anchor.diff:                              simpleEdges.[vertex.State] |> ResizeArray.iter(fun (v,a) ->
                                       path.[remainLength - 1] <- a
                                       walk (remainLength - 1) v path)
  -
  +                            
                               let mutable i = 0
                               let edges = edges.[vertex.State]
                               let mutable count = 0
  
positive.code:                                         for (prod, pos) in arr do
                                              reductions.Push (newVertex, prod, pos, Some (final, box edgeLabel))
                                  else
                                      for tok in curTokens.Value.Tokens do
                                          let arr = parserSource.Reduces.[state].[tok.CurNum]
                                          if arr <> null then
                                              for (prod, pos) in arr do
  
negative.code: open Yard.Generators.RNGLR.AST
  open System.Collections.Generic
  open Yard.Generators.RNGLR.DataStructures
  open Yard.Generators.RNGLR.Parser 
  open Microsoft.FSharp.Collections
  
  
  [<Struct>]
  type TokenWithInfo<'token> =
      val Token  : 'token    
      val NxtLvl : int
      val CurNum : int
      new (t,nl,cn) = {Token=t;NxtLvl=nl;CurNum=cn}
  