X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FElement.java;h=33bfd8d7d08f5027e136aef1eaff959dfbf92ce7;hp=5f55be697e74ed325aa9cc2d4c83b3f2aefc7ecc;hb=5d18f5606c9296e6b0c5749f05fc68f358ace2f6;hpb=2690f6c749f117a103c57d651d89f1b4fbf1316d

diff --git a/src/edu/berkeley/sbp/Element.java b/src/edu/berkeley/sbp/Element.java
index 5f55be6..33bfd8d 100644
--- a/src/edu/berkeley/sbp/Element.java
+++ b/src/edu/berkeley/sbp/Element.java
@@ -10,16 +10,9 @@ import java.lang.ref.*;
 /** the root superclass for all components of the grammar (terminals, nonterminals, literals, etc) */
 public abstract class Element {
 
-    /** add all positions reachable from the start of this Element to @rp */
-    abstract void reachable(HashSet<Sequence.Position> rp);
+    abstract StringBuffer toString(StringBuffer sb);
+
+    /** if this element always matches exactly one token, return a topology covering exactly those possible tokens, otherwise <tt>null</tt> */
+    Forest epsilonForm() { return null; }
 
-    abstract Topology toAtom();
-    Forest epsilonForm() { throw new Error("no epsilon form: " + this); }
-    final boolean possiblyEpsilon(Walk.Cache cache)   {
-        Boolean ret = cache==null ? null : cache.possiblyEpsilon.get(this);
-        if (ret != null) return ret.booleanValue();
-        ret = new Walk.PossiblyEpsilon().walk(this) ? Boolean.TRUE : Boolean.FALSE;
-        if (cache != null) cache.possiblyEpsilon.put(this, ret);
-        return ret;
-    }
 }