anchor.diff:                          add edg newStt
                   go stt      
               | None -> add edg stt
  -
               acc 
   
           let res_edg_seq = 
  
positive.code: 
      let inputGraph actions (inG:LexerInputGraph<'br>) printG =
          let lexbuf = new LexBuffer<_,'br>(inG) 
  //        let g = new LexerInnerGraph<_>(inG)   
  //        let sorted = g.TopologicalSort() |> Array.ofSeq
  //        let states = Array.init ((Array.max sorted)+1) (fun _ -> new ResizeArray<_>())
  //        let startState = new State<_,_>(0,-1, ResizeArray.singleton (new StateInfo<_,_>(0,new ResizeArray<_>(), new ResizeArray<_>())))
  //        states.[g.StartVertex] <- ResizeArray.singleton startState
  //        let edgesSeq = seq{ for v in sorted do
  //                              yield g.OutEdges v |> Array.ofSeq
  //                                  
  //                           }
  //                       |> Seq.filter (fun x -> x.Length > 0)
          let newEdgs = 
              tokenize actions lexbuf printG
          //states edgesSeq sorted.[sorted.Length-1] printG 
              |> Array.ofSeq
          let res = new ParserInputGraph<_>()
          let r = newEdgs
  
negative.code:                             pos_fname = ""
                              pos_lnum = 0
                              pos_bol = 0
                              pos_cnum = x.pos_cnum + 1
                              back_ref = edg.BackRef.Value
                      }
  
  