T ret = bottom(e);
for(Sequence s : (Union)e) {
ret = union((Union)e, ret, walk(s));
+
// FIXME
for(Sequence ss : s.needs()) ret = union((Union)e, ret, walk(ss));
for(Sequence ss : s.hates()) ret = union((Union)e, ret, walk(ss));
public WalkTokenSet(Topology<Tok> cs) { this.cs = cs; }
public WalkTokenSet(Topology<Tok> cs, Cache c) { super(c); this.cs = cs; }
public Topology<Tok> bottom(Element e) { return cs; }
- public Topology<Tok> walkAtom(Atom r) { cs = cs.union(r); return cs; }
+ public Topology<Tok> walkAtom(Atom r) { cs = cs.union(r.getTokenTopology()); return cs; }
}
static class First<Tok extends Input> extends WalkTokenSet<Tok> {
if (e instanceof Sequence) {
Sequence s = (Sequence)e;
- if (s.follow() != null) cs = cs.intersect(s.follow());
+ if (s.follow != null) cs = cs.intersect(s.follow.getTokenTopology());
}
if (c != null && e==me) {