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

Regular Expression Parser coded in C programming language.

Deterministic Finite-State Automata Library for Rust, written in L1

Regex Parsing with a Lexer, Parser & Matcher. Supporting: ".*+?()[]^-|" with an Abstract Syntax Tree, Alternation & Repetition Operators

Simple regex implementation

Lexer and parser generator without any dependencies.