Correct answer: (D) $LR(1)$ parsing is sufficient for deterministic context-free languages.
Explanation
Every DCFL has an LR(1) grammar. Merging LR(1) states into LALR(1) can introduce reduce-reduce conflicts, so A is false. The symbol table is used in many phases, and data flow analysis is a compile-time optimization.
More Parsing and Syntax Analysis questions
GATE 2022 CS Q29– Consider the augmented grammar with \+, *, (, ), id\ as the set of terminals. S' S S S+R R…
GATE 2021 CS (CS1) Q15– Consider the following statements. S 1: Every SLR(1) grammar is unambiguous but there are…
GATE 2021 CS (CS1) Q41– Consider the following context-free grammar where the set of terminals is a, b, c, d, f. S…
GATE 2020 CS Q34– Consider the following grammar. S aSB d B b The number of reduction steps taken by a…
GATE 2019 CS Q13– Which one of the following kinds of derivation is used by LR parsers?
GATE 2019 CS Q29– Consider the grammar given below: S → Aa A → BD B → b ε D → d ε Let a, b, d, and 36 be…