GSS gss = new GSS();
Token.Location loc = input.getLocation();
GSS.Phase current = gss.new Phase(null, this, null, input.next(1, 0, 0), loc, null);
- current.newNode(null, null, pt.start, true);
+ current.newNode(null, Forest.leaf(null, null), pt.start, true);
int count = 1;
for(;;) {
loc = input.getLocation();
}
/** a single state in the LR table and the transitions possible from it */
- public class State implements Comparable<Table.State>, Iterable<Position> {
+
+ public class State implements Comparable<Table.State>, IntegerMappable, Iterable<Position> {
+ public int toInt() { return idx; }
+
+ public boolean lame() {
+ for(Position p : this)
+ for(Position p2 = p; p2!=null; p2=p2.next())
+ if (p2.isLast() && !p2.owner().lame)
+ return false;
+ return true;
+ }
/*
public boolean isResolvable(Token t) {
boolean found = false;
}
}
- public String toString() { return "state["+idx+"]"; }
+ public String toString() {
+ //return "state["+idx+"]";
+ StringBuffer ret = new StringBuffer();
+ ret.append("state["+idx+"]: ");
+ for(Position p : this) ret.append("{"+p+"} ");
+ return ret.toString();
+ }
public int compareTo(Table.State s) { return idx==s.idx ? 0 : idx < s.idx ? -1 : 1; }
}
}
private void finish(GSS.Phase.Node parent, Forest result, GSS.Phase target) {
State state = parent.state.gotoSetNonTerminals.get(position.owner());
+ if (result==null) throw new Error();
if (state!=null)
target.newNode(parent, result, state, numPop<=0, this);
}