Parse a search query as a boolean tree using the following grammar. Note that this parser is parameterized over the parser of query simple terms (const).
bt ::= bt AND bt | bt bt -- same as AND | bt OR bt | - bt | ( bt ) | const const ::= <given as argument>
Language definition and components
Basic language definition for search queries.
Reserved names are
Identifiers accepts almost every ASCII sequences without blanks nor