anchor.diff:              (fun l -> printListAsArray l (fun (x,y) -> print "%d" x))
               "zeroReduces"
   
  -        printInd 0 "let private small_acc = "
  +        printInd 0 "val small_acc = "
           printList tables.acc (fun x -> print "%d" x)
           printBr ""
  -        printBrInd 0 "let private accStates = Array.zeroCreate %d" <| tables.gotos.GetLength 0
  +        printBrInd 0 "val accStates = Array.zeroCreate %d" <| tables.gotos.GetLength 0
           printBrInd 0 "for i = 0 to %d do" statesLim
           printBrInd 2 "accStates.[i] <- List.exists ((=) i) small_acc"
   
  -        printBrInd 0 "let eofIndex = %d" grammar.indexator.eofIndex
  -
  -        printBrInd 0 "let private parserSource = new ParserSource<Token> (gotos, reduces, zeroReduces, accStates, rules, rulesStart, leftSide, startRule, eofIndex, tokenToNumber, acceptEmptyInput, numToString)"
  -
  -        printBr "let buildAst : (seq<Token> -> ParseResult<Token>) ="
  +        printBrInd 0 "val eofIndex = %d" grammar.indexator.eofIndex
  +
  +        printBrInd 0 "val parserSource = new ParserSource<Token> (gotos, reduces, zeroReduces, accStates, rules, rulesStart, leftSide, startRule, eofIndex, tokenToNumber, acceptEmptyInput, numToString)"
  +
  +        printBr "def buildAst : (seq<Token> -> ParseResult<Token>) ="
           printBrInd 1 "buildAst<Token> parserSource"
           printBr ""
           res.ToString()
  
positive.code: 
          printBrInd 1 "| _ -> \"\""
  
          printBrInd 0 "let tokenToNumber = function"
          for i = indexator.termsStart to indexator.termsEnd do
              printBrInd 1 "| %s _ -> %d" (indexator.indexToTerm i) i
          printBr ""
  
          printBr "let mutable private cur = 0"
  
          print "let leftSide = "
          printArr leftSide (print "%d")
  
          print "let private rules = "
          printArr rules (print "%d")
  
          print "let private rulesStart = "
          printArr rulesStart (print "%d")
  
          printBr "let startRule = %d" grammar.startRule
          printBr ""
  
          printBr "let acceptEmptyInput = %A" grammar.canInferEpsilon.[leftSide.[grammar.startRule]]
          printBr ""
  
          print2DArrList tables.gotos
  
negative.code:                 | s -> " of " + s
  
          printBr ""
          printBr "def numToString = function"
  
          for i = 0 to indexator.nonTermCount - 1 do
              printBrInd 1 "| %d -> \"%s\"" i (indexator.indexToNonTerm i)
  