- protected Parser(Union u) { this.pt = new Table(u, top()); }
- protected Parser(Table pt) { this.pt = pt; }
-
- public abstract Forest<R> shiftedToken(T t, Token.Location loc);
- public abstract Topology<T> top();
-
-
- /** parse <tt>input</tt> for a exactly one unique result, throwing <tt>Ambiguous</tt> if not unique or <tt>Failed</tt> if none */
- public Tree<R> parse1(Token.Stream<T> input) throws IOException, Failed, Ambiguous {
- Forest<R> ret = parse(input);
- try { return ret.expand1(); }
- catch (Ambiguous a) {
- System.out.println("while expanding:");
- System.out.println(ret);
- throw a;
- }
- }
-
- /** parse <tt>input</tt>, using the table <tt>pt</tt> to drive the parser */
- public Forest<R> parse(Token.Stream<T> input) throws IOException, Failed {
- GSS gss = new GSS();
- Token.Location loc = input.getLocation();
- GSS.Phase current = gss.new Phase(null, input.next(), loc);
- current.newNode(null, null, pt.start, true, null);
- for(;;) {
- loc = input.getLocation();
- GSS.Phase next = gss.new Phase(current, input.next(), loc);
- current.reduce();
- Forest forest = current.token==null ? null : shiftedToken((T)current.token, loc);
- current.shift(next, forest);
- if (current.isDone()) return (Forest<R>)current.finalResult;
- current.checkFailure();
- current = next;
+ public Parser(Union u, Topology<Token> top) { this.pt = new Table<Token>(u, top); }
+
+ /** implement this method to create the output forest corresponding to a lone shifted input token */
+ public abstract Forest<NodeType> shiftToken(Token t, Input.Location newloc);
+
+ public String toString() { return pt.toString(); }
+
+ private boolean verbose = false;;
+ private static final char[] spin = new char[] { '-', '\\', '|', '/' };
+ private int spinpos = 0;
+ private long last = 0;
+ void spin() {
+ if (verbose) {
+ long now = System.currentTimeMillis();
+ if (now-last < 70) return;
+ last = now;
+ System.err.print("\r " + spin[spinpos++ % (spin.length)]+"\r");