A simple regex-to-golang compiler based on Thompson's construction algorithm.
-
Updated
Jul 16, 2022 - Go
#
thompson-construction
Here are 12 public repositories matching this topic...
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
Potata regex engine
-
Updated
Mar 31, 2024 - Rust
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 Algorithms to implement a Lexical Analysis
-
Updated
Jan 6, 2023 - C#
Regular Expression matching library
-
Updated
Jul 26, 2022 - C++
University course project on Data Structures and Algorithms
-
Updated
Oct 29, 2022 - Java
A graphical application that checks a regular expression and checks that the entered word belongs to it
-
Updated
Jan 26, 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."