The Gateway to Computer Science Excellence
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 by Veteran (54.9k points)
edited by | 3 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,645 questions
56,542 answers
101,534 users