Consider the context-free grammar: 5 -> S S + \ S S * \ a and the string aa + a*. a) Give a leftmost derivation for the string. b) Give a rightmost derivation for the string. c) Give a parse tree for...

Consider the context-free grammar:


5 -> S S + \ S S * \ a

and the string aa + a*.

a) Give a leftmost derivation for the string.

b) Give a rightmost derivation for the string.

c) Give a parse tree for the string.

! d) Is the grammar ambiguous or unambiguous? Justify your answer.


! e) Describe the language generated by this grammar.