cls = new NodeClassFilter (TableTag.class);
recursion = new HasParentFilter (null);
filter = new OrFilter (
new AndFilter (
cls,
new IsEqualFilter (this)),
new AndFilter ( // recurse up the parent chain
new NotFilter (cls), // but not past the first table
recursion));
recursion.setParentFilter (filter);
kids = kids.extractAllNodesThatMatch (