anchor.diff:                                              rule.RuleName = rule.R1
                                           | None -> false)
               let right = 
  -                recTable.[rightI,rightL]
  +                recTable.[rightI * rowSize + rightL]
                   |> Array.tryFind (fun (x:Option<CellData>) -> 
                                           match x with
                                           | Some x -> 
  
positive.code:                             | 0uy -> LblState.Undefined
                              | _   -> LblState.Defined
                          let currentElem = buildData ruleIndex lState rule.Label rule.Weight
                          recTable.[k,0].[int rule.RuleName - 1] <- new CellData(currentElem,0u) |> Some)
      
          fillTable ()
          recTable
  
negative.code:             |> Set.ofArray
              |> Set.count
  
          rowSize <- s.Length
          recTable <- Array.init (rowSize * rowSize) (fun _ -> Array.init nTermsCount (fun _ -> None))
  
          let chooseNewLabel (ruleLabel:uint8) (lbl1:byte) (lbl2:byte) lState1 lState2 =
              let conflictLbl = new LabelWithState(noLbl, LblState.Conflict)
  