public IntPairMap<Node> hash; /* ALLOC */
private boolean good;
- Phase next = null;
+ private Phase next = null;
private Phase prev;
private Input.Location location;
private Input.Location nextLocation;
finalResult = null;
if (prev != null) prev.shift(this, forest);
}
-
+
+ public boolean isFrontier() { return next==null; }
public boolean isDone() throws ParseFailed {
if (token != null) return false;
if (token==null && finalResult==null)