Logged In: NO

A further step would be support of boolean grammars, which allow not only unions, but also intersections and difference operations, as described here:
http://www.megacz.com/research/megacz,adam-sbp.a.scannerless.boolean.parser.pdf
http://research.cs.berkeley.edu/project/sbp/