37 37 votes Among simple LR (SLR), canonical LR, and look-ahead LR (LALR), which of the following pairs identify the method that is very easy to implement and the method that is the most powerful, in that order?SLR, LALRCanonical LR, LALRSLR, canonical LRLALR, canonical LR Compiler Design gatecse-2015-set3 compiler-design parsing normal lr-parser + – go_editor 13.6k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
Best answer 56 56 votes Answer is C. SLR is the simplest to implement and Canonical LR is the most powerful. http://en.wikipedia.org/wiki/LALR_parser_generator Arjun answered Feb 15, 2015 • edited Dec 11, 2017 by kenzou Arjun comment Share Follow See all 3 Comments 3 3 Comments reply HitechGa commented Jan 13, 2022 reply Follow flag From Ullman, Compilers [1986] From Green Tiger Compiler book by Andrew Appel 14 14 replyShare Thadymademe commented Oct 22, 2022 reply Follow flag @HitechGa bro do have any diagram for where operator precedence grammar lies in the diagram. 0 0 replyShare zgod commented Apr 3, 2025 1 flag: ✌ Spam (js__) reply Follow flag 😂 simple slr 😎power full ClR 0 0 replyShare Please log in or register to add a comment.
–5 –5 votes Answer:B according to ace academy solutions Anyone with the explanation why its not A? overtomanu answered Feb 15, 2015 1 flag: ✌ Low quality (Piyush_Barhate) overtomanu comment Share Follow See all 5 Comments 5 5 Comments reply Show 2 previous comments Rajesh Pradhan commented Dec 25, 2016 reply Follow flag There are some LL(1) grammars which are not LALR(1). http://stackoverflow.com/questions/6487588/example-for-ll1-grammer-which-is-not-lalr 17 17 replyShare Piyush Nikam 5 commented Jun 18, 2017 reply Follow flag is LL(1) outside LALR(1) box correct? I thought whatever LL(1) can parse can be parsed by LALR(1) 0 0 replyShare Hemant Parihar commented Jan 5, 2018 reply Follow flag @Piyush, This can't be parsed by LALR but LL(1) can. S --> ( x S --> E ] S --> F ) X --> E ) X --> F ] E --> A F --> A A --> . 3 3 replyShare Please log in or register to add a comment.
