X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FGSS.java;h=f222fe568d8e4914540399674279d6e1bd1ac144;hp=5feba84a0b935984625efaed044aa75b6b5b4129;hb=fc8cad4de7decd07e23f26ccfadb5e6d1ce291d5;hpb=1b46ed935f0fb6fb18afd40f5d1771be030a5a0d diff --git a/src/edu/berkeley/sbp/GSS.java b/src/edu/berkeley/sbp/GSS.java index 5feba84..f222fe5 100644 --- a/src/edu/berkeley/sbp/GSS.java +++ b/src/edu/berkeley/sbp/GSS.java @@ -1,9 +1,10 @@ +// Copyright 2006 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.Parser.Table.*; import edu.berkeley.sbp.Sequence.Position; -import edu.berkeley.sbp.Parser.Table.State; -import edu.berkeley.sbp.Parser.Table.Reduction; import java.io.*; import java.util.*; import java.lang.reflect.*; @@ -11,69 +12,107 @@ import java.lang.reflect.*; /** implements Tomita's Graph Structured Stack */ class GSS { - public GSS() { } + Input input; + public GSS(Input input) { this.input = input; } + public Input getInput() { return input; } - private Phase.Node[] reducing_list = null; - public int resets = 0; - public int waits = 0; + // FIXME: right now, these are the performance bottleneck + HashMapBag performed = new HashMapBag(); - HashMapBag inhibited = new HashMapBag(); - HashMapBag waiting = new HashMapBag(); - HashMapBag performed = new HashMapBag(); - /** FIXME */ - public Forest.Ref finalResult; + Forest.Many finalResult; /** corresponds to a positions between tokens the input stream; same as Tomita's U_i's */ - public class Phase implements Invokable, IntegerMappable { + class Phase implements Invokable, IntegerMappable, GraphViz.ToGraphViz, Iterable { - /** the token immediately after this phase */ - final Token token; + public PriorityQueue reductionQueue = new PriorityQueue(); + + public void invoke(State st, Result result, Object o) { + //shifts++; + good |= next.newNode(result, st, false); + } - private final int pos; + /** the token immediately after this phase */ + final Tok token; + final int pos; - boolean reducing; - private IntPairMap hash; /* ALLOC */ - private boolean closed; + public IntPairMap hash; /* ALLOC */ private boolean good; private Phase next = null; private Phase prev; - private Token.Location location; - public final Parser parser; - + private Input.Location location; + private Input.Location nextLocation; + private Input.Location prevLocation; + private Forest forest; - public Phase(Phase prev, Parser parser, Phase previous, Token token, Token.Location location, Forest forest) { + public Phase(Phase prev, Phase previous, Tok token, Input.Location location, + Input.Location nextLocation, Forest forest) throws ParseFailed { + this.prevLocation = prev==null ? location : prev.getLocation(); this.prev = prev; this.forest = forest; - this.parser = parser; this.pos = previous==null ? 0 : previous.pos+1; this.token = token; this.location = location; - inhibited.clear(); - reset(); - } - - public void reset() { - waiting.clear(); + this.nextLocation = nextLocation; performed.clear(); - hash = new IntPairMap(); + hash = new IntPairMap(); good = false; - closed = false; - reducing = false; 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) - throw new ParseFailed(ParseFailed.error(ANSI.red("unexpected end of file\n"), token, hash.values()), getLocation()); + ParseFailed.error("unexpected end of file", this); return true; } - public Token.Location getLocation() { return location; } + public Input.Location getPrevLocation() { return prevLocation; } + public Input.Location getLocation() { return location; } + public Input.Region getRegion() { return getPrevLocation().createRegion(getLocation()); } + public Input.Location getNextLocation() { return nextLocation; } + + /** perform all shift operations, adding promoted nodes to next */ + public void shift(Phase next, Forest result) throws ParseFailed { + // this massively improves GC performance + if (prev!=null) prev.hash = null; + this.next = next; + for(Node n : hash.values()) { + if (token == null && n.state().isAccepting()) { + if (finalResult==null) finalResult = new Forest.Many(); + for(Result r : n) + finalResult.merge(r.getForest()); + } + if (token == null) continue; + n.state().invokeShifts(token, this, new Result(result, n, null), null); + } + if (!good && token!=null) ParseFailed.error("unexpected character", this); + if (token==null && finalResult==null) ParseFailed.error("unexpected end of file", this); + } + + /** perform all reduction operations */ + public void reduce() throws ParseFailed { + while(!reductionQueue.isEmpty()) + reductionQueue.poll().perform(); + } + + public void newNodeFromReduction(Result result, State state, boolean fromEmptyReduction, Position reduction) { + int pos = result.phase().pos; + Sequence owner = reduction.owner(); + for(Sequence s : owner.hates) + if (performed.contains(pos, s)) + return; + for(Sequence s : owner.needs) + if (!performed.contains(pos, s)) + return; + if (owner.needed_or_hated && !performed.contains(pos, owner)) + performed.add(pos, owner); + if (state!=null) + newNode(result, state, fromEmptyReduction); + } /** add a new node (merging with existing nodes if possible) * @param parent the parent of the new node @@ -82,249 +121,39 @@ class GSS { * @param fromEmptyReduction true iff this node is being created as a result of a reduction of length zero (see GRMLR paper) * @param start the earliest part of the input contributing to this node (used to make merging decisions) */ - public boolean newNode(Node parent, Forest pending, State state, boolean fromEmptyReduction) { - Node p = hash.get(state, parent==null?null:parent.phase()); - if (p != null) return newNode2(p, parent, pending, state, fromEmptyReduction); - else return newNode3(parent, pending, state, fromEmptyReduction); - } - public void newNode(Node parent, Forest pending, State state, boolean fromEmptyReduction, Reduction reduction) { - int pos = parent==null?0:parent.phase()==null?0:parent.phase().pos; - Sequence owner = reduction==null ? null : reduction.position.owner(); - if (reduction!=null) { - if (inhibited.contains(pos, owner)) return; - if (owner.needs != null) - for(Sequence s : owner.needs) - if (!performed.contains(pos, s)) { - waiting.add(s, new Waiting(parent, pending, state, fromEmptyReduction, reduction)); - return; - } - if ((owner.needed != null && owner.needed.size()>0) || - (owner.hated != null && owner.hated.size()>0) || - (owner.hates != null && owner.hates.size()>0)) - performed.add(pos, owner); - } - if (!owner.lame) - newNode(parent, pending, state, fromEmptyReduction); - if (reduction!=null) inhibit(reduction, parent==null?0:parent.phase().pos); - if (reduction != null) { - boolean redo = true; - while(redo) { - redo = false; - for(Waiting w : waiting.getAll(owner)) { - if (w.parent==parent || (parent!=null&&w.parent!=null&&w.parent.phase()==parent.phase())) { - waiting.remove(owner, w); - w.perform(); - redo = true; - break; - } - } - } - } - } - private boolean newNode2(Node p, Node parent, Forest pending, State state, boolean fromEmptyReduction) { - p.holder.merge(pending); - if (p.parents().contains(parent)) return true; - p.parents().add(parent, true); - if (p!=parent && !fromEmptyReduction && reducing) p.performReductions(parent); - return true; - } - private boolean newNode3(Node parent, Forest pending, State state, boolean fromEmptyReduction) { + public boolean newNode(Result result, State state, boolean fromEmptyReduction) { + Node p = hash.get(state, result.phase()); + if (p != null) { p.merge(result); return true; } do { if (token != null && state.canShift(token)) break; if (state.isAccepting()) break; if (token==null) break; if (!state.canReduce(token)) return false; - //if (count > 1) break; - //if (r.numPop == 0) break; - //r.reduce(pending, parent, null, Phase.this, null); - //return; } while(false); - - Node n = new Node(parent, pending, state); // ALLOC - if (reducing) { - n.performEmptyReductions(); - if (!fromEmptyReduction) n.performReductions(parent); - } + new Node(Phase.this, result, state, fromEmptyReduction); // ALLOC return true; } - public void uninhibit(int p, Sequence s) { - if (s.hated!=null) - for(Sequence s2 : s.hated) - inhibited.remove(p, s2); - } - - public void inhibit(Reduction r, int p) { - if (r.position.owner().hated == null) return; - // remember that dead states are still allowed to shift -- just not allowed to reduce - boolean reset = false; - for(Sequence seq : r.position.owner().hated) { - if (performed.contains(p,seq)) { - uninhibit(p, seq); - //System.out.println("\nresetting due to " + r.position.owner() + " killing " + seq); - //inhibited.clear(); - inhibited.add(p, seq); - //inhibited = new HashMapBag(); - reset = true; - resets++; - throw new Reset(); - } - inhibited.add(p, seq); - } - } - - /** perform all reduction operations */ - public void reduce() { - try { - reducing = true; - if (reducing_list==null || reducing_list.length < hash.size()) - reducing_list = new Phase.Node[hash.size() * 4]; - hash.toArray(reducing_list); - int num = hash.size(); - for(int i=0; inext */ - public void shift(Phase next, Forest result) throws ParseFailed { - // this massively improves GC performance - if (prev!=null) prev.hash = null; - this.next = next; - closed = true; - Forest res = null; - boolean ok = false; - for(Phase.Node n : hash.values()) { - if (token == null && n.state.isAccepting()) { - if (finalResult==null) finalResult = new Forest.Ref(); - finalResult.merge(n.holder); - } - if (token == null) continue; - n.state.invokeShifts(token, this, result, n); - } - - if (!good && token!=null) - throw new ParseFailed(ParseFailed.error(ANSI.red("unexpected character")+" "+ANSI.purple(token)+" encountered at "+ANSI.green(getLocation())+"\n", token, hash.values()), - getLocation()); - if (token==null && finalResult==null) - throw new ParseFailed(ParseFailed.error(ANSI.red("unexpected end of file\n"), token, hash.values()), - getLocation()); - } - - - public class Waiting { - Node parent; - Forest pending; - State state; - boolean fromEmptyReduction; - Reduction reduction; - public Waiting(Node parent, Forest pending, State state, boolean fromEmptyReduction, Reduction reduction) { - waits++; - this.parent = parent; - this.pending = pending; - this.state = state; - this.fromEmptyReduction = fromEmptyReduction; - this.reduction = reduction; - } - public void perform() { - //System.out.println("performing: " + reduction.position); - newNode(parent, pending, state, fromEmptyReduction, reduction); - } - } - - // Node ///////////////////////////////////////////////////////////////////////////////// - - /** a node in the GSS */ - public final class Node extends FastSet implements Invokable { - - private Forest.Ref holder = null; - private boolean allqueued = false; - - /** what state this node is in */ - public final State state; - - /** which Phase this Node belongs to (node that Node is also a non-static inner class of Phase) */ - public Phase phase() { return Phase.this; } - public Forest.Ref holder() { return holder==null ? (holder = new Forest.Ref()) : holder; } - public Forest pending() { return Phase.this.closed ? holder().resolve() : holder; } - public FastSet parents() { return this; } - - public void performReductions() { - if (allqueued) return; - allqueued = true; - state.invokeReductions(token, this, this, null); - } - - public void performReductions(Node n2) { - if (!allqueued) performReductions(); - else state.invokeReductions(token, this, this, n2); - } - - public final void invoke(Reduction r, Node n, Node n2) { - if (n==null || n2==null || r.position.pos==0) { - if (r.position.pos==0) { - if (n==null) n = this; - else return; - } - if (n==null) return; - Forest[] holder = new Forest[r.position.pos]; - if (r.position.pos==0) n.finish(r, r.zero(), n.phase(), holder); - else r.reduce(n, r.position.pos-1, n.phase(), holder); - } else { - Forest[] holder = new Forest[r.position.pos]; - if (r.position.pos<=0) throw new Error("called wrong form of reduce()"); - int pos = r.position.pos-1; - Forest old = holder[pos]; - holder[pos] = n.pending(); - if (pos==0) { - System.arraycopy(holder, 0, r.position.holder, 0, holder.length); - Forest rex = r.position.rewrite(n.phase().getLocation()); - n2.finish(r, rex, n.phase(), holder); - } else { - r.reduce(n2, pos-1, n.phase(), holder); - } - holder[pos] = old; - } - } - - public void finish(Reduction r, Forest result, GSS.Phase target, Forest[] holder) { - State state0 = state.gotoSetNonTerminals.get(r.position.owner()); - if (result==null) throw new Error(); - if (state0!=null) - target.newNode(this, result, state0, r.position.pos<=0, r); - } - - public void performEmptyReductions() { state.invokeReductions(token, this, null, null); } - - private Node(Node parent, Forest pending, State state) { - this.state = state; - this.holder().merge(pending); - Phase start = parent==null ? null : parent.phase(); - if (parent != null) parents().add(parent, true); - if (Phase.this.hash.get(state, start) != null) throw new Error("severe problem!"); - Phase.this.hash.put(state, start, this); - } - } - public int toInt() { return pos+1; } public int size() { return hash==null ? 0 : hash.size(); } + public int pos() { return pos; } + public Tok getToken() { return token; } + public Iterator iterator() { return hash.iterator(); } + public GSS getGSS() { return GSS.this; } + + // GraphViz ////////////////////////////////////////////////////////////////////////////// + + public GraphViz.Node toGraphViz(GraphViz gv) { + if (gv.hasNode(this)) return gv.createNode(this); + GraphViz.Group g = gv.createGroup(this); + g.label = "Phase " + pos; + g.color = "gray"; + g.cluster = true; + return g; + } + public boolean isTransparent() { return false; } + public boolean isHidden() { return false; } + } }