This is a cpp program to convert a given regular expression to NFA (Non finite Automata)
The final output of the program is the transition table, which gives the state change on input.
-
Notifications
You must be signed in to change notification settings - Fork 11
imehar/regular-expression-to-NFA
About
A program to convert the given regular expression to Non Definite Automata (NFA)
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published