import java.lang.reflect.*;
/** implements Tomita's Graph Structured Stack */
-class GSS {
+public class GSS {
public static int count = 0;
+ public static int shifts = 0;
+ public static int reductions = 0;
+
public GSS() { }
private Phase.Node[] reducing_list = null;
public int resets = 0;
public int waits = 0;
- HashMapBag<Integer,Sequence> inhibited = new HashMapBag<Integer,Sequence>();
- HashMapBag<Integer,Sequence> expectedInhibit = new HashMapBag<Integer,Sequence>();
+ // FIXME: right now, these are the performance bottleneck
HashMapBag<Sequence,Phase.Waiting> waiting = new HashMapBag<Sequence,Phase.Waiting>();
HashMapBag<Integer,Sequence> performed = new HashMapBag<Integer,Sequence>();
HashMapBag<Integer,Sequence> lastperformed = new HashMapBag<Integer,Sequence>();
+ HashMapBag<Integer,Sequence> expected = new HashMapBag<Integer,Sequence>();
/** FIXME */
public Forest.Ref finalResult;
/** corresponds to a positions <i>between tokens</i> the input stream; same as Tomita's U_i's */
- class Phase<Tok> implements Invokable<State, Forest, Phase<Tok>.Node>, IntegerMappable {
+ class Phase<Tok> implements Invokable<State, Forest, Phase<Tok>.Node>, IntegerMappable, GraphViz.ToGraphViz, Iterable<Phase.Node> {
+ public Iterator<Phase.Node> iterator() { return hash.iterator(); }
public void invoke(State st, Forest result, Node n) {
+ shifts++;
good |= next.newNode(n, result, st, false);
}
boolean reducing;
private IntPairMap<Phase.Node> hash; /* ALLOC */
- private IntPairMap<Forest> singularReductions; /* ALLOC */
private boolean closed;
private boolean good;
private Phase next = null;
this.pos = previous==null ? 0 : previous.pos+1;
this.token = token;
this.location = location;
- inhibited.clear();
+ performed.clear();
reset();
}
public void reset() throws ParseFailed {
waiting.clear();
+ expected.clear();
lastperformed.clear();
lastperformed.addAll(performed);
performed.clear();
hash = new IntPairMap<Phase.Node>();
- singularReductions = new IntPairMap<Forest>();
- expectedInhibit.clear();
- expectedInhibit.addAll(inhibited);
reset = false;
good = false;
closed = false;
Sequence owner = reduction==null ? null : reduction.owner();
if (reduction!=null) {
if (owner.hates!=null) {
- for (Sequence s : lastperformed.getAll(pos))
- if (owner.hates.contains(s))
- return;
for (Sequence s : performed.getAll(pos))
if (owner.hates.contains(s))
return;
+ for (Sequence s : lastperformed.getAll(pos))
+ if (owner.hates.contains(s)) {
+ //System.out.println("now expecting ["+pos+"] => " + s);
+ expected.add(pos, s);
+ return;
+ }
}
- 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))
+ if (!performed.contains(pos, owner)) {
performed.add(pos, owner);
- */
+ if (owner.hated != null)
+ for(Sequence seq : owner.hated)
+ if (performed.contains(pos, seq)) {
+ performed.remove(pos, seq);
+ reset = true;
+ }
+ }
}
- if (reduction!=null) uninhibit(reduction, parent==null?0:parent.phase().pos);
if (!owner.lame)
newNode(parent, pending, state, fromEmptyReduction);
if (reduction != null) {
}
}
}
+
private boolean newNode2(Node p, Node parent, Forest pending, State state, boolean fromEmptyReduction) {
- p.holder.merge(pending);
- if (p.parents().contains(parent)) return true;
+ if (p.merge(parent, pending)) 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) {
do {
if (token != null && state.canShift(token)) break;
return true;
}
- public void inhibit(int p, Sequence s) {
- //if (inhibited.contains(p, s)) return;
- if (performed.contains(p, s)) throw new Reset();
- /*
- if (s.hated!=null)
- for(Sequence s2 : s.hated)
- uninhibit(p, s2);
- */
- if (s.needed!=null)
- for(Sequence s2 : s.needed)
- if (performed.contains(p, s2))
- throw new Reset();
- if (performed.contains(p, s)) throw new Reset();
- }
-
- public void uninhibit(Position r, int p) { uninhibit(p, r.owner()); }
- public void uninhibit(int p, Sequence s) {
- if (performed.contains(p, s)) return;
- performed.add(p, s);
- if (s.hated != null)
- for(Sequence seq : s.hated)
- inhibit(p, seq);
- }
-
/** perform all reduction operations */
public void reduce() throws ParseFailed {
try {
reducing_list[i] = null;
n.performReductions();
}
- /*
- if (expectedInhibit.size() > 0) {
- System.out.println("\n!!!!");
- for(int i : expectedInhibit)
- for(Sequence es : expectedInhibit.getAll(i))
- System.out.println(" " + i + ": " + es);
- System.out.println("");
- inhibited.removeAll(expectedInhibit);
- throw new Reset();
- }
- */
if (reset) {
reset = false;
resets++;
throw new Reset();
}
+ for(int i : expected)
+ for(Sequence s : expected.getAll(i))
+ if (!performed.contains(i, s)) {
+ //System.out.println("resetting due to pos="+i+": " + s + " " + System.identityHashCode(s));
+ resets++;
+ throw new Reset();
+ }
} catch (Reset r) {
reset();
reduce();
/** perform all shift operations, adding promoted nodes to <tt>next</tt> */
public void shift(Phase next, Forest result) throws ParseFailed {
// this massively improves GC performance
- if (prev!=null) {
+ if (prev!=null && parser.helpgc) {
prev.hash = null;
- prev.singularReductions = null;
}
this.next = next;
closed = true;
for(Phase.Node n : hash.values()) {
if (token == null && n.state.isAccepting()) {
if (finalResult==null) finalResult = new Forest.Ref();
- finalResult.merge(n.holder);
+ for(Object f : n.results())
+ finalResult.merge((Forest)f);
}
if (token == null) continue;
n.state.invokeShifts(token, this, result, n);
// Node /////////////////////////////////////////////////////////////////////////////////
/** a node in the GSS */
- final class Node extends FastSet<Node> implements Invokable<Position, Node, Node>, IntegerMappable {
+ final class Node implements Invokable<Position, Node, Node>, IntegerMappable, GraphViz.ToGraphViz {
+ public FastSet<Node> set = new FastSet<Node>();
- private Forest.Ref holder = null;
+
private boolean allqueued = false;
/** what state this node is in */
/** 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<Node> parents() { return this; }
+
+ private HashSet<Forest.Ref> resultMap = new HashSet<Forest.Ref>();
+ public Iterable<Forest.Ref> results() { return resultMap; }
+ public FastSet<Node> parents() { return set; }
+ public boolean merge(Node parent, Forest result) {
+ // FIXME: inefficient!
+ for(Forest.Ref f : results()) {
+ if (f.parents.contains(parent) /* UGLY: */ && f.parents.size()==1) {
+ f.merge(result);
+ return true;
+ }
+ }
+ Forest.Ref f = new Forest.Ref();
+ f.parents.add(parent);
+ f.merge(result);
+ resultMap.add(f);
+ set.add(parent, true);
+ return false;
+ }
public void performReductions() {
if (allqueued) return;
public void performEmptyReductions() { state.invokeReductions(token, this, null, null); }
public final void invoke(Position r, Node n, Node n2) {
+ reductions++;
if (n==null || n2==null || r.pos==0) {
if (r.pos==0) {
if (n==null) n = this;
}
if (n==null) return;
Forest[] holder = new Forest[r.pos];
- if (r.pos==0) n.finish(r, r.zero(), n.phase(), holder);
- else n.reduce(r, r.pos-1, n.phase(), holder);
+ if (r.pos==0) n.finish(r, r.zero(), n.phase());
+ else n.reduce(r, r.pos-1, n.phase(), null);
} else {
- Forest[] holder = new Forest[r.pos];
if (r.pos<=0) throw new Error("called wrong form of reduce()");
int pos = r.pos-1;
- n.reduce(r, pos, n.phase(), holder, n2);
+ n.reduce(r, pos, n.phase(), n2);
}
}
- public void reduce(Position r, int pos, Phase target, Forest[] holder) { reduce(r, pos, target, holder, null); }
- public void reduce(Position r, int pos, Phase target, Forest[] holder, Node only) {
+ public void reduce(Position r, int pos, Phase target, Node only) {
+ Forest[] holder = r.holder;
Forest old = holder[pos];
- holder[pos] = this.pending();
- if (pos==0) {
- System.arraycopy(holder, 0, r.holder, 0, holder.length);
- for(int i=0; i<r.pos; i++) if (r.holder[i]==null) throw new Error("realbad");
- Forest rex = null;
-
- // FIXME: I'm unsure about this -- basically we want to deal with the case where
- // there are two nodes, each of whose Ref points to the same Forest instance.
- // Some node in the next phase has both of these as parents. This might happen
- // since the same reduction can appear in more than one state.
- if (r.pos==1) rex = singularReductions.get(this.pending(), r);
- if (rex==null) {
- rex = r.rewrite(phase().getLocation());
- if (r.pos==1) singularReductions.put(this.pending(), r, rex);
+
+ for(Forest result : results())
+ for(Node child : ((Forest.Ref<?>)result).parents) {
+ if (only != null && child!=only) continue;
+ holder[pos] = result;
+ if (pos==0) child.finish(r, r.rewrite(phase().getLocation()), target);
+ else child.reduce(r, pos-1, target, null);
}
- if (only != null) only.finish(r, rex, target, holder);
- else for(Node child : this.parents()) child.finish(r, rex, target, holder);
- } else {
- if (only != null) only.reduce(r, pos-1, target, holder);
- else for(Node child : this.parents()) child.reduce(r, pos-1, target, holder);
- }
+
holder[pos] = old;
}
- public void finish(Position r, Forest result, Phase<Tok> target, Forest[] holder) {
+ public void finish(Position r, Forest result, Phase<Tok> target) {
Parser.Table<Tok>.State<Tok> state0 = state.gotoSetNonTerminals.get(r.owner());
if (result==null) throw new Error();
if (state0!=null)
private Node(Node parent, Forest pending, State state) {
this.state = state;
- this.holder().merge(pending);
+ this.merge(parent, 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!");
}
public int toInt() { return idx; }
private final int idx = node_idx++;
+
+ // GraphViz //////////////////////////////////////////////////////////////////////////////
+
+ public GraphViz.Node toGraphViz(GraphViz gv) {
+ if (gv.hasNode(this)) return gv.createNode(this);
+ GraphViz.Node n = gv.createNode(this);
+ n.label = ""+state.toStringx();
+ n.shape = "rectangle";
+ n.fill = "green";
+ for(Forest result : results()) n.edge(result, "");
+ for(Node parent : parents()) n.edge(parent, "");
+ ((GraphViz.Group)phase().toGraphViz(gv)).add(n);
+ return n;
+ }
+ public boolean isTransparent() { return false; }
+ public boolean isHidden() { return false; }
+
}
private int node_idx = 0;
public int toInt() { return pos+1; }
public int size() { return hash==null ? 0 : hash.size(); }
- }
+ // 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; }
+
+ }
}
projects / sbp.git / blobdiff