4 ms·
I know about them. That's why I added my criteria of Turing completeness. But perhaps I am wrong. Has anyone written a production grade regex engine in say, Coq
by burntsushi 10y ago
I know about them. That's why I added my criteria of Turing completeness. But perhaps I am wrong. Has anyone written a production grade regex engine in say, Coq or Agda? Can they prevent all possible invalid states? Can they support searching text of arbitrary length?
- eru 10y agoArbitrary length shouldn't be a problem. Agda and co are not restricted to programs of finite runtime. Not sure about production grade, but Google has plenty of results for "Agda regular expressions".