+ public boolean predecessorsContains(StateNode n) {
+ return predecessors.contains(n);
+ }
+ public Pos reduction() { return reduction; }
+ public void merge(Forest newf) {
+ this.f.merge(newf);
+ /*
+ if (predecessors.contains(pred)) return;
+ addPred(pred);
+ if (fromEmptyReduction) return;
+ n.state().invokeReductions(n.phase().getToken(), n, this);
+ */
+ }
+
+ public boolean noSuccessors() { return successors.size()==0; }
+
+ public GSS.Phase phase() { return predPhase; }