Data.BoolExpr.Parser

Parsing function

parseBoolExpr :: CharParser st a -> CharParser st (BoolExpr a)

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

languageDef :: LanguageDef st

Basic language definition for search queries. Reserved names are "AND" "OR" and "-". Identifiers accepts almost every ASCII sequences without blanks nor '-'.

lexer :: TokenParser st

Underlying lexer of languageDef

identifier :: CharParser st String

Shorthand for identifier lexer.

whiteSpace :: CharParser st ()

Shorthand for whiteSpace lexer.

symbol :: String -> CharParser st String

Shorthand for symbol lexer.