X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FParseFailed.java;h=31a3a56e8e19da65c899f2d59ea308ed9716a550;hp=1fa0b08b4676dabafb542f804c582116ef0f9643;hb=a8478f5ddfbfbc8d910d09f27163cbd55752d3b6;hpb=849beccd08c6de8842f8b21a1e4063090b6df33d diff --git a/src/edu/berkeley/sbp/ParseFailed.java b/src/edu/berkeley/sbp/ParseFailed.java index 1fa0b08..31a3a56 100644 --- a/src/edu/berkeley/sbp/ParseFailed.java +++ b/src/edu/berkeley/sbp/ParseFailed.java @@ -4,7 +4,7 @@ package edu.berkeley.sbp; 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.*; @@ -46,25 +46,25 @@ public class ParseFailed extends Exception { return (c >= 'A' && c <= 'Z'); } - static void barf(HashMap sb, GSS.Phase.Node n, int indent, boolean skip, int count, Input.Location loc) { + static void barf(HashMap 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.Node nn : n.parents()) + for(Node nn : (Iterable)n.parents()) barf(sb, nn, indent, skip, count-1, n.phase().getLocation()); } } - static void barf(HashMap sb, GSS.Phase.Node n, int indent, boolean skip, Input.Location loc) { + static void barf(HashMap 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.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)parent.state()) { if (skip) p = p.next(); int raise = 0; done = false; @@ -97,11 +97,11 @@ public class ParseFailed extends Exception { // FIXME - private static HashSet touched = new HashSet(); - static void complain(GSS.Phase.Node n, HashMap> errors, boolean force, int indent) { + private static HashSet touched = new HashSet(); + static void complain(Node n, HashMap> errors, boolean force, int indent) { if (touched.contains(n)) return; touched.add(n); - for(Position p : n.state) { + for(Position p : (Iterable)n.state()) { //if (!p.isLast() && !p.next().isLast()) continue; if (((p.isFirst() || p.isLast()) && !force)/* || p.owner().name==null*/ || !important(p)) {