X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FParser.java;h=0d14563292a631d77db1994d314107280b18080a;hp=31bd1b368a5281c2734c214ffdc4e24c30c4881a;hb=c8a17fdd2e149fe5feecd96c71b7f2cab286ab96;hpb=fa858dc4acddd3e32126ff2558e0860315a84758 diff --git a/src/edu/berkeley/sbp/Parser.java b/src/edu/berkeley/sbp/Parser.java index 31bd1b3..0d14563 100644 --- a/src/edu/berkeley/sbp/Parser.java +++ b/src/edu/berkeley/sbp/Parser.java @@ -15,20 +15,35 @@ public abstract class Parser { protected Parser(Table pt) { this.pt = pt; } /** implement this method to create the output forest corresponding to a lone shifted input token */ - public abstract Forest shiftToken(Tok t, Input.Location loc); + public abstract Forest shiftToken(Input.Location oldloc, Tok t, Input.Location newloc); + + public boolean helpgc = true; + + public String toString() { return pt.toString(); } /** parse input, using the table pt to drive the parser */ public Forest parse(Input input) throws IOException, ParseFailed { GSS gss = new GSS(); Input.Location loc = input.getLocation(); - GSS.Phase current = gss.new Phase(null, this, null, input.next(1, 0, 0), loc, null); + GSS.Phase current = gss.new Phase(null, this, null, input.next(), loc, null); current.newNode(null, Forest.leaf(null, null, null), pt.start, true); int count = 1; - for(;;) { + for(int idx=0;;idx++) { + Input.Location oldloc = loc; loc = input.getLocation(); current.reduce(); - Forest forest = current.token==null ? null : shiftToken((Tok)current.token, loc); - GSS.Phase next = gss.new Phase(current, this, current, input.next(count, gss.resets, gss.waits), loc, forest); + Forest forest = current.token==null ? null : shiftToken(oldloc, (Tok)current.token, loc); + GSS.Phase next = gss.new Phase(current, this, current, input.next(), loc, forest); + if (!helpgc) { + FileOutputStream fos = new FileOutputStream("out-"+idx+".dot"); + PrintWriter p = new PrintWriter(new OutputStreamWriter(fos)); + GraphViz gv = new GraphViz(); + for(Object n : next) + ((GSS.Phase.Node)n).toGraphViz(gv); + gv.dump(p); + p.flush(); + p.close(); + } count = next.size(); if (current.isDone()) return (Forest)gss.finalResult; current = next; @@ -40,6 +55,26 @@ public abstract class Parser { /** an SLR(1) parse table which may contain conflicts */ static class Table extends Walk.Cache { + public String toString() { + StringBuffer sb = new StringBuffer(); + sb.append("parse table"); + for(State state : all_states.values()) { + sb.append(" " + state + "\n"); + for(Topology t : state.shifts) { + sb.append(" shift \""+ + new edu.berkeley.sbp.chr.CharTopology((IntegerTopology)t)+"\" => "); + for(State st : state.shifts.getAll(t)) + sb.append(st.idx+" "); + sb.append("\n"); + } + for(Topology t : state.reductions) + sb.append(" reduce \""+ + new edu.berkeley.sbp.chr.CharTopology((IntegerTopology)t)+"\" => " + + state.reductions.getAll(t) + "\n"); + } + return sb.toString(); + } + public final Walk.Cache cache = this; private void walk(Element e, HashSet hs) { @@ -230,6 +265,14 @@ public abstract class Parser { } } + public String toStringx() { + StringBuffer st = new StringBuffer(); + for(Position p : this) { + if (st.length() > 0) st.append("\n"); + st.append(p); + } + return st.toString(); + } public String toString() { StringBuffer ret = new StringBuffer(); ret.append("state["+idx+"]: ");