private Forest.Ref holder = null;
private boolean allqueued = false;
- /** the set of nodes to which there is an edge starting at this node */
- //public final FastSet<Node> parents = new FastSet<Node>(); /* ALLOC */
-
/** what state this node is in */
public final Parser.Table.State state;
if (!allqueued) { queueReductions(); return; }
for(Parser.Table.Reduction r : state.getReductions(token))
if (r.numPop > 0)
- r.reduce(this, n2, null);
+ r.reduce(this, n2);
}