An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
-
Updated
Nov 11, 2024 - Rust
An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
A low level regular expression library that uses deterministic finite automata.
Manipulate regex and automaton as if they were sets.
Deterministic Finite-State Automata Library for Rust, written in L1
A regex engine for encrypted content (resulting in an encrypted answer)
A library for parsing, compiling, and executing regular expressions.
Potata regex engine
A regex implementation in rust for strings of generic tokens
A regex compiler, using Thompson's construction
Add a description, image, and links to the regex-engine topic page so that developers can more easily learn about it.
To associate your repository with the regex-engine topic, visit your repo's landing page and select "manage topics."