130 views
0 votes
0 votes
Consider the following context  free grammar G:-

S->c/aS/aSbS

is G inherently ambiguous??

how to check this??

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
Gate Fever asked Dec 8, 2018
385 views
L={a*b*c* – {$a^{n}b^{n}c^{n}$ ;$n\geq 0$}shouldn’t L be recursive??bcoz $a^{n}b^{n}c^{n}$ is recursive and its complement is also recursive;a*b*c* is regular ;theref...
0 votes
0 votes
0 answers
2
Gate Fever asked Dec 8, 2018
228 views
consider the folllowing PDA given below where z0 represents stack symbol:here , even b is getting accepted, so in this n(a) $\ngeqslant$n(b);shouldn’t the answer be non...
0 votes
0 votes
1 answer
3
Gate Fever asked Dec 8, 2018
560 views
consider the DFA given below:-minimum number of states in the equivalent DFA will be?? I AM GETTING 3
0 votes
0 votes
0 answers
4