Converting Regular Expressions to Finite Automata in C++

https://github.com/inumerics/parser Source code for converting regular expressions into finite automata. Part 2 of a series on writing a parser generator in C++. This video shows how to program a converter to transform regular expressions into finite state machines to recognize tokens. https://github.com/inumerics/parser/blob/main/lexer/regex.cpp