X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FParser.java;h=bfc022dd43bb68e86fcaba97d1f4a3bd01c56de2;hp=e5cd67cbeccd21cf65ef61ae9356a49486cb0dd9;hb=HEAD;hpb=24219bdf084b45273e869cd19382d1640b396566

diff --git a/src/edu/berkeley/sbp/Parser.java b/src/edu/berkeley/sbp/Parser.java
index e5cd67c..bfc022d 100644
--- 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,9 +354,9 @@ 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) {
-                if (t==null) for(Pos r : eofReductions) node.invoke(r, b, null);
-                else         oreductions.invoke(t, node, b, null);
+            void          invokeReductions(Token t, StateNode node, ResultNode only) {
+                if (t==null) for(Pos r : eofReductions) node.invoke(r, only, null);
+                else         oreductions.invoke(t, node, only, null);
             }
 
             // Constructor //////////////////////////////////////////////////////////////////////////////