I accidentally wrote a Turing-complete parsing library
I'm currently working on lexy, a C++ parsing DSL library:
you describe how input should be parsed, and lexy generates code for it, taking care of error recovery, parse tree generation, and parse values.
Such parser generators are classified based on the expressiveness of the corresponding formal language.
For example, a strict regular expression can only parse regular languages, which is a strict subset of a…