Match pattern begin func end, return the result of func.
Match p but discard the result
Skip p zero or more times
Match u but doesn't consume anything from the input range
Like many_r but with default reduce function that put all return values into an array, or return number of matches
Optionally matches p
Appply a sequence of parsers one after another.
Match one of the given pattern. Remembers the matching parser. Repeated invocation will keep invoking the parser matched the first time.
First invocation matches p. Following invocations matches delim p
Generate a new parser that applies m to outputs of parser p
Combinators