The challenge
Translate human-readable infix expressions into correct deterministic state machines while preserving operator precedence and epsilon transitions.
PROJECT 08 / 2026
Regex to DFA
A console-based compiler theory project that makes the full regex-to-automaton pipeline visible, testable, and easy to reason about.
08
Regex to DFA
TypeAutomata theory engine
Year2026
StackJava / Automata / Algorithms / Compiler theory
CASE STUDY
From problem
to shipped work.
A quick, clear look at the thinking behind the project.
The solution
A modular Java pipeline using postfix conversion, Thompson's construction, epsilon closures, subset construction, and DFA-based string simulation.
The outcome
A documented validator supporting concatenation, union, Kleene star, grouping, transition tables, and accepted or rejected string results.