import edu.berkeley.sbp.util.*;
import edu.berkeley.sbp.Sequence.Position;
import edu.berkeley.sbp.Parser.Table.State;
-import edu.berkeley.sbp.Parser.Table.Reduction;
import java.io.*;
import java.util.*;
import java.lang.reflect.*;
if (p != null) return newNode2(p, parent, pending, state, fromEmptyReduction);
else return newNode3(parent, pending, state, fromEmptyReduction);
}
- public void newNode(Node parent, Forest pending, State state, boolean fromEmptyReduction, Reduction reduction) {
+ public void newNode(Node parent, Forest pending, State state, boolean fromEmptyReduction, Position reduction) {
int pos = parent==null?0:parent.phase()==null?0:parent.phase().pos;
- Sequence owner = reduction==null ? null : reduction.position.owner();
+ Sequence owner = reduction==null ? null : reduction.owner();
if (reduction!=null) {
if (inhibited.contains(pos, owner)) return;
if (owner.needs != null)
p.holder.merge(pending);
if (p.parents().contains(parent)) return true;
p.parents().add(parent, true);
- if (p!=parent && !fromEmptyReduction && reducing) p.queueReductions(parent);
+ if (p!=parent && !fromEmptyReduction && reducing) p.performReductions(parent);
return true;
}
private boolean newNode3(Node parent, Forest pending, State state, boolean fromEmptyReduction) {
//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);
+ n.performEmptyReductions();
+ if (!fromEmptyReduction) n.performReductions(parent);
}
return true;
}
inhibited.remove(p, s2);
}
- public void inhibit(Reduction r, int p) {
- if (r.position.owner().hated == null) return;
+ public void inhibit(Position r, int p) {
+ if (r.owner().hated == null) return;
// remember that dead states are still allowed to shift -- just not allowed to reduce
boolean reset = false;
- for(Sequence seq : r.position.owner().hated) {
+ for(Sequence seq : r.owner().hated) {
if (performed.contains(p,seq)) {
uninhibit(p, seq);
- //System.out.println("\nresetting due to " + r.position.owner() + " killing " + seq);
+ //System.out.println("\nresetting due to " + r.owner() + " killing " + seq);
//inhibited.clear();
inhibited.add(p, seq);
//inhibited = new HashMapBag<Integer,Sequence>();
int num = hash.size();
for(int i=0; i<num; i++) {
Node n = reducing_list[i];
- n.queueEmptyReductions();
+ n.performEmptyReductions();
// INVARIANT: we never "see" a node until its parent-set is complete, modulo merges
}
for(int i=0; i<num; i++) {
Node n = reducing_list[i];
reducing_list[i] = null;
- n.queueReductions();
+ n.performReductions();
}
} catch (Reset r) {
reset();
Forest pending;
State state;
boolean fromEmptyReduction;
- Reduction reduction;
- public Waiting(Node parent, Forest pending, State state, boolean fromEmptyReduction, Reduction reduction) {
+ Position reduction;
+ public Waiting(Node parent, Forest pending, State state, boolean fromEmptyReduction, Position reduction) {
waits++;
this.parent = parent;
this.pending = pending;
// Node /////////////////////////////////////////////////////////////////////////////////
/** a node in the GSS */
- public final class Node extends FastSet<Node> implements Invokable<Reduction, Node, Node> {
+ public final class Node extends FastSet<Node> implements Invokable<Position, Node, Node> {
private Forest.Ref holder = null;
private boolean allqueued = false;
public Forest pending() { return Phase.this.closed ? holder().resolve() : holder; }
public FastSet<Node> parents() { return this; }
- public void queueReductions() {
- if (!reducing) return;
+ public void performReductions() {
if (allqueued) return;
allqueued = true;
state.invokeReductions(token, this, this, null);
}
- public void queueReductions(Node n2) {
- if (!allqueued) { queueReductions(); return; }
- state.invokeReductions(token, this, this, n2);
+ public void performReductions(Node n2) {
+ if (!allqueued) performReductions();
+ else state.invokeReductions(token, this, this, n2);
}
- public final void invoke(Reduction r, Node n, Node n2) {
- if (n==null) {
- if (r.position.pos==0) r.reduce(this);
- } else if (r.position.pos==0) return;
- else if (n2==null) r.reduce(n);
- else r.reduce(n, n2);
+ public final void invoke(Position r, Node n, Node n2) {
+ if (n==null || n2==null || r.pos==0) {
+ if (r.pos==0) {
+ if (n==null) n = this;
+ else return;
+ }
+ if (n==null) return;
+ Forest[] holder = new Forest[r.pos];
+ if (r.pos==0) n.finish(r, r.zero(), n.phase(), holder);
+ else n.reduce(r, r.pos-1, n.phase(), holder);
+ } else {
+ Forest[] holder = new Forest[r.pos];
+ if (r.pos<=0) throw new Error("called wrong form of reduce()");
+ int pos = r.pos-1;
+ Forest old = holder[pos];
+ holder[pos] = n.pending();
+ if (pos==0) {
+ System.arraycopy(holder, 0, r.holder, 0, holder.length);
+ Forest rex = r.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(Position r, int pos, GSS.Phase target, Forest[] holder) {
+ Forest old = holder[pos];
+ holder[pos] = this.pending();
+ if (pos==0) {
+ System.arraycopy(holder, 0, r.holder, 0, holder.length);
+ for(int i=0; i<r.pos; i++) if (r.holder[i]==null) throw new Error("realbad");
+ Forest rex = r.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 queueEmptyReductions() {
- if (!reducing) return;
- state.invokeReductions(token, this, null, null);
+
+ public void finish(Position r, Forest result, GSS.Phase target, Forest[] holder) {
+ State state0 = state.gotoSetNonTerminals.get(r.owner());
+ if (result==null) throw new Error();
+ if (state0!=null)
+ target.newNode(this, result, state0, r.pos<=0, r);
}
- private boolean fe;
- public boolean dead = false;
- public boolean redo = false;
- private Node(Node parent, Forest pending, State state, boolean fe) {
- this.fe = fe;
+ 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();