I emailed Gustavo earlier today but this belongs on the mailing list.
I am working on a project called skdb, which is "apt-get for real
stuff!". You don't need to read the wiki to understand this email
though-
http://adl.serveftp.org/dokuwiki/skdb
In skdb, packages have dependencies of various sorts. Unlike in debian
or gentoo, there is also this concept of a "dependency set". What this
means is that you can have X, Y, and Z, or you can have A, B, and C,
and at least one of these sets must be satisfied in order to be able
to install a package. So, it would be amazingly awesome if users can
write in their packages something like "( (X and Y) or (A and B) ) and
(G)" which should parse to a tree like:
- and:
- or:
- and:
- X
- Y
- and:
- A
- B
- G
(In other words a boolean expression tree.)
Looking at the booleano documentation, most queries look of the form:
book:title is "blah" or book:pages > 50
But in this context, I am not searching for an individual item, but
rather the existence of a particular set. Does anyone know how to do
this with booleano? Should I write my own module with pyparsing?
Thanks!