Given that we tend to pretend that our computers are Turing machines with infinite memory, while in fact they are finite-state ones, corresponding to regular ex

Given that we tend to pretend that our computers are Turing machines with infinite memory, while in fact they are finite-state ones, corresponding to regular expressions, and the "proper" parsers are parts of those, I am now curious whether there are projects compiling those parsers to huge regexps, in the format compatible with common regexp engines. Though perhaps there is no reason to limit such compilation to parsers.