Register

Parse tree ambiguous or not

• retagged by
1,020 views

1 Answer

Best answer
2 2 votes

Yes, Correct! but a string can not ambiguous. Though given grammar is ambiguous!

A grammar will be called ambiguous if can generate more than one parse tree/Left most derivations/Right most derivations for same string.
One more point to be noticed here is that, in first parse tree, left id*id will be evaluated first while in second parse tree id+id will be evaluated first,

• selected by
Voting & Accepting an answer helps improve the community
Answer:
← Previous · Compiler parserNext → · Basic grammer
← Previous in category · Compiler parserNext in category → · Basic grammer
Position:
Show:

Related questions

1 1 vote
2 answers 2 answers
930
930 views
Prateek Arora asked Oct 27, 2016
930 views
Ambiguous grammar
Is the given grammar ambiguous?S->ABA->aB->b
3 3 votes
1 answers 1 answer
1.7k
1.7k views
shekhar chauhan asked Jun 2, 2016
1,705 views
Draw a Parse Tree and verify whether this grammar is Ambiguous or Not .
X X(Y) / YY (X)Y / 0 / 1 / Eps
0 0 votes
1 1 answer
744
744 views
Nikhil Patil asked Feb 7, 2018
744 views
Test Questiion
$G: S\rightarrow SbS\mid a$Grammars are ambiguous True/False.
0 0 votes
1 1 answer
886
886 views
Sanket_ asked Nov 10, 2016
886 views
Parsing
which is false?a) An unambiguous grammar has same RMD for every sentence.b)An ambiguous grammar may have an infinite no. of derivation trees for some sentences in the la...