private Forest.Ref holder = null;
private boolean allqueued = false;
- private HashMap<Parser.Table.Reduction,Forest> cache = null;
-
/** the set of nodes to which there is an edge starting at this node */
//public final FastSet<Node> parents = new FastSet<Node>(); /* ALLOC */
/** which Phase this Node belongs to (node that Node is also a non-static inner class of Phase) */
public Phase phase() { return Phase.this; }
- public HashMap<Parser.Table.Reduction,Forest> cache() {
- return cache==null ? (cache = new HashMap<Parser.Table.Reduction,Forest>()) : cache;
- }
public Forest.Ref holder() { return holder==null ? (holder = new Forest.Ref()) : holder; }
public Forest pending() { return Phase.this.closed ? holder().resolve() : holder; }
public FastSet<Node> parents() { return this; }
- /** FIXME */
public void queueReductions() {
if (allqueued) return;
allqueued = true;
r.reduce(this, null, null);
}
- /** FIXME */
public void queueReductions(Node n2) {
if (!allqueued) { queueReductions(); return; }
for(Parser.Table.Reduction r : state.getReductions(token))
}
- /** FIXME */
public void queueEmptyReductions() {
if (reducing)
for(Parser.Table.Reduction r : token==null ? state.getEofReductions() : state.getReductions(token))