Q3

MCQ1 mark, −0.33

Which one of the following statements is $\text{TRUE}?$

(A)

The $\textit{LALR}(1)$ parser for a grammar $\textit{G}$ cannot have reduce-reduce conflict if the $\textit{LR}(1)$ parser for $\textit{G}$ does not have reduce-reduce conflict.

(B)

Symbol table is accessed only during the lexical analysis phase.

(C)

Data flow analysis is necessary for run-time memory management.

(D)

$\textit{LR}(1)$ parsing is sufficient for deterministic context-free languages.

Loading…