Mark --
Yes please! I'm very interested in the mixing of boolean and proximity
operators. I have also worked on a parser (using JavaCC) but haven't
managed to crack queries such as:
((a OR b) AND c) NEAR (d NOT e)
I can get the parse tree okay, but haven't figured out how to translate
that into a valid Lucene Query object. Simple queries such as:
(a OR b) NEXT (c OR d) // note the use of OR exclusively!
are okay, but nothing more complex. So: bring it on!
-- Robert
rwatkins at foo-bar.org
On Mon, 21 Aug 2006, Mark Miller wrote:
Is anyone interested in helping me test out a new query parser (i.e is
anyone interested in using this, thereby helping me test it) ?
The parser uses a intermediate parse tree representation, unlike Lucene's
Query Filter.
[ snipped ]
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
