anchor.diff:          for state in dfaNodes do
               for i in 0..256 do
                   let st = tableTransitions.[state.Id].[i]
  -                if i = 256
  -                then
  -                    printfn "!!!!"
                   if st <> sentinel 
                   then 
  -                    new TaggedEdge<_,_>(state.Id, st, new EdgeLbl<_,_>(Smbl (char (if i = 256 then int Eof else i)), Eps)) |> resFST.AddVerticesAndEdge |> ignore  
  -                    //resFST.FinalState.Add(st)  
  -                    //new TaggedEdge<_,_>(st,  stEOF, new EdgeLbl<_,_>(Smbl (char Eof), Smbl (actionFunc.[state.Id].[0]))) |> resFST.AddVerticesAndEdge |> ignore                      
  +                    new TaggedEdge<_,_>(state.Id, st, new EdgeLbl<_,_>(Smbl (char (if i = 256 then int Eof else i)), Eps)) |> resFST.AddVerticesAndEdge |> ignore                       
                   else 
                       if state.Id <> 0
                       then 
  
positive.code:         let r = FST<_,_>.Compos(fst, resFST)
          r.PrintToDOT(@"C:\recursive-ascent\src\AbstractFsLex\outPrint1.txt")
  
      ToGraphBasedFst    
      
    with e -> 
  
negative.code:     printLinesIfCodeDefined spec.BottomCode
      cfprintfn os "# 3000000 \"%s\"" output;
    
      let printTable filePath =                                
          let strs =
              tableTransitions
              |> ResizeArray.map(fun x -> 
  