anchor.diff:          for i = 0 to finalV.Count - 1 do
               finalV.[i] <- finalV.[i] + 1 
           let f i = ()
  -        processEdge edges.[g] f vertexMap edgesRes 
  +        for e in edges.[g] do
  +            if not <| startEdges.[g].Contains e || finalEdges.[g].Contains e
  +            then
  +                processEdge edges.[g] f vertexMap edgesRes 
           let resGraph = new ParserInputGraph(startV.ToArray(), finalV.ToArray())
           let tmp = resGraph.AddVerticesAndEdgeRange edgesRes 
           result.Add(resGraph)
  
positive.code: [<Struct>]
  type SearchConfig =
      val SearchWithoutSPPF: BioParserInputGraph -> int -> ParseResult<ResultStruct>
      val SearchWithSPPF: ParserInputGraph -> ParseResult<int>
      val Tokenizer: char -> int
      val HightLengthLimit: int
      val LowLengthLimit: int
  
negative.code:             | x ->   failwithf "Strange symbol in input: %A" x
              |> GLL.r16s.H22_H23.tokenToNumber
      
      new SearchConfig(GLL.r16s.H22_H23.buildAbstract, GLL.r16s.H22_H23.buildAbstractAst, getSmb, 90, 120, 4)
  
  let shift_problem_SearchConfig =
  
  