Consider the following PSG G: V={S,NP,VP,D,N,V}; vO=S; /* phrase rules */ S->NP VP; NP->D N; VP->V NP; /* lexical rules */ D->the; N->dog | cat; V->chases; The grammar shown above recognizes a language that contains some English sentences. You can think of the grammar variables as representing linguistic structures. For example, NP represents a Noun Phrase and VP represents a Verb Phrase.
Consider the following PSG G:
*Attached Image*
a) List all sentences belonging to the language recognized by G.
b) Modify your grammar by adding the following words to your lexicon: dogs, cats, chase
- For example, add a rule to indicate that N can be expanded to the word cats but do not add any additional rules for NP
- Your new grammar should accept all of the sentences accepted by G in addition to others. A sentence is said to be grammatical, according to a grammar, if it is accepted by that grammar. Thus, all sentences accepted by your new grammar are grammatical according to your new grammar.
c) Give two new sentences accepted by your grammar from #2 that are also grammatical according to the English language,
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
