public final Parser.Table.State state;
/** which Phase this Node belongs to (node that Node is also a non-static inner class of Phase) */
- public final Phase phase = Phase.this;
+ public Phase phase() { return Phase.this; }
public HashMap<Parser.Table.Reduction,Forest> cache() {
return cache==null ? (cache = new HashMap<Parser.Table.Reduction,Forest>()) : cache;
if (r.numPop <= 0) continue;
if (r.numPop == 1) {
Forest ret = n.cache().get(r);
- if (ret != null) r.reduce(n, n2, n.phase, ret);
- else n.cache().put(r, r.reduce(n, n2, n.phase, null));
+ if (ret != null) r.reduce(this, n2, ret);
+ else n.cache().put(r, r.reduce(this, n2, null));
} else {
- r.reduce(n, n2, Phase.this, null);
+ r.reduce(this, n2, null);
}
}
}
if (reducing)
for(Parser.Table.Reduction r : token==null ? state.getEofReductions() : state.getReductions(token))
if (r.numPop==0)
- r.reduce(this, null, this.phase, r.zero());
+ r.reduce(this, null, r.zero());
}
private Node(Node parent, Forest pending, Parser.Table.State state, Phase start) {