anchor.diff:                  let count1 = left.Count
                   let count2 = right.Count
   
  -                if (count1 > 0) && (count2 > 0)
  +                if count1 > 0 && count2 > 0
                   then
                       for m in 0..(count1 - 1) do
                           for n in 0..(count2 - 1) do
  
positive.code:                                     | 0uy -> LblState.Undefined
                                      | _   -> LblState.Defined
                                  let currentElem = buildData ruleIndex lState rl rw
                                  (recTable.[k,0]).Add (new CellData(currentElem,0u))                                                                
                      |_ -> ())
      
          fillTable 0 1
  
negative.code:         else 
              let left = ResizeArray.tryFind (fun (x:CellData) -> 
                                              let ind,lSt,lbl,_ = getData x.rData
                                              let top,_,_,_,_ = getRule rules.[int ind]
                                              top = b) recTable.[leftI,leftL]
              let right = 
                      ResizeArray.tryFind (fun (x:CellData) -> 
                                                  let ind,lSt,lbl,_ = getData x.rData
                                                  let top,_,_,_,_ = getRule rules.[int ind]
                                                  top = c) recTable.[rightI,rightL]
  
              
              match right with
  