Question 14.4.5: Give the definition of the shift/reduce and shift/shift conf......
Give the definition of the shift/reduce and shift/shift conflicts in the LR(1)-case.
Assume that a grammar is fixed. Let S be an arbitrary string of terminals and nonterminals. If the set State(S) contains a situation where the underscore sign is followed by a terminal t, we say that the pair (S, t) allows a shift. (This definition is the same as in the SLR(1)-case; we ignore the second components of pairs in State(S).)
If State(S) contains a situation whose first component ends with the underscore sign and the second component is a terminal t, we say that the pair (S, t) LR(1)-allows a reduction (via the corresponding rule). We say that there is a LR(1)-conflictof type shift/reduce for a pair (S, t) if this pair allows both shift and reduction. We say that there is a LR(1)-conflict of type reduce~reduce for a pair (S, t) if this pair allows reductions according to different rules.