- public final void invoke(Reduction r, Node n, Node n2) {
- if (n==null || n2==null || r.position.pos==0) {
- if (r.position.pos==0) {
- if (n==null) n = this;
- else return;
- }
- 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);
- } else {
- 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());
- r.finish(n2, rex, n.phase(), holder);
- } else {
- r.reduce(n2, pos-1, n.phase(), holder);
- }
- holder[pos] = old;
- }
- }
- public void performEmptyReductions() { state.invokeReductions(token, this, null, null); }
-
- private Node(Node parent, Forest pending, State state) {
- this.state = state;
- this.holder().merge(pending);
- Phase start = parent==null ? null : parent.phase();
- if (parent != null) parents().add(parent, true);
- if (Phase.this.hash.get(state, start) != null) throw new Error("severe problem!");
- Phase.this.hash.put(state, start, this);
- }