Message from JavaScript discussions

August 2017

— Some regex with overlapping terminals may cause problems but it's just an extra case

—

The hard part is writing the parser to turn the regex into DFA... but that itself can possibly be made out of a DFA too

— Well, if they are truly regular

— Like I said, what you call "regex" today is not necessarily regular anymore but can be context free or even context sensitive

— For example, using the results of captures inside of your match or using lookahead

— Dfa are context free

— All context free langs can be understood by automata

— Not afaik

— I wrote a compiler compiler in C++ that does it :P

— That can't work

— You can't do infinite recursion with a DFA

— You need a stack, so it's a pushdown thing or whatever it's called