//return;
} while(false);
- Node n = new Node(parent, pending, state, fromEmptyReduction); // ALLOC
+ Node n = new Node(parent, pending, state); // ALLOC
if (reducing) {
n.queueEmptyReductions();
if (!fromEmptyReduction) n.queueReductions(parent);
public FastSet<Node> parents() { return this; }
public void queueReductions() {
- if (!reducing) return;
if (allqueued) return;
allqueued = true;
state.invokeReductions(token, this, this, null);
else if (n2==null) r.reduce(n);
else r.reduce(n, n2);
}
- public void queueEmptyReductions() {
- if (!reducing) return;
- state.invokeReductions(token, this, null, null);
- }
+ public void queueEmptyReductions() { state.invokeReductions(token, this, null, null); }
- private boolean fe;
public boolean dead = false;
public boolean redo = false;
- private Node(Node parent, Forest pending, State state, boolean fe) {
- this.fe = fe;
+ private Node(Node parent, Forest pending, State state) {
this.state = state;
this.holder().merge(pending);
Phase start = parent==null ? null : parent.phase();