in Compiler Design edited by
174 views
0 votes
0 votes

Consider the context-free grammar

$S\rightarrow SS+\mid SS^{\ast}\mid a$

  1. Show how the string $aa+a^{\ast}$ can be generated by this grammar.
  2. Construct a parse tree for this string.
  3. What language does this grammar generate? Justify your answer.
in Compiler Design edited by
by
174 views

Please log in or register to answer this question.

Related questions