only finite sets of strings

Question

only finite sets of strings

markusicu opened this issue 3 years ago · comments

In the TC39 meeting today (2021-may-26) there was some discussion of whether we should prepare for character classes matching infinite sets of strings.

From the start, the proposal has been to extended character classes, and supported Unicode properties, from finite sets of characters to finite sets of strings. This was the basis for the argument to use \p for properties of strings.

As an example, in UTS #51 there is a very clear distinction between

an emoji zwj sequence, defined via a regular expression that matches an infinite set of strings
the RGI emoji ZWJ sequence set (= the RGI_Emoji_ZWJ_Sequence property) which is a finite set of strings listed in a data file

It would be possible to support named matchers for infinite sets of strings, that is, a kind of named sub-regular-expression, but that is very different from a finite set, needs to have separate syntax, and should not be allowed inside character classes.

Mark Davis · Answer 1 · Thu May 27 2021 07:43:10 GMT+0800 (China Standard Time)

I agree that it should be treated as separate. It certainly can be useful; for example, we could have \p{valid_emoji} (or some other syntax), which would match from the current position to the first position that couldn't continue a valid emoji sequence. And set combinations would make sense and be useful, such as [\p{valid_emoji}--\p{RGI_emoji}], which matches emoji sequences that are valid but not RGI.

Mathias Bynens · Answer 2 · Thu May 27 2021 18:00:06 GMT+0800 (China Standard Time)

I agree that named matchers for infinite sets of strings could be useful, but I'm not convinced this is part of the MVP. I would prefer pursuing it as a separate follow-up proposal. @waldemarhorwat, does that match your thinking?

That said, here’s some thoughts:

It would be possible to support named matchers for infinite sets of strings, that is, a kind of named sub-regular-expression, but that is very different from a finite set, […]

Agreed.

[…] needs to have separate syntax, […]

Not sure I agree. I think we could totally use \p{…} for this as well if we decide to support this in the future. Nothing about our current proposal prevents us from doing that, since \p{SomeUnknownOrUnsupportedProperty} throws an exception.

[…] and should not be allowed inside character classes.

I’m not sure. Mark’s example of [\p{Valid_Emoji}--\p{RGI_Emoji}] seems compelling.

Markus Scherer · Answer 3 · Fri Jun 25 2021 00:27:31 GMT+0800 (China Standard Time)

Proposed resolution: There is enough reserved syntax (e.g., curly braces) to enable wide-ranging extensions in the future, but we don't plan to build something specific into the proposed spec changes.

Cc stage 3 reviewers @waldemarhorwat @gibson042 @msaboff

Mathias Bynens · Answer 4 · Fri Aug 20 2021 14:33:37 GMT+0800 (China Standard Time)

https://github.com/tc39/proposal-regexp-set-notation#can-a-property-or-character-class-match-an-infinite-set-of-strings