News for hackers. Stuff that matters.
Re:The New ‘Absent Operator’ in Ruby’s Regular Expressions by RodgerTheGreat on Thursday March 23, 2017 @10:08AM (#13939839)
My initial impression is that this seems similar to the negation operator in parsing expression grammars. PEGs are "greedy", so the semantics of "non-consuming" matches/negations are a bit more straightforward than this feature appears.
Re:The New ‘Absent Operator’ in Ruby’s Regular Expressions by jballanc on Thursday March 23, 2017 @12:41PM (#13941413)
Same here. I wonder when we stop calling these "regular expressions" and start calling them "parsing expressions"?
Re:The New ‘Absent Operator’ in Ruby’s Regular Expressions by zokier on Thursday March 23, 2017 @02:31PM (#13942662)
Perl6 already has taken steps towards that direction, they have "rules" and "grammars", although I also see that they still call regexes regex but try to avoid the term "regular expression"

> This document summarizes Apocalypse 5, which is about the new regex syntax. We now try to call them regex rather than "regular expressions" because they haven't been regular expressions for a long time, and we think the popular term "regex" is in the process of becoming a technical term with a precise meaning of: "something you do pattern matching with, kinda like a regular expression". On the other hand, one of the purposes of the redesign is to make portions of our patterns more amenable to analysis under traditional regular expression and parser semantics, and that involves making careful distinctions between which parts of our patterns and grammars are to be treated as declarative, and which parts as procedural.

> In any case, when referring to recursive patterns within a grammar, the terms rule and token are generally preferred over regex.

https://design.perl6.org/S05.html

Of course it is not surprising that Perl community is pushing the envelope for regex...