anchor.diff:                          parserResult
                       |> Set.unionMany                                                               
                   let res = resPart1
  -                printfn "RESULT   %A" res
  +                //printfn "RESULT   %A" res
                   res)
   
           
  
positive.code:                                             value = NodeV 1
                                          }
                                      let node f = (f , itm.state.itemName, _val ) |> Node
                                      if  //(itm.state.itemName ="s" && itm.state.position = 0 && (parserState.inpStream:Lexing.LexBuffer<_>).IsPastEndOfStream )  
                                          //||
                                          itm.state.position > 0
                                      then                                        
                                          Set.add
                                              {
                                                  rItem  = {itm.state with forest = (*[node*) (parserState.statesSet.MinimumElement.forest @ res.rItem.forest)(*]*)}
                                                  rI     = parserState.i
                                                  rLexer = parserState.lexer
                                              }
                                              buf
  
negative.code:                                         }
                              Set.filter (fun res -> not (isFinaleState res.rItem)) climbRes 
                  let res = resPart1 + resPart2
                  //printfn "RESULT   %A" res
                  res)
  
          
  