GATE CS 2022 (Forenoon) — Question 13

Compiler DesignLexical Analysis & Parsing Architectures (LL(1), LR(1), LALR)MCQ1 mark · −1/3 if wrongEasy

Which one of the following statements is TRUE?
  1. A
    The LALR(1) parser for a grammar G cannot have reduce-reduce conflict if the LR(1) parser for G does not have reduce-reduce conflict.
  2. B
    Symbol table is accessed only during the lexical analysis phase.
  3. C
    Data flow analysis is necessary for run-time memory management.
  4. D
    LR(1) parsing is sufficient for deterministic context-free languages.
Practise the full 2022-FN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkCompilers: Principles, Techniques & ToolsThe "Dragon Book" for parsing, syntax-directed translation and code generation.
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