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;
int where = parents().size();
for(Parser.Table.Reduction r : state.getReductions(token))
if (r.numPop >= 1)
- r.reduce(this, null, null);
+ r.reduce(this);
}
public void queueReductions(Node n2) {
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);
}
if (reducing)
for(Parser.Table.Reduction r : token==null ? state.getEofReductions() : state.getReductions(token))
if (r.numPop==0)
- r.reduce(this, null, r.zero());
+ r.reduce(this);
}
private Node(Node parent, Forest pending, Parser.Table.State state, Phase start) {