A regex compiler using NFA/DFA conversion to build lexers on data streams
-
Updated
Sep 6, 2024 - C
A regex compiler using NFA/DFA conversion to build lexers on data streams
The C code that obtains an NFA machine from a regular expression using the Thompson construction algorithm has been shared.
Add a description, image, and links to the regex-to-nfa topic page so that developers can more easily learn about it.
To associate your repository with the regex-to-nfa topic, visit your repo's landing page and select "manage topics."