Register

Peterlinz exercise

• edited by
392 views

1 Answer

0 votes
0 votes

S -> Saab / aSab / aaSb / aabS/ Saba / aSba / abSa / abaS / Sbaa / bSaa / baSa/ baaS / $\epsilon$

More simplified - 

S -> aSaSbS / aSbSaS / bSaSaS / $\epsilon$

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

Related questions

2 votes
2 votes
1 answer
1
Lakshya Mission 1 asked Jul 8, 2016
427 views
Peterlinz question
Please write grammar for it and explain with example. $L=\{w \: : n_a(w) > n_b(w) \}$
Please write grammar for it and explain with example.$L=\{w \: : n_a(w) n_b(w) \}$
User Avatar
0 votes
0 votes
1 answer
3
admin asked May 1, 2019
555 views
Michael Sipser Edition 3 Exercise 2 Question 9 (Page No. 155)
Give a context-free grammar that generates the language $A=\{a^{i}b^{j}c^{k}\mid i=j$ $\text{or}$ $ j=k$ $\text{where}$ $ i,j,k\geq 0\}.$ Is your grammar ambiguous$?$ Why or why not$?$
Give a context-free grammar that generates the language $A=\{a^{i}b^{j}c^{k}\mid i=j$ $\text{or}$ $ j=k$ $\text{where}$ $ i,j,k\geq 0\}.$ Is your grammar ambiguous$?$ Why...
User Avatar
0 votes
0 votes
0 answers
4
Naveen Kumar 3 asked Apr 14, 2019
282 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
Link Copied!