Regular Expressions Parser and Matcher
completedA grep-like regular expression engine built from the ground up in Python.
Similar to grep, this regular expression matcher was built from the ground up
in Python in collaboration with my partner, Sam Monterola.
Overview
The project implements the full pipeline of a regular expression engine:
- Parsing raw regular expressions into an abstract syntax tree.
- Construction of nondeterministic finite automata (NFAs) from that tree.
- Matching input strings against the compiled automaton.
It was completed as the second course project for Theory of Computing (CSE 30151), where the goal was to reinforce the equivalence between regular expressions and finite automata by implementing the construction by hand.