The author is circling around, but not quite reaching, a statement that POSIX Basic Regular Expressions work everywhere, with the caveat that that not everyone has caught up with version 8 of the Single Unix Specification, which has slightly changed BREs.

Fair, but does BRE actually work everywhere in practice, or just on paper? grep, sed, awk all drift on edge cases like backreferences and bracket expressions. Spec parity isn't binary parity.

I don't think your comment is fair to the author. If there was not such caveat, then there would not be a need to write that article.

Emacs in particular I suffer so much from basically guessing what needs to be escaped or not. I know `rx` exists[0] as an alternative but it's not really fun to use.

Even beyond the regex syntax itself, you often also start running into encoding problems when trying to actually use them. Typing the regex in a shell? Make sure to esacpe stuff properly. Regex in Python? Make sure it's a raw string. Etc etc etc

It's a modern miracle we're at least within rhyming distance of how to write regexes in most tools.

[0]: https://www.gnu.org/software/emacs/manual/html_node/elisp/Rx...

Grasping at straws, it's kinda convenient that ( and ) match literally if the text being searched is Elisp code!

Regexes should have been a structured language not an hodgepodge of DSLs

Technically that's three escaping layers, not two - the python string literal, the shell quoting, then whatever the regex engine itself expects. Doesn't make debugging the mess any less miserable though.

Even more fun writing python that generates shell scripts that contain regex, and other nested-different-escaping scenarios.

A while ago, we wrote a paper about finding regexes which match the same way in both the greedy semantics and the leftmost maximal semantics.

https://par.nsf.gov/servlets/purl/10534654

It drives me nuts when a developer documents something or other as being a "regex" but doesn't mention which dialect of regulation expression he's talking about. This habit is particularly common in the Rust, JavaScript, and Python communities, which seem to forget that their language's regular expression language isn't universal.

Why? Of course it means the dialect that is most directly supported by that language (by builtins or the standard library). And why should they have to consider other dialects? They aren't reading regexes from user input (or they'd be a lot more concerned about sanitization, catastrophic backtracking etc.), and their fellow developers all grok the conventions.

Same applies to “Markdown”.

I've always been a stickler for being specific about which regex language your thing accepts, and whether it is to match any substring, or a prefix, or a suffix, or the whole thing, or a line, or a substring of a line, or whatever.

Here are some of the [more popular][1] ones, and then there are PCRE and Python.

It took me a while to learn that some of the older ones you see in e.g. grep are [specified by POSIX][2].

[1]: https://cppreference.com/cpp/regex#Regular_expression_gramma...

[2]: https://pubs.opengroup.org/onlinepubs/009696899/basedefs/xbd...

We must find a way to return to SNOBOL/PITBOL. It’s so elegant and effective in Ada (where it’s in the standard library).

https://en.wikipedia.org/wiki/SNOBOL

> In the 1980s and 1990s, its use faded as newer languages such as AWK and Perl made string manipulation by means of regular expressions fashionable. SNOBOL4 patterns include a way to express BNF grammars, which are equivalent to context-free grammars and more powerful than regular expressions. The "regular expressions" in current versions of AWK and Perl are in fact extensions of regular expressions in the traditional sense, but regular expressions, unlike SNOBOL4 patterns, are not recursive, which gives a distinct computational advantage to SNOBOL4 patterns.

Quite Interesting. Have you worked with SNOBOL a lot? Care to share your experiences?

This para caught my eye;

A SNOBOL pattern can be very simple or extremely complex. A simple pattern is just a text string (e.g. "ABCD"), but a complex pattern may be a large structure describing, for example, the complete grammar of a computer language. It is possible to implement a language interpreter in SNOBOL almost directly from a Backus–Naur form expression of it, with few changes. Creating a macro assembler and an interpreter for a completely theoretical piece of hardware could take as little as a few hundred lines, with a new instruction being added with a single line.

Also this;

SNOBOL4 pattern-matching uses a backtracking algorithm similar to that used in the logic programming language Prolog, which provides pattern-like constructs via DCGs. This algorithm makes it easier to use SNOBOL as a logic programming language than is the case for most languages.

Seems like there are some hidden superpowers waiting to be unlocked ;-)

I want to share Russ Cox's webpage on regexp https://swtch.com/~rsc/regexp/

I find it a good reading.

That's one of the reasons RFC 9485, "I-Regexp: An Interoperable Regular Expression Format", is important.

https://datatracker.ietf.org/doc/html/rfc9485

Go stdlib regexp package does not support back references, as it uses the RE2 engine. You can use them in replace but not matching.

Regexp does not use re2, it is a separate implementation of the same concepts.

> the special characters . * ^ $

These already do not work in many tools which require those special characters to be escaped to have any meaning. An easy example is GNU grep, sed, etc. which use BRE ("Basic Regular Expressions") by default. The article mentions GNU coreutils but does not explain that `-E` is required to fix that behavior.

> the following features work everywhere. YMMV.

Amusing pair of statements.

It works 100% of the time, 50% of the time.

Sounds about right. Ops will tell you it's the other 50% that gets the page at 3am, and cron doesn't care about your regex's mood that day.

60% of the time, it works every time!

I built my Rust library for JSONLogic and use bindings for other languages after similar frustrations with Rule engines, template engines and IFTTT engines. https://github.com/GoPlasmatic/datalogic-rs

JSON schema's docs also have a recommended regular expression subset:

https://json-schema.org/understanding-json-schema/reference/...

I've become a fan of whatever PCRE2 understands

Then there’s not just the issue of whether the engine supports a particular syntactical feature but the issue of matching semantics. Perl/PCRE’s semantics are far different from POSIX’s and some implementations different semantics altogether (and quite reasonably).

Microsoft FINDSTR.EXE supports a subset of these regular expressions.

It does not support the + repetition operator.

2 RegExp problems:

1. You can not compose a bigger regexp out of smaller ones

2. A regexp can not "call" other regexps

To do regex matching efficiently, you need to compile the pattern before using it. That'd exclude dynamically "calling" other regex patterns. But bigger regex pattern strings can be composed from smaller regex pattern strings. You'd just need to do the composition before the compilation.

I'm just thinking in JavaScript I can do this:

  let s =  "abc" + "def";

Why can't I do:

  let regExp = /abc/ + /def/;   

If JavaScript (or some other) interpreter can turn /abc/ into a RegExp, why can't it do the same for

/abc/ + /def/

?

Also define blocks if all someone wants is to break the pattern up to make it more readable.

Swift has a RegexBuilder[1][2] interface, in addition to the usual string-ey interface that allows composition.

[1]: https://github.com/swiftlang/swift-evolution/blob/main/propo...

[2]: https://developer.apple.com/documentation/regexbuilder

So my favorite regex (.*?) works? Puh.

why the "?" ?

Because without it your regex eats the whole file and calls it a match.

To make it lazy. It's the match anything in-between so you can put stuff before and after its my most used regex.

"my name is (.*?)$" => my name is k0in

Or values "last (.*?), was great" => last sunday, was great

> So for my definition of “everywhere,” with the caveats mentioned above, the following features work everywhere. YMMV.

  .
  ^, $
  […], [^…]
  \*
  \w, \W, \s, \S
  \1 - \9 backreferences
  \b \B
  ? + 
  | alternation
  {n,m} for counting matches
  (...) capturing

Except that these don't work in macOS/BSD sed (even with -E flag):

- \w, \W, \s, \S - need to use POSIX classes instead: [[:alnum:]], [^[:alnum:]], [[:space:]], [^[:space:]]

- \b - need to use use [[:<:]] (word start) and [[:>:]] (word end) instead

- \B - (not a word start/end) no alternatives

why I built this

The dialect differences get most of the attention, but the semantic split that matters more is backtracking vs. Thompson NFA construction — Cox's writeups cover this well. Two engines can accept the same syntax and still diverge badly on worst-case time.