}
if (n==null) return;
Forest[] holder = new Forest[r.position.pos];
- if (r.position.pos==0) r.finish(n, r.zero(), n.phase(), holder);
- else r.reduce(n, r.position.pos-1, n.phase(), holder);
+ if (r.position.pos==0) n.finish(r, r.zero(), n.phase(), holder);
+ else n.reduce(r, r.position.pos-1, n.phase(), holder);
} else {
- r.reduce(n, n2);
+ Forest[] holder = new Forest[r.position.pos];
+ if (r.position.pos<=0) throw new Error("called wrong form of reduce()");
+ int pos = r.position.pos-1;
+ Forest old = holder[pos];
+ holder[pos] = n.pending();
+ if (pos==0) {
+ System.arraycopy(holder, 0, r.position.holder, 0, holder.length);
+ Forest rex = r.position.rewrite(n.phase().getLocation());
+ n2.finish(r, rex, n.phase(), holder);
+ } else {
+ n2.reduce(r, pos-1, n.phase(), holder);
+ }
+ holder[pos] = old;
}
}
+
+ public void reduce(Reduction r, int pos, GSS.Phase target, Forest[] holder) {
+ Forest old = holder[pos];
+ holder[pos] = this.pending();
+ if (pos==0) {
+ System.arraycopy(holder, 0, r.position.holder, 0, holder.length);
+ for(int i=0; i<r.position.pos; i++) if (r.position.holder[i]==null) throw new Error("realbad");
+ Forest rex = r.position.rewrite(target.getLocation());
+ for(GSS.Phase.Node child : this.parents()) child.finish(r, rex, target, holder);
+ } else {
+ for(GSS.Phase.Node child : this.parents()) child.reduce(r, pos-1, target, holder);
+ }
+ holder[pos] = old;
+ }
+
+ public void finish(Reduction r, Forest result, GSS.Phase target, Forest[] holder) {
+ State state0 = state.gotoSetNonTerminals.get(r.position.owner());
+ if (result==null) throw new Error();
+ if (state0!=null)
+ target.newNode(this, result, state0, r.position.pos<=0, r);
+ }
+
public void performEmptyReductions() { state.invokeReductions(token, this, null, null); }
private Node(Node parent, Forest pending, State state) {