some simplifications to GSS, ResultNode, and StateNode

[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 56ee0ca..bfc022d 100644 (file)
--- a/src/edu/berkeley/sbp/Parser.java
+++ b/src/edu/berkeley/sbp/Parser.java
@@ -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, ResultNode 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 //////////////////////////////////////////////////////////////////////////////