anchor.diff:                  (targetState : ParserStateId)
                   (tableGenState : LrTableGenState<'Nonterminal, 'Terminal, 'Lookahead>) =
           //
  -        let tableKey = sourceState, Symbol.Terminal transitionSymbol
  +        let tableKey = sourceState, transitionSymbol
   
           //
           let entry =
               let action = LrParserAction.Shift targetState
  -            match Map.tryFind tableKey tableGenState.Table with
  +            match Map.tryFind tableKey tableGenState.ActionTable with
               | None ->
                   Set.singleton action
               | Some entry ->
  
positive.code:         // If any states or transition-edges have been added, we need to recurse
          // and continue until we reach a fixpoint; otherwise, return the completed table.
          if tableGenState.ParserStates <> tableGenState'.ParserStates ||
              tableGenState.Table <> tableGenState'.Table then
              createTableImpl grammar analysis tableGenState'
          else
              // Create the parser table from the table-gen state.
              { Table = tableGenState.Table;
                  ParserStateCount = uint32 tableGenState.ParserStates.Count;
                  ReductionRulesById = tableGenState.ReductionRulesById; }
  
  
negative.code:         // Update the table with the new entry.
          (),
          { tableGenState with
              ActionTable = Map.add tableKey entry tableGenState.ActionTable; }
  
  
  /// An LR(0) item.
  