The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
77 views
If we have more than 1 parse tree,but one is LMD and other is RMD , Is Grammar Ambiguous?

There are no other parse tree other than these two.
asked in Compiler Design by (253 points) | 77 views
+3

It is ambiguous.

The Property is if we have more than 1 LMD or 1 RMD or 1 Parse tree then it is ambiguous.

+1
if both the parse tree derived using Lmd and Rmd are same then its ambiguous.

but if there are only  two parse tree one is using lmd and other using rmd and both of them are different the  its not ambiguous
+1
yes more than 1 parse tree -->ambiguous grammar irrespective of LMD ,RMD

1 Answer

+1 vote
Best answer
No grammar is not ambiguous.

For every string of language there exist one leftmost and one right most derivation.
answered by (115 points)
selected by

Related questions

0 votes
1 answer
1
+1 vote
1 answer
4
asked Oct 11, 2017 in Compiler Design by Kuldeep Pal Active (1.3k points) | 102 views
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
49,587 questions
54,197 answers
187,535 comments
71,151 users