Any zero-width assertions inside
[...] lose there meaning of a zero-width assertion.
[\b] does not match a word boundary (it matches a backspace, or, in POSIX,
[$] matches a literal
[^] is either an error or, as in ECMAScript regex flavor, any char. Same with
You may solve the problem using any of the below patterns:
Matching between a char sequence and a single char or end of string (current scenario)
.*?([YOUR_SINGLE_CHAR_DELIMITER(S)]|$) pattern (suggested by João Silva) is rather inefficient since the regex engine checks for the patterns that appear to the right of the lazy dot pattern first, and only if they do not match does it "expand" the lazy dot pattern.
In these cases it is recommended to use negated character class (or bracket expression in the POSIX talk):
See demo. Details
[&?] - a positive character class matching either
? (note the relationships between chars/char ranges in a character class are OR relationships)
list= - a substring, char sequence
([^&]*) - Capturing group #1: zero or more (
*) chars other than
[^&]), as many as possible
Checking for the trailing single char delimiter presence without returning it or end of string
&). Although it is not expected in a query string, it is a common scenario.
In that case, you can use two approaches:
- A positive lookahead with an alternation containing positive character class:
- A negative lookahead with just a negative character class:
The negative lookahead solution is a bit more efficient because it does not contain an alternation group that adds complexity to matching procedure. The OP solution would look like
See this regex demo and another one here.
Certainly, in case the trailing delimiters are multichar sequences, only a positive lookahead solution will work since
[^yes] does not negate a sequence of chars, but the chars inside the class (i.e.
[^yes] matches any char but