Return either left (higher precedence) or right parser.
Join two parsers together, returning a pair if successful.
Applies a parser repeatedly, delimited by a separator until it fails.
For building recursive parsers, delays getting the parser until it's applied.
Returns a successful, even if parsing failed. The unsucessful result is represented as 'null'.
Base parser class with abstract operators.
Top-level parser, consumes all tokens passed.
Manipulates an array of Result values, reducing the result down to a single element.
Applies a parser repeatedly until it fails.
Parse individual reserved keyword or operator.
Parse individual token that matches a particular lex.Tag
// Combinators ///// All combinators return a result.