Parses a single character if its contained in the lists of allowed characters
Parses a single character if it passes the predicate
Keeps consuming characters until the predicate pred becomes false.
Very efficiently attempts to parse a set of strings, by first converting it into an array-backed Trie and then walking it once.
Very efficiently attempts to parse a set of strings, by first converting it into an array-backed Trie and then walking it once. If multiple strings match the input, longest match wins.
High-performance intrinsics for parsing common patterns. All of these have equivalent to constructs that can be put together using a combination of "string"s, p1 | p2, and p.rep, but much faster or more convenient.