X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FParseFailed.java;h=872ffacb1e421559a85974b9cef44d5303c82925;hp=7a3416ed6780ea2c8c796537eb5f68f0b7ae7ba7;hb=24219bdf084b45273e869cd19382d1640b396566;hpb=14b3d2ee6a2d2ef84628e541ec291961f2061a5a

diff --git a/src/edu/berkeley/sbp/ParseFailed.java b/src/edu/berkeley/sbp/ParseFailed.java
index 7a3416e..872ffac 100644
--- a/src/edu/berkeley/sbp/ParseFailed.java
+++ b/src/edu/berkeley/sbp/ParseFailed.java
@@ -5,7 +5,7 @@ import edu.berkeley.sbp.*;
 import edu.berkeley.sbp.Sequence.Pos;
 import edu.berkeley.sbp.Sequence.Pos;
 import edu.berkeley.sbp.GSS.Phase;
-import edu.berkeley.sbp.Node;
+import edu.berkeley.sbp.StateNode;
 import edu.berkeley.sbp.util.*;
 import java.io.*;
 import java.util.*;
@@ -47,23 +47,23 @@ public class ParseFailed extends Exception {
         return (c >= 'A' && c <= 'Z');
     }
 
-    static <Tok> void barf(HashMap<Element,Input.Location> sb, Node n, int indent, boolean skip, int count, Input.Location loc) {
+    static <Tok> void barf(HashMap<Element,Input.Location> sb, StateNode 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())
+            for(StateNode nn : (Iterable<StateNode>)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) {
+    static <Tok> void barf(HashMap<Element,Input.Location> sb, StateNode 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;
+        StateNode parent = n;
         boolean done = false;
         boolean alldone = false;
         boolean go = false;
@@ -102,8 +102,8 @@ public class ParseFailed extends Exception {
 
 
     // FIXME
-    private static HashSet<Node> touched = new HashSet<Node>();
-    static <Tok> void complain(Node n, HashMap<String,HashSet<String>> errors, boolean force, int indent) {
+    private static HashSet<StateNode> touched = new HashSet<StateNode>();
+    static <Tok> void complain(StateNode n, HashMap<String,HashSet<String>> errors, boolean force, int indent) {
         if (touched.contains(n)) return;
         touched.add(n);
         for(Pos p : (Iterable<Pos>)n.state()) {
@@ -112,7 +112,7 @@ public class ParseFailed extends Exception {
                 !important(p)) {
             /*
               FIXME: removed
-                for(Node n2 : n.parents())
+                for(StateNode n2 : n.parents())
                     complain(n2, errors, force
                     //| p.isFirst()
                 , indent);
@@ -150,7 +150,7 @@ public class ParseFailed extends Exception {
     }
     private static void error(String message,
                               Object token,
-                              Iterable<Node> nodes,
+                              Iterable<StateNode> nodes,
                               Input.Region region,
                               Input input,
                               GSS gss) throws ParseFailed{
@@ -184,7 +184,7 @@ public class ParseFailed extends Exception {
             */
         }
         HashMap<Element,Input.Location> hm = new HashMap<Element,Input.Location>();
-        for(Node no : nodes)
+        for(StateNode no : nodes)
             barf(hm, no, 0, false, region.getStart());
         ret.append("\n expected: ");
         Set<Element> hs = hm.keySet();
@@ -207,7 +207,7 @@ public class ParseFailed extends Exception {
         /*
         ret.append("\n  The author of SBP apologizes for the these nearly-useless error messages:\n\n");
         HashMap<String,HashSet<String>> errors = new HashMap<String,HashSet<String>>();
-        for(Node n : nodes) {
+        for(StateNode n : nodes) {
             //System.out.println(n.state);
             complain(n, errors, false, 0);
         }