2. Consider the context-free grammar: S->S SIS-S|(S)|a 1) Use left-most and right-most derivation to show how...

Transcribed Image Text:

2. Consider the context-free grammar: S->S SIS-S|(S)|a 1) Use left-most and right-most derivation to show how the string (a- a)*a can be generated by this grammar. 2) Construct a parse tree for this string. 3) Is this grammar ambiguous? Why? (Hint: consider parse tree for a*a*a) 2. Consider the context-free grammar: S->S SIS-S|(S)|a 1) Use left-most and right-most derivation to show how the string (a- a)*a can be generated by this grammar. 2) Construct a parse tree for this string. 3) Is this grammar ambiguous? Why? (Hint: consider parse tree for a*a*a)

Answer rating: 100% (QA)

It seems there is a typo in the loop initialization condition I assume you meant to write forint L 1... View the full answer