X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FParser.java;h=95e3ba52a024c8e31223bf4271aee5b55d1450dd;hp=90f86f24c8167983504abc89cc243b5116d48032;hb=c805010980fc22bcd66c1684a772f66563cd6b72;hpb=3885d0596c6f13f432ecd2c46f87d6477cb773b0 diff --git a/src/edu/berkeley/sbp/Parser.java b/src/edu/berkeley/sbp/Parser.java index 90f86f2..95e3ba5 100644 --- a/src/edu/berkeley/sbp/Parser.java +++ b/src/edu/berkeley/sbp/Parser.java @@ -1,200 +1,370 @@ +// Copyright 2006-2007 all rights reserved; see LICENSE file for BSD-style license + package edu.berkeley.sbp; -import edu.berkeley.sbp.*; import edu.berkeley.sbp.util.*; -import edu.berkeley.sbp.*; -import edu.berkeley.sbp.Sequence.Position; -import edu.berkeley.sbp.*; +import edu.berkeley.sbp.Sequence.Pos; +import edu.berkeley.sbp.Sequence.Pos; import java.io.*; import java.util.*; -import java.lang.reflect.*; -/** a parser which translates streams of Tokens of type T into a Forest */ -public abstract class Parser { +/** a parser which translates an Input<Token> into a Forest<NodeType> */ +public abstract class Parser implements Serializable { - private final Table pt; + final Table pt; /** create a parser to parse the grammar with start symbol u */ - protected Parser(Union u) { this.pt = new Table(u, top()); } - protected Parser(Table pt) { this.pt = pt; } - - public abstract Forest shiftedToken(T t, Token.Location loc); - public abstract Topology top(); - - - /** parse input for a exactly one unique result, throwing Ambiguous if not unique or Failed if none */ - public Tree parse1(Token.Stream input) throws IOException, Failed, Ambiguous { - Forest ret = parse(input); - try { return ret.expand1(); } - catch (Ambiguous a) { - System.out.println("while expanding:"); - System.out.println(ret); - throw a; - } - } - - /** parse input, using the table pt to drive the parser */ - public Forest parse(Token.Stream 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)current.finalResult; - current.checkFailure(); - current = next; + public Parser(Union u) { this.pt = new Table(u); } + + /** implement this method to create the output forest corresponding to a lone shifted input token */ + public abstract Forest shiftToken(Token t, Input.Region region); + + public abstract Topology emptyTopology(); + + public String toString() { return pt.toString(); } + + /** parse input, and return the shared packed parse forest (or throw an exception) */ + public Forest parse(Input input) throws IOException, ParseFailed { + long start = System.currentTimeMillis(); + verbose = System.getProperty("sbp.verbose", null) != null; + spinpos = 0; + GSS gss = new GSS(input, this); + int idmax = 0; + int[][] count = new int[1024*1024][]; + HashMap ids = new HashMap(); + try { + for(GSS.Phase current = gss.new Phase(pt.start); ;) { + if (verbose) debug(current.token, gss, input); + if (current.isDone()) return (Forest)current.finalResult; + Input.Region region = current.getLocation().createRegion(current.getNextLocation()); + Forest forest = shiftToken((Token)current.token, region); + /* + int maxid = 0; + for(Reduction r : gss.finishedReductions) + if (ids.get(r.reduction())==null) + ids.put(r.reduction(), idmax++); + count[current.pos] = new int[idmax]; + for(Reduction r : gss.finishedReductions) + count[current.pos][ids.get(r.reduction())]++; + */ + current = gss.new Phase(current, forest); + } + } finally { + if (verbose) { + long time = System.currentTimeMillis() - start; + System.err.println("\r parse time: " + time +"ms "+ ANSI.clreol()); + debug(null, gss, input); + } + /* + PrintWriter pw = new PrintWriter(new OutputStreamWriter(new FileOutputStream("out.plot"))); + boolean[] use = new boolean[idmax]; + for(int i=0; i20) + use[j] = true; + for(int i=0; i=count[i].length ? 0 : count[i][j])); + } + pw.println(); + } + pw.close(); + pw = new PrintWriter(new OutputStreamWriter(new FileOutputStream("test.plot"))); + pw.println("set terminal postscript enhanced color"); + pw.println("set output \"out.ps\""); + pw.println("set pm3d map"); + pw.println("set autoscale"); + pw.println("set view 0,0"); + pw.println("set ytics (\\"); + int q = -1; + for(int j=0; j hs) { - if (e==null) return; - if (hs.contains(e)) return; - hs.add(e); - if (e instanceof Atom) return; - for(Sequence s : (Union)e) { - hs.add(s); - for(Position p = s.firstp(); p != null; p = p.next()) - walk(p.element(), hs); - } - } + class Table implements Serializable { /** the start state */ - public final State start; + final State start; + + /** a dummy state from which no reductions can be performed */ + private final State dead_state; /** used to generate unique values for State.idx */ private int master_state_idx = 0; + /** all the states for this table */ + private transient HashSet> all_states = new HashSet>(); + + /** all the doomed states in this table */ + private transient HashMap,State> doomed_states = new HashMap,State>(); + + /** all the non-doomed states in this table */ + private transient HashMap,State> normal_states = new HashMap,State>(); + /** construct a parse table for the given grammar */ - public Table(Topology top) { this("s", top); } - public Table(String startSymbol, Topology top) { this(new Union(startSymbol), top); } - public Table(Union ux, Topology top) { - Union start0 = new Union("0"); - start0.add(new Sequence.Singleton(ux, null, null)); - - for(Sequence s : start0) cache.eof.put(s, true); - cache.eof.put(start0, true); - - // construct the set of states - HashMap,State> all_states = new HashMap,State>(); - HashSet all_elements = new HashSet(); - walk(start0, all_elements); - for(Element e : all_elements) - cache.ys.put(e, new Walk.YieldSet(e, cache).walk()); - HashSet hp = new HashSet(); - reachable(start0, hp); - this.start = new State(hp, all_states, all_elements); + Table(Union ux) { + Union rootUnion = new Union("0", Sequence.create(ux), true); + Grammar grammar = new Grammar(rootUnion) { + public Topology emptyTopology() { return Parser.this.emptyTopology(); } + }; + + // create the "dead state" + this.dead_state = new State(new HashSet(), true, grammar); + + // construct the start state; this will recursively create *all* the states + this.start = new State(reachable(rootUnion), false, grammar); + buildReductions(grammar); + sortReductions(grammar); + } + + /** fill in the reductions table */ + private void buildReductions(Grammar grammar) { // for each state, fill in the corresponding "row" of the parse table - for(State state : all_states.values()) - for(Position p : state.hs) { - - // the Grammar's designated "last position" is the only accepting state - if (start0.contains(p.owner()) && p.next()==null) - state.accept = true; - - // FIXME: how does right-nullability interact with follow restrictions? - // all right-nullable rules get a reduction [Johnstone 2000] - if (p.isRightNullable(cache)) { - Walk.Follow wf = new Walk.Follow(top.empty(), p.owner(), all_elements, cache); - Reduction red = new Reduction(p); - state.reductions.put(wf.walk(p.owner()), red); - if (wf.includesEof()) state.eofReductions.add(red); - } + for(State state : all_states) + for(Pos p : state.hs) { // if the element following this position is an atom, copy the corresponding // set of rows out of the "master" goto table and into this state's shift table if (p.element() != null && p.element() instanceof Atom) - state.shifts.addAll(state.gotoSetTerminals.subset(((Atom)p.element()))); + state.shifts.addAll(state.gotoSetTerminals.subset(((Atom)p.element()).getTokenTopology())); + + // RNGLR: we can potentially reduce from any "right-nullable" position -- that is, + // any position for which all Elements after it in the Sequence are capable of + // matching the empty string. + if (!grammar.isRightNullable(p)) continue; + Topology follow = grammar.follow(p.owner()); + for(Pos p2 = p; p2 != null && p2.element() != null; p2 = p2.next()) { + if (!(p2.element() instanceof Union)) + throw new Error("impossible -- only Unions can be nullable"); + + // interesting RNGLR-followRestriction interaction: we must intersect + // not just the follow-set of the last non-nullable element, but the + // follow-sets of the nulled elements as well. + for(Sequence s : ((Union)p2.element())) + follow = follow.intersect(grammar.follow(s)); + Topology set = grammar.epsilonFollowSet((Union)p2.element()); + if (set != null) follow = follow.intersect(set); + } + + // indicate that when the next token is in the set "follow", nodes in this + // state should reduce according to Pos "p" + state.reductions.put(follow, p); + if (grammar.followEof.contains(p.owner())) state.eofReductions.add(p); + } + + // optimize the reductions table + if (emptyTopology() instanceof IntegerTopology) + for(State state : all_states) { + // FIXME: this is pretty ugly + state.oreductions = state.reductions.optimize(((IntegerTopology)emptyTopology()).functor()); + state.oshifts = state.shifts.optimize(((IntegerTopology)emptyTopology()).functor()); } } - /** a single state in the LR table and the transitions possible from it */ - public class State implements Comparable, Iterable { - - /* - public boolean isResolvable(Token t) { - boolean found = false; - for(Reduction r : getReductions(t)) { - Position p = r.position; - if (!p.isRightNullable(cache)) continue; - if (p.owner().firstp()==p) continue; - if (found) { - // found two items meeting criteria #1 - return false; - } else { - found = true; - continue; + // FIXME: this method needs to be cleaned up and documented + private void sortReductions(Grammar grammar) { + // crude algorithm to assing an ordinal ordering to every position + // al will be sorted in DECREASING order (al[0] >= al[1]) + ArrayList al = new ArrayList(); + for(State s : all_states) { + for(Object po : s.positions()) { + Sequence.Pos p = (Sequence.Pos)po; + if (al.contains(p)) continue; + int i=0; + for(; i 0) { + Sequence.Pos p = al.remove(j); + al.add(i, p); + continue OUTER; + } + break; + } + + int j = 1; + int pk = 0; + for(int i=0; i 0) + { inc = true; break; } + } + inc = true; + if (inc) { + j++; + pk = i; + } + al.get(i).ord = j; + } + } + /** + * A single state in the LR table and the transitions + * possible from it + * + * A state corresponds to a set of Sequence.Pos's. Each + * Node in the GSS has a State; the Node represents a set of + * possible parses, one for each Pos in the State. + * + * Every state is either "doomed" or "normal". If a Pos + * is part of a Sequence which is a conjunct (that is, it was + * passed to Sequence.{and(),andnot()}), then that Pos + * will appear only in doomed States. Furthermore, any set + * of Positions reachable from a doomed State also forms a + * doomed State. Note that in this latter case, a doomed + * state might have exactly the same set of Positions as a + * non-doomed state. + * + * Nodes with non-doomed states represent nodes which + * contribute to actual valid parses. Nodes with doomed + * States exist for no other purpose than to enable/disable + * some future reduction from a non-doomed Node. Because of + * this, we "garbage-collect" Nodes with doomed states if + * there are no more non-doomed Nodes which they could + * affect (see Result, Reduction, and Node for details). + * + * Without this optimization, many seemingly-innocuous uses + * of positive and negative conjuncts can trigger O(n^2) + * space+time complexity in otherwise simple grammars. There + * is an example of this in the regression suite. + */ + class State implements IntegerMappable, Serializable { + public final int idx = master_state_idx++; - private final HashSet hs; + private final transient HashSet hs; + public HashSet> conjunctStates = new HashSet>(); - private transient HashMap gotoSetNonTerminals = new HashMap(); - private transient TopologicalBag gotoSetTerminals = new TopologicalBag(); + HashMap> gotoSetNonTerminals = new HashMap>(); + private transient TopologicalBag> gotoSetTerminals = new TopologicalBag>(); - private TopologicalBag reductions = new TopologicalBag(); - private HashSet eofReductions = new HashSet(); - private TopologicalBag shifts = new TopologicalBag(); - private boolean accept = false; + TopologicalBag reductions = new TopologicalBag(); + HashSet eofReductions = new HashSet(); + private TopologicalBag> shifts = new TopologicalBag>(); + private boolean accept = false; + + private VisitableMap> oshifts = null; + private VisitableMap oreductions = null; + public final boolean doomed; // Interface Methods ////////////////////////////////////////////////////////////////////////////// - public boolean canShift(Token t) { return shifts.contains(t); } - public Iterable getShifts(Token t) { return shifts.get(t); } - public boolean isAccepting() { return accept; } - public Iterable getReductions(Token t) { return t==null ? eofReductions : reductions.get(t); } - public Iterable getEofReductions() { return eofReductions; } - public Iterator iterator() { return hs.iterator(); } + public boolean doomed() { return doomed; } + boolean isAccepting() { return accept; } + + Iterable positions() { return hs; } + + boolean canShift(Token t) { return oshifts!=null && oshifts.contains(t); } + void invokeShifts(Token t, GSS.Phase phase, Node pred, Forest f) { oshifts.invoke(t, phase, pred, f); } + boolean canReduce(Token t) { + return oreductions != null && (t==null ? eofReductions.size()>0 : oreductions.contains(t)); } + void invokeEpsilonReductions(Token t, Node node) { + if (t==null) for(Pos r : eofReductions) node.invoke(r, null, null); + else oreductions.invoke(t, node, null, null); + } + void invokeReductions(Token t, Node node, Result b) { + if (t==null) for(Pos r : eofReductions) node.invoke(r, b, null); + else oreductions.invoke(t, node, b, null); + } // Constructor ////////////////////////////////////////////////////////////////////////////// /** - * create a new state consisting of all the Positions in hs - * @param hs the set of Positions comprising this State - * @param all_states the set of states already constructed (to avoid recreating states) - * @param all_elements the set of all elements (Atom instances need not be included) + * create a new state consisting of all the Poss in hs + * @param hs the set of Poss comprising this State + * @param all the set of all elements (Atom instances need not be included) * * In principle these two steps could be merged, but they * are written separately to highlight these two facts: @@ -212,160 +382,130 @@ public abstract class Parser { * for non-Atom Elements. * */ - public State(HashSet hs, - HashMap,State> all_states, - HashSet all_elements) { + public State(HashSet hs, boolean doomed, Grammar grammar) { this.hs = hs; + this.doomed = doomed; + + // register ourselves so that no two states are ever + // created with an identical position set (termination depends on this) + ((HashMap)(doomed ? doomed_states : normal_states)).put(hs, this); + ((HashSet)all_states).add(this); + + for(Pos p : hs) { + // Step 1a: take note if we are an accepting state + // (last position of the root Union's sequence) + if (p.next()==null && !doomed && grammar.rootUnion.contains(p.owner())) + accept = true; + + // Step 1b: If any Pos in the set is the first position of its sequence, then this + // state is responsible for spawning the "doomed" states for each of the + // Sequence's conjuncts. This obligation is recorded by adding the to-be-spawned + // states to conjunctStates. + if (!p.isFirst()) continue; + for(Sequence s : p.owner().needs()) + if (!hs.contains(s.firstp())) + conjunctStates.add(mkstate(reachable(s.firstp()), true, grammar)); + for(Sequence s : p.owner().hates()) + if (!hs.contains(s.firstp())) + conjunctStates.add(mkstate(reachable(s.firstp()), true, grammar)); + } - // register ourselves in the all_states hash so that no - // two states are ever created with an identical position set - all_states.put(hs, this); - - // Step 1a: examine all Position's in this state and compute the mappings from + // Step 2a: examine all Pos's in this state and compute the mappings from // sets of follow tokens (tokens which could follow this position) to sets // of _new_ positions (positions after shifting). These mappings are // collectively known as the _closure_ - TopologicalBag bag0 = new TopologicalBag(); - for(Position position : hs) { + TopologicalBag bag0 = new TopologicalBag(); + for(Pos position : hs) { if (position.isLast() || !(position.element() instanceof Atom)) continue; Atom a = (Atom)position.element(); - HashSet hp = new HashSet(); + HashSet hp = new HashSet(); reachable(position.next(), hp); - bag0.addAll(a, hp); + bag0.addAll(a.getTokenTopology(), hp); } - // Step 1b: for each _minimal, contiguous_ set of characters having an identical next-position + // Step 2b: for each _minimal, contiguous_ set of characters having an identical next-position // set, add that character set to the goto table (with the State corresponding to the // computed next-position set). for(Topology r : bag0) { - HashSet h = new HashSet(); - for(Position p : bag0.getAll(r)) h.add(p); - gotoSetTerminals.put(r, all_states.get(h) == null ? new State(h, all_states, all_elements) : all_states.get(h)); + HashSet h = new HashSet(); + for(Pos p : bag0.getAll(r)) h.add(p); + ((TopologicalBag)gotoSetTerminals).put(r, mkstate(h, doomed, grammar)); } - // Step 2: for every non-Atom element (ie every Element which has a corresponding reduction), - // compute the closure over every position in this set which is followed by a symbol - // which could yield the Element in question. + // Step 3: for every Sequence, compute the closure over every position in this set which + // is followed by a symbol which could yield the Sequence. // // "yields" [in one or more step] is used instead of "produces" [in exactly one step] // to avoid having to iteratively construct our set of States as shown in most // expositions of the algorithm (ie "keep doing XYZ until things stop changing"). - /* - for(Element e : all_elements) { - if (e instanceof Atom) continue; - HashSet h = new Walk.Closure(null, g.cache).closure(e, hs); - State s = all_states.get(h) == null ? new State(h, all_states, all_elements) : all_states.get(h); - if (gotoSetNonTerminals.get(e) != null) - throw new Error("this should not happen"); - gotoSetNonTerminals.put(e, s); - } - */ - HashMapBag move = new HashMapBag(); - for(Position p : hs) { - Element e = p.element(); - if (e==null) continue; - HashSet ys = cache.ys.get(e); - if (ys != null) { - for(Element y : ys) { - HashSet hp = new HashSet(); + + HashMapBag move = new HashMapBag(); + for(Pos p : hs) + if (!p.isLast() && p.element() instanceof Union) + for(Sequence s : ((Union)p.element())) { + HashSet hp = new HashSet(); reachable(p.next(), hp); - move.addAll(y, hp); + move.addAll(s, hp); } - } + OUTER: for(Sequence y : move) { + // if a reduction is "lame", it should wind up in the dead_state after reducing + HashSet h = move.getAll(y); + State s = mkstate(h, doomed, grammar); + for(Pos p : hs) + if (p.element() != null && (p.element() instanceof Union)) + for(Sequence seq : ((Union)p.element())) + if (seq.needs.contains(y) || seq.hates.contains(y)) { + // FIXME: assumption that no sequence is ever both usefully (non-lamely) matched + // and also directly lamely matched + for(Pos pp = y.firstp(); pp != null; pp = pp.next()) + ((HashMap)gotoSetNonTerminals).put(pp, dead_state); + continue OUTER; + } + for(Pos pp = y.firstp(); pp != null; pp = pp.next()) + gotoSetNonTerminals.put(pp, s); } - for(Element y : move) { - HashSet h = move.getAll(y); - State s = all_states.get(h) == null ? new State(h, all_states, all_elements) : all_states.get(h); - gotoSetNonTerminals.put(y, s); - } - } - - public String toString() { return "state["+idx+"]"; } - - public int compareTo(Table.State s) { return idx==s.idx ? 0 : idx < s.idx ? -1 : 1; } - } - - /** - * the information needed to perform a reduction; copied here to - * avoid keeping references to Element objects in a Table - */ - public class Reduction { - // FIXME: cleanup; almost everything in here could go in either Sequence.Position.getRewrite() or else in GSS.Reduct - public final int numPop; - /*private*/ final Position position; - private final Forest[] holder; // to avoid constant reallocation - public int hashCode() { return position.hashCode(); } - public boolean equals(Object o) { - if (o==null) return false; - if (o==this) return true; - if (!(o instanceof Reduction)) return false; - Reduction r = (Reduction)o; - return r.position == position; } - public Reduction(Position p) { - this.position = p; - this.numPop = p.pos; - this.holder = new Forest[numPop]; - } - public String toString() { return "[reduce " + position + "]"; } - public Forest reduce(GSS.Phase.Node parent, GSS.Phase.Node onlychild, Forest rex) { - Forest ret = reduce(parent, numPop-1, rex, onlychild, parent.phase()); + private State mkstate(HashSet h, boolean b, Grammar grammar) { + State ret = (b?doomed_states:normal_states).get(h); + if (ret==null) ret = new State(h,b, grammar); return ret; } - private Forest zero = null; - public Forest zero() { - if (zero != null) return zero; - if (numPop > 0) throw new Error(); - return zero = position.rewrite(null); - } - - // FIXME: this could be more elegant and/or cleaner and/or somewhere else - private Forest reduce(GSS.Phase.Node parent, int pos, Forest rex, GSS.Phase.Node onlychild, GSS.Phase target) { - if (pos>=0) holder[pos] = parent.pending(); - if (pos==0) { - if (rex==null) { - System.arraycopy(holder, 0, position.holder, 0, holder.length); - rex = position.rewrite(target.getLocation()); - } - if (onlychild != null) - reduce(onlychild, pos-1, rex, null, target); - else - for(GSS.Phase.Node child : parent.parents()) - reduce(child, pos-1, rex, null, target); - } else if (pos>0) { - if (onlychild != null) - reduce(onlychild, pos-1, rex, null, target); - else - for(GSS.Phase.Node child : parent.parents()) - reduce(child, pos-1, rex, null, target); - } else { - State state = parent.state.gotoSetNonTerminals.get(position.owner()); - if (state!=null) - target.newNode(parent, rex, state, numPop<=0, parent.phase()); - } - return rex; + public int toInt() { return idx; } + public String toString() { + StringBuffer ret = new StringBuffer(); + for(Pos p : hs) + ret.append(p+"\n"); + return ret.toString(); } } - } - - private static final Forest[] emptyForestArray = new Forest[0]; + } // Helpers ////////////////////////////////////////////////////////////////////////////// - - private static void reachable(Element e, HashSet h) { + + private static HashSet reachable(Element e) { + HashSet h = new HashSet(); + reachable(e, h); + return h; + } + private static void reachable(Element e, HashSet h) { if (e instanceof Atom) return; for(Sequence s : ((Union)e)) reachable(s.firstp(), h); } - private static void reachable(Position p, HashSet h) { + private static void reachable(Pos p, HashSet h) { if (h.contains(p)) return; h.add(p); if (p.element() != null) reachable(p.element(), h); } + private static HashSet reachable(Pos p) { + HashSet ret = new HashSet(); + reachable(p, ret); + return ret; + } }