Converting Regular Expressions to Non-Deterministic Finite Automata through an Automated Framework

A Regular Expression, often abbreviated as Regex, are a sequence of characters that define a search pattern. An Non-deterministic Finite Automata (NFA) is a computational machine which can be in any one of many finite states at any given point of time, and transitions between these states, allowing for non deterministic behavior. Regular expressions, while beneficial for defining string patterns, require human conversion into NF for identification. This project aims to build a compiler which converts Regular Expressions into NFA to bridge the gap between the theoretical and computing worlds. This would be achieved using a Python based framework.