X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FParser.java;h=6986a4b900de9f22a9fe3416159d17eac25d684d;hp=046e725fcd90da6543f03d7eee099f4b4a97071c;hb=6caa23ec64fa689a91c0b81238d04ff7322a945c;hpb=d3a56050406bda802d0dc4b3c24f83cbb0c06620

diff --git a/src/edu/berkeley/sbp/Parser.java b/src/edu/berkeley/sbp/Parser.java
index 046e725..6986a4b 100644
--- a/src/edu/berkeley/sbp/Parser.java
+++ b/src/edu/berkeley/sbp/Parser.java
@@ -153,7 +153,7 @@ public class Parser<T extends Token, R> {
                     // if the element following this position is an atom, copy the corresponding
                     // set of rows out of the "master" goto table and into this state's shift table
                     if (p.element() != null && p.element() instanceof Atom)
-                        state.shifts.addAll(state.gotoSetTerminals.subset(((Atom)p.element()).top()));
+                        state.shifts.addAll(state.gotoSetTerminals.subset(((Atom)p.element()).dup()));
                 }
         }
 
@@ -224,7 +224,7 @@ public class Parser<T extends Token, R> {
                     Atom a = (Atom)position.element();
                     HashSet<Position> hp = new HashSet<Position>();
                     position.next().reachable(hp);
-                    bag0.addAll(a.top(), /*clo.walk()*/hp);
+                    bag0.addAll(a.dup(), /*clo.walk()*/hp);
                 }
 
                 // Step 1b: for each _minimal, contiguous_ set of characters having an identical next-position