-
-
- // GSS Nodes //////////////////////////////////////////////////////////////////////////////
-
- /** a node in the GSS */
- public final class Node extends FastSet<Node> implements Invokable<Parser.Table.Reduction, Node, Node> {
-
- public void addParent(Node parent, boolean fromEmptyReduction) {
- if (parents().contains(parent)) return;
- parents().add(parent);
- if (this!=parent && !fromEmptyReduction) queueReductions(parent);
- }
-
- private Forest.Ref holder = null;
- private boolean allqueued = false;
-
- /** what state this node is in */
- 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 Phase phase() { return Phase.this; }
-
- public Forest.Ref holder() { return holder==null ? (holder = new Forest.Ref()) : holder; }
- public Forest pending() { return Phase.this.closed ? holder().resolve() : holder; }
- public FastSet<Node> parents() { return this; }
-
- public void queueReductions() {
- if (allqueued) return;
- allqueued = true;
- int where = parents().size();
- /*
- for(Parser.Table.Reduction r : state.getReductions(token))
- if (r.numPop > 0)
- r.reduce(this);
- */
- state.invokeReductions(token, this, this, null);
- }
-
- public void queueReductions(Node n2) {
- if (!allqueued) { queueReductions(); return; }
- /*
- for(Parser.Table.Reduction r : state.getReductions(token))
- if (r.numPop > 0)
- r.reduce(this, n2);
- */
- state.invokeReductions(token, this, this, n2);
- }
-
- public final void invoke(Parser.Table.Reduction r, Node n, Node n2) {
- if (n==null) {
- if (r.numPop==0) r.reduce(this);
- return;
- }
- if (r.numPop==0) return;
- if (n2==null) {
- r.reduce(n);
- } else {
- r.reduce(n, n2);
- }
- }
- public void queueEmptyReductions() {
- if (!reducing) return;
- /*
- for(Parser.Table.Reduction r : state.getReductions(token))
- if (r.numPop==0)
- r.reduce(this);
- */
- state.invokeReductions(token, this, null, null);
- }
-
- private Node(Node parent, Forest pending, Parser.Table.State state, Phase start) {
- this.state = state;
- if (pending != null) this.holder().merge(pending);
- if (parent != null) parents().add(parent);
- if (Phase.this.hash.get(code(state, start)) != null) throw new Error("severe problem!");
- Phase.this.hash.put(code(state, start), this);
- Phase.this.numNodes++;
- if (parent==null) holder().valid = true; // hack to make sure that the "base" node is always considered valid
- }