reopened by
660 views
0 votes
0 votes
An umambiguous grammar has same right most and left most derivation>??

True or false.?
reopened by

2 Answers

0 votes
0 votes
If any grammar has more than 1 LMD or more than 1 RMD or more than 1 parse tree that will be an ambiuous grammar.SO if grammar is unabiguous it must have only 1 LMD or 1RMD or 1 parse tree.

So here every umbiguous grammar has only 1 LMD and 1 RMD means both must be equal because if it is not it will be ambiguous.

 TRUE
0 votes
0 votes
ambiguous means only one parse tree so it means  that left recursive most derivative and right most derivation will be same

Related questions

4 votes
4 votes
0 answers
3
0 votes
0 votes
1 answer
4