Register

can someone share the approach for the following que

271 views

2 Answers

0 votes
0 votes

there is no specific approach for solving these kind of questions.

question ask that, show that there exist one unambiguous Grammar which is equivalent to the given grammar.

 

check this : 

S -> epsilon | ab | AB

B -> AB| A

A -> aAb | ab | aABb

• edited by
User Avatar
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 Oct 12, 2019
227 views
Michael Sipser Edition 3 Exercise 2 Question 51 (Page No. 159)
Show that every DCFG is an unambiguous CFG.
Show that every DCFG is an unambiguous CFG.
User Avatar
0 votes
0 votes
0 answers
3
admin asked Oct 12, 2019
422 views
Michael Sipser Edition 3 Exercise 2 Question 46 (Page No. 158)
Consider the following CFG $G:$ $S \rightarrow SS \mid T$ $T \rightarrow aT b \mid ab$ Describe $L(G)$ and show that $G$ is ambiguous. Give an unambiguous grammar $H$ where $L(H) = L(G)$ and sketch a proof that $H$ is unambiguous.
Consider the following CFG $G:$$S \rightarrow SS \mid T$$T \rightarrow aT b \mid ab$Describe $L(G)$ and show that $G$ is ambiguous. Give an unambiguous grammar $H$ where ...
User Avatar
0 votes
0 votes
0 answers
4
Naveen Kumar 3 asked Apr 14, 2019
212 views
Peter Linz Edition 4 Exercise 5.2 Question 19 (Page No. 145)
Prove the following result. Let $G = (V, T, S, P )$ be a context-free grammar in which every $A ∈ V$ occurs on the left side of at most one production. Then $G$ is unambiguous.
Prove the following result. Let $G = (V, T, S, P )$ be a context-free grammar in which every $A ∈ V$ occurs on the left side of at most one production. Then $G$ is unam...
User Avatar
Link Copied!