import edu.berkeley.sbp.*;
import edu.berkeley.sbp.Sequence.Position;
import edu.berkeley.sbp.GSS.Phase;
-import edu.berkeley.sbp.GSS.Phase.Node;
+import edu.berkeley.sbp.Node;
import edu.berkeley.sbp.util.*;
import java.io.*;
import java.util.*;
if (p.element() == null) return false;
if (!(p.element() instanceof Union)) return false;
Union u = (Union)p.element();
- if (u.synthetic) return false;
- if (u.name==null) return false;
- if (u.name.length() == 0) return false;
- char c = u.name.charAt(0);
+ if (u.isSynthetic()) return false;
+ if (u.getName()==null) return false;
+ if (u.getName().length() == 0) return false;
+ char c = u.getName().charAt(0);
return (c >= 'A' && c <= 'Z');
}
- static <Tok> void barf(HashMap<Element,Input.Location> sb, GSS.Phase<Tok>.Node n, int indent, boolean skip, int count, Input.Location loc) {
+ static <Tok> void barf(HashMap<Element,Input.Location> sb, Node n, int indent, boolean skip, int count, Input.Location loc) {
if (count <= 0) {
barf(sb, n, indent, skip, loc);
} else {
- for(GSS.Phase<Tok>.Node nn : n.parents())
+ /*
+ FIXME: removed
+ for(Node nn : (Iterable<Node>)n.parents())
barf(sb, nn, indent, skip, count-1, n.phase().getLocation());
+ */
}
}
- static <Tok> void barf(HashMap<Element,Input.Location> sb, GSS.Phase<Tok>.Node n, int indent, boolean skip, Input.Location loc) {
+ static <Tok> void barf(HashMap<Element,Input.Location> sb, Node n, int indent, boolean skip, Input.Location loc) {
if (touched.contains(n)) return;
touched.add(n);
String s = "";
for(int i=0; i< indent; i++) s += " ";
- GSS.Phase<Tok>.Node parent = n;
+ Node parent = n;
boolean done = false;
boolean alldone = false;
boolean go = false;
boolean force = false;
- for(Position p : parent.state) {
+ for(Position p : (Iterable<Position>)parent.state()) {
if (skip) p = p.next();
int raise = 0;
done = false;
else if (p.pos-raise > 0)
barf(sb, n, indent, false, 1);
*/
- if (!new Walk.Cache().possiblyEpsilon(p.element()))
+ if (!new Cache(null, null).possiblyEpsilon(p.element()))
break;
p = p.next();
raise++;
// FIXME
- private static HashSet<GSS.Phase.Node> touched = new HashSet<GSS.Phase.Node>();
- static <Tok> void complain(GSS.Phase<Tok>.Node n, HashMap<String,HashSet<String>> errors, boolean force, int indent) {
+ private static HashSet<Node> touched = new HashSet<Node>();
+ static <Tok> void complain(Node n, HashMap<String,HashSet<String>> errors, boolean force, int indent) {
if (touched.contains(n)) return;
touched.add(n);
- for(Position p : n.state) {
+ for(Position p : (Iterable<Position>)n.state()) {
//if (!p.isLast() && !p.next().isLast()) continue;
if (((p.isFirst() || p.isLast()) && !force)/* || p.owner().name==null*/ ||
!important(p)) {
+ /*
+ FIXME: removed
for(Node n2 : n.parents())
- complain(n2, errors, force /*| p.isFirst()*/, indent);
+ complain(n2, errors, force
+ //| p.isFirst()
+ , indent);
+ */
} else {
String seqname = p.owner()/*.name*/+"";
HashSet<String> hs = errors.get(seqname);
return ANSI.purple(ret.toString());
}
+ static void error(String message, GSS.Phase phase) throws ParseFailed {
+ error(message, phase.getLocation(), phase.getToken(),
+ phase, phase.getRegion(), phase.getGSS().getInput(), phase.getGSS());
+ }
static void error(String message,
Input.Location loc,
Object token,