Register

Peter Linz Edition 4 Exercise 5.2 Question 16 (Page No. 145)

282 views
0 votes
0 votes
Show that the grammar with productions

$S\rightarrow aAB,$

$A\rightarrow bBb,$

$B\rightarrow A|\lambda.$

 is unambiguous.
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
1 answer
1
Naveen Kumar 3 asked Apr 14, 2019
336 views
Peter Linz Edition 4 Exercise 5.2 Question 15 (Page No. 145)
Show that the grammar with productions $S\rightarrow SS,$ $S\rightarrow \lambda,$ $S\rightarrow aSb,$ $S\rightarrow bSa.$ is ambiguous.
Show that the grammar with productions$S\rightarrow SS,$$S\rightarrow \lambda,$$S\rightarrow aSb,$$S\rightarrow bSa.$is ambiguous.
User Avatar
0 votes
0 votes
1 answer
2
Naveen Kumar 3 asked Apr 14, 2019
284 views
Peter Linz Edition 4 Exercise 5.2 Question 14 (Page No. 145)
Show that the grammar $S\rightarrow aSb|SS|\lambda$ is ambiguous, but that the language denoted by it is not.
Show that the grammar $S\rightarrow aSb|SS|\lambda$ is ambiguous, but that the language denoted by it is not.
User Avatar
0 votes
0 votes
1 answer
3
Naveen Kumar 3 asked Apr 14, 2019
223 views
Peter Linz Edition 4 Exercise 5.2 Question 13 (Page No. 145)
Show that the following grammar is ambiguous. $S\rightarrow aSbS|bSaS|\lambda$
Show that the following grammar is ambiguous. $S\rightarrow aSbS|bSaS|\lambda$
User Avatar
0 votes
0 votes
1 answer
4
Naveen Kumar 3 asked Apr 14, 2019
234 views
Peter Linz Edition 4 Exercise 5.2 Question 7 (Page No. 145)
Construct an unambiguous grammar equivalent to the grammar in Exercise 6.
Construct an unambiguous grammar equivalent to the grammar in Exercise 6.
User Avatar
Link Copied!