rename Result->ResultNode

[sbp.git] / src / edu / berkeley / sbp / Parser.java

diff --git a/src/edu/berkeley/sbp/Parser.java b/src/edu/berkeley/sbp/Parser.java
index e5cd67c..56ee0ca 100644 (file)
--- a/src/edu/berkeley/sbp/Parser.java
+++ b/src/edu/berkeley/sbp/Parser.java
@@ -314,7 +314,7 @@ public abstract class Parser<Token, NodeType> implements Serializable {
          *  some future reduction from a non-doomed StateNode.  Because of
          *  this, we "garbage-collect" Nodes with doomed states if
          *  there are no more non-doomed Nodes which they could
-         *  affect (see Result, Reduction, and StateNode for details).
+         *  affect (see ResultNode, Reduction, and StateNode for details).
          *
          *  Without this optimization, many seemingly-innocuous uses
          *  of positive and negative conjuncts can trigger O(n^2)
@@ -354,7 +354,7 @@ public abstract class Parser<Token, NodeType> implements Serializable {
                 if (t==null) for(Pos r : eofReductions) node.invoke(r, null, null);
                 else         oreductions.invoke(t, node, null, null);
             }
-            void          invokeReductions(Token t, StateNode node, Result b) {
+            void          invokeReductions(Token t, StateNode node, ResultNode b) {
                 if (t==null) for(Pos r : eofReductions) node.invoke(r, b, null);
                 else         oreductions.invoke(t, node, b, null);
             }