Consider the following grammar G1 T= {a,b}, N = {E}, S = E, P = {E->aEa...

 

Transcribed Image Text:

Consider the following grammar G1 T= {a,b}, N = {E}, S = E, P = {E->aEa | bEb | } Briefly describe what kind of strings belong to the language generated by grammar G1. a) Is grammar G1 context free? Briefly state why. b) c) d) Draw a parse tree of string abba. Present a leftmost derivation of string abba, pointing out the production rules used. (You can give names such as r1, r2, r3 to the three rules.) Consider the following grammar G1 T= {a,b}, N = {E}, S = E, P = {E->aEa | bEb | } Briefly describe what kind of strings belong to the language generated by grammar G1. a) Is grammar G1 context free? Briefly state why. b) c) d) Draw a parse tree of string abba. Present a leftmost derivation of string abba, pointing out the production rules used. (You can give names such as r1, r2, r3 to the three rules.)

Answer rating: 100% (QA)

a Yes grammar G1 is contextfree This is because it has a single nonterminal symbol E and a set of p... View the full answer