This is a simple Thompson Construction Algorithm implemented in Java.
TODO: Bugs for certain cases. Caused in stack parsing. Switch from stack parsing to Recursive Top Down parsing.
Derek S. Prijatelj
forked from prijatelj/thompson-construction
-
Notifications
You must be signed in to change notification settings - Fork 0
Wujianqiu/thompson-construction
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Java implementation of Thompson Construction Algorithm for converting regular expressions into non-deterministic finite automata (NFAs)
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published
Languages
- Java 100.0%