anchor.diff:  [<Struct>]
   type StateInfo<'a, 'br> =
       val StartV: int
  -    val AccumulatedString: ResizeArray<'a>
  +    val AccumulatedString:'a list 
       val Positions: ResizeArray<Position<'br>>
       new (startV, str, positions) = {StartV = startV; AccumulatedString = str; Positions = positions}
   
  
positive.code:         let g = new LexerInnerGraph<'br>(inGraph)
          let sorted = g.TopologicalSort() |> Array.ofSeq
          let states = Array.init ((Array.max sorted)+1) (fun _ -> new ResizeArray<_>())
          let startState = new State<_,'br>(0,-1, ResizeArray.singleton (new StateInfo<_,'br>(0, new ResizeArray<_>(), new ResizeArray<_>())))
          do states.[g.StartVertex] <- ResizeArray.singleton startState
          let edgesSeq = seq{ for v in sorted do
                                  yield g.OutEdges v |> Array.ofSeq    
  
negative.code:         res
  
      static member Create(trans, accept) = new UnicodeTables(trans, accept)
  