Gregex is a regular expression solver which utilizes Non-deterministic Finite Automata (NFA) to simulate the input strings.
-
Notifications
You must be signed in to change notification settings - Fork 0
Provides a regular expression engine that uses a Nondeterministic finite automaton to simulate the regular expression
License
Saphereye/gregex
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Provides a regular expression engine that uses a Nondeterministic finite automaton to simulate the regular expression
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published