Regex limiataion and Turing completeness
There is a question here
Are .NET's regular expressions Turing complete?
When I asked another question here if there's some powerful pattern
matching library in JS, for some reason. people didn't like my question.
Some people imply it's because I deny Regex poiting out it's not
TuringComplete, and I should have present my own certain task with regex.
I also think this request is totally pointless.
Having said that, let me make clear.
Regular Expression Lookbehind doesn't work with quantifiers ('+' or '*')
After some work, I found this issue by my own. and I thought if there's
something the framework can't process, which definitely means Turing
incomplete. Am I wrong?
No comments:
Post a Comment