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.
Deterministic Finite-State Automata Library for Rust, written in L1
Lexer and parser generator without any dependencies.
Add a description, image, and links to the regex-parser topic page so that developers can more easily learn about it.
To associate your repository with the regex-parser topic, visit your repo's landing page and select "manage topics."