-
regex
regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
-
regex-syntax
A regular expression parser
-
iregex
Intermediate representation for Regular Expressions
-
rust-automata
A framework and a DSL for building finite state machines in Rust
-
derive-finite-automaton
Procedural macro for generating finite automaton
-
lexviz
A customizable lexical analyser tool which also allows you to visualize the NFAs and DFAs generated
-
enso-automata
A finite-automata-based lexing engine
-
enso-flexer
A finite-automata-based lexing engine
-
inator
Optimal zero-copy parsers with nondeterministic finite automata
-
rure
A C API for Rust's regular expression library
-
automafish
state machine builder for creating deterministic state machines out of nondeterministic state machine definitions
-
rustlex_fsa
manipulating (deterministic) finite automata
-
finite-automata
A collection of extendable finite automata with immutable state and transition data
-
regex_macros
statically compiled regular expressions for Rust. Unless you specifically need compile time regular expressions or a matching engine that is guaranteed not to allocate, you should temporarily prefer using…
-
pure-hfsm
A finite state machine library with a clear separation between the machine definition and its changing state
-
regex_dfa
turning regexes into DFAs
-
fa
Foreign-function interface wrapper of the Augeas libfa Finite Automata library
-
libfa-sys
Native bindings to the Augeas libfa Finite Automata library
Try searching with DuckDuckGo.