anchor.diff:          
           let print2DReduceArrList (arr : 'a list[,]) checker printer name =
               print2DArrList "[|" "|]" "; " "let private" printArr resultReducesArrayCreationCodePrinter (arr : 'a list[,]) checker printer name
  -
   
   
   
  
positive.code:             for s = 0 to dfaArr.[i].Length - 1 do
                  dfaArrList.[i, j] <- s::(dfaArr.[i].[s].[j])::dfaArrList.[i, j]
      let finitStatesSet = dfaTableArr |> Array.map (fun x -> snd x)
      
  
      let totalRulesNumberOfStates = rulesArr |> Array.sumBy (fun x -> x.numberOfStates)
  
negative.code:         printBr "let acceptEmptyInput = %A" grammar.canInferEpsilon.[leftSide.[grammar.startRule]]
          printBr ""
  
          print "let defaultAstToDot = "
          printBrInd 0 "(fun (tree : Yard.Generators.Common.AST.Tree<Token>) -> tree.AstToDot numToString tokenToNumber leftSide)"
  
          printBr ""
  
  