Skip to content
Mac app that converts a formal regular expression to an ε-NFA and visualizes it in the form of a transition table.
Objective-C Python C
Find file
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Failed to load latest commit information.
Regex Visualizer
.gitignore
LICENSE.txt
README.markdown

README.markdown

Download here

Description

This is an application I made to try and grasp automata and regular expressions.

It converts a formal regular expression to an ε-NFA and visualizes it in the form of a transition table. It uses the algorithm described in section 3.2.3 of "Introduction to Automata Theory, Languages & Computation" to create the ε-NFA; thus, the NFA has not been minimized at all and it is not efficient by any means. However, all the parsing is done with a Python script which can be easily extended to apply the minimization techniques described in the next chapter.

Only formal regular expression notation is currently supported; that is, the +, *, (, and ) operators.

Screenshot

Main window

License

This project is released under the MIT License.

Something went wrong with that request. Please try again.