anchor.diff:      let firstSets = computeFirstSetMap ct terminals nonterminals productions
       let lookaheads = computeLookaheadItems ct fGetAllProductions firstSets kernelItems
   
  -    let conflicts = ResizeArray()
  +    let errors = ResizeArray()
       let resolveConflict term x1 x2 =
           match x1, x2, term with
           | LALRAction.Shift _, LALRAction.Reduce prod, Some term ->
  
positive.code:         // very soon thrown on an impossible conflict type.
          | _ -> CannotChoose NoPrecedenceInfo
  
      match createLALRStates ct fGetAllProductions firstSets resolveConflict conflicts s' kernelItems lookaheads with
      | theGloriousStateTable when conflicts.Count = 0 ->
          Ok theGloriousStateTable
      | _ -> conflicts |> List.ofSeq |> Error
  
  /// <summary>Builds an LALR parsing table.</summary>
  /// <param name="resolver">Used to resolve LALR conflicts.</param>
  
negative.code:                 else
                      None)
              |> List.ofSeq
          let resolvedEofAction =
              eofActions
              |> resolveEOFConflict
              |> Option.map (function
                  // Essentially, reducing <S'> -> <S> means accepting.
                  | LALRAction.Reduce {Head = head} when head = startSymbol -> LALRAction.Accept
                  | action -> action)
          states.Add {Index = index; Actions = actions; GotoActions = gotoActions; EOFAction = resolvedEofAction}
          statesConflicted.Add {Index = index; Actions = actionsConflicted; GotoActions = gotoActions; EOFActions = eofActions}
  
      if errors.Count <> 0 then
          statesConflicted.MoveToImmutable()
          |> BuildError.LALRConflictReport
          |> errors.Add
      states.MoveToImmutable()
  
  /// <summary>Builds an LALR parsing table.</summary>
  