2 ms·
It’s turing complete so you could compile almost any language to regex. You might have to build a vm for some languages, also in regex. The point is, it’s regex
by karlgkk 5mo ago
It’s turing complete so you could compile almost any language to regex. You might have to build a vm for some languages, also in regex. The point is, it’s regex all the way down.
- Patryk27 5mo agoRegular expressions are not Turing-complete.
- 0xffany 5mo agoTrue in the CS Theory space, but most modern regex engines implement a few niceties which make their "regex" turing complete. https://blog.poisson.chat/posts/2024-06-18-turing-regex.html https://blog.poisson.chat/posts/2024-06-18-turing-regex.html
- benchloftbrunch 5mo agoJavascript/PCRE/etc regexes have additional features (like backreferences) that give them strictly more computational power than a regular DFA/NFA. (Still not Turing complete though without external control flow to support arbitrary iteration/recursion, like is done here)