-// Copyright 2006 all rights reserved; see LICENSE file for BSD-style license
+// Copyright 2006-2007 all rights reserved; see LICENSE file for BSD-style license
package edu.berkeley.sbp;
import edu.berkeley.sbp.*;
import edu.berkeley.sbp.util.*;
import edu.berkeley.sbp.Parser.Table.*;
-import edu.berkeley.sbp.Sequence.Position;
+import edu.berkeley.sbp.Sequence.Pos;
+import edu.berkeley.sbp.Sequence.Pos;
import java.io.*;
import java.util.*;
import java.lang.reflect.*;
/** a node in the GSS */
final class Node
- implements Invokable<Position, Boolean, Result>,
+ implements Invokable<Pos, Result>,
IntegerMappable,
GraphViz.ToGraphViz,
Iterable<Result> {
/** which GSS.Phase this Node belongs to */
- public GSS.Phase phase() { return phase; }
+ public GSS.Phase phase() { return phase; }
public Iterator<Result> iterator() { return results.iterator(); }
public Parser.Table.State state() { return state; }
public int toInt() { return idx; }
- public boolean merge(Result r) {
- if (results.contains(r)) return true;
- results.add(r);
- if (fromEmptyReduction) return false;
- state.invokeReductions(phase().getToken(), this, false, r);
- return false;
+ boolean destroyed = false;
+
+ public void check() {
+ if (destroyed) return;
+ boolean dead = true;
+ // - all nodes must have a predecessor
+ // - non-doomed nodes must either:
+ // - be on the frontier or
+ // - have a non-doomed node closer to the frontier than themself
+ if (phase.isFrontier()) dead = false;
+ else for(Result r : successors)
+ if (state.doomed) { if (r.usedByAnyNode()) { dead = false; break; } }
+ else { if (r.usedByNonDoomedNode()) { dead = false; break; } }
+ dead |= results.size()==0;
+ if (!dead) return;
+ destroyed = true;
+ while(successors.size()>0)
+ for(Result r : successors) {
+ successors.remove(r);
+ r.destroy();
+ break;
+ }
+ while(results.size()>0)
+ for(Result r : results) {
+ results.remove(r);
+ r.removeSucc(this);
+ break;
+ }
+ results = null;
+ successors = null;
}
//////////////////////////////////////////////////////////////////////
private final boolean fromEmptyReduction;
//private FastSet<Result> results = new FastSet<Result>();
private HashSet<Result> results = new HashSet<Result>();
-
- public final void invoke(Position r, Boolean emptyProductions, Result only) {
- if (emptyProductions != (r.pos==0)) return;
- if (r.pos==0) finish(r, r.zero(phase().getLocation().createRegion(phase().getLocation())), phase());
- else reduce(r, r.pos-1, phase(), only);
+ private HashSet<Result> successors = new HashSet<Result>();
+
+ public final void invoke(Pos r, Result only) {
+ boolean emptyProductions = only==null;
+ if (emptyProductions != (r.numPops()==0)) return;
+ if (r.numPops()!=0) reduce(r, r.numPops()-1, phase(), only);
+ else {
+ Input.Region region = phase().getLocation().createRegion(phase().getLocation());
+ new Result(r.rewrite(region), this, r, phase());
+ }
}
- private void reduce(Position r, int pos, GSS.Phase target, Result only) {
+ private void reduce(Pos r, int pos, GSS.Phase target, Result only) {
Forest[] holder = r.holder;
Forest old = holder[pos];
+ if (results==null) return; // FIXME: this should not happen
for(Result res : results)
if (only == null || res == only) {
- Node child = res.parent();
+ Node pred = res.pred();
holder[pos] = res.getForest();
- if (pos>0) child.reduce(r, pos-1, target, null);
+ if (pos>0) pred.reduce(r, pos-1, target, null);
else {
- Reduction reduction =
- new Reduction(child, r, r.rewrite(child.phase().getLocation().createRegion(target.getLocation())), target);
- target.reductionQueue.add(reduction);
+ Input.Region region = pred.phase().getLocation().createRegion(target.getLocation());
+ new Reduction(pred, r, r.rewrite(region), target);
}
}
-
holder[pos] = old;
}
- void finish(Position r, Forest forest, GSS.Phase target) {
- Parser.Table.State state0 = (Parser.Table.State)state.gotoSetNonTerminals.get(r.owner());
- Result result = new Result(forest, this, r);
- target.newNodeFromReduction(result, state0, r.pos<=0, r);
- }
-
Node(GSS.Phase phase, Result result, State state, boolean fromEmptyReduction) {
this.phase = phase;
this.state = state;
this.fromEmptyReduction = fromEmptyReduction;
- results.add(result);
if (phase.hash.get(state, result.phase()) != null) throw new Error("severe problem!");
phase.hash.put(state, result.phase(), this);
+ addResult(result);
+ state.invokeEpsilonReductions(phase().token, this);
+ }
- for(Object s : state.also)
- phase.newNode(result, (State)s, fromEmptyReduction);
+ // Add/Remove Successors/Results //////////////////////////////////////////////////////////////////////////////
- state.invokeReductions(phase().token, this, true, null);
- if (!fromEmptyReduction)
- state.invokeReductions(phase().getToken(), this, false, null);
+ public void removeSucc(Result succ) {
+ if (successors==null) return;
+ successors.remove(succ);
+ check();
+ }
+ public void removeResult(Result result) {
+ if (results==null) return;
+ results.remove(result);
+ check();
+ }
+ public void addSucc(Result succ) {
+ if (successors==null) return; // FIXME: this should not happen
+ successors.add(succ);
+ }
+ public void addResult(Result r) {
+ if (results.contains(r)) return;
+ results.add(r);
+ r.addSucc(this);
+ if (!fromEmptyReduction) state.invokeReductions(phase().getToken(), this, r);
}
// GraphViz //////////////////////////////////////////////////////////////////////////////
public GraphViz.Node toGraphViz(GraphViz gv) {
+ if (results.size()==0) return null;
if (gv.hasNode(this)) return gv.createNode(this);
GraphViz.Node n = gv.createNode(this);
- n.label = ""+state.toStringx();
+ n.label = "state["+state.toInt()+"]";
n.shape = "rectangle";
- boolean hasparents = false;
- //for(Node parent : parents()) { hasparents = true; n.edge(parent, ""); }
- //for(Forest result : resultMap) n.edge(result, "");
- n.color = !hasparents ? "blue" : /*state.evil ? "red" :*/ "green";
+ boolean haspreds = false;
+ for(Result r : results) n.edge(r, "");
+ n.color = state.doomed ? "red" : "green";
((GraphViz.Group)phase().toGraphViz(gv)).add(n);
return n;
}
projects / sbp.git / blobdiff