anchor.diff:  open YC.FST.GraphBasedFst
   open Microsoft.FSharp.Collections 
   open QuickGraph
  +open YC.FSA.GraphBasedFsa
   
   //------------------------------------------------------------------
   // This code is duplicated from Microsoft.FSharp.Compiler.UnicodeLexing
  
positive.code:         resFST.InitState.Add((fst perRuleData.[0]).Id) //we SUGGEST that we have one init state
          
          let stEOF = tableTransitions.[0].[(sizeTable - 1)] 
          new TaggedEdge<_,_>(0, stEOF, new EdgeLbl<_,_>(Smbl (char Eof), Eps)) |> resFST.AddVerticesAndEdge |> ignore
          resFST.FinalState.Add(stEOF)
                           
          for state in dfaNodes do
  
negative.code:                 let st = tableTransitions.[state.Id].[i]
                  if st <> sentinel 
                  then 
                      new EdgeFST<_,_>(state.Id, st, (Smbl (char (if i = sizeTable - 1 then int Eof else i)), Eps)) |> resFST.AddVerticesAndEdge |> ignore                       
                  else 
                      if state.Id <> 0
                      then 
                          let action = if actionFunc.[state.Id].Count > 0 then Smbl (actionFunc.[state.Id].[0]) else Eps
                          if tableTransitions.[0].[i] <> sentinel || i = sizeTable - 1
                          then  
                              new EdgeFST<_,_>(state.Id, tableTransitions.[0].[i], (Smbl (char (if i = sizeTable - 1 then int Eof else i)), action)) |> resFST.AddVerticesAndEdge |> ignore
                              
          let getVal printV s = 
              match s with
              | Smbl y -> "Smbl " + printV y
              | Eps -> "Eps"
  
          let filePathFst = 
              match !out with 
  