0 votes 0 votes which is false? a) An unambiguous grammar has same RMD for every sentence. b)An ambiguous grammar may have an infinite no. of derivation trees for some sentences in the language generated. Compiler Design compiler-design parsing ambiguous-grammar true-false + – Sanket_ asked Nov 10, 2016 • retagged Jun 21, 2022 by Lakshman Bhaiya Sanket_ 354 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes I think Option A is false because Unambiguous grammar has different RMD trees for different sentences . It is wrong to say that unambiguous grammar has same RMD for every sentence. Option B is true . because In ambiguous grammar number of derivation trees possible is dependent on grammar. so It is possible . Amit Pal answered Nov 10, 2016 Amit Pal comment Share Follow See all 3 Comments See all 3 3 Comments reply Arjun commented Nov 10, 2016 reply Follow Share For 'B' how can it be infinite? Because everything in grammar is finite- so we must show how this can give rise to infinity. 0 votes 0 votes Amit Pal commented Nov 11, 2016 reply Follow Share Sir , I have confusion about possibility of infinite but definitely more than one derivations are possible for same sentence . 0 votes 0 votes Sanket_ commented Nov 11, 2016 reply Follow Share If there is a null transition then it can give inifinite trees ex. s->ss| ε|a 1 votes 1 votes Please log in or register to add a comment.
