1 votes 1 votes Consider the following grammar G: $S\rightarrow AB\mid d$ $A\rightarrow aA\mid b$ $B\rightarrow bB\mid c$ The grammar G is: LL (1) grammar and not LR (0) LL (1) and LR (0) Not LL (1) but LR (0) Neither LL (1) nor LR (0) Compiler Design compiler-design parsing made-easy-test-series + – Rohit Gupta 8 asked Jan 10, 2018 • retagged Jun 29, 2022 by Lakshman Bhaiya Rohit Gupta 8 1.6k views answer comment Share Follow See all 16 Comments See all 16 16 Comments reply Show 13 previous comments monika06 commented Jun 5, 2018 reply Follow Share Where is B production here? 0 votes 0 votes Nandkishor3939 commented Jan 31, 2019 reply Follow Share I think answer should be a right? 0 votes 0 votes krmanish043 commented Jan 31, 2019 reply Follow Share no it is LR(0), ANS MUST BE OPTION B 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes It is LL(1) but not LR (0) correct me if I am wrong OO7 answered Jul 6, 2018 • edited Jul 6, 2018 by OO7 OO7 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes The grammar is ll(1) and epsilon free. So it will be SLR(1) clr(1) and lalr(1). Hence option b. Abhinav Gupta answered Jan 31, 2019 Abhinav Gupta comment Share Follow See all 0 reply Please log in or register to add a comment.