anchor.diff:              ] |> ignore
   
           test RNGLR.AandB.buildAstAbstract qGraph 23 22 0 11 1
  +
  +    [<Test>]
  +    member this._30_Errors_PrettySimpleCalc_FirstEdge () =
  +        let qGraph = new ParserInputGraph<_>(0, 2)
  +        qGraph.AddVerticesAndEdgeRange
  +            [edg 0 1 (RNGLR.PrettySimpleCalc.PLUS 1)
  +             edg 1 2 (RNGLR.PrettySimpleCalc.RNGLR_EOF 0)
  +             ] |> ignore
  +        let testErrors = new ResizeArray<string>()
  +        testErrors.Add("PLUS1")
  +
  +        errorTest RNGLR.PrettySimpleCalc.buildAstAbstract qGraph false testErrors
   
       member this.``Not Ambigous Simple Calc. Branch. Perf`` i inpLength isLoop =  
           let tpl x =
  
positive.code: 
          test RNGLR.PrettySimpleCalc.buildAstAbstract qGraph 13 12 0 3 0
  
  
      [<Test>]
      member this._00_Simple () =
          let qGraph = new ParserInputGraph<_>(0, 2)
          qGraph.AddVerticesAndEdgeRange
              [edg 0 1 (RNGLR.PrettySimpleCalc.PLUS 1)
               edg 1 2 (RNGLR.PrettySimpleCalc.RNGLR_EOF 0)
               ] |> ignore
          test RNGLR.PrettySimpleCalc.buildAstAbstract qGraph 15 14 0 4 1
  
      [<Test>]
      member this._02_PrettySimpleCalcSimple_BranchedInput () =
          let qGraph = new ParserInputGraph<_>(0, 4)
  
negative.code:     for e in qGraph.Edges do lexerInputG.AddEdgeForsed (new LexerEdge<_,_>(e.Source,e.Target,Some (e.Tag, e.Tag)))
      lexerInputG
  
  //generate log message
  let getStringErrors (errDict:Dictionary<_,_>) =
      let mutable errStr = "Error tokens: "
      for tknStr in errDict.Keys do
          errStr <- errStr + tknStr + ", "
      errStr
  