News for hackers. Stuff that matters.
Re:A functioning Turing Machine using Notepad++ and its find... by pstoll on Tuesday February 22, 2022 @08:40AM (#30427776)
You must not have suffered enough, I mean used regexs widely enough.

He meant “syntax” in the sense that different regex engines have different syntax and capabilities - can I do a negative look ahead assertion in engines Z, how do I do a zero width lookaround in pcre, gnu, python, posix, etc.

Depending how far down the rabbit hole you want to go, start here:

https://swtch.com/~rsc/regexp/regexp1.html

Re:A functioning Turing Machine using Notepad++ and its find... by midjji on Wednesday February 23, 2022 @06:47AM (#30440081)
Oh and dont forget that just because the documentation says it uses a specific regex syntax, that does not mean its correctly implemented. It gets worse when an application examples specify a specific syntax but what happens in the background is that it will use the default reg exp engine, which can be system or enviroment specified.
Re:A functioning Turing Machine using Notepad++ and its find... by metalliqaz on Tuesday February 22, 2022 @02:15PM (#30432242)
I just don't count those cases as 'basic' syntax.
Re:A functioning Turing Machine using Notepad++ and its find... by pstoll on Tuesday February 22, 2022 @08:56PM (#30436620)
Basic - naming a capture group. Awk / posix - \1 Perl - $1. Python - (?P<name>).

I’d find it hard to ignore the specifics. I mean if you only ever use one tool and were never exposed to other regex engines I guess.