GATE CS 2026 (Forenoon) — Question 28

Compiler DesignLexical Analysis & Parsing Architectures (LL(1), LR(1), LALR)MSQ1 markMedium

Which of the following statements is/are true?
  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
Practise the full 2026-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAFree All-India Mock — every SundayA full GATE CS paper, exactly 180 minutes, ranked across India with your GATE score.
Practise more on Lexical Analysis & Parsing Architectures (LL(1), LR(1), LALR)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group