0 votes 0 votes Compiler Design grammar ace-test-series + – amit166 asked Jan 9, 2019 • retagged Jul 16, 2022 by Anjana5051 amit166 415 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Magma commented Jan 9, 2019 reply Follow Share @srestha mam what's your opinion on this ?? 0 votes 0 votes srestha commented Jan 10, 2019 reply Follow Share @Magma D) 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Take a string abcb for this we get two parse trees S->abS->abSb->abcb and S-Sb->abSb->abcb so ambiguity so NO LL(1) Option c Navneet Kalra answered Jan 10, 2019 Navneet Kalra comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments srestha commented Jan 10, 2019 reply Follow Share https://gateoverflow.in/906/gate2003-16 0 votes 0 votes Navneet Kalra commented Jan 10, 2019 i edited by Navneet Kalra Jan 10, 2019 reply Follow Share srestha mam plz help me...according to the given answer in the link....a grammar cannot be LL(1) even if it is unambiguous,deterministic and left recursive.....but if the grammar has been found unambiguous in first attempt....would we go with this statement and mark option d as correct..... ur help will be highly helpful mam 0 votes 0 votes srestha commented Jan 11, 2019 reply Follow Share Actually it is not ambiguous But it is not deterministic and left recursive So, B) is also not correct 0 votes 0 votes Please log in or register to add a comment.
