no longer need to thread a Grammar through Parser.Table

[sbp.git] / src / edu / berkeley / sbp / Union.java

diff --git a/src/edu/berkeley/sbp/Union.java b/src/edu/berkeley/sbp/Union.java
index a0660e3..8f3ea2e 100644 (file)
--- a/src/edu/berkeley/sbp/Union.java
+++ b/src/edu/berkeley/sbp/Union.java
@@ -74,12 +74,12 @@ public class Union extends Element implements Iterable<Sequence> {
     }
 
     /** the Forest which results from matching this Union against the empty string at region <tt>region</tt> */
-    Forest epsilonForm(Input.Region region, Grammar cache) {
+    Forest epsilonForm(Input.Region region) {
         viewed = true;
         Forest.Many epsilonForm = new Forest.Many();
         for(Sequence s : this)
-            if (cache.possiblyEpsilon(s))
-                epsilonForm.merge(s.epsilonForm(region, cache));
+            if (Element.possiblyEpsilon(s))
+                epsilonForm.merge(s.epsilonForm(region));
         return epsilonForm;
     }