anchor.diff:                              if la.HasHash then
                                   propagate.Add((item, itemSet.Index), (gotoKernel, gotoIdx))
                               lookaheads.AddRange (gotoKernel, gotoIdx) la |> ignore
  -                        | false, _ -> ())))
  +                        | false, _ -> ()
           propagate
   
       // The next line assumes the first item set's kernel contains only
  
positive.code:                     match item.CurrentSymbol with
                      | LALRSymbol.Terminal _ -> ()
                      | LALRSymbol.Nonterminal nont ->
                          nont
                          |> fGetAllProductions
                          |> Set.iter (LR0Item.Create >> q.Enqueue)
          let goto =
              visitedItems
              |> Seq.filter (fun x -> not x.IsAtEnd)
  
negative.code:         | LALRSymbol.Terminal _ -> false
          | LALRSymbol.Nonterminal nont -> dict.HasEmpty nont
  
      for {Head = x; Handle = xs} in productions do
          if xs.IsEmpty then
              dict.AddEmpty x |> ignore
  
      let mutable changed = true
  
  