Register

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

216 views

1 Answer

0 votes
0 votes

S→ aaB → aab

S→ AB →AaB  →aaB→aab

hence it is ambigious    you can draw the tree like the steps above and you will see that both derivations are different

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

Related questions

0 votes
0 votes
0 answers
1
Naveen Kumar 3 asked Apr 14, 2019
286 views
Peter Linz Edition 4 Exercise 5.2 Question 16 (Page No. 145)
Show that the grammar with productions $S\rightarrow aAB,$ $A\rightarrow bBb,$ $B\rightarrow A|\lambda.$ is unambiguous.
Show that the grammar with productions$S\rightarrow aAB,$$A\rightarrow bBb,$$B\rightarrow A|\lambda.$ is unambiguous.
User Avatar
0 votes
0 votes
1 answer
2
Naveen Kumar 3 asked Apr 14, 2019
339 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
3
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
4
Naveen Kumar 3 asked Apr 14, 2019
224 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
Link Copied!