An LALR(1) parser for a grammar G can have shift-reduce (S-R) conflicts if and only if
A)the SLR(1) parser for G has S-R conflicts
B)the LR(1) parser for G has S-R conflicts
C)the LR(0) parser for G has S-R conflicts
D)the LALR(1) parser for G has reduce-reduce conflicts

Question

Quizplus · Accepted Answer

An LALR(1) parser can have shift-reduce conflicts if and only if the LR(1) parser for the same grammar has shift-reduce conflicts. This is because LALR(1) parsers are constructed by merging states of the LR(1) automaton that have the same kernel items but potentially different lookahead symbols, which can lead to shift-reduce conflicts if they exist in the LR(1) parser.

An LALR(1) Parser for a Grammar G Can Have Shift-Reduce