5 ms·

I mean Regex is Turing complete, so technically…

• Retric 3y ago
  Regular expressions aren’t necessarily Touring complete, some extensions to the standard are.
• alwayslikethis 3y ago
  It isn't, at least in the proper sense. A regular language cannot be Turing complete.
  • sonicanatidae 3y ago
    It's an easy mistake to make. They both are most often used incorrectly by people that poorly understand them.