1,230 views

1 Answer

Best answer
5 votes
5 votes

Let’s find out the derivation tree for the string "(0)".

As there are two parse trees for a single string "(0)", the grammar G is ambiguous.

selected by

Related questions

1 votes
1 votes
1 answer
1
learner_geek asked Aug 2, 2017
567 views
If i am wrong please let me correct with giving proper explanation.
2 votes
2 votes
2 answers
2
Kaushal28 asked Sep 21, 2016
2,317 views
If any grammer is given, how can we tell that the grammar is regular or not? Is that any perticular method?
3 votes
3 votes
2 answers
3
vivekpinto07 asked Jun 24, 2016
3,975 views
An ambiguous grammar is one that producesmore than one left most derivation for the same sentence.more than one right most derivation for the same sentence.more than one ...
0 votes
0 votes
3 answers
4