Compile and evaluate regular expressions using Non-deterministic Finite Automata (NFAs).
-
Updated
Mar 24, 2026 - Gleam
Compile and evaluate regular expressions using Non-deterministic Finite Automata (NFAs).
A simple regex-to-golang compiler based on Thompson's construction algorithm.
A Tool for Drawing the DFA/NFA of a Regex for a Regular Language
implementation of automata in r7rs scheme
Simple regular expression interpreter
thompson constructor.
A Python program to build Non-Deterministic Finite Automatons from Regular Expressions using Thompson’s construction.
C implementation of Regular Expression Parser and Non-Deterministic Automaton Generator, i.e. Thompson Construction.
Potata regex engine
Regex matcher using Thompson’s construction.
A "mini" regular expressions matcher
University course project on Data Structures and Algorithms
Regular Expression matching library
Implementación de análisis léxico usando automatas
Compiler Construction project to create our own programming language.
Compiler Algorithms to implement a Lexical Analysis
Add a description, image, and links to the thompson-construction topic page so that developers can more easily learn about it.
To associate your repository with the thompson-construction topic, visit your repo's landing page and select "manage topics."