I should not have said that, I’m sorry I was really tired, but I think it’s also more complicated than no
Many implementations of “regular expressions” are actually capable of describing more than regular languages
Like Perl/PCRE’s regular expression parser (which I used to write the above regexes) is capable of recursive evaluation and backreferences and probably other stuff I don’t know about cuz I don’t use it very often
I don’t actually know if you can or not but yeah
Tbh, you probably know more about formal language theory than me
You can’t because the regular languages cannot describe properly nested parentheses.
I should not have said that, I’m sorry I was really tired, but I think it’s also more complicated than no
Many implementations of “regular expressions” are actually capable of describing more than regular languages
Like Perl/PCRE’s regular expression parser (which I used to write the above regexes) is capable of recursive evaluation and backreferences and probably other stuff I don’t know about cuz I don’t use it very often
I don’t actually know if you can or not but yeah
Tbh, you probably know more about formal language theory than me