The Gateway to Computer Science Excellence
0 votes
223 views
An umambiguous grammar has same right most and left most derivation>??

True or false.?
in Compiler Design by Active (2k points)
reopened by | 223 views
0
true
0
Unambigiuos grammar dont have same LMD and RMD rt???
0
ohh...I thought about parse tree. SOrry. Its false.

2 Answers

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
by Active (2k points)
0 votes
ambiguous means only one parse tree so it means  that left recursive most derivative and right most derivation will be same
by Active (1.8k points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,741 questions
57,251 answers
198,061 comments
104,693 users