X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FGSS.java;h=a4f3d6a8688048fce734ad50b9815b820117cd72;hp=5847d6ba32a261709b3629a2e3653e5232b037c1;hb=e4f373b56b1cdc2c086c0b86e5ec45bad784df0e;hpb=69965bfd571a733f573e2adc7fae06a653c83cae

diff --git a/src/edu/berkeley/sbp/GSS.java b/src/edu/berkeley/sbp/GSS.java
index 5847d6b..a4f3d6a 100644
--- a/src/edu/berkeley/sbp/GSS.java
+++ b/src/edu/berkeley/sbp/GSS.java
@@ -186,9 +186,6 @@ class GSS {
             private Forest.Ref holder = null;
             private boolean allqueued = false;
 
-            /** the set of nodes to which there is an edge starting at this node */
-            //public final FastSet<Node> parents = new FastSet<Node>();  /* ALLOC */
-
             /** what state this node is in */
             public final Parser.Table.State state;
 
@@ -212,7 +209,7 @@ class GSS {
                 if (!allqueued) { queueReductions(); return; }
                 for(Parser.Table.Reduction r : state.getReductions(token))
                     if (r.numPop > 0)
-                        r.reduce(this, n2, null);
+                        r.reduce(this, n2);
             }