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
From-Scratch Regular Expression Engine in C.
⚡ A modern, regex-only YouTube signature deciphering library written in Python. Fully dynamic parser – no JavaScript, no execution, no AST. Latest obfuscation fully supported.
A Regular Languages Simulator to help CS students understand and experiment with everything Regular Languages 📕 Includes Regular Expressions (Regexes), DFAs, NFAs, as well as functionality and UI for converting back and forth between them ♻️
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
A minimalist, human-readable programming language that compiles to Go
Professional AdTech utility for automated AppID extraction. Scans HTML/URLs to identify Google Play Package Names and App Store IDs using optimized Regex. Features multi-source processing, deduplication, and a multilingual Streamlit UI.
Regex Parsing with a Lexer, Parser & Matcher. Supporting: ".*+?()[]^-|" with an Abstract Syntax Tree, Alternation & Repetition Operators
Lexer and parser generator without any dependencies.
Simple regex implementation
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."