+ 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 {
+ /*
+ 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, 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 += " ";
+ Node parent = n;
+ boolean done = false;
+ boolean alldone = false;
+ boolean go = false;
+ boolean force = false;
+ for(Position p : (Iterable<Position>)parent.state()) {
+ if (skip) p = p.next();
+ int raise = 0;
+ done = false;
+ while(p != null) {
+ if (p.isLast()) break;
+ if (important(p)) {
+ Input.Location l = sb.get(p.element());
+ if (l == null || l.compareTo(loc) < 0)
+ sb.put(p.element(), loc);
+ done = true;
+ alldone = true;
+ }
+ /*
+ else if (p.pos-raise > 0)
+ barf(sb, n, indent, false, 1);
+ if (!new Grammar(null, null).possiblyEpsilon(p.element()))
+ break;
+ */
+ p = p.next();
+ raise++;
+ if (p.isLast()) {
+ if (!done) barf(sb, n, indent, true, 1, loc);
+ break;
+ }
+ }
+ }
+ if (!alldone) barf(sb, n, indent, false, 1, loc);
+ }
+
+
+
+ // FIXME
+ 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 : (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