Register

gate forum test series

244 views

1 Answer

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

Related questions

0 votes
0 votes
2 answers
1
gateexplore asked Jul 2, 2023
254 views
Theory of Computation
User Avatar
1 votes
1 votes
2 answers
2
go_editor asked Nov 20, 2020
2,177 views
UGC NET CSE | October 2020 | Part 2 | Question: 57
Which of the following grammars is(are) ambiguous? $s \rightarrow ss \mid asb \mid bsa \mid \lambda$ $s \rightarrow asbs \mid bsas \mid \lambda$ ... : $(i)$ and $(iii)$ only $(ii)$ only $(ii)$ and $(iii)$ only $(i)$ and $(ii)$ only
Which of the following grammars is(are) ambiguous?$s \rightarrow ss \mid asb \mid bsa \mid \lambda$$s \rightarrow asbs \mid bsas \mid \lambda$$s \rightarrow aAB \\ A \rig...
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
283 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!