X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FGSS.java;h=6d5f8abaa6d238ec72fc4f1f1ae082df727fdbbe;hp=26b64486bf81c7ee4e323ad600851ac65146cbe0;hb=4989eef7b4c4ff06e54f89ffd78b1483da088d6e;hpb=ea98ead8a9a46a7314da6faac96a31bfecd7002b

diff --git a/src/edu/berkeley/sbp/GSS.java b/src/edu/berkeley/sbp/GSS.java
index 26b6448..6d5f8ab 100644
--- a/src/edu/berkeley/sbp/GSS.java
+++ b/src/edu/berkeley/sbp/GSS.java
@@ -122,11 +122,10 @@ class GSS {
             reducing = true;
             HashSet<Phase.Node> s = new HashSet<Phase.Node>();
             s.addAll(hash.values());
+            //while(pendingReduct.size()>0)
+            //pendingReduct.removeFirst().go();
             for(Phase.Node n : s) n.queueEmptyReductions();
             for(Phase.Node n : s) n.queueReductions();
-            while(pendingReduct.size()>0)
-                //pendingReduct.iterator().next().go();
-                pendingReduct.removeFirst().go();
         }
 
         /** perform all shift operations, adding promoted nodes to <tt>next</tt> */
@@ -207,9 +206,12 @@ class GSS {
                     queueReductions(n2);
             }
 
+            private HashSet<Node> queued = new HashSet<Node>();
             /** FIXME */
             public void queueReductions(Node n2) {
-                newReduct(this, n2, null);
+                if (queued.contains(n2)) return;
+                queued.add(n2);
+                new Reduct(this, n2, null).go();
             }
 
 
@@ -232,10 +234,6 @@ class GSS {
             }
         }
 
-        public void newReduct(Node n, Node n2, Parser.Table.Reduction r) {
-            new Reduct(n, n2, r)/*.go()*/;
-        }
-
         // Forest / Completed Reductions //////////////////////////////////////////////////////////////////////////////
 
         /** a pending or completed reduction */
@@ -261,11 +259,11 @@ class GSS {
                 this.n = n;
                 this.n2 = n2;
                 this.r = r;
-                if (reductions.contains(this)) { done = true; return; }
+                //if (reductions.contains(this)) { done = true; return; }
                 reductions.add(this);
                 pendingReduct.addFirst(this);
                 pendingReductions++;
-                //if (reducing) go();
+                go();
             }
 
             /** perform the reduction */
@@ -295,17 +293,15 @@ class GSS {
                         // children wind up being children of the newly
                         // created node rather than part of the popped
                         // sequence
-                        
+                        if (r.numPop <= 0) continue;
                         if (r.numPop == 1) {
                             Forest ret = n.cache().get(r);
                             if (ret != null) r.reduce(n, n2, n.phase, ret);
                             else n.cache().put(r, r.reduce(n, n2, n.phase, null));
+                        } else {
+                            r.reduce(n, n2, Phase.this, null);
                         }
                     }
-                    for(Parser.Table.Reduction r : token==null ? n.state.getEofReductions() : n.state.getReductions(token)) {
-                        if (r.numPop <= 1) continue;
-                        r.reduce(n, n2, Phase.this, null);
-                    }
                 } else if (r.numPop != 1) {
                     r.reduce(n, n2, Phase.this, null);
                 }