anchor.diff:  
   /// Computes the lookahead symbols for the given `LR0ItemSet`s.
   let computeLookaheadItems fGetAllProductions (firstSets: FirstSets) itemSets =
  -    RA itemSets
  +    IA itemSets
   
       let lookaheads = LookaheadItemsTable(firstSets.AllTerminals.Length)
       let propagate =
  
positive.code: /// a nonterminal and the start symbol are required.
  let createLR0KernelItems fGetAllProductions startSymbol =
  
      let itemSets = ResizeArray()
      let itemSetsToProcess = Queue()
      let kernelMap = Dictionary()
  
  
negative.code: 
  /// Creates an LALR state table.
  let createLALRStates fGetAllProductions (firstSets: FirstSets) fResolveConflict conflicts startSymbol itemSets (lookaheadTables: LookaheadItemsTable) =
      IA itemSets
      RA conflicts
  
      let emptyLookahead = LookaheadSet(firstSets.AllTerminals.Length)
      emptyLookahead.Freeze()
      let states = ImmutableArray.CreateBuilder itemSets.Length
      for itemSet in itemSets do
          let index = uint32 itemSet.Index
          // The book says we have to close the kernel under LR(1) to create the
  