A simple regex-to-golang compiler based on Thompson's construction algorithm.
-
Updated
Jul 16, 2022 - Go
#
thompson-construction
Here are 17 public repositories matching this topic...
Compile and evaluate regular expressions using Non-deterministic Finite Automata (NFAs).
-
Updated
May 4, 2025 - Gleam
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 17, 2022 - Python
Regular expression matching program
-
Updated
Jun 26, 2024 - Python
Potata regex engine
-
Updated
Mar 31, 2024 - Rust
C implementation of Regular Expression Parser and Non-Deterministic Automaton Generator, i.e. Thompson Construction.
-
Updated
Jun 5, 2024 - C
Compiler Algorithms to implement a Lexical Analysis
-
Updated
Jan 6, 2023 - C#
Regex matcher using Thompson’s construction.
-
Updated
Jan 10, 2025 - 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
Regular Expression matching library
-
Updated
Jul 26, 2022 - C++
University course project on Data Structures and Algorithms
-
Updated
Oct 29, 2022 - Java
An application that renders a Finite Automaton Diagram from an input text real-time.
-
Updated
Dec 5, 2024 - Dart
Implementación de análisis léxico usando automatas
-
Updated
Jun 20, 2024 - Python
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."