public LeftRecursiveRule(Grammar g, string name, RuleAST ast) : base(g, name, ast, 1) { originalAST = ast; alt = new Alternative[numberOfAlts + 1]; // always just one for (int i = 1; i <= numberOfAlts; i++) alt[i] = new Alternative(this, i); }