Which of the following statements is/are true?
- ALL(1) parser uses backtracking
- BFor a grammar to be LL(1), it must be left-recursive
- CFor a grammar to be LL(1), it must be left-factored
- DThe LL(1) parsers are more powerful than the SLR parsers
Compiler DesignLexical Analysis & Parsing Architectures (LL(1), LR(1), LALR)MSQ1 markMedium
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.