GLR, LR(1) LALR(1) parser generator for Rust with custom reduce action
-
Updated
Sep 20, 2024 - Rust
GLR, LR(1) LALR(1) parser generator for Rust with custom reduce action
An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
Finite-state machines for Rust
Formális nyelvek labor feladatok 2023 - Sapientia EMTE
Email id parser for email address as defined in RFC5322 'addr-spec' using Finite Automaton implemented in Rust.
A low level regular expression library that uses deterministic finite automata.
Deterministic Finite-State Automata Library for Rust, written in L1
Simulations of deterministic finite automata in different languages!
Add a description, image, and links to the dfa topic page so that developers can more easily learn about it.
To associate your repository with the dfa topic, visit your repo's landing page and select "manage topics."