0 0 votes An umambiguous grammar has same right most and left most derivation>?? True or false.? Compiler Design parsing compiler-design + – Ravi_1511 1.2k views answer comment Share Follow Print See all 3 Comments 3 3 Comments reply Sushant Gokhale commented Jan 30, 2017 reply Follow flag true 0 0 replyShare bad_engineer commented Jan 30, 2017 reply Follow flag Unambigiuos grammar dont have same LMD and RMD rt??? 0 0 replyShare Sushant Gokhale commented Jan 30, 2017 reply Follow flag ohh...I thought about parse tree. SOrry. Its false. 0 0 replyShare Please log in or register to add a comment.
0 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 Ravi_1511 answered Jan 30, 2017 Ravi_1511 comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes ambiguous means only one parse tree so it means that left recursive most derivative and right most derivation will be same Vishal Goyal answered May 20, 2017 Vishal Goyal comment Share Follow 0 reply Please log in or register to add a comment.
