Skip to content

Latest commit

 

History

History
8 lines (7 loc) · 520 Bytes

README.md

File metadata and controls

8 lines (7 loc) · 520 Bytes

Toy project that checks whether a string matches a given regex or not.

It is mostly based on an article by Russ Cox in an attempt to build a minimal regex engine inspired by Thompson's construction algorithm. The main purpose of this exercise is to play with NFA, DFA and regex. It is by no means a finished regex library and it deliberately omits support for some of the regex features like lookaheads etc.