anchor.diff:          | Some context ->
               let root = sppfNodes.[pointers.[int context.Pointer].[0]] 
               Success (new Tree<_>(Seq.toArray tokens, root, rules))                      
  -        | None -> Error("nope")
  +        | None -> Error "nope"
   
       createEpsNodesAndPtr()
       run 0
  
positive.code:             nonTermChildren.Add (newNodeNum, new ResizeArray<_>([children]))
              newNodeNum
                   
      let getPointer nodes set =        
          let pointerNum = set |> Seq.tryFind (fun i -> pointers.[int i] = nodes)
          match pointerNum with
          | Some i -> i
          | None -> createPointer nodes set
  
      let shift state vertex (pointer: int<ptr>) tokenNum pos =
          let termNode = getNodeT tokenNum pos
  
negative.code:             refreshSets()
              step -1 pos (new Queue<_>(setU)) table
      
      let getResult () =           
          sppfNodes |> Seq.iter (fun node -> match node with   // lol
                                             | :? AST as ast -> ast.pos <- -1
                                             | _ -> ())
  