package edu.berkeley.sbp;
import edu.berkeley.sbp.*;
import edu.berkeley.sbp.util.*;
+import edu.berkeley.sbp.Sequence.Position;
import java.io.*;
import java.util.*;
import java.lang.reflect.*;
-//////////////////////////////////////////////////////////////////////////////
-// TODO:
-//
-// - fix public/package/private status
-//
-
-//////////////////////////////////////////////////////////////////////////////
-// Optimizations to add
-//
-// ** NOTE: not all of these are appropriate for this class -- it is
-// simply a list of optimizations not implemented. This
-// class is meant to remain simple and easy to understand;
-// optimizations which obscure that do not belong here (they
-// should go into the compiled version instead)
-
/** implements Tomita's Graph Structured Stack */
class GSS {
public Forest.Ref finalResult = null;
/** 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 = new HashMap<Long,Phase.Node>(); /* ALLOC */
/** the number of nodes in this phase */
private int numNodes = 0;
this.location = location;
}
- public boolean isDone() { return token == null; }
+ 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);
+ }
+ }
+ }
- private String error = "generic syntax error";
- public void checkFailure() throws Parser.Failed {
- if (numNodes <= 0)
- throw new Parser.Failed(error, getLocation());
+ 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 {
+ if (token != null) return false;
+ if (token==null && finalResult==null)
+ throw new Parser.Failed(error(red("unexpected end of file\n")),
+ getLocation());
+ 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 void newNode(Node parent, Forest pending, Parser.Table.State state, boolean fromEmptyReduction) {
+ public boolean newNode(Node parent, Forest pending, Parser.Table.State state, boolean fromEmptyReduction) {
Node p = hash.get(code(state, parent==null?null:parent.phase()));
- if (p != null) newNode2(p, parent, pending, state, fromEmptyReduction);
- else newNode3(parent, pending, state, fromEmptyReduction);
+ if (p != null) return newNode2(p, parent, pending, state, fromEmptyReduction);
+ else return newNode3(parent, pending, state, fromEmptyReduction);
}
- private void newNode2(Node p, Node parent, Forest pending, Parser.Table.State state, boolean fromEmptyReduction) {
+ private boolean newNode2(Node p, Node parent, Forest pending, Parser.Table.State state, boolean fromEmptyReduction) {
p.holder.merge(pending);
- if (p.parents().contains(parent)) return;
- p.parents().add(parent);
+ 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");
+ p.parents().add(parent, true);
if (p!=parent && !fromEmptyReduction) p.queueReductions(parent);
+ return true;
}
- private void newNode3(Node parent, Forest pending, Parser.Table.State state, boolean fromEmptyReduction) {
+ private boolean newNode3(Node parent, Forest pending, Parser.Table.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;
+ //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
+ Node n = new Node(parent, pending, state, fromEmptyReduction); // ALLOC
n.queueEmptyReductions();
if (!fromEmptyReduction) n.queueReductions(parent);
+ return true;
}
}
}
+ private boolean good = false;
public void invoke(Parser.Table.State st, Forest result, Node n) {
- next.newNode(n, result, st, true);
+ 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) {
+ public void shift(Phase next, Forest result) throws Parser.Failed {
this.next = next;
closed = true;
Forest res = null;
if (n.holder==null) continue;
n.holder.resolve();
if (token == null && n.state.isAccepting()) {
- ok = true;
if (finalResult==null) finalResult = new Forest.Ref();
finalResult.merge(n.holder);
}
if (!n.holder.valid()) continue;
if (token == null) continue;
n.state.invokeShifts(token, this, result, n);
- /*
- for(Parser.Table.State st : n.state.getShifts(token)) {
- if (res == null) res = result;
- next.newNode(n, res, st, true, this);
- ok = true;
- }
- */
}
- if (!ok && token != null) {
- StringBuffer error = new StringBuffer();
- error.append("error: unable to shift token \"" + token + "\"\n");
- //error.append(" before: " +pendingReductions+ "\n");
- //error.append(" before: " +totalReductions+ "\n");
- //for(Phase.Node n : hash.values()) {
- //n.queueReductions();
- //n.queueEmptyReductions();
- //}
- //error.append(" after: " +pendingReductions+ "\n");
- //error.append(" candidate states:\n");
- //for(Phase.Node n : hash.values()) {
- //for(Sequence.Position p : n.state) error.append(" " + p + "\n");
- //error.append(" --\n");
- //for(Parser.Table.Reduction r : n.state.getReductions(token)) error.append(" " + r + "\n");
- //error.append(" ==\n");
- //}
- next.error = error.toString();
- }
+ if (!good && token!=null)
+ throw new Parser.Failed(error(red("unexpected character")+" "+purple(token)+" encountered at "+green(getLocation())+"\n"),
+ getLocation());
+ if (token==null && finalResult==null)
+ throw new Parser.Failed(error(red("unexpected end of file\n")),
+ getLocation());
// this massively improves GC performance
hash = null;
/** a node in the GSS */
public final class Node extends FastSet<Node> implements Invokable<Parser.Table.Reduction, Node, Node> {
+ public boolean touched = false;
private Forest.Ref holder = null;
private boolean allqueued = false;
public FastSet<Node> parents() { return this; }
public void queueReductions() {
+ if (!reducing) return;
if (allqueued) return;
allqueued = true;
int where = parents().size();
state.invokeReductions(token, this, null, null);
}
- private Node(Node parent, Forest pending, Parser.Table.State state) {
+ private boolean fe;
+ private Node(Node parent, Forest pending, Parser.Table.State state, boolean fe) {
+ this.fe = fe;
this.state = state;
Phase start = parent==null ? null : parent.phase();
if (pending != null) this.holder().merge(pending);
- if (parent != null) parents().add(parent);
+ 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++;
projects / sbp.git / blobdiff