Compile and evaluate regular expressions using Non-deterministic Finite Automata (NFAs).
-
Updated
Mar 24, 2026 - Gleam
#
thompson-construction
Here are 20 public repositories matching this topic...
A Tool for Drawing the DFA/NFA of a Regex for a Regular Language
regular-expression nfa dfa formal-languages automata-theory dfa-minimization finite-automata nfa-to-dfa-conversion thompson-construction regex-to-automata powerset-construction
-
Updated
May 29, 2025 - Python
A simple regex-to-golang compiler based on Thompson's construction algorithm.
-
Updated
Jul 16, 2022 - Go
implementation of automata in r7rs scheme
scheme automata regular-expression r7rs finite-state-machine automaton regular-expressions r7rs-scheme thompson-algorithm thompson-construction
-
Updated
Apr 5, 2022 - Scheme
thompson constructor.
-
Updated
Jan 4, 2021 - C
Simple regular expression interpreter
-
Updated
Mar 9, 2023 - Haskell
A Python program to build Non-Deterministic Finite Automatons from Regular Expressions using Thompson’s construction.
-
Updated
Aug 11, 2025 - Python
Browser-based regex and finite-automata visualizer for CPSC 351: regex to NFA/DFA, minimization, NFA-to-regex, closure constructions, the pumping lemma, equivalence-graded challenges, and step-by-step simulation, in course-exact notation. Client-side, accessible, no backend. A companion to the AArch64 Playground.
react visualization computer-science typescript accessibility regex educational cytoscape nfa regular-expressions dfa theory-of-computation automata-theory dfa-minimization finite-automata vite pumping-lemma thompson-construction
-
Updated
Jun 18, 2026 - TypeScript
Regex matcher using Thompson’s construction.
-
Updated
Jan 10, 2025 - C
Potata regex engine
-
Updated
Mar 31, 2024 - Rust
Regular Expression matching library
-
Updated
Jul 26, 2022 - C++
Compiler Algorithms to implement a Lexical Analysis
-
Updated
Jan 6, 2023 - C#
University course project on Data Structures and Algorithms
-
Updated
Oct 29, 2022 - Java
C implementation of Regular Expression Parser and Non-Deterministic Automaton Generator, i.e. Thompson Construction.
-
Updated
Jun 5, 2024 - C
A "mini" regular expressions matcher
cplusplus cpp pattern-matching regex stl nfa compiler-design shunting-yard-algorithm regex-engine non-deterministic-finite-automaton automata-theory scratch-implementation thompson-construction
-
Updated
Jun 21, 2026 - C++
compilers deterministic-finite-automata nondeterministic-finite-automata regex-to-nfa nfa-to-dfa-conversion thompson-construction minimized-dfa
-
Updated
Apr 16, 2024 - Jupyter Notebook
Compiler Construction project to create our own programming language.
regex lexical-analysis symbol-table parse-trees compiler-construction subset-construction thompson-construction
-
Updated
Feb 20, 2025 - Java
Implementación de análisis léxico usando automatas
-
Updated
Jun 20, 2024 - Python
Web-based Universal Automata Translator — converts between RE, NFA, DFA, CFG, and string sets with live interactive visualization. Built for CS416 Theory of Computing at Future University in Egypt.
react automata nfa regular-expressions dfa context-free-grammar finite-automaton thompson-construction theory-of-computing
-
Updated
May 1, 2026 - JavaScript
Improve this page
Add a description, image, and links to the thompson-construction topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the thompson-construction topic, visit your repo's landing page and select "manage topics."