1,317 views

1 Answer

Best answer
0 0 votes
non of these since all grammar are left linear! (grammar is ambiguous only if it is left and right linear both).

there is only one derivation tree for each production.
Position:
Show:

Related questions

1 1 vote
2 2 answers
2.5k
2.5k views
2 2 votes
6 6 answers
2.7k
2.7k views
Ankit Chourasiya asked Sep 13, 2015
2,695 views
Consider R1 and R2 are two regular expression then equality of two regular expression compute inA) polynomial time  B) Exponential timeC) logarithmic Polynomial time  D) ...
2 2 votes
5 5 answers
3.3k
3.3k views
Desert_Warrior asked Aug 22, 2015
3,320 views
(a+b)*a(a+b)*(a+b)*b * a b * a (a + b)*(a + b)* a b* a b*b * a (a + b)* a b*All are generating same language.
1 1 vote
0 0 answers
577
577 views
paressep28 asked Apr 25, 2024
577 views
How is "All strings {0,1} of length five or more in which the third symbol from the right end is different from the leftmost symbol" solved? Answer Follow·1 Request ...