+// 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.*;
/** implements Tomita's Graph Structured Stack */
class GSS {
- public GSS() { }
+ static int count = 0;
+ static int shifts = 0;
+ static int reductions = 0;
+ int resets = 0;
+ int waits = 0;
+
+ Input input;
+
+ public GSS(Input input) { this.input = input; }
private Phase.Node[] reducing_list = null;
- public int resets = 0;
- public int waits = 0;
- HashMapBag<Integer,Sequence> inhibited = new HashMapBag<Integer,Sequence>();
- HashMapBag<Sequence,Phase.Waiting> waiting = new HashMapBag<Sequence,Phase.Waiting>();
- HashMapBag<Integer,Sequence> performed = 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 */
+ Forest.Many finalResult;
+
/** corresponds to a positions <i>between tokens</i> the input stream; same as Tomita's U_i's */
- public class Phase implements Invokable<State, Forest, GSS.Phase.Node> {
+ class Phase<Tok> implements Invokable<State, Forest, Phase<Tok>.Node>, IntegerMappable, GraphViz.ToGraphViz, Iterable<Phase.Node> {
- /** the token immediately after this phase */
- public final Token token;
+ 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;
+ /** the token immediately after this phase */
+ final Tok token;
- /** currently this is necessary only for the code() hack -- it doesn't actually correspond to the input */
private final int pos;
- /** FIXME */
- public Forest.Ref finalResult;
-
- /** all nodes, keyed by the value returned by code() */
- /*private*/ HashMap<Long,Phase.Node> hash; /* ALLOC */
-
- /** the number of nodes in this phase */
- private int numNodes;
-
- boolean closed;
-
+ boolean reducing;
+ private IntPairMap<Phase.Node> hash; /* ALLOC */
+ private boolean closed;
private boolean good;
private Phase next = null;
-
- private Token.Location location;
+ private Phase prev;
+ private Input.Location location;
+ private Input.Location nextLocation;
+ private Input.Location prevLocation;
+
public final Parser parser;
private Forest forest;
- Phase prev;
- public Phase(Phase prev, Parser parser, Phase previous, Token token, Token.Location location, Forest forest) {
+
+ public Phase(Phase prev, Parser parser, 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();
+ this.nextLocation = nextLocation;
+ performed.clear();
reset();
}
- public void reset() {
+ public void reset() throws ParseFailed {
waiting.clear();
+ expected.clear();
+ lastperformed.clear();
+ lastperformed.addAll(performed);
performed.clear();
- hash = new HashMap<Long,Phase.Node>();
+ hash = new IntPairMap<Phase.Node>();
+ reset = false;
good = false;
closed = false;
- numNodes = 0;
reducing = false;
finalResult = null;
if (prev != null) prev.shift(this, forest);
}
- public void complain(Node n, HashMap<String,HashSet<String>> errors, boolean force) {
- if (n.touched) return;
- n.touched = true;
- for(Position p : n.state) {
- //if (!p.isLast()) {
- if (((p.isFirst() || p.isLast()) && !force) || p.owner().name==null) {
- for(Node n2 : n.parents())
- complain(n2, errors, force | p.isFirst());
- } else {
- String seqname = p.owner().name;
- HashSet<String> hs = errors.get(seqname);
- if (hs==null) errors.put(seqname, hs = new HashSet<String>());
- hs.add(p.element()+"");
- //String s = " while parsing " + seqname + ": expected a " + p.element();
- //"\n";
- /*
- s += " parsed: ";
- for(Position p2 = p.owner().firstp(); p2 != null && p2 != p && !p2.isLast(); p2 = p2.next()) s += (p2.element() + " ");
- s += "\n";
- s += " expected: ";
- for(Position p2 = p; p2 != null && !p2.isLast(); p2 = p2.next()) s += (p2.element() + " ");
- */
- //s += "\n";
- //errors.add(s);
- }
- }
- }
-
- public String black(Object o) { return "\033[30m"+o+"\033[0m"; }
- public String red(Object o) { return "\033[31m"+o+"\033[0m"; }
- public String green(Object o) { return "\033[32m"+o+"\033[0m"; }
- public String yellow(Object o) { return "\033[33m"+o+"\033[0m"; }
- public String blue(Object o) { return "\033[34m"+o+"\033[0m"; }
- public String purple(Object o) { return "\033[35m"+o+"\033[0m"; }
- public String cyan(Object o) { return "\033[36m"+o+"\033[0m"; }
- public String el(Object e) {
- String s = e.toString();
- if (s.length()==0 || s.charAt(0)!='\"' || s.charAt(s.length()-1)!='\"') return yellow(s);
- s = s.substring(1);
- s = s.substring(0, s.length()-1);
- StringBuffer ret = new StringBuffer();
- for(int i=0; i<s.length(); i++) {
- if (s.charAt(i)=='\\' && i<s.length()-1) ret.append(s.charAt(++i));
- else ret.append(s);
- }
- return purple(ret.toString());
- }
- public String error(String message) {
- String lookAhead = token==null ? "<EOF>" : token.toString();
- StringBuffer ret = new StringBuffer();
- ret.append("\n ");
- ret.append(message);
- HashMap<String,HashSet<String>> errors = new HashMap<String,HashSet<String>>();
- for(Node n : hash.values()) complain(n, errors, false);
- for(String s : errors.keySet()) {
- ret.append(" while parsing " + yellow(s));
- HashSet<String> hs = errors.get(s);
- if (hs.size()==1) ret.append(" expected " + yellow(el(hs.iterator().next())) + "\n");
- else {
- ret.append(" expected ");
- boolean first = true;
- for(String s2 : hs) {
- if (!first) ret.append(" or ");
- first = false;
- ret.append(yellow(el(s2)));
- }
- ret.append("\n");
- }
- }
- return ret.toString();
- }
-
- public boolean isDone() throws Parser.Failed {
+
+ public boolean isDone() throws ParseFailed {
if (token != null) return false;
if (token==null && finalResult==null)
- throw new Parser.Failed(error(red("unexpected end of file\n")),
- getLocation());
+ throw new ParseFailed(ParseFailed.error(("unexpected end of file\n"),
+ token, hash.values()),
+ getLocation().createRegion(getLocation()), input);
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; }
/** add a new node (merging with existing nodes if possible)
* @param parent the parent of the new node
* @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) {
- return newNode(parent, pending, state, fromEmptyReduction, null); }
- public boolean newNode(Node parent, Forest pending, State state, boolean fromEmptyReduction, Reduction reduction) {
+ 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, Position reduction) {
int pos = parent==null?0:parent.phase()==null?0:parent.phase().pos;
+ Sequence owner = reduction==null ? null : reduction.owner();
if (reduction!=null) {
- if (inhibited.contains(pos, reduction.position.owner())) return false;
- if (reduction.position.owner().needs != null) {
- for(Sequence s : reduction.position.owner().needs) {
+ if (owner.hates!=null) {
+ 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 (owner.needs != null)
+ for(Sequence s : owner.needs)
if (!performed.contains(pos, s)) {
waiting.add(s, new Waiting(parent, pending, state, fromEmptyReduction, reduction));
- return false;
+ return;
}
- }
+ 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;
+ }
}
- performed.add(pos, reduction.position.owner());
}
- Node p = hash.get(code(state, parent==null?null:parent.phase()));
- boolean ret;
- if (reduction!=null) inhibit(reduction, parent==null?0:parent.phase().pos);
- if (p != null) ret = newNode2(p, parent, pending, state, fromEmptyReduction, reduction);
- else ret = newNode3(parent, pending, state, fromEmptyReduction, reduction);
+ newNode(parent, pending, state, fromEmptyReduction);
if (reduction != null) {
boolean redo = true;
while(redo) {
redo = false;
- for(Waiting w : waiting.getAll(reduction.position.owner())) {
+ for(Waiting w : waiting.getAll(owner)) {
if (w.parent==parent || (parent!=null&&w.parent!=null&&w.parent.phase()==parent.phase())) {
- waiting.remove(reduction.position.owner(), w);
+ waiting.remove(owner, w);
w.perform();
redo = true;
break;
}
}
}
- return ret;
}
- private boolean newNode2(Node p, Node parent, Forest pending, State state, boolean fromEmptyReduction, Reduction reduction) {
- p.holder.merge(pending);
- if (p.parents().contains(parent)) return true;
- //if (p.fe && p.phase() != parent.phase()) throw new Error("yep yep");
- //if (!p.fe && p.phase() == parent.phase()) throw new Error("yep yep2");
+
+ private boolean newNode2(Node p, Node parent, Forest pending, State state, boolean fromEmptyReduction) {
+ if (p.merge(parent, pending)) return true;
p.parents().add(parent, true);
- if (p!=parent && !fromEmptyReduction) p.queueReductions(parent);
+ if (p!=parent && !fromEmptyReduction && reducing) p.performReductions(parent);
return true;
}
- private boolean newNode3(Node parent, Forest pending, State state, boolean fromEmptyReduction, Reduction reduction) {
+
+ private boolean newNode3(Node parent, Forest pending, State state, boolean fromEmptyReduction) {
do {
if (token != null && state.canShift(token)) break;
if (state.isAccepting()) break;
if (token==null) break;
- //if (!state.canReduce(token)) return false;
+ 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, fromEmptyReduction); // ALLOC
- n.queueEmptyReductions();
- if (!fromEmptyReduction) n.queueReductions(parent);
+ Node n = new Node(parent, pending, state); // ALLOC
+ if (reducing) {
+ n.performEmptyReductions();
+ if (!fromEmptyReduction) n.performReductions(parent);
+ }
return true;
}
- 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
- for(Sequence seq : r.position.owner().hated) {
- if (performed.contains(p,seq)) {
- inhibited.clear();
- inhibited.add(p, seq);
- resets++;
- throw new Reset();
- }
- inhibited.add(p, seq);
- }
- }
-
/** perform all reduction operations */
- public void reduce() {
+ public void reduce() throws ParseFailed {
try {
reducing = true;
if (reducing_list==null || reducing_list.length < hash.size())
reducing_list = new Phase.Node[hash.size() * 4];
- Collection<Node> hv = hash.values();
- hv.toArray(reducing_list);
- int num = hv.size();
+ hash.toArray(reducing_list);
+ int num = hash.size();
for(int i=0; i<num; i++) {
Node n = reducing_list[i];
- n.queueEmptyReductions();
+ n.performEmptyReductions();
// INVARIANT: we never "see" a node until its parent-set is complete, modulo merges
}
for(int i=0; i<num; i++) {
Node n = reducing_list[i];
reducing_list[i] = null;
- n.queueReductions();
+ n.performReductions();
}
+ 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();
}
+ count = 0;
}
+ private boolean reset = false;
class Reset extends RuntimeException { }
- public void invoke(State st, Forest result, Node n) {
- good |= next.newNode(n, result, st, false);
- }
-
/** perform all shift operations, adding promoted nodes to <tt>next</tt> */
- public void shift(Phase next, Forest result) throws Parser.Failed {
- if (prev!=null) prev.hash = null;
+ public void shift(Phase next, Forest result) throws ParseFailed {
+ // this massively improves GC performance
+ if (prev!=null && parser.helpgc) {
+ prev.hash = null;
+ }
this.next = next;
closed = true;
Forest res = null;
boolean ok = false;
for(Phase.Node n : hash.values()) {
- if (n.holder==null) continue;
- n.holder.resolve();
if (token == null && n.state.isAccepting()) {
- if (finalResult==null) finalResult = new Forest.Ref();
- finalResult.merge(n.holder);
+ if (finalResult==null) finalResult = new Forest.Many();
+ for(Object f : n.results())
+ finalResult.merge((Forest)f);
}
- if (!n.holder.valid()) continue;
if (token == null) continue;
n.state.invokeShifts(token, this, result, n);
}
if (!good && token!=null)
- throw new Parser.Failed(error(red("unexpected character")+" "+purple(token)+" encountered at "+green(getLocation())+"\n"),
- getLocation());
+ throw new ParseFailed(ParseFailed.error(("unexpected character ")+" \'"+
+ ANSI.purple(StringUtil.escapify(token+"", "\\\'\r\n"))+
+ "\' encountered at "+
+ ANSI.green(next.getRegion())+"\n", token, hash.values()),
+ next.getRegion(), input);
if (token==null && finalResult==null)
- throw new Parser.Failed(error(red("unexpected end of file\n")),
- getLocation());
-
- // this massively improves GC performance
- //hash = null;
+ throw new ParseFailed(ParseFailed.error(("unexpected end of file at "+getLocation()+"\n"), token, hash.values()),
+ getLocation().createRegion(getLocation()), input);
}
- public class Waiting {
+ class Waiting {
Node parent;
Forest pending;
State state;
boolean fromEmptyReduction;
- Reduction reduction;
- public Waiting(Node parent, Forest pending, State state, boolean fromEmptyReduction, Reduction reduction) {
+ Position reduction;
+ public Waiting(Node parent, Forest pending, State state, boolean fromEmptyReduction, Position reduction) {
waits++;
this.parent = parent;
this.pending = pending;
this.reduction = reduction;
}
public void perform() {
- System.out.println("performing: " + reduction.position);
+ //System.out.println("performing: " + reduction.position);
newNode(parent, pending, state, fromEmptyReduction, reduction);
}
}
- // GSS Nodes //////////////////////////////////////////////////////////////////////////////
+ // Node /////////////////////////////////////////////////////////////////////////////////
/** a node in the GSS */
- public final class Node extends FastSet<Node> implements Invokable<Reduction, Node, Node> {
+ final class Node implements Invokable<Position, Node, Node>, IntegerMappable, GraphViz.ToGraphViz {
+ public FastSet<Node> set = new FastSet<Node>();
- public boolean touched = false;
- private Forest.Ref holder = null;
+
private boolean allqueued = false;
/** what state this node is in */
- public final State state;
+ public final Parser.Table<Tok>.State<Tok> 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<Node> parents() { return this; }
+ public Phase phase() { return Phase.this; }
+
+ private HashSet<Forest.Many> resultMap = new HashSet<Forest.Many>();
+ public Iterable<Forest.Many> results() { return resultMap; }
+ public FastSet<Node> parents() { return set; }
+ public boolean merge(Node parent, Forest result) {
+ // FIXME: inefficient!
+ for(Forest.Many f : results()) {
+ if (f.parents.contains(parent) /* UGLY: */ && f.parents.size()==1) {
+ f.merge(result);
+ return true;
+ }
+ }
+ Forest.Many f = new Forest.Many();
+ f.parents.add(parent);
+ f.merge(result);
+ resultMap.add(f);
+ set.add(parent, true);
+ return false;
+ }
- public void queueReductions() {
- if (!reducing) return;
+ public void performReductions() {
if (allqueued) return;
allqueued = true;
- int where = parents().size();
state.invokeReductions(token, this, this, null);
}
- public void queueReductions(Node n2) {
- if (!allqueued) { queueReductions(); return; }
- state.invokeReductions(token, this, this, n2);
+ 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) {
- if (r.numPop==0) r.reduce(this);
- 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;
+ else return;
+ }
+ if (n==null) return;
+ Forest[] holder = new Forest[r.pos];
+ if (r.pos==0) n.finish(r, r.zero(n.phase().getLocation().createRegion(n.phase().getLocation())), n.phase());
+ else n.reduce(r, r.pos-1, n.phase(), null);
+ } else {
+ if (r.pos<=0) throw new Error("called wrong form of reduce()");
+ int pos = r.pos-1;
+ n.reduce(r, pos, n.phase(), n2);
}
- if (r.numPop==0) return;
- if (n2==null) r.reduce(n);
- else r.reduce(n, n2);
}
- public void queueEmptyReductions() {
- if (!reducing) return;
- state.invokeReductions(token, this, null, null);
+
+ public void reduce(Position r, int pos, Phase target, Node only) {
+ Forest[] holder = r.holder;
+ Forest old = holder[pos];
+
+ HashSet<Forest> rr = new HashSet<Forest>();
+ for(Forest result : results()) rr.add(result);
+ for(Forest result : rr)
+ for(Node child : ((Forest.Many<?>)result).parents) {
+ if (only != null && child!=only) continue;
+ holder[pos] = result;
+ if (pos==0) child.finish(r, r.rewrite(child.phase().getLocation().createRegion(target.getLocation())), target);
+ else child.reduce(r, pos-1, target, null);
+ }
+
+ holder[pos] = old;
+ }
+
+ 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)
+ target.newNode(this, result, state0, r.pos<=0, r);
}
- private boolean fe;
- public boolean dead = false;
- public boolean redo = false;
- private Node(Node parent, Forest pending, State state, boolean fe) {
- this.fe = fe;
+ private Node(Node parent, Forest pending, State state) {
this.state = state;
- for(Position p : state) {
- if (p.owner().needs!=null)
- for(Sequence s : p.owner().needs) {
- //dead = true;
- //redo = false;
- }
- }
+ this.merge(parent, pending);
Phase start = parent==null ? null : parent.phase();
- if (pending != null) this.holder().merge(pending);
if (parent != null) parents().add(parent, true);
- if (Phase.this.hash.get(code(state, start)) != null) throw new Error("severe problem!");
- Phase.this.hash.put(code(state, start), this);
- Phase.this.numNodes++;
- if (parent==null) holder().valid = true; // hack to make sure that the "base" node is always considered valid
+ if (Phase.this.hash.get(state, start) != null) throw new Error("severe problem!");
+ Phase.this.hash.put(state, start, this);
}
+ 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(); }
- /** helper method */
- private static boolean equal(Object a, Object b) {
- if (a==null && b==null) return true;
- if (a==null || b==null) return false;
- return a.equals(b);
- }
+ // 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; }
- /** this is something of a hack right now */
- private static long code(State state, Phase start) {
- return (((long)state.idx) << 32) | (start==null ? 0 : (start.pos+1));
}
}