Compile and evaluate regular expressions using Non-deterministic Finite Automata (NFAs).
-
Updated
May 21, 2025 - Gleam
Compile and evaluate regular expressions using Non-deterministic Finite Automata (NFAs).
A simple regex-to-golang compiler based on Thompson's construction algorithm.
implementation of automata in r7rs scheme
A Tool for Drawing the DFA/NFA of a Regex for a Regular Language
thompson constructor.
Simple regular expression interpreter
A Python program to build Non-Deterministic Finite Automatons from Regular Expressions using Thompson’s construction.
Potata regex engine
An application that renders a Finite Automaton Diagram from an input text real-time.
Compiler Algorithms to implement a Lexical Analysis
University course project on Data Structures and Algorithms
Regular Expression matching library
C implementation of Regular Expression Parser and Non-Deterministic Automaton Generator, i.e. Thompson Construction.
Implementación de análisis léxico usando automatas
Regex matcher using Thompson’s construction.
Compiler Construction project to create our own programming language.
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."