-import java.lang.reflect.*;
-
-/** a parser which translates streams of Tokens of type T into a Forest<R> */
-public class Parser<T extends Token, R> {
-
- private final Table pt;
-
- //public Parser( Topology top) { this(new Table( top)); }
- //public Parser(String s, Topology top) { this(new Table(s, top)); }
-
- /**
- * create a parser to parse the grammar with start symbol <tt>u</tt>
- * @param top a "sample" Topology<T> that can be cloned (FIXME, demanding this is lame)
- */
- public Parser(Union u, Topology<T> top) { this(new Table(u, top)); }
-
- Parser(Table pt) { this.pt = pt; }
-
- /** 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 { return parse(input).expand1(); }
-
- /** 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();
- GSS.Phase current = gss.new Phase(null, input.next());
- current.newNode(null, null, pt.start, true, null);
- for(;;) {
- GSS.Phase next = gss.new Phase(current, input.next());
- current.reduce();
- current.shift(next);
- if (current.isDone()) return (Forest<R>)current.finalResult;
- current.checkFailure();
- current = next;
- }
- }
-