Which of the following statements is/are true?

GATE · 2026 · CS · Set 1 · Computer Science & IT

1. A.

   LL(1) parser uses backtracking

2. B.

   For a grammar to be LL(1), it must be left-recursive

3. C.

   For a grammar to be LL(1), it must be left-factored

4. D.

   The LL(1) parsers are more powerful than the SLR parsers

Attempted by 84 students.