Register

Ullman (Compiler Design) Edition 2 Exercise 2.2 Question 2 (Page No. 51)

330 views
0 votes
0 votes

What language is generated by the following grammars? In each case justify your answer. 

  1. $S\rightarrow 0S1 \mid 01$
  2. $S\rightarrow +SS \mid -SS \mid a$
  3. $S\rightarrow S(S)S \mid \epsilon$
  4. $S\rightarrow aSbS \mid bSaS \mid \epsilon$
  5. $S\rightarrow a \mid S+S \mid SS \mid S^{\ast} \mid (S)$
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
admin asked Jul 26, 2019
656 views
Ullman (Compiler Design) Edition 2 Exercise 2.2 Question 4 (Page No. 51 - 52)
Construct unambiguous context-free grammars for each of the following languages. In each case show that your grammar is correct. Arithmetic expressions in postfix notation. Left-associative lists of identifiers separated by commas. Right- ... $(d)$.
Construct unambiguous context-free grammars for each of the following languages. In each case show that your grammar is correct. Arithmetic expressions in postfix notatio...
User Avatar
1 votes
1 votes
2 answers
2
admin asked Jul 26, 2019
1,186 views
Ullman (Compiler Design) Edition 2 Exercise 2.2 Question 3 (Page No. 51)
Which of the grammars are ambiguous? $S\rightarrow 0S1 \mid 01$ $S\rightarrow +SS \mid -SS \mid a$ $S\rightarrow S(S)S \mid \epsilon$ $S\rightarrow aSbS \mid bSaS \mid \epsilon$ $S\rightarrow a \mid S+S \mid SS \mid S^{\ast} \mid (S)$
Which of the grammars are ambiguous? $S\rightarrow 0S1 \mid 01$$S\rightarrow +SS \mid -SS \mid a$$S\rightarrow S(S)S \mid \epsilon$$S\rightarrow aSbS \mid bSaS \mid \epsi...
User Avatar
0 votes
0 votes
0 answers
3
admin asked Jul 26, 2019
175 views
Ullman (Compiler Design) Edition 2 Exercise 2.2 Question 1 (Page No. 51)
Consider the context-free grammar $S\rightarrow SS+\mid SS^{\ast}\mid a$ Show how the string $aa+a^{\ast}$ can be generated by this grammar. Construct a parse tree for this string. What language does this grammar generate? Justify your answer.
Consider the context-free grammar$S\rightarrow SS+\mid SS^{\ast}\mid a$Show how the string $aa+a^{\ast}$ can be generated by this grammar.Construct a parse tree for this ...
User Avatar
Link Copied!