Q40

MCQ2 marks, −0.67

Consider the following two sets of $\textsf{LR(1)}$ items of an $\textsf{LR(1)}$ grammar.\begin{array}{l|l} X \rightarrow c.X, c∕d &X → c.X, \$\\ X \rightarrow .cX, c∕ d& X → .cX, \$\\ X \rightarrow .d, c∕ d & X → .d, \$ \end{array}Which of the following statements related to merging of the two sets in the corresponding $\textsf{LALR}$ parser is/are FALSE? $1$ only $2$ only $1$ and $4$ only $\text{1, 2, 3}$ and $4$

(A)

Cannot be merged since look aheads are different.

(B)

Can be merged but will result in $\textsf{S-R}$ conflict.

(C)

Can be merged but will result in $\textsf{R-R}$ conflict.

(D)

Cannot be merged since $\textsf{goto}$ on $c$ will lead to two different sets.

Loading…