regjsparser
Version:
Parsing the JavaScript's RegExp in JavaScript.
2,167 lines • 77.6 kB
JavaScript
// regjsparser
//
// ==================================================================
//
// See ECMA-262 Standard: https://tc39.es/ecma262/#sec-patterns
//
// The grammar below follows the standard. For brevity, the grammar parameters
// that are only passed through ([?UnicodeMode], [?UnicodeSetsMode] and
// [?NamedCaptureGroups]) are omitted; the parameters that guard an
// alternative ([+UnicodeMode], [~UnicodeSetsMode], ...) or that are set
// explicitly are kept.
//
// NOTE: Without the u and v flags, the parser also accepts the extended
// grammar of Annex B, see
// https://tc39.es/ecma262/#sec-regular-expressions-patterns
// e.g. quantified lookaheads (https://github.com/jviereck/regjsparser/issues/130).
//
// Pattern ::
// Disjunction
//
// Disjunction ::
// Alternative
// Alternative | Disjunction
//
// Alternative ::
// [empty]
// Alternative Term
//
// Term ::
// Assertion
// Atom
// Atom Quantifier
//
// Assertion ::
// ^
// $
// \b
// \B
// (?= Disjunction )
// (?! Disjunction )
// (?<= Disjunction )
// (?<! Disjunction )
//
// Quantifier ::
// QuantifierPrefix
// QuantifierPrefix ?
//
// QuantifierPrefix ::
// *
// +
// ?
// { DecimalDigits[~Sep] }
// { DecimalDigits[~Sep] ,}
// { DecimalDigits[~Sep] , DecimalDigits[~Sep] }
//
// Atom ::
// PatternCharacter
// .
// \ AtomEscape
// CharacterClass
// ( GroupSpecifier? Disjunction )
// (? RegularExpressionModifiers : Disjunction )
// (? RegularExpressionModifiers - RegularExpressionModifiers : Disjunction )
//
// RegularExpressionModifiers ::
// [empty]
// RegularExpressionModifiers RegularExpressionModifier
//
// RegularExpressionModifier :: one of
// i m s
//
// SyntaxCharacter :: one of
// ^ $ \ . * + ? ( ) [ ] { } |
//
// PatternCharacter ::
// SourceCharacter but not SyntaxCharacter
//
// AtomEscape ::
// DecimalEscape
// CharacterClassEscape
// CharacterEscape
// [+NamedCaptureGroups] k GroupName
//
// CharacterEscape ::
// ControlEscape
// c AsciiLetter
// 0 [lookahead ∉ DecimalDigit]
// HexEscapeSequence
// RegExpUnicodeEscapeSequence
// IdentityEscape
//
// ControlEscape :: one of
// f n r t v
//
// GroupSpecifier ::
// ? GroupName
//
// GroupName ::
// < RegExpIdentifierName >
//
// RegExpIdentifierName ::
// RegExpIdentifierStart
// RegExpIdentifierName RegExpIdentifierPart
//
// RegExpIdentifierStart ::
// IdentifierStartChar
// \ RegExpUnicodeEscapeSequence[+UnicodeMode]
// [~UnicodeMode] UnicodeLeadSurrogate UnicodeTrailSurrogate
//
// RegExpIdentifierPart ::
// IdentifierPartChar
// \ RegExpUnicodeEscapeSequence[+UnicodeMode]
// [~UnicodeMode] UnicodeLeadSurrogate UnicodeTrailSurrogate
//
// RegExpUnicodeEscapeSequence ::
// [+UnicodeMode] u HexLeadSurrogate \u HexTrailSurrogate
// [+UnicodeMode] u HexLeadSurrogate
// [+UnicodeMode] u HexTrailSurrogate
// [+UnicodeMode] u HexNonSurrogate
// [~UnicodeMode] u Hex4Digits
// [+UnicodeMode] u{ CodePoint }
//
// UnicodeLeadSurrogate ::
// any Unicode code point in the inclusive interval from U+D800 to U+DBFF
//
// UnicodeTrailSurrogate ::
// any Unicode code point in the inclusive interval from U+DC00 to U+DFFF
//
// HexLeadSurrogate ::
// Hex4Digits but only if the MV of Hex4Digits is in the inclusive interval from 0xD800 to 0xDBFF
//
// HexTrailSurrogate ::
// Hex4Digits but only if the MV of Hex4Digits is in the inclusive interval from 0xDC00 to 0xDFFF
//
// HexNonSurrogate ::
// Hex4Digits but only if the MV of Hex4Digits is not in the inclusive interval from 0xD800 to 0xDFFF
//
// IdentityEscape ::
// [+UnicodeMode] SyntaxCharacter
// [+UnicodeMode] /
// [~UnicodeMode] SourceCharacter but not UnicodeIDContinue
//
// DecimalEscape ::
// NonZeroDigit DecimalDigits[~Sep]? [lookahead ∉ DecimalDigit]
//
// CharacterClassEscape ::
// d
// D
// s
// S
// w
// W
// [+UnicodeMode] p{ UnicodePropertyValueExpression }
// [+UnicodeMode] P{ UnicodePropertyValueExpression }
//
// UnicodePropertyValueExpression ::
// UnicodePropertyName = UnicodePropertyValue
// LoneUnicodePropertyNameOrValue
//
// UnicodePropertyName ::
// UnicodePropertyNameCharacters
//
// UnicodePropertyNameCharacters ::
// UnicodePropertyNameCharacter UnicodePropertyNameCharacters?
//
// UnicodePropertyValue ::
// UnicodePropertyValueCharacters
//
// LoneUnicodePropertyNameOrValue ::
// UnicodePropertyValueCharacters
//
// UnicodePropertyValueCharacters ::
// UnicodePropertyValueCharacter UnicodePropertyValueCharacters?
//
// UnicodePropertyValueCharacter ::
// UnicodePropertyNameCharacter
// DecimalDigit
//
// UnicodePropertyNameCharacter ::
// AsciiLetter
// _
//
// CharacterClass ::
// [ [lookahead ≠ ^] ClassContents ]
// [^ ClassContents ]
//
// ClassContents ::
// [empty]
// [~UnicodeSetsMode] NonemptyClassRanges
// [+UnicodeSetsMode] ClassSetExpression
//
// NonemptyClassRanges ::
// ClassAtom
// ClassAtom NonemptyClassRangesNoDash
// ClassAtom - ClassAtom ClassContents[~UnicodeSetsMode]
//
// NonemptyClassRangesNoDash ::
// ClassAtom
// ClassAtomNoDash NonemptyClassRangesNoDash
// ClassAtomNoDash - ClassAtom ClassContents[~UnicodeSetsMode]
//
// ClassAtom ::
// -
// ClassAtomNoDash
//
// ClassAtomNoDash ::
// SourceCharacter but not one of \ or ] or -
// \ ClassEscape
//
// ClassEscape ::
// b
// [+UnicodeMode] -
// CharacterClassEscape
// CharacterEscape
//
// ClassSetExpression ::
// ClassUnion
// ClassIntersection
// ClassSubtraction
//
// ClassUnion ::
// ClassSetRange ClassUnion?
// ClassSetOperand ClassUnion?
//
// ClassIntersection ::
// ClassSetOperand && [lookahead ≠ &] ClassSetOperand
// ClassIntersection && [lookahead ≠ &] ClassSetOperand
//
// ClassSubtraction ::
// ClassSetOperand -- ClassSetOperand
// ClassSubtraction -- ClassSetOperand
//
// ClassSetRange ::
// ClassSetCharacter - ClassSetCharacter
//
// ClassSetOperand ::
// NestedClass
// ClassStringDisjunction
// ClassSetCharacter
//
// NestedClass ::
// [ [lookahead ≠ ^] ClassContents[+UnicodeMode, +UnicodeSetsMode] ]
// [^ ClassContents[+UnicodeMode, +UnicodeSetsMode] ]
// \ CharacterClassEscape[+UnicodeMode]
//
// ClassStringDisjunction ::
// \q{ ClassStringDisjunctionContents }
//
// ClassStringDisjunctionContents ::
// ClassString
// ClassString | ClassStringDisjunctionContents
//
// ClassString ::
// [empty]
// NonEmptyClassString
//
// NonEmptyClassString ::
// ClassSetCharacter NonEmptyClassString?
//
// ClassSetCharacter ::
// [lookahead ∉ ClassSetReservedDoublePunctuator] SourceCharacter but not ClassSetSyntaxCharacter
// \ CharacterEscape[+UnicodeMode]
// \ ClassSetReservedPunctuator
// \b
//
// ClassSetReservedDoublePunctuator :: one of
// && !! ## $$ %% ** ++ ,, .. :: ;; << == >> ?? @@ ^^ `` ~~
//
// ClassSetSyntaxCharacter :: one of
// ( ) [ ] { } / - \ |
//
// ClassSetReservedPunctuator :: one of
// & - ! # % , : ; < = > @ ` ~
//
// --------------------------------------------------------------
// NOTE: The following productions refer to the
// "Regular Expression Buffer Boundaries for ECMAScript" proposal.
// https://github.com/tc39/proposal-regexp-buffer-boundaries
// --------------------------------------------------------------
// Assertion ::
// [+UnicodeMode] \A
// [+UnicodeMode] \z
// [+UnicodeMode] \Z
"use strict";
(function() {
var fromCodePoint = String.fromCodePoint || (function() {
// Implementation taken from
// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/fromCodePoint
var stringFromCharCode = String.fromCharCode;
var floor = Math.floor;
return function fromCodePoint() {
var MAX_SIZE = 0x4000;
var codeUnits = [];
var highSurrogate;
var lowSurrogate;
var index = -1;
var length = arguments.length;
if (!length) {
return '';
}
var result = '';
while (++index < length) {
var codePoint = Number(arguments[index]);
if (
!isFinite(codePoint) || // `NaN`, `+Infinity`, or `-Infinity`
codePoint < 0 || // not a valid Unicode code point
codePoint > 0x10FFFF || // not a valid Unicode code point
floor(codePoint) != codePoint // not an integer
) {
throw RangeError('Invalid code point: ' + codePoint);
}
if (codePoint <= 0xFFFF) { // BMP code point
codeUnits.push(codePoint);
} else { // Astral code point; split in surrogate halves
// http://mathiasbynens.be/notes/javascript-encoding#surrogate-formulae
codePoint -= 0x10000;
highSurrogate = (codePoint >> 10) + 0xD800;
lowSurrogate = (codePoint % 0x400) + 0xDC00;
codeUnits.push(highSurrogate, lowSurrogate);
}
if (index + 1 == length || codeUnits.length > MAX_SIZE) {
result += stringFromCharCode.apply(null, codeUnits);
codeUnits.length = 0;
}
}
return result;
};
}());
// The parser state. It lives at module scope, so that the parsing functions
// below are created once instead of on every call to parse().
var str;
var features;
var pos;
var backrefDenied;
var closedCaptureCounter;
var firstIteration;
var shouldReparse;
var hasUnicodeFlag;
var hasUnicodeSetFlag;
var isUnicodeMode;
var namedCaptureGroups;
// The declared group names in source order, and whether a name is visible
// at the current position. See declareGroupName().
var groupNames;
var visibleGroupNames;
var namedReferences;
var hasIdentityEscapeK;
function updateRawStart(node, start) {
node.range[0] = start;
node.raw = str.substring(start, node.range[1]);
return node;
}
function createAnchor(kind, rawLength) {
return {
type: 'anchor',
kind: kind,
range: [
pos - rawLength,
pos
],
raw: str.substring(pos - rawLength, pos)
};
}
function createValue(kind, codePoint, from, to) {
return {
type: 'value',
kind: kind,
codePoint: codePoint,
range: [from, to],
raw: str.substring(from, to)
};
}
function createEscaped(kind, codePoint, value, fromOffset) {
fromOffset = fromOffset || 0;
return createValue(kind, codePoint, pos - (value.length + fromOffset), pos);
}
function createCharacter(matches) {
var _char = matches[0];
var first = _char.charCodeAt(0);
if (isUnicodeMode) {
var second;
if (_char.length === 1 && first >= 0xD800 && first <= 0xDBFF) {
second = lookahead().charCodeAt(0);
if (second >= 0xDC00 && second <= 0xDFFF) {
// Unicode surrogate pair
pos++;
return createValue(
'symbol',
(first - 0xD800) * 0x400 + second - 0xDC00 + 0x10000,
pos - 2, pos);
}
}
}
return createValue('symbol', first, pos - 1, pos);
}
function createDisjunction(alternatives, from, to) {
return {
type: 'disjunction',
body: alternatives,
range: [
from,
to
],
raw: str.substring(from, to)
};
}
function createDot() {
return {
type: 'dot',
range: [
pos - 1,
pos
],
raw: '.'
};
}
function createCharacterClassEscape(value) {
return {
type: 'characterClassEscape',
value: value,
range: [
pos - 2,
pos
],
raw: str.substring(pos - 2, pos)
};
}
function createReference(matchIndex) {
var start = pos - 1 - matchIndex.length;
return {
type: 'reference',
matchIndex: parseInt(matchIndex, 10),
range: [
start,
pos
],
raw: str.substring(start, pos)
};
}
function createNamedReference(name) {
var start = name.range[0] - 3;
return {
type: 'reference',
name: name,
range: [
start,
pos
],
raw: str.substring(start, pos)
};
}
function createGroup(behavior, disjunction, from, to) {
return {
type: 'group',
behavior: behavior,
body: disjunction,
range: [
from,
to
],
raw: str.substring(from, to)
};
}
function createQuantifier(min, max, from, to, symbol) {
if (to == null) {
from = pos - 1;
to = pos;
}
return {
type: 'quantifier',
min: min,
max: max,
greedy: true,
body: null, // set later on
symbol: symbol,
range: [
from,
to
],
raw: str.substring(from, to)
};
}
function createAlternative(terms, from, to) {
return {
type: 'alternative',
body: terms,
range: [
from,
to
],
raw: str.substring(from, to)
};
}
function createCharacterClass(contents, negative, from, to) {
return {
type: 'characterClass',
kind: contents.kind,
body: contents.body,
negative: negative,
range: [
from,
to
],
raw: str.substring(from, to)
};
}
function createClassRange(min, max, from, to) {
// NonemptyClassRanges :: ClassAtom - ClassAtom ClassContents
// It is a Syntax Error if the CharacterValue of the first ClassAtom is
// strictly greater than the CharacterValue of the second ClassAtom.
//
// SEE: https://tc39.es/ecma262/#sec-patterns-static-semantics-early-errors
if (min.codePoint > max.codePoint) {
bail('invalid range in character class', min.raw + '-' + max.raw, from, to);
}
return {
type: 'characterClassRange',
min: min,
max: max,
range: [
from,
to
],
raw: str.substring(from, to)
};
}
function createClassStrings(strings, from, to) {
return {
type: 'classStrings',
strings: strings,
range: [from, to],
raw: str.substring(from, to)
};
}
function createClassString(characters, from, to) {
return {
type: 'classString',
characters: characters,
range: [from, to],
raw: str.substring(from, to)
};
}
function flattenBody(body) {
if (body.type === 'alternative') {
return body.body;
} else {
return [body];
}
}
function incr(amount) {
amount = (amount || 1);
pos += amount;
}
function consume(amount) {
var res = str.substring(pos, pos += amount);
return res;
}
function skip(value) {
if (!match(value)) {
bail('character', value);
}
}
function match(value) {
var len = value.length;
if (str.substring(pos, pos + len) === value) {
incr(len);
return value;
}
}
function matchOne(value) {
if (str[pos] === value) {
pos++;
return value;
}
}
function lookahead() {
return str[pos];
}
function currentOne(value) {
return str[pos] === value;
}
function current(value) {
var len = value.length;
return str.substring(pos, pos + len) === value;
}
function next(value) {
return str[pos + 1] === value;
}
function matchReg(regExp) {
var subStr = str.substring(pos);
var res = subStr.match(regExp);
if (res) {
pos += res[0].length;
}
return res;
}
function parseDisjunction() {
// Disjunction ::
// Alternative
// Alternative | Disjunction
var res = [], from = pos, i;
// Indexes into groupNames of the names declared in this disjunction and
// in the current alternative. See declareGroupName().
var disjunctionStart = groupNames.length;
var alternativeStart = disjunctionStart;
res.push(parseAlternative());
while (matchOne('|')) {
// Groups in different alternatives can't both participate, so the
// names of the previous alternative are not visible in the next one.
for (i = alternativeStart; i < groupNames.length; i++) {
visibleGroupNames[groupNames[i]] = false;
}
alternativeStart = groupNames.length;
res.push(parseAlternative());
}
// After the disjunction, the names of all its alternatives are visible.
for (i = disjunctionStart; i < alternativeStart; i++) {
visibleGroupNames[groupNames[i]] = true;
}
if (res.length === 1) {
return res[0];
}
return createDisjunction(res, from, pos);
}
function parseAlternative() {
var res = [], from = pos;
var term;
// Alternative ::
// [empty]
// Alternative Term
while (term = parseTerm()) {
res.push(term);
}
if (res.length === 1) {
return res[0];
}
return createAlternative(res, from, pos);
}
function parseTerm() {
// Term ::
// Assertion
// Atom
// Atom Quantifier
// Term (Annex B) ::
// ...
// [~UnicodeMode] QuantifiableAssertion Quantifier
// [~UnicodeMode] Assertion[~UnicodeMode, ~UnicodeSetsMode]
// [~UnicodeMode] ExtendedAtom Quantifier
// [~UnicodeMode] ExtendedAtom
//
// QuantifiableAssertion (Annex B) ::
// (?= Disjunction[~UnicodeMode, ~UnicodeSetsMode] )
// (?! Disjunction[~UnicodeMode, ~UnicodeSetsMode] )
//
// SEE: https://github.com/jviereck/regjsparser/issues/130
if (pos >= str.length || currentOne('|') || currentOne(')')) {
return null; /* Means: The term is empty */
}
var assertion = parseAssertion();
var quantifier;
if (assertion) {
var pos_backup = pos;
quantifier = parseQuantifier() || false;
if (quantifier) {
// Annex B
if (!isUnicodeMode && assertion.type === "group") {
quantifier.body = flattenBody(assertion);
// The quantifier contains the assertion. Therefore, the beginning of the
// quantifier range is given by the beginning of the assertion.
updateRawStart(quantifier, assertion.range[0]);
return quantifier;
}
pos = pos_backup;
bail("Expected atom");
}
return assertion;
}
// If there is no Assertion, try to parse an atom.
var atom = parseAtomAndExtendedAtom();
if (!atom) {
// Check if a quantifier is following. A quantifier without an atom
// is an error.
pos_backup = pos;
quantifier = parseQuantifier() || false;
if (quantifier) {
pos = pos_backup;
bail("Expected atom");
}
// If no unicode flag, then try to parse ExtendedAtom -> ExtendedPatternCharacter.
// ExtendedPatternCharacter
if (!isUnicodeMode && matchOne("{")) {
atom = createCharacter("{");
} else {
bail("Expected atom");
}
}
quantifier = parseQuantifier() || false;
if (quantifier) {
var type = atom.type, behavior = atom.behavior;
if (
type === "group" &&
(behavior === "negativeLookbehind" ||
behavior === "lookbehind")
) {
bail(
"Invalid quantifier",
"",
quantifier.range[0],
quantifier.range[1]
);
}
quantifier.body = flattenBody(atom);
// The quantifier contains the atom. Therefore, the beginning of the
// quantifier range is given by the beginning of the atom.
updateRawStart(quantifier, atom.range[0]);
return quantifier;
}
return atom;
}
function parseGroup(matchA, typeA, matchB, typeB) {
var type, from = pos;
if (match(matchA)) {
type = typeA;
} else if (match(matchB)) {
type = typeB;
} else {
return false;
}
return finishGroup(type, from);
}
function finishGroup(type, from) {
var body = parseDisjunction();
if (!body) {
bail('Expected disjunction');
}
skip(')');
var group = createGroup(type, flattenBody(body), from, pos);
if (type == 'normal') {
// Keep track of the number of closed groups. This is required for
// parseDecimalEscape(). In case the string is parsed a second time the
// value already holds the total count and no incrementation is required.
if (firstIteration) {
closedCaptureCounter++;
}
}
return group;
}
// NOTE: parseAssertion() parses ^ $ \b \B and lookaheads; lookbehinds are
// parsed together with the atoms. In the AST, ^ $ \b and \B are "anchor"
// nodes, and lookarounds are "group" nodes.
function parseAssertion() {
// Assertion ::
// ^
// $
// \b
// \B
// (?= Disjunction )
// (?! Disjunction )
// [+UnicodeMode] \A
// [+UnicodeMode] \z
// [+UnicodeMode] \Z
// ...
//
// (?<= Disjunction ) and (?<! Disjunction ) are parsed in
// parseAtomAndExtendedAtom().
switch(lookahead()) {
case '^':
incr();
return createAnchor('start', 1 /* rawLength */);
case '$':
incr();
return createAnchor('end', 1 /* rawLength */);
case '\\': {
if (next('b')) {
incr(2);
return createAnchor('boundary', 2 /* rawLength */);
} else if (next('B')) {
incr(2);
return createAnchor('not-boundary', 2 /* rawLength */);
} else if (isUnicodeMode && features.bufferBoundaries) {
if (next('A')) {
incr(2);
return createAnchor('start-buffer', 2 /* rawLength */);
} else if (next('z')) {
incr(2);
return createAnchor('end-buffer', 2 /* rawLength */);
} else if (next('Z')) {
incr(2);
return createAnchor('end-buffer-optional-newline', 2 /* rawLength */);
}
}
break;
}
case '(':
return parseGroup('(?=', 'lookahead', '(?!', 'negativeLookahead');
default:
return;
}
}
function parseQuantifier() {
// Quantifier ::
// QuantifierPrefix
// QuantifierPrefix ?
//
// QuantifierPrefix ::
// *
// +
// ?
// { DecimalDigits[~Sep] }
// { DecimalDigits[~Sep] ,}
// { DecimalDigits[~Sep] , DecimalDigits[~Sep] }
var res, from = pos;
var quantifier;
var min, max;
switch(lookahead()) {
case '*':
incr();
quantifier = createQuantifier(0, undefined, undefined, undefined, '*');
break;
case '+':
incr();
quantifier = createQuantifier(1, undefined, undefined, undefined, "+");
break;
case '?':
incr();
quantifier = createQuantifier(0, 1, undefined, undefined, "?");
break;
case '{': {
if (res = matchReg(/^\{(\d+)\}/)) {
min = parseInt(res[1], 10);
quantifier = createQuantifier(min, min, from, pos);
}
else if (res = matchReg(/^\{(\d+),\}/)) {
min = parseInt(res[1], 10);
quantifier = createQuantifier(min, undefined, from, pos);
}
else if (res = matchReg(/^\{(\d+),(\d+)\}/)) {
min = parseInt(res[1], 10);
max = parseInt(res[2], 10);
if (min > max) {
bail('numbers out of order in {} quantifier', '', from, pos);
}
quantifier = createQuantifier(min, max, from, pos);
}
if (min && (!Number.isSafeInteger(min)) || (max && !Number.isSafeInteger(max))) {
bail("iterations outside JS safe integer range in quantifier", "", from, pos);
}
}
}
if (quantifier) {
if (matchOne('?')) {
quantifier.greedy = false;
quantifier.range[1] += 1;
}
}
return quantifier;
}
function parseAtomAndExtendedAtom() {
// Parsing Atom and ExtendedAtom together due to redundancy.
// ExtendedAtom is defined in Annex B of the ECMA-262 standard.
//
// SEE: https://tc39.es/ecma262/#sec-regular-expressions-patterns
//
// Atom ::
// PatternCharacter
// .
// \ AtomEscape
// CharacterClass
// ( GroupSpecifier? Disjunction )
// (? RegularExpressionModifiers : Disjunction )
// (? RegularExpressionModifiers - RegularExpressionModifiers : Disjunction )
//
// ExtendedAtom (Annex B) ::
// .
// \ AtomEscape[~UnicodeMode]
// \ [lookahead = c]
// CharacterClass[~UnicodeMode, ~UnicodeSetsMode]
// ( GroupSpecifier[~UnicodeMode]? Disjunction[~UnicodeMode, ~UnicodeSetsMode] )
// (? RegularExpressionModifiers : Disjunction[~UnicodeMode, ~UnicodeSetsMode] )
// (? RegularExpressionModifiers - RegularExpressionModifiers : Disjunction[~UnicodeMode, ~UnicodeSetsMode] )
// InvalidBracedQuantifier
// ExtendedPatternCharacter
//
// ExtendedPatternCharacter (Annex B) ::
// SourceCharacter but not one of ^ $ \ . * + ? ( ) [ |
var res;
switch (res = lookahead()) {
case '.':
// .
incr();
return createDot();
case '\\': {
// \ AtomEscape
incr();
res = parseAtomEscape();
if (!res) {
if (!isUnicodeMode && lookahead() == 'c') {
// B.1.4 ExtendedAtom
// \[lookahead = c]
return createValue('symbol', 92, pos - 1, pos);
}
bail('atomEscape');
}
return res;
}
case '[':
return parseCharacterClass();
case '(': {
if (features.lookbehind && (res = parseGroup('(?<=', 'lookbehind', '(?<!', 'negativeLookbehind'))) {
return res;
}
else if (features.namedGroups && match("(?<")) {
var name = parseIdentifier();
skip(">");
declareGroupName(name);
var group = finishGroup("normal", name.range[0] - 3);
group.name = name;
return group;
}
else if (features.modifiers && current("(?") && str[pos + 2] != ":") {
return parseModifiersGroup();
}
else {
// ( Disjunction )
// (?: Disjunction )
return parseGroup('(?:', 'ignore', '(', 'normal');
}
}
case ']':
case '}':
// ExtendedPatternCharacter, first part. See parseTerm.
if (!isUnicodeMode) {
incr();
return createCharacter(res);
}
break;
case '^':
case '$':
case '*':
case '+':
case '?':
case '{':
case ')':
case '|':
break;
default:
// PatternCharacter
incr();
return createCharacter(res);
}
}
function parseModifiersGroup() {
function hasDupChar(str) {
var i = 0;
while (i < str.length) {
if (str.indexOf(str[i], i + 1) != -1) {
return true;
}
i++;
}
return false;
}
var from = pos;
incr(2);
var enablingFlags = matchReg(/^[sim]+/);
var disablingFlags;
if(matchOne("-") && lookahead() !== ":"){
disablingFlags = matchReg(/^[sim]+/);
if (!disablingFlags) {
bail('Invalid flags for modifiers group');
}
} else if(!enablingFlags){
bail('Invalid flags for modifiers group');
}
enablingFlags = enablingFlags ? enablingFlags[0] : "";
disablingFlags = disablingFlags ? disablingFlags[0] : "";
var flags = enablingFlags + disablingFlags;
if(flags.length > 3 || hasDupChar(flags)) {
bail('flags cannot be duplicated for modifiers group');
}
if(!matchOne(":")) {
bail('Invalid flags for modifiers group');
}
var modifiersGroup = finishGroup("ignore", from);
modifiersGroup.modifierFlags = {
enabling: enablingFlags,
disabling: disablingFlags
};
return modifiersGroup;
}
function parseUnicodeSurrogatePairEscape(firstEscape, isUnicodeMode) {
if (isUnicodeMode) {
var first, second;
if (firstEscape.kind == 'unicodeEscape' &&
(first = firstEscape.codePoint) >= 0xD800 && first <= 0xDBFF &&
currentOne('\\') && next('u') ) {
var prevPos = pos;
pos++;
var secondEscape = parseClassEscape();
if (secondEscape.kind == 'unicodeEscape' &&
(second = secondEscape.codePoint) >= 0xDC00 && second <= 0xDFFF) {
// Unicode surrogate pair
firstEscape.kind = 'unicodeCodePointEscape';
firstEscape.codePoint = (first - 0xD800) * 0x400 + second - 0xDC00 + 0x10000;
firstEscape.range[1] = pos;
firstEscape.raw = str.substring(firstEscape.range[0], pos)
}
else {
pos = prevPos;
}
}
}
return firstEscape;
}
function parseClassEscape() {
return parseAtomEscape(true);
}
function parseAtomEscape(insideCharacterClass) {
// AtomEscape ::
// DecimalEscape
// CharacterClassEscape
// CharacterEscape
// [+NamedCaptureGroups] k GroupName
//
// ClassEscape ::
// b
// [+UnicodeMode] -
// [~UnicodeMode] c ClassControlLetter (Annex B)
// CharacterClassEscape
// CharacterEscape
var res, from = pos, ch;
switch (ch = lookahead()) {
case '0':
case '1':
case '2':
case '3':
case '4':
case '5':
case '6':
case '7':
case '8':
case '9':
return parseDecimalEscape(insideCharacterClass);
case 'B': {
// IdentityEscape (Annex B) ::
// [~UnicodeMode] SourceCharacterIdentityEscape
// SourceCharacterIdentityEscape (Annex B) :: B
if (insideCharacterClass && isUnicodeMode) {
bail('\\B not possible inside of CharacterClass', '', from);
}
return parseIdentityEscape();
}
case 'b': {
if (insideCharacterClass) {
// ClassEscape :: b
// The CharSet containing the one character U+0008 (BACKSPACE).
//
// SEE: https://tc39.es/ecma262/#sec-compiletocharset
incr();
return createEscaped('singleEscape', 0x0008, '\\b');
} else {
return parseIdentityEscape();
}
}
case 'c': {
if (insideCharacterClass) {
if (!isUnicodeMode && (res = matchReg(/^c(\d)/))) {
// ClassEscape (Annex B) :: [~UnicodeMode] c ClassControlLetter
// ClassControlLetter :: DecimalDigit
return createEscaped('controlLetter', res[1].charCodeAt(0) % 32, res[1], 2);
} else if (!isUnicodeMode && match("c_")) {
// ClassEscape (Annex B) :: [~UnicodeMode] c ClassControlLetter
// ClassControlLetter :: _
return createEscaped('controlLetter', 31, '_', 2);
}
}
return parseCharacterEscape();
}
// CharacterClassEscape ::
// d
// D
// s
// S
// w
// W
case 'd':
case 'D':
case 'w':
case 'W':
case 's':
case 'S':
incr();
return createCharacterClassEscape(ch);
case 'k':
if (namedCaptureGroups) {
// AtomEscape :: [+NamedCaptureGroups] k GroupName
if (!insideCharacterClass && features.namedGroups) {
if (res = parseNamedReference()) {
return res;
}
// `k` is not an IdentityEscape with NamedCaptureGroups.
if (next('<')) {
bail('Invalid capture group name', '', from);
}
bail('Invalid named reference', '', from);
}
} else {
// `\k` is an IdentityEscape, unless the pattern contains a
// GroupName and is parsed again with NamedCaptureGroups.
hasIdentityEscapeK = true;
}
return parseIdentityEscape();
case 'p':
case 'P':
return parseUnicodePropertyEscape() || parseIdentityEscape();
case '-': {
// [+U] -
if (insideCharacterClass && isUnicodeMode) {
incr();
return createEscaped('singleEscape', 0x002d, '\\-');
}
return parseIdentityEscape();
}
default:
return parseCharacterEscape();
}
}
function parseDecimalEscape(insideCharacterClass) {
// DecimalEscape ::
// NonZeroDigit DecimalDigits[~Sep]? [lookahead ∉ DecimalDigit]
var res, match, from = pos;
if (res = matchReg(/^(?!0)\d+/)) {
match = res[0];
var refIdx = parseInt(match, 10);
if (refIdx <= closedCaptureCounter && !insideCharacterClass) {
// If the number is smaller than the normal-groups found so
// far, then it is a reference...
return createReference(match);
} else {
// ... otherwise it needs to be interpreted as a octal (if the
// number is in an octal format). If it is NOT octal format,
// then the slash is ignored and the number is matched later
// as normal characters.
// Recall the negative decision to decide if the input must be parsed
// a second time with the total normal-groups.
backrefDenied.push(refIdx);
// \1 octal escapes are disallowed in unicode mode, but they might
// be references to groups which haven't been parsed yet.
// We must parse a second time to determine if \1 is a reference
// or an octal scape, and then we can report the error.
if (firstIteration) {
shouldReparse = true;
} else {
bailOctalEscapeIfUnicode(from, pos);
}
// Reset the position again, as maybe only parts of the previous
// matched numbers are actual octal numbers. E.g. in '19' only
// the '1' should be matched, and in '400' only the '40'.
incr(-match.length);
if (res = matchLegacyOctalEscapeSequence()) {
return createEscaped('octal', parseInt(res[0], 8), res[0], 1);
} else {
// If we end up here, we have a case like /\91/. Then the
// first slash is to be ignored and the 9 & 1 to be treated
// like ordinary characters. Create a character for the
// first number only here - other number-characters
// (if available) will be matched later.
var start = pos;
res = createCharacter(matchReg(/^[89]/));
return updateRawStart(res, start - 1);
}
}
}
// Only allow octal numbers in the following. All matched numbers start
// with a zero (if the do not, the previous if-branch is executed).
// If the number is not octal format and starts with zero (e.g. `091`)
// then only the zeros `0` is treated here and the `91` are ordinary
// characters.
// Example:
// /\091/.exec('\091')[0].length === 3
else if (res = matchLegacyOctalEscapeSequence()) {
match = res[0];
// CharacterEscape :: 0 [lookahead ∉ DecimalDigit]
// A `0` followed by `8` or `9` (e.g. `\08`) is only valid as an Annex B
// LegacyOctalEscapeSequence.
if (match !== '0' || /\d/.test(lookahead())) {
bailOctalEscapeIfUnicode(from, pos);
}
if (/^0{1,3}$/.test(match)) {
// If they are all zeros, they must be U+0000.
return createEscaped('null', 0x0000, '0', match.length);
} else {
return createEscaped('octal', parseInt(match, 8), match, 1);
}
}
return false;
}
function matchLegacyOctalEscapeSequence() {
// LegacyOctalEscapeSequence ::
// 0 [lookahead ∈ { 8, 9 }]
// NonZeroOctalDigit [lookahead ∉ OctalDigit]
// ZeroToThree OctalDigit [lookahead ∉ OctalDigit]
// FourToSeven OctalDigit
// ZeroToThree OctalDigit OctalDigit
//
// The escape is at most \377, e.g. in '\400' only the '\40' is matched.
return matchReg(/^(?:[0-3][0-7]{0,2}|[4-7][0-7]?)/);
}
function bailOctalEscapeIfUnicode(from, pos) {
if (isUnicodeMode) {
bail("Invalid decimal escape in unicode mode", null, from, pos);
}
}
function parseUnicodePropertyEscape() {
var res, from = pos;
if (features.unicodePropertyEscape && isUnicodeMode && (res = matchReg(/^([pP])\{([^}]+)\}/))) {
// https://github.com/jviereck/regjsparser/issues/77
return {
type: 'unicodePropertyEscape',
negative: res[1] === 'P',
value: res[2],
range: [from - 1, pos],
raw: str.substring(from - 1, pos)
};
}
return false;
}
function parseNamedReference() {
if (features.namedGroups && matchReg(/^k<(?=.*?>)/)) {
var name = parseIdentifier();
skip('>');
namedReferences.push(name);
return createNamedReference(name);
}
}
function parseRegExpUnicodeEscapeSequence(isUnicodeMode) {
var res;
if (res = matchReg(/^u([0-9a-fA-F]{4})/)) {
// RegExpUnicodeEscapeSequence ::
// [+UnicodeMode] u HexLeadSurrogate \u HexTrailSurrogate
// [+UnicodeMode] u HexLeadSurrogate
// [+UnicodeMode] u HexTrailSurrogate
// [+UnicodeMode] u HexNonSurrogate
// [~UnicodeMode] u Hex4Digits
return parseUnicodeSurrogatePairEscape(
createEscaped('unicodeEscape', parseInt(res[1], 16), res[1], 2),
isUnicodeMode
);
} else if (isUnicodeMode && (res = matchReg(/^u\{([0-9a-fA-F]+)\}/))) {
// RegExpUnicodeEscapeSequence ::
// [+UnicodeMode] u{ CodePoint }
return createEscaped('unicodeCodePointEscape', parseInt(res[1], 16), res[1], 4);
}
}
function parseCharacterEscape() {
// CharacterEscape ::
// ControlEscape
// c AsciiLetter
// 0 [lookahead ∉ DecimalDigit]
// HexEscapeSequence
// RegExpUnicodeEscapeSequence
// [~UnicodeMode] LegacyOctalEscapeSequence (Annex B)
// IdentityEscape
var res;
var from = pos;
switch (lookahead()) {
case 't':
incr();
return createEscaped('singleEscape', 0x009, '\\t');
case 'n':
incr();
return createEscaped('singleEscape', 0x00A, '\\n');
case 'v':
incr();
return createEscaped('singleEscape', 0x00B, '\\v');
case 'f':
incr();
return createEscaped('singleEscape', 0x00C, '\\f');
case 'r':
incr();
return createEscaped('singleEscape', 0x00D, '\\r');
case 'c':
if (res = matchReg(/^c([a-zA-Z])/)) {
// c ControlLetter
return createEscaped('controlLetter', res[1].charCodeAt(0) % 32, res[1], 2);
}
break;
case '0':
// 0 [lookahead ∉ DecimalDigit]
// Only reached from ClassSetCharacter: AtomEscape and ClassEscape
// handle decimal digits before trying CharacterEscape.
if (matchReg(/^0(?!\d)/)) {
return createEscaped('null', 0x0000, '0', 1);
}
break;
case 'x':
if (res = matchReg(/^x([0-9a-fA-F]{2})/)) {
// HexEscapeSequence
return createEscaped('hexadecimalEscape', parseInt(res[1], 16), res[1], 2);
}
break;
case 'u':
if (res = parseRegExpUnicodeEscapeSequence(isUnicodeMode)) {
if (!res || res.codePoint > 0x10FFFF) {
bail('Invalid escape sequence', null, from, pos);
}
return res;
}
break;
}
// IdentityEscape
return parseIdentityEscape();
}
function parseIdentifierAtom(check) {
// RegExpIdentifierStart ::
// IdentifierStartChar
// \ RegExpUnicodeEscapeSequence[+UnicodeMode]
// [~UnicodeMode] UnicodeLeadSurrogate UnicodeTrailSurrogate
//
// RegExpIdentifierPart ::
// IdentifierPartChar
// \ RegExpUnicodeEscapeSequence[+UnicodeMode]
// [~UnicodeMode] UnicodeLeadSurrogate UnicodeTrailSurrogate
var ch = lookahead();
var from = pos;
if (ch === '\\') {
incr();
var esc = parseRegExpUnicodeEscapeSequence(true);
if (!esc || !check(esc.codePoint)) {
bail('Invalid escape sequence', null, from, pos);
}
return fromCodePoint(esc.codePoint);
}
var code = ch.charCodeAt(0);
if (code >= 0xD800 && code <= 0xDBFF) {
ch += str[pos + 1];
var second = ch.charCodeAt(1);
if (second >= 0xDC00 && second <= 0xDFFF) {
// Unicode surrogate pair
code = (code - 0xD800) * 0x400 + second - 0xDC00 + 0x10000;
}
}
if (!check(code)) return;
incr();
if (code > 0xFFFF) incr();
return ch;
}
function parseIdentifier() {
// RegExpIdentifierName ::
// RegExpIdentifierStart
// RegExpIdentifierName RegExpIdentifierPart
var start = pos;
var res = parseIdentifierAtom(isIdentifierStart);
if (!res) {
bail('Invalid identifier');
}
var ch;
while (ch = parseIdentifierAtom(isIdentifierPart)) {
res += ch;
}
return {
type: 'identifier',
value: res,
range: [start, pos],
raw: str.substring(start, pos)
};
}
function isIdentifierStart(ch) {
// ECMAScript (Unicode v18.0.0) NonAsciiIdentifierStart:
// Generated by `tools/generate-identifier-regex.js`.
var NonAsciiIdentifierStart = /[\xAA\xB5\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0370-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u048A-\u052F\u0531-\u0556\u0558\u0559\u0560-\u0588\u058B\u058C\u05D0-\u05EA\u05EF-\u05F2\u0620-\u064A\u066E\u066F\u0671-\u06D3\u06D5\u06E5\u06E6\u06EE\u06EF\u06FA-\u06FC\u06FF\u0710\u0712-\u072F\u074D-\u07A5\u07B1\u07CA-\u07EA\u07F4\u07F5\u07FA\u0800-\u0815\u081A\u0824\u0828\u0840-\u0858\u0860-\u086A\u0870-\u0887\u0889-\u088F\u08A0-\u08C9\u0904-\u0939\u093D\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BD\u09CE\u09DC\u09DD\u09DF-\u09E1\u09F0\u09F1\u09FC\u0A05-\u0A0A\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39\u0A59-\u0A5C\u0A5E\u0A72-\u0A74\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABD\u0AD0\u0AE0\u0AE1\u0AF9\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3D\u0B5C\u0B5D\u0B5F-\u0B61\u0B71\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BD0\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D\u0C58-\u0C5A\u0C5C\u0C5D\u0C60\u0C61\u0C80\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBD\u0CDC-\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D04-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D\u0D4E\u0D54-\u0D56\u0D5F-\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81\u0E82\u0E84\u0E86-\u0E8A\u0E8C-\u0EA3\u0EA5\u0EA7-\u0EB0\u0EB2\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6\u0EDC-\u0EDF\u0F00\u0F40-\u0F47\u0F49-\u0F6C\u0F88-\u0F8C\u1000-\u102A\u103F\u1050-\u1055\u105A-\u105D\u1061\u1065\u1066\u106E-\u1070\u1075-\u1081\u108E\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u1380-\u138F\u13A0-\u13F5\u13F8-\u13FD\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16EE-\u16F8\u1700-\u1711\u171F-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7\u17DC\u1820-\u1878\u1880-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191E\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u1A00-\u1A16\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4C\u1B83-\u1BA0\u1BAE\u1BAF\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1C80-\u1C8A\u1C90-\u1CBA\u1CBD-\u1CBF\u1CE9-\u1CEC\u1CEE-\u1CF3\u1CF5\u1CF6\u1CFA\u1D00-\u1DBF\u1E00-\u1F15\u1F18-\u1F1D\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D\u1F5F-\u1F7D\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC\u1FD0-\u1FD3\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u2071\u207F\u208F-\u209F\u2102\u2107\u210A-\u2113\u2115\u2118-\u211D\u2124\u2126\u2128\u212A-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2160-\u2188\u2C00-\u2CE4\u2CEB-\u2CEE\u2CF2\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D80-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u3005-\u3007\u3021-\u3029\u3031-\u3035\u3038-\u303C\u3041-\u3096\u309B-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312F\u3131-\u318E\u31A0-\u31BF\u31F0-\u31FF\u3400-\u4DBF\u4E00-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B\uA640-\uA66E\uA67F-\uA69D\uA6A0-\uA6EF\uA717-\uA71F\uA722-\uA788\uA78B-\uA7DD\uA7E2\uA7F1-\uA801\uA803-\uA805\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB\uA8FD\uA8FE\uA90A-\uA925\uA930-\uA946\uA960-\uA97C\uA984-\uA9B2\uA9CF\uA9E0-\uA9E4\uA9E6-\uA9EF\uA9FA-\uA9FE\uAA00-\uAA28\uAA40-\uAA42\uAA44-\uAA4B\uAA60-\uAA76\uAA7A\uAA7E-\uAAAF\uAAB1\uAAB5\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADD\uAAE0-\uAAEA\uAAF2-\uAAF4\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB69\uAB6C\uAB6D\uAB70-\uABE2\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D\uFB1F-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE70-\uFE74\uFE76-\uFEFC\uFF21-\uFF3A\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC]|\uD800[\uDC00-\uDC0B\uDC0D-\uDC26\uDC28-\uDC3A\uDC3C\uDC3D\uDC3F-\uDC4D\uDC50-\uDC5D\uDC80-\uDCFA\uDD40-\uDD74\uDE80-\uDE9C\uDEA0-\uDED0\uDF00-\uDF1F\uDF2D-\uDF4A\uDF50-\uDF75\uDF80-\uDF9D\uDFA0-\uDFC3\uDFC8-\uDFCF\uDFD1-\uDFD5]|\uD801[\uDC00-\uDC9D\uDCB0-\uDCD3\uDCD8-\uDCFB\uDD00-\uDD27\uDD30-\uDD63\uDD70-\uDD7A\uDD7C-\uDD8A\uDD8C-\uDD92\uDD94\uDD95\uDD97-\uDDA1\uDDA3-\uDDB1\uDDB3-\uDDB9\uDDBB\uDDBC\uDDC0-\uDDF3\uDE00-\uDF36\uDF40-\uDF55\uDF60-\uDF67\uDF80-\uDF85\uDF87-\uDFB0\uDFB2-\uDFBF]|\uD802[\uDC00-\uDC05\uDC08\uDC0A-\uDC35\uDC37\uDC38\uDC3C\uDC3F-\uDC55\uDC60-\uDC76\uDC80-\uDC9E\uDCE0-\uDCF2\uDCF4\uDCF5\uDD00-\uDD15\uDD20-\uDD39\uDD40-\uDD59\uDD80-\uDDB7\uDDBE\uDDBF\uDE00\uDE10-\uDE13\uDE15-\uDE17\uDE19-\uDE35\uDE60-\uDE7C\uDE80-\uDE9C\uDEC0-\uDEC7\uDEC9-\uDEE4\uDF00-\uDF35\uDF40-\uDF55\uDF60-\uDF72\uDF80-\uDF91]|\uD803[\uDC00-\uDC48\uDC80-\uDCB2\uDCC0-\uDCF2\uDD00-\uDD23\uDD4A-\uDD65\uDD6F-\uDD85\uDE80-\uDEA9\uDEB0\uDEB1\uDEC2-\uDEC7\uDED9-\uDEEE\uDF00-\uDF1C\uDF27\uDF30-\uDF45\uDF70-\uDF81\uDFB0-\uDFC4\uDFE0-\uDFF6]|\uD804[\uDC03-\uDC37\uDC71\uDC72\uDC75\uDC83-\uDCAF\uDCD0-\uDCE8\uDD03-\uDD26\uDD44\uDD47\uDD50-\uDD72\uDD76\uDD83-\uDDB2\uDDC1-\uDDC4\uDDDA\uDDDC\uDE00-\uDE11\uDE13-\uDE2B\uDE3F\uDE40\uDE80-\uDE86\uDE88\uDE8A-\uDE8D\uDE8F-\uDE9D\uDE9F-\uDEA8\uDEB0-\uDEDE\uDF05-\uDF0C\uDF0F\uDF10\uDF13-\uDF28\uDF2A-\uDF30\uDF32\uDF33\uDF35-\uDF39\uDF3D\uDF50\uDF5D-\uDF61\uDF80-\uDF89\uDF8B\uDF8E\uDF90-\uDFB5\uDFB7\uDFD1\uDFD3]|\uD805[\uDC00-\uDC34\uDC47-\uDC4A\uDC5F-\uDC61\uDC80-\uDCAF\uDCC4\uDCC5\uDCC7\uDD80-\uDDAE\uDDD8-\uDDDB\uDE00-\uDE2F\uDE44\uDE80-\uDEAA\uDEB8\uDF00-\uDF1A\uDF40-\uDF46]|\uD806[\uDC00-\uDC2B\uDCA0-\uDCDF\uDCFF-\uDD06\uDD09\uDD0C-\uDD13\uDD15\uDD16\uDD18-\uDD2F\uDD3F\uDD41\uDDA0-\uDDA7\uDDAA-\uDDD0\uDDE1\uDDE3\uDE00\uDE0B-\uDE32\uDE3A\uDE50\uDE5C-\uDE89\uDE9D\uDEB0-\uDEF8\uDF0A\uDFC0-\uDFE0]|\uD807[\uDC00-\uDC08\uDC0A-\uDC2E\uDC40\uDC72-\uDC8F\uDD00-\uDD06\uDD08\uDD09\uDD0B-\uDD30\uDD46\uDD60-\uDD65\uDD67\uDD68\uDD6A-\uDD89\uDD98\uDDB0-\uDDDB\uDDF1\uDEE0-\uDEF2\uDF02\uDF04-\uDF10\uDF12-\uDF33\uDFB0]|\uD808[\uDC00-\uDF99]|\uD809[\uDC00-\uDC6F\uDC75-\uDD43\uDD50-\uDE86]|\uD80B[\uDF90-\uDFF0]|[\uD80C\uD80E\uD80F\uD81C-\uD822\uD840-\uD868\uD86A-\uD86D\uD86F-\uD872\uD874-\uD879\uD880-\uD883\uD885-\uD88C\uD8B4-\uD8BE][\uDC00-\uDFFF]|\uD80D[\uDC00-\uDC2F\uDC41-\uDC46\uDC60-\uDFFF]|\uD810[\uDC00-\uDFFA]|\uD811[\uDC00-\uDE46]|\uD818[\uDD00-\uDD1D]|\uD81A[\uDC00-\uDE38\uDE40-\uDE5E\uDE70-\uDEBE\uDED0-\uDEED\uDF00-\uDF2F\uDF40-\uDF43\uDF63-\uDF77\uDF7D-\uDF8F]|\uD81B[\uDD40-\uDD6C\uDE40-\uDE7F\uDEA0-\uDEB8\uDEBB-\uDED3\uDF00-\uDF4A\uDF50\uDF93-\uDF9F\uDFE0\uDFE1\uDFE3\uDFF2-\uDFF6]|\uD823[\uDC00-\uDCDA\uDCFF-\uDD20\uDD80-\uDDF2\uDE00-\uDFFF]|\uD824[\uDC00-\uDD91\uDDA0-\uDDD2]|\uD82B[\uDFF0-\uDFF3\uDFF5-\uDFFB\uDFFD\uDFFE]|\uD82C[\uDC00-\uDD28\uDD32\uDD50-\uDD52\uDD55\uDD64-\uDD68\uDD70-\uDEFB]|\uD82F[\uDC00-\uDC6A\uDC70-\uDC7C\uDC80-\uDC88\uDC90-\uDC99]|\uD835[\uDC00-\uDC54\uDC56-\uDC9C\uDC9E\uDC9F\uDCA2\uDCA5\uDCA6\uDCA9-\uDCAC\uDCAE-\uDCB9\uDCBB\uDCBD-\uDCC3\uDCC5-\uDD05\uDD07-\uDD0A\uDD0D-\uDD14\uDD16-\uDD1C\uDD1E-\uDD39\uDD3B-\uDD3E\uDD40-\uDD44\uDD46\uDD4A-\uDD50\uDD52-\uDEA6\uDEA8-\uDEC0\uDEC2-\uDEDA\uDEDC-\uDEFA\uDEFC-\uDF14\uDF16-\uDF34\uDF36-\uDF4E\uDF50-\uDF6E\uDF70-\uDF88\uDF8A-\uDFA8\uDFAA-\uDFC2\uDFC4-\uDFCB]|\uD837[\uDF00-\uDF81\uDF90-\uDF96\uDFCD-\uDFFF]|\uD838[\uDC30-\uDC6D\uDD00-\uDD2C\uDD37-\uDD3D\uDD4E\uDE90-\uDEAD\uDEC0-\uDEEB]|\uD839[\uDCD0-\uDCEB\uDDD0-\uDDED\uDDF0\uDEC0-\uDEDE\uDEE0-\uDEE2\uDEE4\uDEE5\uDEE7-\uDEED\uDEF0-\uDEF4\uDEFE\uDEFF\uDFE0-\uDFE6\uDFE8-\uDFEB\uDFED\uDFEE\uDFF0-\uDFFE]|\uD83A[\uDC00-\uDCC4\uDD00-\uDD43\uDD4B]|\uD83B[\uDE00-\uDE03\uDE05-\uDE1F\uDE21\uDE22\uDE24\uDE27\uDE29-\uDE32\uDE34-\uDE37\uDE39\uDE3B\uDE42\uDE47\uDE49\uDE4B\uDE4D-\uDE4F\uDE51\uDE52\uDE54\uDE57\uDE59\uDE5B\uDE5D\uDE5F\uDE61\uDE62\uDE64\uDE67-\uDE6A\uDE6C-\uDE72\uDE74-\uDE77\uDE79-\uDE7C\uDE7E\uDE80-\uDE89\uDE8B-\uDE9B\uDEA1-\uDEA3\uDEA5-\uDEA9\uDEAB-\uDEBB]|\uD869[\uDC00-\uDEDF\uDF00-\uDFFF]|\uD86E[\uDC00-\uDC1E\uDC20-\uDFFF]|\uD873[\uDC00-\uDEAD\uDEB0-\uDFFF]|\uD87A[\uDC00-\uDFE0\uDFF0-\uDFFF]|\uD87B[\uDC00-\uDE5D]|\uD87E[\uDC00-\uDE1D]|\uD884[\uDC00-\uDF4A\uDF50-\uDFFF]|\uD88D[\uDC00-\uDC79]|\uD8BF[\uDC00-\uDC3F]/;
return (ch === 36) || (ch === 95) || // $ (dollar) and _ (underscore)
(ch >= 65 && ch <= 90) || // A..Z
(ch >= 97 && ch <= 122) || // a..z
((ch >= 0x80) && NonAsciiIdentifierStart.test(fromCodePoint(ch)));
}
// Taken from the Esprima parser.
function isIdentifierPart(ch) {
// ECMAScript (Unicode v18.0.0) NonAsciiIdentifierPartOnly:
// Generated by `tools/generate-identifier-regex.js`.
// eslint-disable-next-line no-misleading-character-class
var NonAsciiIdentifierPartOnly = /[\xB7\u0300-\u036F\u0387\u0483-\u0487\u0591-\u05BD\u05BF\u05C1\u05C2\u05C4\u05C5\u05C7-\u05C9\u0610-\u061A\u064B-\u0669\u0670\u06D6-\u06DC\u06DF-\u06E4\u06E7\u06E8\u06EA-\u06ED\u06F0-\u06F9\u0711\u0730-\u074A\u07A6-\u07B0\u07C0-\u07C9\u07EB-\u07F3\u07FD\u0816-\u0819\u081B-\u0823\u0825-\u0827\u0829-\u082D\u0859-\u085B\u0897-\u089F\u08CA-\u08E1\u08E3-\u0903\u093A-\u093C\u093E-\u094F\u0951-\u0957\u0962\u0963\u0966-\u096F\u0981-\u0983\u09BC\u09BE-\u09C4\u09C7\u09C8\u09CB-\u09CD\u09D7\u09E2\u09E3\u09E6-\u09EF\u09FE\u0A01-\u0A03\u0A3C\u0A3E-\u0A42\u0A47\u0A48\u0A4B-\u0A4D\u0A51\u0A66-\u0A71\u0A75\u0A81-\u0A83\u0ABC\u0ABE-\u0AC5\u0AC7-\u0AC9\u0ACB-\u0ACD\u0AE2\u0AE3\u0AE6-\u0AEF\u0AFA-\u0AFF\u0B01-\u0B03\u0B3C\u0B3E-\u0B44\u0B47\u0B48\u0B4B-\u0B4D\u0B53-\u0B57\u0B62\u0B63\u0B66-\u0B6F\u0B82\u0BBE-\u0BC2\u0BC6-\u0BC8\u0BCA-\u0BCD\u0BD7\u0BE6-\u0BEF\u0C00-\u0C04\u0C3C\u0C3E-\u0C44\u0C46-\u0C48\u0C4A-\u0C4D\u0C55\u0C56\u0C62\u0C63\u0C66-\u0C6F\u0C81-\u0C83\u0CBC\u0CBE-\u0CC4\u0CC6-\u0CC8\u0CCA-\u0CCD\u0CD5\u0CD6\u0CE2\u0CE3\u0CE6-\u0CEF\u0CF3\u0D00-\u0D03\u0D3B\u0D3C\u0D3E-\u0D44\u0D46-\u0D48\u0D4A-\u0D4D\u0D57\u0D62\u0D63\u0D66-\u0D6F\u0D81-\u0D83\u0DCA\u0DCF-\u0DD4\u0DD6\u0DD8-\u0DDF\u0DE6-\u0DEF\u0DF2\u0DF3\u0E31\u0E34-\u0E3A\u0E47-\u0E4E\u0E50-\u0E59\u0EB1\u0EB4-\u0EBC\u0EC8-\u0ECE\u0ED0-\u0ED9\u0F18\u0F19\u0F20-\u0F29\u0F35\u0F37\u0F39\u0F3E\u0F3F\u0F71-\u0F84\u0F86\u0F87\u0F8D-\u0F97\u0F99-\u0FBC\u0FC6\u102B-\u103E\u1040-\u1049\u1056-\u1059\u105E-\u1060\u1062-\u1064\u1067-\u106D\u1071-\u1074\u1082-\u108D\u108F-\u109D\u135D-\u135F\u1369-\u1371\u1712-\u1715\u1732-\u1734\u1752\u1753\u1772\u1773\u17B4-\u17D3\u17DD\u17E0-\u17E9\u180B-\u180D\u180F-\u1819\u18A9\u1920-\u192B\u1930-\u193B\u1946-\u194F\u19D0-\u19DA\u1A17-\u1A1B\u1A55-\u1A5E\u1A60-\u1A7C\u1A7F-\u1A89\u1A90-\u1A99\u1AB0-\u1ABD\u1ABF-\u1AF0\u1B00-\u1B04\u1B34-\u1B44\u1B50-\u1B59\u1B6B-\u1B73\u1B80-\u1B82\u1BA1-\u1BAD\u1BB0-\u1BB9\u1BE6-\u1BF3\u1C24-\u1C37\u1C40-\u1C49\u1C50-\u1C59\u1CD0-\u1CD2\u1CD4-\u1CE8\u1CED\u1CF4\u1CF7-\u1CF9\u1DC0-\u1DFF\u200C\u200D\u203F\u2040\u2054\u20D0-\u20DC\u20E1\u20E5-\u20F0\u2CEF-\u2CF1\u2D7F\u2DE0-\u2DFF\u302A-\u302F\u3099\u309A\u30FB\uA620-\uA629\uA66F\uA674-\uA67D\uA69E\uA69F\uA6F0\uA6F1\uA802\uA806\uA80B\uA823-\uA827\uA82C\uA880\uA881\uA8B4-\uA8C5\uA8D0-\uA8D9\uA8E0-\uA8F1\uA8FF-\uA909\uA926-\uA92D\uA947-\uA953\uA980-\uA983\uA9B3-\uA9C0\uA9D0-\uA9D9\uA9E5\uA9F0-\uA9F9\uAA29-\uAA36\uAA43\uAA4C\uAA4D\uAA50-\uAA59\uAA7B-\uAA7D\uAAB0\uAAB2-\uAAB4\uAAB7\uAAB8\uAABE\uAABF\uAAC1\uAAEB-\uAAEF\uAAF5\uAAF6\uABE3-\uABEA\uABEC\uABED\uABF0-\uABF9\uFB1E\uFE00-\uFE0F\uFE20-\uFE2F\uFE33\uFE34\uFE4D-\uFE4F\uFF10-\uFF19\uFF3F\uFF65]|\uD800[\uDDFD\uDEE0\uDF76-\uDF7A]|\uD801[\uDCA0-\uDCA9]|\uD802[\uDE01-\uDE03\uDE05\uDE06\uDE0C-\uDE0F\uDE38-\uDE3A\uDE3F\uDEE5\uDEE6]|\uD803[\uDD24-\uDD27\uDD30-\uDD39\uDD40-\uDD49\uDD69-\uDD6D\uDEAB\uDEAC\uDECB-\uDECF\uDEF0-\uDEFF\uDF46-\uDF50\uDF82-\uDF85]|\uD804[\uDC00-\uDC02\uDC38-\uDC46\uDC66-\uDC70\uDC73\uDC74\uDC7F-\uDC82\uDCB0-\uDCBA\uDCC2\uDCF0-\uDCF9\uDD00-\uDD02\uDD27-\uDD34\uDD36-\uDD3F\uDD45\uDD46\uDD73\uDD80-\uDD82\uDDB3-\uDDC0\uDDC9-\uDDCC\uDDCE-\uDDD9\uDE2C-\uDE37\uDE3E\uDE41\uDEDF-\uDEEA\uDEF0-\uDEF9\uDF00-\uDF03\uDF3B\uDF3C\uDF3E-\uDF44\uDF47\uDF48\uDF4B-\uDF4D\uDF57\uDF62\uDF63\uDF66-\uDF6C\uDF70-\uDF74\uDFB8-\uDFC0\uDFC2\uDFC5\uDFC7-\uDFCA\uDFCC-\uDFD0\uDFD2\uDFE1\uDFE2]|\uD805[\uDC35-\uDC46\uDC50-\uDC59\uDC5E\uDCB0-\uDCC3\uDCD0-\uDCD9\uDDAF-\uDDB5\uDDB8-\uDDC0\uDDDC\uDDDD\uDE30-\uDE40\uDE50-\uDE59\uDEAB-\uDEB7\uDEC0-\uDEC9\uDED0-\uDEE3\uDF1D-\uDF2B\uDF30-\uDF39]|\uD806[\uDC2C-\uDC3A\uDCE0-\uDCE9\uDD30-\uDD35\uDD37\uDD38\uDD3B-\uDD3E\uDD40\uDD42\uDD43\uDD50-\uDD59\uDDD1-\uDDD7\uDDDA-\uDDE0\uDDE4\uDE01-\uDE0A\uDE33-\uDE39\uDE3B-\uDE3E\uDE47\uDE51-\uDE5B\uDE8A-\uDE99\uDF60-\uDF67\uDFF0-\uDFF9]|\uD807[\uDC2F-\uDC36\uDC38-\uDC3F\uDC50-\uDC59\uDC92-\uDCA7\uDCA9-\uDCB6\uDD31-\uDD36\uDD3A\uDD3C\uDD3D\uDD3F-\uDD45\uDD47\uDD50-\uDD59\uDD8A-\uDD8E\uDD90\uDD91\uDD93-\uDD97\uDDA0-\uDDA9\uDDE0-\uDDE9\uDDF0\uDEF3-\uDEF6\uDF00\uDF01\uDF03\uDF34-\uDF3A\uDF3E-\uDF42\uDF50-\uDF5A]|\uD80D[\uDC40\uDC47-\uDC55]|\uD818[\uDD1E-\uDD39]|\uD81A[\uDE60-\uDE69\uDEC0-\uDEC9\uDEF0-\uDEF4\uDF30-\uDF36\uDF50-\uDF59]|\uD81B[\uDD70-\uDD79\uDF4F\uDF51-\uDF87\uDF8F-\uDF92\uDFE4\uDFF0\uDFF1]|\uD82F[\uDC9D\uDC9E]|\uD833[\uDCF0-\uDCF9\uDF00-\uDF2D\uDF30-\uDF46]|\uD834[\uDD27\uDD28\uDD65-\uDD69\uDD6D-\uDD72\uDD7B-\uDD82\uDD85-\uDD8B\uDDAA-\uDDAD\uDE42-\uDE44\uDE50-\uDE52\uDE5B\uDE5C\uDE5F\uDE80\uDE81]|\uD835[\uDFCE-\uDFFF]|\uD836[\uDE00-\uDE36\uDE3B-\uDE6C\uDE75\uDE84\uDE9B-\uDE9F\uDEA1-\uDEAF]|\uD838[\uDC00-\uDC06\uDC08-\uDC18\uDC1B-\uDC21\uDC23\uDC24\uDC26-\uDC2A\uDC8F\uDD30-\uDD36\uDD40-\uDD49\uDEAE\uDEEC-\uDEF9]|\uD839[\uDCEC-\uDCF9\uDDEE\uDDEF\uDDF1-\uDDFA\uDEE3\uDEE6\uDEEE\uDEEF\uDEF5]|\uD83A[\uDCD0-\uDCD6\uDD44-\uDD4A\uDD50-\uDD59]|\uD83E[\uDFF0-\uDFF9]|\uDB40[\uDD00-\uDDEF]/;
return isIdentifierStart(ch) ||
(ch >= 48 && ch <= 57) || // 0..9
((ch >= 0x80) && NonAsciiIdentifierPartOnly.test(fromCodePoint(ch)));
}
function parseIdentityEscape() {
// IdentityEscape (Annex B) ::
// [+UnicodeMode] SyntaxCharacter
// [+UnicodeMode] /
// [~UnicodeMode] SourceCharacterIdentityEscape
//
// SourceCharacterIdentityEscape (Annex B) ::
// [~NamedCaptureGroups] SourceCharacter but not c
// [+NamedCaptureGroups] SourceCharacter but not one of c or k
var tmp;
var l = lookahead();
if (
(isUnicodeMode && /[\^$.*+?()\\[\]{}|/]/.test(l)) ||
(!isUnicodeMode && l !== "c" && !(namedCaptureGroups && l === "k"))
) {
tmp = consume(1);
return createEscaped('identifier', tmp.charCodeAt(0), tmp, 1);
}
return null;
}
function parseCharacterClass() {
// CharacterClass ::
// [ [lookahead ≠ ^] ClassContents ]
// [^ ClassContents ]
var res, from = pos;
if (match("[^")) {
res = parseClassContents();
skip(']');
// It is a Syntax Error if MayContainStrings of the ClassContents is
// true, as a negated class cannot be complemented sensibly.
//
// SEE: https://tc39.es/ecma262/#sec-patterns-static-semantics-early-errors
if (hasUnicodeSetFlag && mayContainStrings(res)) {
bail('Negated character class may contain strings', '', from, pos);
}
return createCharacterClass(res, true, from, pos);
} else if (matchOne('[')) {
res = parseClassContents();
skip(']');
return createCharacterClass(res, false, from, pos);
}
return null;
}
function mayContainStrings(contents) {
// MayContainStrings of ClassContents, i.e. of a ClassUnion,
// ClassIntersection or ClassSubtraction.
//
// SEE: https://tc39.es/ecma262/#sec-static-semantics-maycontainstrings
switch (contents.kind) {
case 'intersection':
// The intersection may contain strings only if all operands may.
return contents.body.every(operandMayContainStrings);
case 'subtraction':
// The subtraction may contain strings only if the first operand may.
return operandMayContainStrings(contents.body[0]);
default:
// The union may contain strings if any operand may.
return contents.body.some(operandMayContainStrings);
}
}
function operandMayContainStrings(node) {
switch (node.type) {
case 'classStrings':
// ClassStringDisjunction: true if any ClassString is not exactly one
// character, which includes the empty string.
return node.strings.some(function (string) {
return string.characters.length !== 1;
});
case 'characterClass':
// NestedClass :: [^ ClassContents ] is always false.
return !node.negative && mayContainStrings(node);
case 'unicodePropertyEscape':
return !node.negative && isBinaryPropertyOfStrings(node.value);
default:
// ClassSetCharacter, ClassSetRange, CharacterClassEscape :: d D s S w W
return false;
}
}
function isBinaryPropertyOfStrings(value) {
// SEE: https://tc39.es/ecma262/#table-binary-unicode-properties-of-strings
switch (value) {
case 'Basic_Emoji':
case 'Emoji_Keycap_Sequence':
case 'RGI_Emoji_Modifier_Sequence':
case 'RGI_Emoji_Flag_Sequence':
case 'RGI_Emoji_Tag_Sequence':
case 'RGI_Emoji_ZWJ_Sequence':
case 'RGI_Emoji':
return true;
default:
return false;
}
}
function parseClassContents() {
// ClassContents ::
// [empty]
// [~UnicodeSetsMode] NonemptyClassRanges
// [+UnicodeSetsMode] ClassSetExpression
var res;
if (currentOne(']')) {
// Empty array means nothing inside of the ClassRange.
return { kind: 'union', body: [] };
} else if (hasUnicodeSetFlag) {
return parseClassSetExpression();
} else {
res = parseNonemptyClassRanges();
if (!res) {
bail('nonEmptyClassRanges');
}
return { kind: 'union', body: res };
}
}
function parseNonemptyClassRanges() {
// NonemptyClassRanges ::
// ClassAtom
// ClassAtom NonemptyClassRangesNoDash
// ClassAtom - ClassAtom ClassContents
//
// NonemptyClassRangesNoDash ::
// ClassAtom
// ClassAtomNoDash NonemptyClassRangesNoDash
// ClassAtomNoDash - ClassAtom ClassContents
//
// Both productions are right-recursive. They are parsed within a loop such
// that large classes take linear time and don't overflow the call stack.
var contents = [], rangeIndexes = [];
var atom, atomTo, dash, range, i, j;
do {
atom = parseClassAtom();
if (!atom) {
bail('classAtom');
}
if (currentOne('-') && !next(']')) {
// ClassAtom - ClassAtom ClassContents
incr();
dash = createCharacter('-');
atomTo = parseClassAtom();
if (!atomTo) {
bail('classAtom');
}
rangeIndexes.push(contents.length);
contents.push({ atom: atom, dash: dash, atomTo: atomTo, from: atom.range[0], to: pos });
} else {
// ClassAtom
// ClassAtom NonemptyClassRangesNoDash
contents.push(atom);
}
} while (!currentOne(']'));
// Build the ranges from right to left. This keeps the error precedence
// of the recursive grammar, where a range is checked only after the
// rest of the class has been parsed.
for (i = rangeIndexes.length - 1; i >= 0; i--) {
range = contents[rangeIndexes[i]];
// Check if both the from and atomTo have codePoints.
if (!('codePoint' in range.atom) || !('codePoint' in range.atomTo)) {
if (!isUnicodeMode) {
// If not, don't create a range but treat them as
// `atom` `-` `atom` instead.
//
// SEE: https://tc39.es/ecma262/#sec-regular-expression-patterns-semantics
// NonemptyClassRanges::ClassAtom - ClassAtom ClassContents
// CharacterRangeOrUnion
contents[rangeIndexes[i]] = [range.atom, range.dash, range.atomTo];
} else {
// With unicode flag, both sides must have codePoints if
// one side has a codePoint.
//
// SEE: https://tc39.es/ecma262/#sec-patterns-static-semantics-early-errors
// NonemptyClassRanges :: ClassAtom - ClassAtom ClassContents
bail('invalid character class');
}
} else {
contents[rangeIndexes[i]] = createClassRange(range.atom, range.atomTo, range.from, range.to);
}
}
// Flatten contents to return a single array of class elements.
var res = [];
for (i = 0; i < contents.length; i++) {
var contentsItem = contents[i];
if (Array.isArray(contentsItem)) {
for (j = 0; j < contentsItem.length; j++) {
res.push(contentsItem[j]);
}
} else {
res.push(contentsItem);
}
}
return res;
}
function parseClassAtom() {
// ClassAtom ::
// -
// ClassAtomNoDash
if (matchOne('-')) {
return createCharacter('-');
} else {
return parseClassAtomNoDash();
}
}
function parseClassAtomNoDash() {
// ClassAtomNoDash ::
// SourceCharacter but not one of \ or ] or -
// \ ClassEscape
//
// ClassAtomNoDash (Annex B) ::
// ...
// \ [lookahead = c]
var res;
switch ((res = lookahead())) {
case "\\": {
incr();
res = parseClassEscape();
if (!res) {
if (!isUnicodeMode && lookahead() == "c") {
return createCharacter("\\");
}
bail("classEscape");
}
return parseUnicodeSurrogatePairEscape(res, isUnicodeMode);
}
case "]":
case "-":
break;
default:
incr();
return createCharacter(res);
}
}
function parseClassSetExpression() {
// ClassSetExpression ::
// ClassUnion
// ClassIntersection
// ClassSubtraction
//
// ClassUnion ::
// ClassSetRange ClassUnion?
// ClassSetOperand ClassUnion?
//
// ClassIntersection ::
// ClassSetOperand && [lookahead ≠ &] ClassSetOperand
// ClassIntersection && [lookahead ≠ &] ClassSetOperand
//
// ClassSubtraction ::
// ClassSetOperand -- ClassSetOperand
// ClassSubtraction -- ClassSetOperand
//
var body = [];
var kind;
var operand = parseClassSetOperand(/* allowRanges*/ true);
body.push(operand);
// A single `&` or `-` is not an operator: `&` is an ordinary
// ClassSetCharacter and a lone `-` is a syntax error, which the next
// parseClassSetOperand() call reports.
if (operand.type === 'characterClassRange') {
kind = 'union';
} else if (currentOne('&') && next('&')) {
kind = 'intersection';
} else if (currentOne('-') && next('-')) {
kind = 'subtraction';
} else {
kind = 'union';
}
while (!currentOne(']')) {
if (kind === 'intersection') {
skip('&');
skip('&');
if (currentOne('&')) {
bail('&& cannot be followed by &. Wrap it in brackets: &&[&].');
}
} else if (kind === 'subtraction') {
skip('-');
skip('-');
}
operand = parseClassSetOperand(/* allowRanges*/ kind === 'union');
body.push(operand);
}
return { kind: kind, body: body };
}
function parseClassSetOperand(allowRanges) {
// ClassSetOperand ::
// NestedClass
// ClassStringDisjunction
// ClassSetCharacter
//
// NestedClass ::
// [ [lookahead ≠ ^] ClassContents[+UnicodeMode, +UnicodeSetsMode] ]
// [^ ClassContents[+UnicodeMode, +UnicodeSetsMode] ]
// \ CharacterClassEscape[+UnicodeMode]
//
// ClassSetRange ::
// ClassSetCharacter - ClassSetCharacter
//
// ClassSetCharacter ::
// [lookahead ∉ ClassSetReservedDoublePunctuator] SourceCharacter but not ClassSetSyntaxCharacter
// \ CharacterEscape[+UnicodeMode]
// \ ClassSetReservedPunctuator
// \b
//
// ClassSetSyntaxCharacter :: one of
// ( ) [ ] { } / - \ |
var from = pos;
var start, res;
if (matchOne('\\')) {
// ClassSetOperand ::
// NestedClass
// ClassStringDisjunction
// ...
//
// NestedClass ::
// ...
// \ CharacterClassEscape[+UnicodeMode]
if (match('q{')) {
return parseClassStringDisjunction();
} else if (res = parseClassEscape()) {
if (res.type === 'characterClassEscape' || res.type === 'unicodePropertyEscape') {
// NestedClass ::
// \ CharacterClassEscape[+UnicodeMode]
//
// A NestedClass is not a ClassSetCharacter, so it cannot start a
// ClassSetRange, e.g. `[\d-a]` is a SyntaxError.
return res;
}
start = res;
} else if (res = parseClassSetCharacterEscapedHelper()) {
start = res;
} else {
bail('Invalid escape', '\\' + lookahead(), from);
}
} else if (res = parseClassSetCharacterUnescapedHelper()) {
start = res;
} else if (res = parseCharacterClass()) {
// ClassSetOperand ::
// NestedClass
// ...
//
// NestedClass ::
// [ [lookahead ≠ ^] ClassContents[+UnicodeMode, +UnicodeSetsMode] ]
// [^ ClassContents[+UnicodeMode, +UnicodeSetsMode] ]
// ...
return res;
} else {
bail('Invalid character', lookahead());
}
if (allowRanges && currentOne('-') && !next('-')) {
incr();
if (res = parseClassSetCharacter()) {
// ClassSetRange ::
// ClassSetCharacter - ClassSetCharacter
return createClassRange(start, res, from, pos);
}
bail('Invalid range end', lookahead());
}
// ClassSetOperand ::
// ...
// ClassSetCharacter
return start;
}
function parseClassSetCharacter() {
// ClassSetCharacter ::
// [lookahead ∉ ClassSetReservedDoublePunctuator] SourceCharacter but not ClassSetSyntaxCharacter
// \ CharacterEscape[+UnicodeMode]
// \ ClassSetReservedPunctuator
// \b
if (matchOne('\\')) {
var res, from = pos;
if (res = parseClassSetCharacterEscapedHelper()) {
return res;
} else {
bail('Invalid escape', '\\' + lookahead(), from);
}
}
return parseClassSetCharacterUnescapedHelper();
}
function parseClassSetCharacterUnescapedHelper() {
// ClassSetCharacter ::
// [lookahead ∉ ClassSetReservedDoublePunctuator] SourceCharacter but not ClassSetSyntaxCharacter
// ...
var res;
if (matchReg(/^(?:&&|!!|##|\$\$|%%|\*\*|\+\+|,,|\.\.|::|;;|<<|==|>>|\?\?|@@|\^\^|``|~~)/)) {
bail('Invalid set operation in character class');
}
if (res = matchReg(/^[^()[\]{}/\-\\|]/)) {
return createCharacter(res);
}
}
function parseClassSetCharacterEscapedHelper() {
// ClassSetCharacter ::
// ...
// \ CharacterEscape[+UnicodeMode]
// \ ClassSetReservedPunctuator
// \b
var res;
if (matchOne('b')) {
return createEscaped('singleEscape', 0x0008, '\\b');
} else if (matchOne('B')) {
bail('\\B not possible inside of ClassContents', '', pos - 2);
} else if (res = matchReg(/^[&\-!#%,:;<=>@`~]/)) {
return createEscaped('identifier', res[0].codePointAt(0), res[0]);
} else if (res = parseCharacterEscape()) {
return res;
} else {
return null;
}
}
function parseClassStringDisjunction() {
// ClassStringDisjunction ::
// \q{ ClassStringDisjunctionContents }
//
// ClassStringDisjunctionContents ::
// ClassString
// ClassString | ClassStringDisjunctionContents
// When calling this function, \q{ has already been consumed.
var from = pos - 3;
var res = [];
do {
res.push(parseClassString());
} while (matchOne('|'));
skip('}');
return createClassStrings(res, from, pos);
}
function parseClassString() {
// ClassString ::
// [empty]
// NonEmptyClassString
//
// NonEmptyClassString ::
// ClassSetCharacter NonEmptyClassString?
var res = [], from = pos;
var char;
while (char = parseClassSetCharacter()) {
res.push(char);
}
return createClassString(res, from, pos);
}
function declareGroupName(name) {
// Pattern :: Disjunction
// It is a Syntax Error if Pattern contains two distinct GroupSpecifiers
// x and y such that the CapturingGroupName of x is the CapturingGroupName
// of y and such that MightBothParticipate(x, y) is true.
//
// SEE: https://tc39.es/ecma262/#sec-patterns-static-semantics-early-errors
//
// MightBothParticipate(x, y) is false only if x and y are in different
// alternatives of a Disjunction. A name is visible from the point of
// its declaration, except in the following alternatives of the same
// Disjunction (see parseDisjunction()). Another group with a visible
// name might participate together with this one.
if (visibleGroupNames[name.value]) {
bail('Duplicate capture group name', name.value, name.range[0], name.range[1]);
}
visibleGroupNames[name.value] = true;
groupNames.push(name.value);
// The pattern contains a GroupName, so it is parsed with
// [+NamedCaptureGroups]. See the second pass in parse().
namedCaptureGroups = true;
}
function checkNamedReferences() {
// AtomEscape :: k GroupName
// It is a Syntax Error if GroupSpecifiersThatMatch(GroupName) is empty.
//
// SEE: https://tc39.es/ecma262/#sec-patterns-static-semantics-early-errors
for (var i = 0; i < namedReferences.length; i++) {
var name = namedReferences[i];
if (!(name.value in visibleGroupNames)) {
bail('Invalid named capture referenced', name.value, name.range[0], name.range[1]);
}
}
}
function bail(message, details, from, to) {
from = from == null ? pos : from;
to = to == null ? from : to;
var contextStart = Math.max(0, from - 10);
var contextEnd = Math.min(to + 10, str.length);
// Output a bit of context and a line pointing to where our error is.
//
// We are assuming that there are no actual newlines in the content as this is a regular expression.
var context = ' ' + str.substring(contextStart, contextEnd);
var pointer = ' ' + new Array(from - contextStart + 1).join(' ') + '^';
throw SyntaxError(message + ' at position ' + from + (details ? ': ' + details : '') + '\n' + context + '\n' + pointer);
}
function parse(input, flags, options) {
// The parser state lives at module scope, so parse() saves the state of
// any call in progress and restores it on exit. This keeps parse()
// reentrant: a nested call, e.g. from input.toString() or from a getter on
// the options, must not clobber the state of the outer call.
var savedStr = str;
var savedFeatures = features;
var savedPos = pos;
var savedBackrefDenied = backrefDenied;
var savedClosedCaptureCounter = closedCaptureCounter;
var savedFirstIteration = firstIteration;
var savedShouldReparse = shouldReparse;
var savedHasUnicodeFlag = hasUnicodeFlag;
var savedHasUnicodeSetFlag = hasUnicodeSetFlag;
var savedIsUnicodeMode = isUnicodeMode;
var savedNamedCaptureGroups = namedCaptureGroups;
var savedGroupNames = groupNames;
var savedVisibleGroupNames = visibleGroupNames;
var savedNamedReferences = namedReferences;
var savedHasIdentityEscapeK = hasIdentityEscapeK;
try {
return parseImpl(input, flags, options);
} finally {
str = savedStr;
features = savedFeatures;
pos = savedPos;
backrefDenied = savedBackrefDenied;
closedCaptureCounter = savedClosedCaptureCounter;
firstIteration = savedFirstIteration;
shouldReparse = savedShouldReparse;
hasUnicodeFlag = savedHasUnicodeFlag;
hasUnicodeSetFlag = savedHasUnicodeSetFlag;
isUnicodeMode = savedIsUnicodeMode;
namedCaptureGroups = savedNamedCaptureGroups;
groupNames = savedGroupNames;
visibleGroupNames = savedVisibleGroupNames;
namedReferences = savedNamedReferences;
hasIdentityEscapeK = savedHasIdentityEscapeK;
}
}
function parseImpl(input, flags, options) {
features = options || {};
backrefDenied = [];
closedCaptureCounter = 0;
firstIteration = true;
shouldReparse = false;
hasUnicodeFlag = (flags || "").indexOf("u") !== -1;
hasUnicodeSetFlag = (flags || "").indexOf("v") !== -1;
isUnicodeMode = hasUnicodeFlag || hasUnicodeSetFlag;
namedCaptureGroups = isUnicodeMode;
groupNames = [];
visibleGroupNames = Object.create(null);
namedReferences = [];
hasIdentityEscapeK = false;
pos = 0;
if (hasUnicodeSetFlag && !features.unicodeSet) {
throw new Error('The "v" flag is only supported when the .unicodeSet option is enabled.');
}
if (hasUnicodeFlag && hasUnicodeSetFlag) {
throw new Error('The "u" and "v" flags are mutually exclusive.');
}
// Convert the input to a string and treat the empty string special.
str = String(input);
if (str === '') {
str = '(?:)';
}
var result = parseDisjunction();
if (result.range[1] !== str.length) {
bail('Could not parse entire input - got stuck', '', result.range[1]);
}
// The spec requires to interpret the `\2` in `/\2()()/` as backreference.
// As the parser collects the number of capture groups as the string is
// parsed it is impossible to make these decisions at the point when the
// `\2` is handled. In case the local decision turns out to be wrong after
// the parsing has finished, the input string is parsed a second time with
// the total number of capture groups set.
//
// SEE: https://github.com/jviereck/regjsparser/issues/70
shouldReparse = shouldReparse || backrefDenied.some(function (ref) {
return ref <= closedCaptureCounter;
});
// Without the u and v flags, the pattern is first parsed with
// [~NamedCaptureGroups]. If it contains a GroupName, it is parsed again
// with [+NamedCaptureGroups]. The parser switches to [+NamedCaptureGroups]
// at the first GroupName already, and only a `\k` before it is parsed
// differently. So the second pass is skipped when there is none.
//
// This relies on `\k` being the only production that depends on
// [NamedCaptureGroups]. If anything else is gated on `namedCaptureGroups`,
// it must also trigger a reparse when it appears before the first
// GroupName.
//
// SEE: https://tc39.es/ecma262/#sec-parsepattern-annexb
if (groupNames.length > 0 && hasIdentityEscapeK) {
shouldReparse = true;
}
if (shouldReparse) {
// Parse the input a second time.
pos = 0;
firstIteration = false;
groupNames = [];
visibleGroupNames = Object.create(null);
namedReferences = [];
result = parseDisjunction();
}
checkNamedReferences();
return result;
}
var regjsparser = {
parse: parse
};
if (typeof module !== 'undefined' && module.exports) {
module.exports = regjsparser;
} else {
window.regjsparser = regjsparser;
}
}());