Compile and evaluate regular expressions using Non-deterministic Finite Automata (NFAs).

A Tool for Drawing the DFA/NFA of a Regex for a Regular Language

A simple regex-to-golang compiler based on Thompson's construction algorithm.

implementation of automata in r7rs scheme

thompson constructor.

Simple regular expression interpreter

A Python program to build Non-Deterministic Finite Automatons from Regular Expressions using Thompson’s construction.

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.

Regex matcher using Thompson’s construction.

Potata regex engine

C implementation of Regular Expression Parser and Non-Deterministic Automaton Generator, i.e. Thompson Construction.

Laboratorio 1 A Diseño de Lenguajes de Programación

Regular Expression matching library

A "mini" regular expressions matcher

Compiler Algorithms to implement a Lexical Analysis

University course project on Data Structures and Algorithms

A grep-alike CLI backed by a from-scratch Thompson-NFA regex engine — no backtracking, no built-in RegExp.

Compiler Construction project to create our own programming language.

Implementación de análisis léxico usando automatas