Builds a parser that consumes any number of consecutive characters which satisfy the specified predicate.
Builds a parser that consumes any number of consecutive characters which satisfy the specified predicate. Always succeeds unless a minimum number of required matches is specified.
Builds a parser that consumes any number of consecutive characters that are not one of the specified characters.
Builds a parser that consumes any number of consecutive characters that are not one of the specified characters. Always succeeds unless a minimum number of required matches is specified.
Builds a parser that consumes any number of consecutive occurrences of the specified characters.
Builds a parser that consumes any number of consecutive occurrences of the specified characters. Always succeeds unless a minimum number of required matches is specified.
Returns an optimized, Array-based lookup function for the specified characters.
Companion with factory methods for creating optimized character parsers.