- public String toString() { return "state["+idx+"]"; }
-
- public int compareTo(Table.State s) { return idx==s.idx ? 0 : idx < s.idx ? -1 : 1; }
- }
-
- /**
- * the information needed to perform a reduction; copied here to
- * avoid keeping references to <tt>Element</tt> objects in a Table
- */
- public class Reduction {
- // FIXME: cleanup; almost everything in here could go in either Sequence.Position.getRewrite() or else in GSS.Reduct
- public final int numPop;
- /*private*/ final Position position;
- private final Forest[] holder; // to avoid constant reallocation
- public int hashCode() { return position.hashCode(); }
- public boolean equals(Object o) {
- if (o==null) return false;
- if (o==this) return true;
- if (!(o instanceof Reduction)) return false;
- Reduction r = (Reduction)o;
- return r.position == position;
- }
- public Reduction(Position p) {
- this.position = p;
- this.numPop = p.pos;
- this.holder = new Forest[numPop];
- }
- public String toString() { return "[reduce " + position + "]"; }
-
- private Forest zero = null;
- public Forest zero() {
- if (zero != null) return zero;
- if (numPop > 0) throw new Error();
- return zero = position.rewrite(null);
- }
-
- public void reduce(GSS.Phase.Node parent) {
- if (numPop==0) finish(parent, zero(), parent.phase());
- else reduce(parent, numPop-1, parent.phase());
+ private State<Token> mkstate(HashSet<Position> h, boolean b) {
+ if (b) return doomed_states.get(h) == null ? (State)new State<Token>(h,b) : (State)doomed_states.get(h);
+ else return normal_states.get(h) == null ? (State)new State<Token>(h,b) : (State)normal_states.get(h);