/** a node in the GSS */
final class StateNode
- extends Node
+ extends Node<ResultNode>
implements Invokable<Pos, ResultNode, Object>,
Iterable<ResultNode> {
/** which GSS.Phase this StateNode belongs to */
public GSS.Phase phase() { return phase; }
- public Iterator<ResultNode> iterator() { return results.iterator(); }
+ public Iterator<ResultNode> iterator() { return predecessors.iterator(); }
public Parser.Table.State state() { return state; }
boolean destroyed = false;
else for(ResultNode r : successors)
if (state.doomed) { if (r.usedByAnyNode()) { dead = false; break; } }
else { if (r.usedByNonDoomedNode()) { dead = false; break; } }
- dead |= results.size()==0;
+ dead |= predecessors.size()==0;
if (!dead) return;
destroyed = true;
if (phase() != null && phase().hash != null)
r.removePred(this);
break;
}
- while(results.size()>0)
- for(ResultNode r : results) {
- results.remove(r);
+ while(predecessors.size()>0)
+ for(ResultNode r : predecessors) {
+ predecessors.remove(r);
r.removeSucc(this);
break;
}
- results = null;
+ predecessors = null;
successors = null;
}
private final GSS.Phase predPhase;
private final Parser.Table.State state;
private boolean fromEmptyReduction;
- private FastSet<ResultNode> results = new FastSet<ResultNode>();
+ private FastSet<ResultNode> predecessors = new FastSet<ResultNode>();
private FastSet<ResultNode> successors = new FastSet<ResultNode>();
- //private HashSet<ResultNode> results = new HashSet<ResultNode>();
+ //private HashSet<ResultNode> predecessors = new HashSet<ResultNode>();
//private HashSet<ResultNode> successors = new HashSet<ResultNode>();
public final void invoke(Pos r, ResultNode only, Object o) {
}
private void reduce(Pos r, int pos, GSS.Phase target, ResultNode only) {
- for(ResultNode res : results)
+ for(ResultNode res : predecessors)
if (only == null || res == only)
for(StateNode pred : res.getPreds())
reduce2(r, pos, target, pred, res.getForest());
this.predPhase = pred.phase();
phase.hash.put(state, pred.phase(), this);
- results.add(pred);
+ predecessors.add(pred);
pred.addSucc(this);
if (!fromEmptyReduction)
state.invokeReductions(phase().getToken(), this, pred);
state.invokeEpsilonReductions(phase().token, this);
}
- // Add/Remove Successors/Results //////////////////////////////////////////////////////////////////////////////
+ // Add/Remove Successors/Predecessors //////////////////////////////////////////////////////////////////////////////
public void removeSucc(ResultNode succ) {
successors.remove(succ);
check();
}
public void removeResult(ResultNode result) {
- results.remove(result);
+ predecessors.remove(result);
check();
}
public void addSucc(ResultNode succ) {
successors.add(succ);
}
public void addResult(Forest f, Pos reduction, StateNode pred) {
- for(ResultNode r : results)
+ for(ResultNode r : predecessors)
if (r.predecessorsContains(pred)) {
r.merge(f);
return;
}
ResultNode result = new ResultNode(f, reduction, pred);
- results.add(result);
+ predecessors.add(result);
result.addSucc(this);
if (!this.fromEmptyReduction) state.invokeReductions(phase().getToken(), this, result);
}