anchor.diff:              stateToDerivedLookahead.Add derivedLookaheads
               for i = 0 to grammar.indexator.fullCount - 1 do
                   if i <> grammar.indexator.eofIndex then
  +                    // new kernel with lookaheads
                       let destStates = new Dictionary<int, Set<int>>()
  -                    let mutable dontStackSet = Set.empty
  -                    let mutable stackSet = Set.empty
  +//                    let mutable dontStackSet = Set.empty
  +//                    let mutable stackSet = Set.empty
                       for j = 0 to mainKernels.Length-1 do
                               if curSymbol mainKernels.[j] = i && not mainLookaheads.[j].IsEmpty then
                                   let nextKernels = KernelInterpreter.nextPos grammar mainKernels.[j]
  -                                dontStackSet <- Set.add (KernelInterpreter.getProd mainKernels.[j]) dontStackSet 
  +//                                dontStackSet <- Set.add (KernelInterpreter.getProd mainKernels.[j]) dontStackSet 
                                   for nextKernel in nextKernels do
                                       if not <| destStates.ContainsKey nextKernel then
                                           destStates.[nextKernel] <- mainLookaheads.[j]
  
positive.code:                             destStates_arr.[!dsIter] <- destState.Key, destState.Value
                              incr dsIter
                          let newVertex : Vertex<_,_> = destStates_arr |> dfsLR
                          vertex.addEdge <| new Edge<_,_>(newVertex, (i, (dontStackSet, stackSet)))
              decr dfsDepth
              vertex
  
  
negative.code:                         if curSymbol derivedKernels.[j] = i && not newDerivedLookaheads.[j].IsEmpty then hasNewLookahead <- true
                      let destStates = new Dictionary<int, Set<int>>()
                      if hasNewLookahead then
  //                        let mutable stackSet = Set.empty
  //                        let mutable dontStackSet = Set.empty
                          for j = 0 to mainKernels.Length-1 do
                              if curSymbol mainKernels.[j] = i then
                                  let nextKernels = KernelInterpreter.nextPos grammar mainKernels.[j]
  //                                dontStackSet <- Set.add (KernelInterpreter.getProd mainKernels.[j]) dontStackSet 
                                  for nextKernel in nextKernels do
                                      if not <| destStates.ContainsKey nextKernel then
                                          destStates.[nextKernel] <- newMainLookaheads.[j]
  