Seems like it shouldn't be too hard. You'd need a Java object for the
condition, which has the comparison value and a reference to the
operator (which I assume is going to be optional, since otherwise you'd
always have an infinite tree). Then the binding would be something like
this:
Have you looked at the way Ant does conditions? That might give you
some insight.
-Original Message-
I'm trying to model recursive structures, like something that allows me
to build a SQL WHERE clause. That means it can include comparisons (like
a = b), and, or, and not. The problem I'm
I'm trying to model recursive structures, like something that allows me
to build a SQL WHERE clause. That means it can include comparisons (like
a = b), and, or, and not. The problem I'm having is that I can't seem to
get it as simple as I'd like.
What I want is to have a condition be a , an , an
