import edu.berkeley.sbp.*;
import edu.berkeley.sbp.util.*;
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.*;
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<Sequence,Phase.Waiting> waiting = new HashMapBag<Sequence,Phase.Waiting>();
+ HashMapBag<Integer,Sequence> performed = new HashMapBag<Integer,Sequence>();
+
/** corresponds to a positions <i>between tokens</i> the input stream; same as Tomita's U_i's */
- public class Phase implements Invokable<Parser.Table.State, Forest, GSS.Phase.Node> {
+ public class Phase implements Invokable<State, Forest, GSS.Phase.Node> {
/** the token immediately after this phase */
public final Token token;
- boolean reducing = false;
+ boolean reducing;
/** 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 = null;
+ public Forest.Ref finalResult;
/** all nodes, keyed by the value returned by code() */
- /*private*/ HashMap<Long,Phase.Node> hash = new HashMap<Long,Phase.Node>(); /* ALLOC */
+ /*private*/ HashMap<Long,Phase.Node> hash; /* ALLOC */
/** the number of nodes in this phase */
- private int numNodes = 0;
+ private int numNodes;
- boolean closed = false;
+ boolean closed;
+
+ private boolean good;
+ private Phase next = null;
private Token.Location location;
- public Phase(Phase previous, Token token, Token.Location location) {
+ public final Parser parser;
+
+ private Forest forest;
+ Phase prev;
+ public Phase(Phase prev, Parser parser, Phase previous, Token token, Token.Location location, Forest forest) {
+ 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();
+ performed.clear();
+ hash = new HashMap<Long,Phase.Node>();
+ 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) {
return true;
}
- private String error = "generic syntax error";
-
public Token.Location getLocation() { return location; }
/** add a new node (merging with existing nodes if possible)
* @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, Parser.Table.State state, boolean fromEmptyReduction) {
+ 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) {
+ int pos = parent==null?0:parent.phase()==null?0:parent.phase().pos;
+ 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 (!performed.contains(pos, s)) {
+ waiting.add(s, new Waiting(parent, pending, state, fromEmptyReduction, reduction));
+ return false;
+ }
+ }
+ }
+ if ((reduction.position.owner().needed != null && reduction.position.owner().needed.size()>0) ||
+ (reduction.position.owner().hated != null && reduction.position.owner().hated.size()>0) ||
+ (reduction.position.owner().hates != null && reduction.position.owner().hates.size()>0))
+ performed.add(pos, reduction.position.owner());
+ }
Node p = hash.get(code(state, parent==null?null:parent.phase()));
- if (p != null) return newNode2(p, parent, pending, state, fromEmptyReduction);
- else return newNode3(parent, pending, state, fromEmptyReduction);
+ 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);
+ if (reduction != null) {
+ boolean redo = true;
+ while(redo) {
+ redo = false;
+ for(Waiting w : waiting.getAll(reduction.position.owner())) {
+ if (w.parent==parent || (parent!=null&&w.parent!=null&&w.parent.phase()==parent.phase())) {
+ waiting.remove(reduction.position.owner(), w);
+ w.perform();
+ redo = true;
+ break;
+ }
+ }
+ }
+ }
+ return ret;
}
- private boolean newNode2(Node p, Node parent, Forest pending, Parser.Table.State state, boolean fromEmptyReduction) {
+ 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!=parent && !fromEmptyReduction) p.queueReductions(parent);
return true;
}
- private boolean newNode3(Node parent, Forest pending, Parser.Table.State state, boolean fromEmptyReduction) {
+ private boolean newNode3(Node parent, Forest pending, State state, boolean fromEmptyReduction, Reduction reduction) {
do {
if (token != null && state.canShift(token)) break;
if (state.isAccepting()) break;
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() {
- 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();
- for(int i=0; i<num; i++) {
- Node n = reducing_list[i];
- n.queueEmptyReductions();
- // 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();
+ 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();
+ for(int i=0; i<num; i++) {
+ Node n = reducing_list[i];
+ n.queueEmptyReductions();
+ // 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();
+ }
+ } catch (Reset r) {
+ reset();
+ reduce();
}
}
- private boolean good = false;
- public void invoke(Parser.Table.State st, Forest result, Node n) {
+ class Reset extends RuntimeException { }
+
+ public void invoke(State st, Forest result, Node n) {
good |= next.newNode(n, result, st, false);
}
- private Phase next = null;
/** 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;
this.next = next;
closed = true;
Forest res = null;
getLocation());
// this massively improves GC performance
- hash = null;
+ //hash = null;
}
+
+ 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);
+ }
+ }
// GSS Nodes //////////////////////////////////////////////////////////////////////////////
/** a node in the GSS */
- public final class Node extends FastSet<Node> implements Invokable<Parser.Table.Reduction, Node, Node> {
+ public final class Node extends FastSet<Node> implements Invokable<Reduction, Node, Node> {
public boolean touched = false;
private Forest.Ref holder = null;
private boolean allqueued = false;
/** what state this node is in */
- public final Parser.Table.State state;
+ 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; }
state.invokeReductions(token, this, this, n2);
}
- public final void invoke(Parser.Table.Reduction r, Node n, Node n2) {
+ public final void invoke(Reduction r, Node n, Node n2) {
if (n==null) {
if (r.numPop==0) r.reduce(this);
return;
}
private boolean fe;
- private Node(Node parent, Forest pending, Parser.Table.State state, boolean fe) {
+ public boolean dead = false;
+ public boolean redo = false;
+ private Node(Node parent, Forest pending, State state, boolean fe) {
this.fe = fe;
this.state = state;
+ for(Position p : state) {
+ if (p.owner().needs!=null)
+ for(Sequence s : p.owner().needs) {
+ //dead = true;
+ //redo = false;
+ }
+ }
Phase start = parent==null ? null : parent.phase();
if (pending != null) this.holder().merge(pending);
if (parent != null) parents().add(parent, true);
}
/** this is something of a hack right now */
- private static long code(Parser.Table.State state, Phase start) {
+ private static long code(State state, Phase start) {
return (((long)state.idx) << 32) | (start==null ? 0 : (start.pos+1));
}
}
projects / sbp.git / blobdiff