1 package edu.berkeley.sbp;
2 import edu.berkeley.sbp.*;
3 import edu.berkeley.sbp.util.*;
4 import edu.berkeley.sbp.Sequence.Position;
5 import edu.berkeley.sbp.Parser.Table.State;
6 import edu.berkeley.sbp.Parser.Table.Reduction;
9 import java.lang.reflect.*;
11 /** implements Tomita's Graph Structured Stack */
16 private Phase.Node[] reducing_list = null;
17 public int resets = 0;
20 HashMapBag<Integer,Sequence> inhibited = new HashMapBag<Integer,Sequence>();
21 HashMapBag<Sequence,Phase.Waiting> waiting = new HashMapBag<Sequence,Phase.Waiting>();
22 HashMapBag<Integer,Sequence> performed = new HashMapBag<Integer,Sequence>();
24 /** corresponds to a positions <i>between tokens</i> the input stream; same as Tomita's U_i's */
25 public class Phase implements Invokable<State, Forest, GSS.Phase.Node> {
27 /** the token immediately after this phase */
28 public final Token token;
32 /** currently this is necessary only for the code() hack -- it doesn't actually correspond to the input */
33 private final int pos;
36 public Forest.Ref finalResult;
38 /** all nodes, keyed by the value returned by code() */
39 /*private*/ HashMap<Long,Phase.Node> hash; /* ALLOC */
41 /** the number of nodes in this phase */
47 private Phase next = null;
49 private Token.Location location;
50 public final Parser parser;
52 private Forest forest;
54 public Phase(Phase prev, Parser parser, Phase previous, Token token, Token.Location location, Forest forest) {
58 this.pos = previous==null ? 0 : previous.pos+1;
60 this.location = location;
68 hash = new HashMap<Long,Phase.Node>();
74 if (prev != null) prev.shift(this, forest);
77 public void complain(Node n, HashMap<String,HashSet<String>> errors, boolean force) {
78 if (n.touched) return;
80 for(Position p : n.state) {
82 if (((p.isFirst() || p.isLast()) && !force) || p.owner().name==null) {
83 for(Node n2 : n.parents())
84 complain(n2, errors, force | p.isFirst());
86 String seqname = p.owner().name;
87 HashSet<String> hs = errors.get(seqname);
88 if (hs==null) errors.put(seqname, hs = new HashSet<String>());
89 hs.add(p.element()+"");
90 //String s = " while parsing " + seqname + ": expected a " + p.element();
94 for(Position p2 = p.owner().firstp(); p2 != null && p2 != p && !p2.isLast(); p2 = p2.next()) s += (p2.element() + " ");
97 for(Position p2 = p; p2 != null && !p2.isLast(); p2 = p2.next()) s += (p2.element() + " ");
105 public String black(Object o) { return "\033[30m"+o+"\033[0m"; }
106 public String red(Object o) { return "\033[31m"+o+"\033[0m"; }
107 public String green(Object o) { return "\033[32m"+o+"\033[0m"; }
108 public String yellow(Object o) { return "\033[33m"+o+"\033[0m"; }
109 public String blue(Object o) { return "\033[34m"+o+"\033[0m"; }
110 public String purple(Object o) { return "\033[35m"+o+"\033[0m"; }
111 public String cyan(Object o) { return "\033[36m"+o+"\033[0m"; }
112 public String el(Object e) {
113 String s = e.toString();
114 if (s.length()==0 || s.charAt(0)!='\"' || s.charAt(s.length()-1)!='\"') return yellow(s);
116 s = s.substring(0, s.length()-1);
117 StringBuffer ret = new StringBuffer();
118 for(int i=0; i<s.length(); i++) {
119 if (s.charAt(i)=='\\' && i<s.length()-1) ret.append(s.charAt(++i));
122 return purple(ret.toString());
124 public String error(String message) {
125 String lookAhead = token==null ? "<EOF>" : token.toString();
126 StringBuffer ret = new StringBuffer();
129 HashMap<String,HashSet<String>> errors = new HashMap<String,HashSet<String>>();
130 for(Node n : hash.values()) complain(n, errors, false);
131 for(String s : errors.keySet()) {
132 ret.append(" while parsing " + yellow(s));
133 HashSet<String> hs = errors.get(s);
134 if (hs.size()==1) ret.append(" expected " + yellow(el(hs.iterator().next())) + "\n");
136 ret.append(" expected ");
137 boolean first = true;
138 for(String s2 : hs) {
139 if (!first) ret.append(" or ");
141 ret.append(yellow(el(s2)));
146 return ret.toString();
149 public boolean isDone() throws Parser.Failed {
150 if (token != null) return false;
151 if (token==null && finalResult==null)
152 throw new Parser.Failed(error(red("unexpected end of file\n")),
157 public Token.Location getLocation() { return location; }
159 /** add a new node (merging with existing nodes if possible)
160 * @param parent the parent of the new node
161 * @param result the SPPF result corresponding to the new node
162 * @param state the state that the new node is in
163 * @param fromEmptyReduction true iff this node is being created as a result of a reduction of length zero (see GRMLR paper)
164 * @param start the earliest part of the input contributing to this node (used to make merging decisions)
166 public boolean newNode(Node parent, Forest pending, State state, boolean fromEmptyReduction) {
167 return newNode(parent, pending, state, fromEmptyReduction, null); }
168 public boolean newNode(Node parent, Forest pending, State state, boolean fromEmptyReduction, Reduction reduction) {
169 int pos = parent==null?0:parent.phase()==null?0:parent.phase().pos;
170 if (reduction!=null) {
171 if (inhibited.contains(pos, reduction.position.owner())) return false;
172 if (reduction.position.owner().needs != null) {
173 for(Sequence s : reduction.position.owner().needs) {
174 if (!performed.contains(pos, s)) {
175 waiting.add(s, new Waiting(parent, pending, state, fromEmptyReduction, reduction));
180 performed.add(pos, reduction.position.owner());
182 Node p = hash.get(code(state, parent==null?null:parent.phase()));
184 if (reduction!=null) inhibit(reduction, parent==null?0:parent.phase().pos);
185 if (p != null) ret = newNode2(p, parent, pending, state, fromEmptyReduction, reduction);
186 else ret = newNode3(parent, pending, state, fromEmptyReduction, reduction);
187 if (reduction != null) {
191 for(Waiting w : waiting.getAll(reduction.position.owner())) {
192 if (w.parent==parent || (parent!=null&&w.parent!=null&&w.parent.phase()==parent.phase())) {
193 waiting.remove(reduction.position.owner(), w);
203 private boolean newNode2(Node p, Node parent, Forest pending, State state, boolean fromEmptyReduction, Reduction reduction) {
204 p.holder.merge(pending);
205 if (p.parents().contains(parent)) return true;
206 //if (p.fe && p.phase() != parent.phase()) throw new Error("yep yep");
207 //if (!p.fe && p.phase() == parent.phase()) throw new Error("yep yep2");
208 p.parents().add(parent, true);
209 if (p!=parent && !fromEmptyReduction) p.queueReductions(parent);
212 private boolean newNode3(Node parent, Forest pending, State state, boolean fromEmptyReduction, Reduction reduction) {
214 if (token != null && state.canShift(token)) break;
215 if (state.isAccepting()) break;
216 if (token==null) break;
217 //if (!state.canReduce(token)) return false;
218 //if (count > 1) break;
219 //if (r.numPop == 0) break;
220 //r.reduce(pending, parent, null, Phase.this, null);
224 Node n = new Node(parent, pending, state, fromEmptyReduction); // ALLOC
225 n.queueEmptyReductions();
226 if (!fromEmptyReduction) n.queueReductions(parent);
230 public void inhibit(Reduction r, int p) {
231 if (r.position.owner().hated == null) return;
232 // remember that dead states are still allowed to shift -- just not allowed to reduce
233 for(Sequence seq : r.position.owner().hated) {
234 if (performed.contains(p,seq)) {
236 inhibited.add(p, seq);
240 inhibited.add(p, seq);
244 /** perform all reduction operations */
245 public void reduce() {
248 if (reducing_list==null || reducing_list.length < hash.size())
249 reducing_list = new Phase.Node[hash.size() * 4];
250 Collection<Node> hv = hash.values();
251 hv.toArray(reducing_list);
253 for(int i=0; i<num; i++) {
254 Node n = reducing_list[i];
255 n.queueEmptyReductions();
256 // INVARIANT: we never "see" a node until its parent-set is complete, modulo merges
258 for(int i=0; i<num; i++) {
259 Node n = reducing_list[i];
260 reducing_list[i] = null;
269 class Reset extends RuntimeException { }
271 public void invoke(State st, Forest result, Node n) {
272 good |= next.newNode(n, result, st, false);
275 /** perform all shift operations, adding promoted nodes to <tt>next</tt> */
276 public void shift(Phase next, Forest result) throws Parser.Failed {
277 if (prev!=null) prev.hash = null;
282 for(Phase.Node n : hash.values()) {
283 if (n.holder==null) continue;
285 if (token == null && n.state.isAccepting()) {
286 if (finalResult==null) finalResult = new Forest.Ref();
287 finalResult.merge(n.holder);
289 if (!n.holder.valid()) continue;
290 if (token == null) continue;
291 n.state.invokeShifts(token, this, result, n);
294 if (!good && token!=null)
295 throw new Parser.Failed(error(red("unexpected character")+" "+purple(token)+" encountered at "+green(getLocation())+"\n"),
297 if (token==null && finalResult==null)
298 throw new Parser.Failed(error(red("unexpected end of file\n")),
301 // this massively improves GC performance
306 public class Waiting {
310 boolean fromEmptyReduction;
312 public Waiting(Node parent, Forest pending, State state, boolean fromEmptyReduction, Reduction reduction) {
314 this.parent = parent;
315 this.pending = pending;
317 this.fromEmptyReduction = fromEmptyReduction;
318 this.reduction = reduction;
320 public void perform() {
321 System.out.println("performing: " + reduction.position);
322 newNode(parent, pending, state, fromEmptyReduction, reduction);
326 // GSS Nodes //////////////////////////////////////////////////////////////////////////////
328 /** a node in the GSS */
329 public final class Node extends FastSet<Node> implements Invokable<Reduction, Node, Node> {
331 public boolean touched = false;
332 private Forest.Ref holder = null;
333 private boolean allqueued = false;
335 /** what state this node is in */
336 public final State state;
338 /** which Phase this Node belongs to (node that Node is also a non-static inner class of Phase) */
339 public Phase phase() { return Phase.this; }
341 public Forest.Ref holder() { return holder==null ? (holder = new Forest.Ref()) : holder; }
342 public Forest pending() { return Phase.this.closed ? holder().resolve() : holder; }
343 public FastSet<Node> parents() { return this; }
345 public void queueReductions() {
346 if (!reducing) return;
347 if (allqueued) return;
349 int where = parents().size();
350 state.invokeReductions(token, this, this, null);
353 public void queueReductions(Node n2) {
354 if (!allqueued) { queueReductions(); return; }
355 state.invokeReductions(token, this, this, n2);
358 public final void invoke(Reduction r, Node n, Node n2) {
360 if (r.numPop==0) r.reduce(this);
363 if (r.numPop==0) return;
364 if (n2==null) r.reduce(n);
365 else r.reduce(n, n2);
367 public void queueEmptyReductions() {
368 if (!reducing) return;
369 state.invokeReductions(token, this, null, null);
373 public boolean dead = false;
374 public boolean redo = false;
375 private Node(Node parent, Forest pending, State state, boolean fe) {
378 for(Position p : state) {
379 if (p.owner().needs!=null)
380 for(Sequence s : p.owner().needs) {
385 Phase start = parent==null ? null : parent.phase();
386 if (pending != null) this.holder().merge(pending);
387 if (parent != null) parents().add(parent, true);
388 if (Phase.this.hash.get(code(state, start)) != null) throw new Error("severe problem!");
389 Phase.this.hash.put(code(state, start), this);
390 Phase.this.numNodes++;
391 if (parent==null) holder().valid = true; // hack to make sure that the "base" node is always considered valid
398 private static boolean equal(Object a, Object b) {
399 if (a==null && b==null) return true;
400 if (a==null || b==null) return false;
404 /** this is something of a hack right now */
405 private static long code(State state, Phase start) {
406 return (((long)state.idx) << 32) | (start==null ? 0 : (start.pos+1));