Register

Ullman (TOC) Edition 3 Exercise 5.4 Question 5 (Page No. 216)

• edited by
204 views
0 votes
0 votes

This question concerns the grammar

  $S\rightarrow A1B$
  $A\rightarrow 0A|\in$
  $B\rightarrow 0B|1B\in$

  1. Show that this grammar is unambiguous.
  2. Find a grammar for the same language that is ambiguous and demonstrate its ambiguity.
• edited by
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
2
admin asked Apr 6, 2019
295 views
Ullman (TOC) Edition 3 Exercise 5.4 Question 6 (Page No. 216)
This question concerns the grammar $S\rightarrow A1B$ $A\rightarrow 0A|\in$ $B\rightarrow 0B|1B\in$ Is your grammar is unambiguous$?$ If not,redesign it to be unambiguous.
This question concerns the grammar $S\rightarrow A1B$ $A\rightarrow 0A|\in$ $B\rightarrow 0B|1B\in$ Is your grammar is unambiguous$?$ If not,redesign it to be unambi...
User Avatar
0 votes
0 votes
0 answers
4
admin asked Apr 6, 2019
224 views
Ullman (TOC) Edition 3 Exercise 5.4 Question 3 (Page No. 216)
Find an unambiguous grammar for the language of $S\rightarrow aS|aSbS|\in$
Find an unambiguous grammar for the language of $S\rightarrow aS|aSbS|\in$
User Avatar
Link Copied!