anchor.diff:          if isNotEps
           then
               for e in outEdgesInnerGraph.[startV.vNum] do
  -                addNonZeroReduction newVertex newVertex.State e.Tag edge startV
  +                addNonZeroReduction newVertex e.Tag edge startV
   
       let edgesToTerms = new Dictionary<_,_>()
       let push (currentGraphV:VInfo<_>) gssVertex state =
  
positive.code:         then
              verticesToProcess.Enqueue(elem)
  
      let addNonZeroReduction gssVertex state token gssEdge (innerGraphV : VInfo<_>)=
          let arr = parserSource.Reduces.[state].[parserSource.TokenToNumber token]
          if arr <> null 
          then
              for (prod, pos) in arr do
                  innerGraphV.AddReduction(new Reduction(gssVertex, prod, pos, Some gssEdge))
  
      let addZeroReduction gssVertex state token (innerGraphV : VInfo<_>) shouldEnqueue =
          let arr = parserSource.ZeroReduces.[state].[parserSource.TokenToNumber token]
          if arr <> null
          then
              for prod in arr do
  
negative.code:             | None -> Error (-1, Unchecked.defaultof<'TokenType>, "There is no accepting state")
              | Some res -> 
                  let tree = new Tree<_>(terminals.ToArray(), nodes.[res], parserSource.Rules)
                  //tree.AstToDot parserSource.NumToString parserSource.TokenToNumber parserSource.TokenData parserSource.LeftSide "../../../Tests/AbstractRNGLR/DOT/sppf.dot"
                  Success <| tree