An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
-
Updated
May 8, 2024 - Rust
An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
Fortran port of the tiny-regex-c library
This repository provides a lexer and parser for the Pascal programming language. Both lexer and parser can generate errors indicating the location in the code.
Deterministic Finite-State Automata Library for Rust, written in L1
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."