0 votes 0 votes 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. Compiler Design compiler-design parsing + – Reshu $ingh asked Jan 25, 2019 • retagged Jul 2, 2022 by Lakshman Bhaiya Reshu $ingh 816 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply muthu kumar commented Jan 25, 2019 reply Follow Share It is ambiguous. The Property is if we have more than 1 LMD or 1 RMD or 1 Parse tree then it is ambiguous. 3 votes 3 votes Manas Mishra commented Jan 25, 2019 reply Follow Share 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 votes 1 votes Raghav Khajuria commented Feb 18, 2019 reply Follow Share yes more than 1 parse tree -->ambiguous grammar irrespective of LMD ,RMD 1 votes 1 votes Please log in or register to add a comment.
Best answer 2 votes 2 votes No grammar is not ambiguous. For every string of language there exist one leftmost and one right most derivation. Laxmikant sahu answered Feb 17, 2019 • selected Feb 17, 2019 by Reshu $ingh Laxmikant sahu comment Share Follow See 1 comment See all 1 1 comment reply swami_9 commented Sep 27, 2022 reply Follow Share @Laxmikant sahu what if these two lmd and rmd trees are the same? 0 votes 0 votes Please log in or register to add a comment.
