anchor.diff:                | [] -> buf,[]
           let (red,n_tree) = to_Label (if tree<>[] then kill_label tree else tree)  []     
           Label::(Node(red,item.prod_name,[item.prod_name]))::n_tree
  -    let tree2 item tree = ((Leaf(text,[text]))::(function (Label::tree)-> tree| x-> x) tree)
  +    let tree2 item tree = ((Leaf(text,[text]))::(*function (Label::tree)-> tree| x-> x*) tree)
       let new_states = Set.filter (fun (item,tree) -> (item.next_num=None))states
       let result_states states _tree = Set.map (fun (item,tree) -> (item,(_tree item tree))) states
       union_all
  
positive.code:    let r = res ()
     printfn "Result : %A" r;
     printfn "End time: %A Total: %A" System.DateTime.Now (System.DateTime.Now - (!start_time));
     ignore(System.Console.ReadLine())
negative.code:     match x with
      PLiteral(y)|PToken(y)-> Source.toString y
      |_ -> ""
  //Р·Р°РїР_Р_РёР_Р°Р>РєР°. Р_С_РїР_Р>С_Р·С_РчР_ Р_Р>С_ Р·Р°РїР_Р_РёР_Р°Р_РёС_ С_РчР·С_Р>С_С'Р°С'Р_Р_ С"-РёР№ parse Рё climb   
  let memoize (f: 'a ->'b) =
     let t = new System.Collections.Generic.Dictionary<'a,'b>()   
     fun x ->        
  