GATE Computer Science (CS) 2022 Shift 1 Solved Paper

Question : 13 of 65

Marks: +1, -0

Which one of the following statements is TRUE?

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.
Symbol table is accessed only during the lexical analysis phase
Data flow analysis is necessary for run-time memory management.
LR(1) parsing is sufficient for deterministic context-free languages

Go to Question:

Prev Question

Next Question