anchor.diff:  let printSmbString (x:char*Position<_>) = 
           (fst x).ToString() + "_br: " + (snd x).back_ref + "(" + (snd x).start_offset.ToString() + "," + (snd x).end_offset.ToString() + ")"
   
  -type TokenEdge<'br(* when 'br:comparison*)>(s,e,t)=
  +type TokenEdge<'br>(s,e,t)=
       inherit TaggedEdge<int, char*Position<'br>>(s,e,t)
           
       member this.BackRef = (snd t).back_ref
  
positive.code:     member this.EndPos = (snd t).end_offset
      member this.Label = fst t
  
  type GraphTokenValue<'br(* when 'br:comparison*)>() =
      inherit AdjacencyGraph<int,TokenEdge<'br>>()
  
      member this.AddEdgeForsed (e:TokenEdge<_>) =
  
negative.code:     res.AddVerticesAndEdgeRange edgesParserGraph |> ignore  
      res
  
  let Tokenize (fstLexer : FST<_,_>) (actions : array<GraphTokenValue<_> -> _>) (alphabet: HashSet<_>) eofToken (inputGraph : Appr<_>) =    
      let inputFst = inputGraph.ToFST() 
      let inputFstLexer = FST<_,_>.Compos(inputFst, fstLexer, alphabet) 
      //inputFstLexer.PrintToDOT (@"..\..\Tests\CalcTestLexerk.dot", printSmbString)
      let epsRes = 
          match inputFstLexer with
          | Success fst -> 
              let parserInputGraph = Interpret fst actions eofToken
              Success (EpsClosure.NfaToDfa parserInputGraph)
          | Error errors -> Error errors
      
      epsRes 
  
  let ToDot (parserInputGraph : ParserInputGraph<_>) filePrintPath toStr =
  