Which one of the following statements is TRUE?

GATE · 2022 · CS · Computer Science & IT

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.

Attempted by 169 students.