Expand description
Nondeterministic finite automata with epsilon transitions and algorithms to compile them into optimal deterministic finite automata.
Structs§
- Compiled
- Deterministic finite automata.
- Fuzzer
- Infinite iterator over inputs guaranteed to be accepted by a given automaton.
- Never
Accepts - Tried to fuzz an automaton that never accepts any input.
Enums§
- Parser
- Unevaluated binary operation.
Traits§
- Expression
- Convert to a variety of source-code-related formats.
Functions§
- any
- Accept anything accepted by any of these parsers.
- empty
- Accept only the empty string.
- ignore
- Accept this token if we see it here, but throw it away.
- on
- Accept this token if we see it here, then call this user-defined function on it.
- on_seq
- Accept this sequence of tokens if we see it here, then call this user-defined function on it.
- opt
- Accept either this token or nothing.
- parenthesized
- Surround this language in parentheses. Note that whitespace around the language–e.g. “( A )”–is fine.
- postponed
- Promise a parser that can’t be computed yet (usually because it nests itself).
- seq
- Accept if and only if each parser accepts in order.
- single_
space - A single character of whitespace (or exactly one “\r\n”).
- space
- Any amount of whitespace.