@sheetxl/sdk 0.8.0-beta.1 → 0.8.0-beta.11

package/browser/esm/{f2G3QRgEbvFJcoa2.mjs → DvAaxH6z_tGvrRzl.mjs}

@@ -1,25 +1,25 @@
 /**
-* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.1
+* @license @sheetxl/sdk - SDK - A high-performance, embeddable spreadsheet engine. - v0.8.0-beta.11
 *
 * (C) 2026-present SheetXL Inc. & Michael T. Ford
 * License: The license can be found at https://www.sheetxl.com/license.
 */
-import { nt as e } from "./BtuJ9AGzeURtAsGo.mjs";
-import { FormulaError as t } from "@sheetxl/primitives";
-function n(e) {
+import { An as e, Bn as t, Dn as n, Fn as r, Gn as i, Hn as a, In as o, Jn as s, Kn as c, Ln as l, Nn as u, Pn as d, Rn as f, Tn as p, Un as m, Vn as h, Wn as g, Xn as _, Yn as v, Zn as y, dr as b, ir as x, jn as S, kn as ee, nr as te, or as C, qn as w, rr as ne, sr as re, zn as ie } from "./C16ycKja6zG0crV_.mjs";
+import { FormulaError as T } from "@sheetxl/primitives";
+function E(e) {
 	console && console.error && console.error(`Error: ${e}`);
 }
-function r(e) {
+function D(e) {
 	console && console.warn && console.warn(`Warning: ${e}`);
 }
-function i(e) {
+function ae(e) {
 	let t = (/* @__PURE__ */ new Date()).getTime(), n = e();
 	return {
 		time: (/* @__PURE__ */ new Date()).getTime() - t,
 		value: n
 	};
 }
-function a(e) {
+function O(e) {
 	function t() {}
 	t.prototype = e;
 	let n = new t();
@@ -28,7 +28,7 @@ function a(e) {
 	}
 	return r(), r(), e;
 }
-var o = class {
+var k = class {
 	get definition() {
 		return this._definition;
 	}
@@ -43,9 +43,9 @@ var o = class {
 			t.accept(e);
 		});
 	}
-}, s = class extends o {
+}, A = class extends k {
 	constructor(e) {
-		super([]), this.idx = 1, Object.assign(this, v(e));
+		super([]), this.idx = 1, Object.assign(this, B(e));
 	}
 	set definition(e) {}
 	get definition() {
@@ -54,35 +54,35 @@ var o = class {
 	accept(e) {
 		e.visit(this);
 	}
-}, c = class extends o {
+}, j = class extends k {
 	constructor(e) {
-		super(e.definition), this.orgText = "", Object.assign(this, v(e));
+		super(e.definition), this.orgText = "", Object.assign(this, B(e));
 	}
-}, l = class extends o {
+}, M = class extends k {
 	constructor(e) {
-		super(e.definition), this.ignoreAmbiguities = !1, Object.assign(this, v(e));
+		super(e.definition), this.ignoreAmbiguities = !1, Object.assign(this, B(e));
 	}
-}, u = class extends o {
+}, N = class extends k {
 	constructor(e) {
-		super(e.definition), this.idx = 1, Object.assign(this, v(e));
+		super(e.definition), this.idx = 1, Object.assign(this, B(e));
 	}
-}, d = class extends o {
+}, P = class extends k {
 	constructor(e) {
-		super(e.definition), this.idx = 1, Object.assign(this, v(e));
+		super(e.definition), this.idx = 1, Object.assign(this, B(e));
 	}
-}, f = class extends o {
+}, F = class extends k {
 	constructor(e) {
-		super(e.definition), this.idx = 1, Object.assign(this, v(e));
+		super(e.definition), this.idx = 1, Object.assign(this, B(e));
 	}
-}, p = class extends o {
+}, I = class extends k {
 	constructor(e) {
-		super(e.definition), this.idx = 1, Object.assign(this, v(e));
+		super(e.definition), this.idx = 1, Object.assign(this, B(e));
 	}
-}, m = class extends o {
+}, L = class extends k {
 	constructor(e) {
-		super(e.definition), this.idx = 1, Object.assign(this, v(e));
+		super(e.definition), this.idx = 1, Object.assign(this, B(e));
 	}
-}, h = class extends o {
+}, R = class extends k {
 	get definition() {
 		return this._definition;
 	}
@@ -90,21 +90,21 @@ var o = class {
 		this._definition = e;
 	}
 	constructor(e) {
-		super(e.definition), this.idx = 1, this.ignoreAmbiguities = !1, this.hasPredicates = !1, Object.assign(this, v(e));
+		super(e.definition), this.idx = 1, this.ignoreAmbiguities = !1, this.hasPredicates = !1, Object.assign(this, B(e));
 	}
-}, g = class {
+}, z = class {
 	constructor(e) {
-		this.idx = 1, Object.assign(this, v(e));
+		this.idx = 1, Object.assign(this, B(e));
 	}
 	accept(e) {
 		e.visit(this);
 	}
 };
-function _(e) {
+function oe(e) {
 	function t(e) {
-		return e.map(_);
+		return e.map(oe);
 	}
-	if (e instanceof s) {
+	if (e instanceof A) {
 		let t = {
 			type: "NonTerminal",
 			name: e.nonTerminalName,
@@ -112,43 +112,43 @@ function _(e) {
 		};
 		return typeof e.label == "string" && (t.label = e.label), t;
 	}
-	if (e instanceof l) return {
+	if (e instanceof M) return {
 		type: "Alternative",
 		definition: t(e.definition)
 	};
-	if (e instanceof u) return {
+	if (e instanceof N) return {
 		type: "Option",
 		idx: e.idx,
 		definition: t(e.definition)
 	};
-	if (e instanceof d) return {
+	if (e instanceof P) return {
 		type: "RepetitionMandatory",
 		idx: e.idx,
 		definition: t(e.definition)
 	};
-	if (e instanceof f) return {
+	if (e instanceof F) return {
 		type: "RepetitionMandatoryWithSeparator",
 		idx: e.idx,
-		separator: _(new g({ terminalType: e.separator })),
+		separator: oe(new z({ terminalType: e.separator })),
 		definition: t(e.definition)
 	};
-	if (e instanceof m) return {
+	if (e instanceof L) return {
 		type: "RepetitionWithSeparator",
 		idx: e.idx,
-		separator: _(new g({ terminalType: e.separator })),
+		separator: oe(new z({ terminalType: e.separator })),
 		definition: t(e.definition)
 	};
-	if (e instanceof p) return {
+	if (e instanceof I) return {
 		type: "Repetition",
 		idx: e.idx,
 		definition: t(e.definition)
 	};
-	if (e instanceof h) return {
+	if (e instanceof R) return {
 		type: "Alternation",
 		idx: e.idx,
 		definition: t(e.definition)
 	};
-	if (e instanceof g) {
+	if (e instanceof z) {
 		let t = {
 			type: "Terminal",
 			name: e.terminalType.name,
@@ -159,7 +159,7 @@ function _(e) {
 		let i = e.terminalType.PATTERN;
 		return e.terminalType.PATTERN && (t.pattern = i instanceof RegExp ? i.source : i), t;
 	}
-	if (e instanceof c) return {
+	if (e instanceof j) return {
 		type: "Rule",
 		name: e.name,
 		orgText: e.orgText,
@@ -168,23 +168,23 @@ function _(e) {
 	throw Error("non exhaustive match");
 	var n, r;
 }
-function v(e) {
+function B(e) {
 	return Object.fromEntries(Object.entries(e).filter(([, e]) => e !== void 0));
 }
-var y = class {
+var se = class {
 	visit(e) {
 		let t = e;
 		switch (t.constructor) {
-			case s: return this.visitNonTerminal(t);
-			case l: return this.visitAlternative(t);
-			case u: return this.visitOption(t);
-			case d: return this.visitRepetitionMandatory(t);
-			case f: return this.visitRepetitionMandatoryWithSeparator(t);
-			case m: return this.visitRepetitionWithSeparator(t);
-			case p: return this.visitRepetition(t);
-			case h: return this.visitAlternation(t);
-			case g: return this.visitTerminal(t);
-			case c: return this.visitRule(t);
+			case A: return this.visitNonTerminal(t);
+			case M: return this.visitAlternative(t);
+			case N: return this.visitOption(t);
+			case P: return this.visitRepetitionMandatory(t);
+			case F: return this.visitRepetitionMandatoryWithSeparator(t);
+			case L: return this.visitRepetitionWithSeparator(t);
+			case I: return this.visitRepetition(t);
+			case R: return this.visitAlternation(t);
+			case z: return this.visitTerminal(t);
+			case j: return this.visitRule(t);
 			default: throw Error("non exhaustive match");
 		}
 	}
@@ -199,34 +199,34 @@ var y = class {
 	visitTerminal(e) {}
 	visitRule(e) {}
 };
-function b(e, t = []) {
-	return e instanceof u || e instanceof p || e instanceof m || (e instanceof h ? e.definition.some((e) => b(e, t)) : !(e instanceof s && t.includes(e)) && e instanceof o && (e instanceof s && t.push(e), e.definition.every((e) => b(e, t))));
+function ce(e, t = []) {
+	return e instanceof N || e instanceof I || e instanceof L || (e instanceof R ? e.definition.some((e) => ce(e, t)) : !(e instanceof A && t.includes(e)) && e instanceof k && (e instanceof A && t.push(e), e.definition.every((e) => ce(e, t))));
 }
-function x(e) {
-	if (e instanceof s) return "SUBRULE";
-	if (e instanceof u) return "OPTION";
-	if (e instanceof h) return "OR";
-	if (e instanceof d) return "AT_LEAST_ONE";
-	if (e instanceof f) return "AT_LEAST_ONE_SEP";
-	if (e instanceof m) return "MANY_SEP";
-	if (e instanceof p) return "MANY";
-	if (e instanceof g) return "CONSUME";
+function V(e) {
+	if (e instanceof A) return "SUBRULE";
+	if (e instanceof N) return "OPTION";
+	if (e instanceof R) return "OR";
+	if (e instanceof P) return "AT_LEAST_ONE";
+	if (e instanceof F) return "AT_LEAST_ONE_SEP";
+	if (e instanceof L) return "MANY_SEP";
+	if (e instanceof I) return "MANY";
+	if (e instanceof z) return "CONSUME";
 	throw Error("non exhaustive match");
 }
-var S = class {
+var le = class {
 	walk(e, t = []) {
 		e.definition.forEach((n, r) => {
 			let i = e.definition.slice(r + 1);
-			if (n instanceof s) this.walkProdRef(n, i, t);
-			else if (n instanceof g) this.walkTerminal(n, i, t);
-			else if (n instanceof l) this.walkFlat(n, i, t);
-			else if (n instanceof u) this.walkOption(n, i, t);
-			else if (n instanceof d) this.walkAtLeastOne(n, i, t);
-			else if (n instanceof f) this.walkAtLeastOneSep(n, i, t);
-			else if (n instanceof m) this.walkManySep(n, i, t);
-			else if (n instanceof p) this.walkMany(n, i, t);
+			if (n instanceof A) this.walkProdRef(n, i, t);
+			else if (n instanceof z) this.walkTerminal(n, i, t);
+			else if (n instanceof M) this.walkFlat(n, i, t);
+			else if (n instanceof N) this.walkOption(n, i, t);
+			else if (n instanceof P) this.walkAtLeastOne(n, i, t);
+			else if (n instanceof F) this.walkAtLeastOneSep(n, i, t);
+			else if (n instanceof L) this.walkManySep(n, i, t);
+			else if (n instanceof I) this.walkMany(n, i, t);
 			else {
-				if (!(n instanceof h)) throw Error("non exhaustive match");
+				if (!(n instanceof R)) throw Error("non exhaustive match");
 				this.walkOr(n, i, t);
 			}
 		});
@@ -242,51 +242,51 @@ var S = class {
 		this.walk(e, r);
 	}
 	walkAtLeastOne(e, t, n) {
-		let r = [new u({ definition: e.definition })].concat(t, n);
+		let r = [new N({ definition: e.definition })].concat(t, n);
 		this.walk(e, r);
 	}
 	walkAtLeastOneSep(e, t, n) {
-		let r = C(e, t, n);
+		let r = ue(e, t, n);
 		this.walk(e, r);
 	}
 	walkMany(e, t, n) {
-		let r = [new u({ definition: e.definition })].concat(t, n);
+		let r = [new N({ definition: e.definition })].concat(t, n);
 		this.walk(e, r);
 	}
 	walkManySep(e, t, n) {
-		let r = C(e, t, n);
+		let r = ue(e, t, n);
 		this.walk(e, r);
 	}
 	walkOr(e, t, n) {
 		let r = t.concat(n);
 		e.definition.forEach((e) => {
-			let t = new l({ definition: [e] });
+			let t = new M({ definition: [e] });
 			this.walk(t, r);
 		});
 	}
 };
-function C(e, t, n) {
-	return [new u({ definition: [new g({ terminalType: e.separator })].concat(e.definition) })].concat(t, n);
+function ue(e, t, n) {
+	return [new N({ definition: [new z({ terminalType: e.separator })].concat(e.definition) })].concat(t, n);
 }
-function w(e) {
-	if (e instanceof s) return w(e.referencedRule);
-	if (e instanceof g) return [e.terminalType];
+function de(e) {
+	if (e instanceof A) return de(e.referencedRule);
+	if (e instanceof z) return [e.terminalType];
 	if (function(e) {
-		return e instanceof l || e instanceof u || e instanceof p || e instanceof d || e instanceof f || e instanceof m || e instanceof g || e instanceof c;
+		return e instanceof M || e instanceof N || e instanceof I || e instanceof P || e instanceof F || e instanceof L || e instanceof z || e instanceof j;
 	}(e)) return function(e) {
 		let t = [], n = e.definition, r, i = 0, a = n.length > i, o = !0;
-		for (; a && o;) r = n[i], o = b(r), t = t.concat(w(r)), i += 1, a = n.length > i;
+		for (; a && o;) r = n[i], o = ce(r), t = t.concat(de(r)), i += 1, a = n.length > i;
 		return [...new Set(t)];
 	}(e);
 	if (function(e) {
-		return e instanceof h;
+		return e instanceof R;
 	}(e)) return function(e) {
-		let t = e.definition.map((e) => w(e));
+		let t = e.definition.map((e) => de(e));
 		return [...new Set(t.flat())];
 	}(e);
 	throw Error("non exhaustive match");
 }
-var T = "_~IN~_", E = class extends S {
+var fe = "_~IN~_", pe = class extends le {
 	constructor(e) {
 		super(), this.topProd = e, this.follows = {};
 	}
@@ -295,67 +295,67 @@ var T = "_~IN~_", E = class extends S {
 	}
 	walkTerminal(e, t, n) {}
 	walkProdRef(e, t, n) {
-		let r = (i = e.referencedRule, a = e.idx, i.name + a + T + this.topProd.name);
+		let r = (i = e.referencedRule, a = e.idx, i.name + a + fe + this.topProd.name);
 		var i, a;
-		let o = w(new l({ definition: t.concat(n) }));
+		let o = de(new M({ definition: t.concat(n) }));
 		this.follows[r] = o;
 	}
 };
-function D(e) {
+function H(e) {
 	return e.charCodeAt(0);
 }
-function O(e, t) {
+function me(e, t) {
 	Array.isArray(e) ? e.forEach(function(e) {
 		t.push(e);
 	}) : t.push(e);
 }
-function k(e, t) {
+function U(e, t) {
 	if (!0 === e[t]) throw "duplicate flag " + t;
 	e[t], e[t] = !0;
 }
-function A(e) {
+function W(e) {
 	if (e === void 0) throw Error("Internal Error - Should never get here!");
 	return !0;
 }
-function j() {
+function he() {
 	throw Error("Internal Error - Should never get here!");
 }
-function M(e) {
+function ge(e) {
 	return e.type === "Character";
 }
-var N = [];
-for (let e = D("0"); e <= D("9"); e++) N.push(e);
-var P = [D("_")].concat(N);
-for (let e = D("a"); e <= D("z"); e++) P.push(e);
-for (let e = D("A"); e <= D("Z"); e++) P.push(e);
-var ee = [
-	D(" "),
-	D("\f"),
-	D("\n"),
-	D("\r"),
-	D("	"),
-	D("\v"),
-	D("	"),
-	D("\xA0"),
-	D(" "),
-	D(" "),
-	D(" "),
-	D(" "),
-	D(" "),
-	D(" "),
-	D(" "),
-	D(" "),
-	D(" "),
-	D(" "),
-	D(" "),
-	D(" "),
-	D("\u2028"),
-	D("\u2029"),
-	D(" "),
-	D(" "),
-	D("　"),
-	D("")
-], te = /[0-9a-fA-F]/, F = /[0-9]/, ne = /[1-9]/, I = class {
+var _e = [];
+for (let e = H("0"); e <= H("9"); e++) _e.push(e);
+var ve = [H("_")].concat(_e);
+for (let e = H("a"); e <= H("z"); e++) ve.push(e);
+for (let e = H("A"); e <= H("Z"); e++) ve.push(e);
+var ye = [
+	H(" "),
+	H("\f"),
+	H("\n"),
+	H("\r"),
+	H("	"),
+	H("\v"),
+	H("	"),
+	H("\xA0"),
+	H(" "),
+	H(" "),
+	H(" "),
+	H(" "),
+	H(" "),
+	H(" "),
+	H(" "),
+	H(" "),
+	H(" "),
+	H(" "),
+	H(" "),
+	H(" "),
+	H("\u2028"),
+	H("\u2029"),
+	H(" "),
+	H(" "),
+	H("　"),
+	H("")
+], be = /[0-9a-fA-F]/, xe = /[0-9]/, Se = /[1-9]/, Ce = class {
 	visitChildren(e) {
 		for (let t in e) {
 			let n = e[t];
@@ -435,7 +435,7 @@ var ee = [
 	visitGroup(e) {}
 	visitGroupBackReference(e) {}
 	visitQuantifier(e) {}
-}, L = {}, re = new class {
+}, we = {}, Te = new class {
 	constructor() {
 		this.idx = 0, this.input = "", this.groupIdx = 0;
 	}
@@ -467,18 +467,18 @@ var ee = [
 		};
 		for (; this.isRegExpFlag();) switch (this.popChar()) {
 			case "g":
-				k(n, "global");
+				U(n, "global");
 				break;
 			case "i":
-				k(n, "ignoreCase");
+				U(n, "ignoreCase");
 				break;
 			case "m":
-				k(n, "multiLine");
+				U(n, "multiLine");
 				break;
 			case "u":
-				k(n, "unicode");
+				U(n, "unicode");
 				break;
-			case "y": k(n, "sticky");
+			case "y": U(n, "sticky");
 		}
 		if (this.idx !== this.input.length) throw Error("Redundant input: " + this.input.substring(this.idx));
 		return {
@@ -548,7 +548,7 @@ var ee = [
 						case "!": t = "NegativeLookbehind";
 					}
 				}
-				A(t);
+				W(t);
 				let n = this.disjunction();
 				return this.consumeChar(")"), {
 					type: t,
@@ -556,7 +556,7 @@ var ee = [
 					loc: this.loc(e)
 				};
 		}
-		return j();
+		return he();
 	}
 	quantifier(e = !1) {
 		let t, n = this.idx;
@@ -564,13 +564,13 @@ var ee = [
 			case "*":
 				t = {
 					atLeast: 0,
-					atMost: Infinity
+					atMost: 1 / 0
 				};
 				break;
 			case "+":
 				t = {
 					atLeast: 1,
-					atMost: Infinity
+					atMost: 1 / 0
 				};
 				break;
 			case "?":
@@ -595,13 +595,13 @@ var ee = [
 							atMost: e
 						}) : t = {
 							atLeast: n,
-							atMost: Infinity
+							atMost: 1 / 0
 						}, this.consumeChar("}");
 				}
 				if (!0 === e && t === void 0) return;
-				A(t);
+				W(t);
 		}
-		if (!0 !== e || t !== void 0) return A(t) ? (this.peekChar(0) === "?" ? (this.consumeChar("?"), t.greedy = !1) : t.greedy = !0, t.type = "Quantifier", t.loc = this.loc(n), t) : void 0;
+		if (!0 !== e || t !== void 0) return W(t) ? (this.peekChar(0) === "?" ? (this.consumeChar("?"), t.greedy = !1) : t.greedy = !0, t.type = "Quantifier", t.loc = this.loc(n), t) : void 0;
 	}
 	atom() {
 		let e, t = this.idx;
@@ -617,17 +617,17 @@ var ee = [
 				break;
 			case "(": e = this.group();
 		}
-		return e === void 0 && this.isPatternCharacter() && (e = this.patternCharacter()), A(e) ? (e.loc = this.loc(t), this.isQuantifier() && (e.quantifier = this.quantifier()), e) : j();
+		return e === void 0 && this.isPatternCharacter() && (e = this.patternCharacter()), W(e) ? (e.loc = this.loc(t), this.isQuantifier() && (e.quantifier = this.quantifier()), e) : he();
 	}
 	dotAll() {
 		return this.consumeChar("."), {
 			type: "Set",
 			complement: !0,
 			value: [
-				D("\n"),
-				D("\r"),
-				D("\u2028"),
-				D("\u2029")
+				H("\n"),
+				H("\r"),
+				H("\u2028"),
+				H("\u2029")
 			]
 		};
 	}
@@ -670,49 +670,49 @@ var ee = [
 		let e, t = !1;
 		switch (this.popChar()) {
 			case "d":
-				e = N;
+				e = _e;
 				break;
 			case "D":
-				e = N, t = !0;
+				e = _e, t = !0;
 				break;
 			case "s":
-				e = ee;
+				e = ye;
 				break;
 			case "S":
-				e = ee, t = !0;
+				e = ye, t = !0;
 				break;
 			case "w":
-				e = P;
+				e = ve;
 				break;
-			case "W": e = P, t = !0;
+			case "W": e = ve, t = !0;
 		}
-		return A(e) ? {
+		return W(e) ? {
 			type: "Set",
 			value: e,
 			complement: t
-		} : j();
+		} : he();
 	}
 	controlEscapeAtom() {
 		let e;
 		switch (this.popChar()) {
 			case "f":
-				e = D("\f");
+				e = H("\f");
 				break;
 			case "n":
-				e = D("\n");
+				e = H("\n");
 				break;
 			case "r":
-				e = D("\r");
+				e = H("\r");
 				break;
 			case "t":
-				e = D("	");
+				e = H("	");
 				break;
-			case "v": e = D("\v");
+			case "v": e = H("\v");
 		}
-		return A(e) ? {
+		return W(e) ? {
 			type: "Character",
 			value: e
-		} : j();
+		} : he();
 	}
 	controlLetterEscapeAtom() {
 		this.consumeChar("c");
@@ -726,7 +726,7 @@ var ee = [
 	nulCharacterAtom() {
 		return this.consumeChar("0"), {
 			type: "Character",
-			value: D("\0")
+			value: H("\0")
 		};
 	}
 	hexEscapeSequenceAtom() {
@@ -738,7 +738,7 @@ var ee = [
 	identityEscapeAtom() {
 		return {
 			type: "Character",
-			value: D(this.popChar())
+			value: H(this.popChar())
 		};
 	}
 	classPatternCharacterAtom() {
@@ -751,7 +751,7 @@ var ee = [
 			case "]": throw Error("TBD");
 			default: return {
 				type: "Character",
-				value: D(this.popChar())
+				value: H(this.popChar())
 			};
 		}
 	}
@@ -759,17 +759,17 @@ var ee = [
 		let e = [], t = !1;
 		for (this.consumeChar("["), this.peekChar(0) === "^" && (this.consumeChar("^"), t = !0); this.isClassAtom();) {
 			let t = this.classAtom();
-			if (t.type, M(t) && this.isRangeDash()) {
+			if (t.type, ge(t) && this.isRangeDash()) {
 				this.consumeChar("-");
 				let n = this.classAtom();
-				if (n.type, M(n)) {
+				if (n.type, ge(n)) {
 					if (n.value < t.value) throw Error("Range out of order in character class");
 					e.push({
 						from: t.value,
 						to: n.value
 					});
-				} else O(t.value, e), e.push(D("-")), O(n.value, e);
-			} else O(t.value, e);
+				} else me(t.value, e), e.push(H("-")), me(n.value, e);
+			} else me(t.value, e);
 		}
 		return this.consumeChar("]"), {
 			type: "Set",
@@ -792,7 +792,7 @@ var ee = [
 		switch (this.consumeChar("\\"), this.peekChar()) {
 			case "b": return this.consumeChar("b"), {
 				type: "Character",
-				value: D("\b")
+				value: H("\b")
 			};
 			case "d":
 			case "D":
@@ -826,14 +826,14 @@ var ee = [
 	}
 	positiveInteger() {
 		let e = this.popChar();
-		if (!1 === ne.test(e)) throw Error("Expecting a positive integer");
-		for (; F.test(this.peekChar(0));) e += this.popChar();
+		if (!1 === Se.test(e)) throw Error("Expecting a positive integer");
+		for (; xe.test(this.peekChar(0));) e += this.popChar();
 		return parseInt(e, 10);
 	}
 	integerIncludingZero() {
 		let e = this.popChar();
-		if (!1 === F.test(e)) throw Error("Expecting an integer");
-		for (; F.test(this.peekChar(0));) e += this.popChar();
+		if (!1 === xe.test(e)) throw Error("Expecting an integer");
+		for (; xe.test(this.peekChar(0));) e += this.popChar();
 		return parseInt(e, 10);
 	}
 	patternCharacter() {
@@ -856,7 +856,7 @@ var ee = [
 			case "|": throw Error("TBD");
 			default: return {
 				type: "Character",
-				value: D(e)
+				value: H(e)
 			};
 		}
 	}
@@ -874,7 +874,7 @@ var ee = [
 		return this.peekChar() === "-" && this.isClassAtom(1);
 	}
 	isDigit() {
-		return F.test(this.peekChar(0));
+		return xe.test(this.peekChar(0));
 	}
 	isClassAtom(e = 0) {
 		switch (this.peekChar(e)) {
@@ -947,7 +947,7 @@ var ee = [
 		let t = "";
 		for (let n = 0; n < e; n++) {
 			let e = this.popChar();
-			if (!1 === te.test(e)) throw Error("Expecting a HexDecimal digits");
+			if (!1 === be.test(e)) throw Error("Expecting a HexDecimal digits");
 			t += e;
 		}
 		return {
@@ -974,32 +974,32 @@ var ee = [
 		};
 	}
 }();
-function ie(e) {
+function Ee(e) {
 	let t = e.toString();
-	if (L.hasOwnProperty(t)) return L[t];
+	if (we.hasOwnProperty(t)) return we[t];
 	{
-		let e = re.pattern(t);
-		return L[t] = e, e;
+		let e = Te.pattern(t);
+		return we[t] = e, e;
 	}
 }
-var ae = "Complement Sets are not supported for first char optimization", oe = "Unable to use \"first char\" lexer optimizations:\n";
-function se(e, t = !1) {
+var De = "Complement Sets are not supported for first char optimization", Oe = "Unable to use \"first char\" lexer optimizations:\n";
+function ke(e, t = !1) {
 	try {
-		let t = ie(e);
-		return ce(t.value, {}, t.flags.ignoreCase);
-	} catch (i) {
-		if (i.message === ae) t && r(`${oe}\tUnable to optimize: < ${e.toString()} >\n\tComplement Sets cannot be automatically optimized.\n\tThis will disable the lexer's first char optimizations.\n\tSee: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#COMPLEMENT for details.`);
+		let t = Ee(e);
+		return Ae(t.value, {}, t.flags.ignoreCase);
+	} catch (n) {
+		if (n.message === De) t && D(`${Oe}\tUnable to optimize: < ${e.toString()} >\n\tComplement Sets cannot be automatically optimized.\n\tThis will disable the lexer's first char optimizations.\n\tSee: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#COMPLEMENT for details.`);
 		else {
-			let r = "";
-			t && (r = "\n	This will disable the lexer's first char optimizations.\n	See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#REGEXP_PARSING for details."), n(`${oe}\n\tFailed parsing: < ${e.toString()} >\n\tUsing the @chevrotain/regexp-to-ast library\n\tPlease open an issue at: https://github.com/chevrotain/chevrotain/issues` + r);
+			let n = "";
+			t && (n = "\n	This will disable the lexer's first char optimizations.\n	See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#REGEXP_PARSING for details."), E(`${Oe}\n\tFailed parsing: < ${e.toString()} >\n\tUsing the @chevrotain/regexp-to-ast library\n\tPlease open an issue at: https://github.com/chevrotain/chevrotain/issues` + n);
 		}
 	}
 	return [];
 }
-function ce(e, t, n) {
+function Ae(e, t, n) {
 	switch (e.type) {
 		case "Disjunction":
-			for (let r = 0; r < e.value.length; r++) ce(e.value[r], t, n);
+			for (let r = 0; r < e.value.length; r++) Ae(e.value[r], t, n);
 			break;
 		case "Alternative":
 			let r = e.value;
@@ -1019,19 +1019,19 @@ function ce(e, t, n) {
 				let a = i;
 				switch (a.type) {
 					case "Character":
-						le(a.value, t, n);
+						je(a.value, t, n);
 						break;
 					case "Set":
-						if (!0 === a.complement) throw Error(ae);
+						if (!0 === a.complement) throw Error(De);
 						a.value.forEach((e) => {
-							if (typeof e == "number") le(e, t, n);
+							if (typeof e == "number") je(e, t, n);
 							else {
 								let r = e;
-								if (!0 === n) for (let e = r.from; e <= r.to; e++) le(e, t, n);
+								if (!0 === n) for (let e = r.from; e <= r.to; e++) je(e, t, n);
 								else {
-									for (let e = r.from; e <= r.to && e < 256; e++) le(e, t, n);
+									for (let e = r.from; e <= r.to && e < 256; e++) je(e, t, n);
 									if (r.to >= 256) {
-										let e = r.from >= 256 ? r.from : 256, n = r.to, i = z(e), a = z(n);
+										let e = r.from >= 256 ? r.from : 256, n = r.to, i = K(e), a = K(n);
 										for (let e = i; e <= a; e++) t[e] = e;
 									}
 								}
@@ -1039,35 +1039,35 @@ function ce(e, t, n) {
 						});
 						break;
 					case "Group":
-						ce(a.value, t, n);
+						Ae(a.value, t, n);
 						break;
 					default: throw Error("Non Exhaustive Match");
 				}
 				let o = a.quantifier !== void 0 && a.quantifier.atLeast === 0;
-				if (a.type === "Group" && !1 === de(a) || a.type !== "Group" && !1 === o) break;
+				if (a.type === "Group" && !1 === Ne(a) || a.type !== "Group" && !1 === o) break;
 			}
 			break;
 		default: throw Error("non exhaustive match!");
 	}
 	return Object.values(t);
 }
-function le(e, t, n) {
-	let r = z(e);
+function je(e, t, n) {
+	let r = K(e);
 	t[r] = r, !0 === n && function(e, t) {
 		let n = String.fromCharCode(e), r = n.toUpperCase();
 		if (r !== n) {
-			let e = z(r.charCodeAt(0));
+			let e = K(r.charCodeAt(0));
 			t[e] = e;
 		} else {
 			let e = n.toLowerCase();
 			if (e !== n) {
-				let n = z(e.charCodeAt(0));
+				let n = K(e.charCodeAt(0));
 				t[n] = n;
 			}
 		}
 	}(e, t);
 }
-function ue(e, t) {
+function Me(e, t) {
 	return e.value.find((e) => {
 		if (typeof e == "number") return t.includes(e);
 		{
@@ -1076,11 +1076,11 @@ function ue(e, t) {
 		}
 	});
 }
-function de(e) {
+function Ne(e) {
 	let t = e.quantifier;
-	return !(!t || t.atLeast !== 0) || !!e.value && (Array.isArray(e.value) ? e.value.every(de) : de(e.value));
+	return !(!t || t.atLeast !== 0) || !!e.value && (Array.isArray(e.value) ? e.value.every(Ne) : Ne(e.value));
 }
-var fe = class extends I {
+var Pe = class extends Ce {
 	constructor(e) {
 		super(), this.targetCharCodes = e, this.found = !1;
 	}
@@ -1107,12 +1107,12 @@ var fe = class extends I {
 		this.targetCharCodes.includes(e.value) && (this.found = !0);
 	}
 	visitSet(e) {
-		e.complement ? ue(e, this.targetCharCodes) === void 0 && (this.found = !0) : ue(e, this.targetCharCodes) !== void 0 && (this.found = !0);
+		e.complement ? Me(e, this.targetCharCodes) === void 0 && (this.found = !0) : Me(e, this.targetCharCodes) !== void 0 && (this.found = !0);
 	}
 };
-function pe(e, t) {
+function Fe(e, t) {
 	if (t instanceof RegExp) {
-		let n = ie(t), r = new fe(e);
+		let n = Ee(t), r = new Pe(e);
 		return r.visit(n), r.found;
 	}
 	for (let n of t) {
@@ -1121,28 +1121,28 @@ function pe(e, t) {
 	}
 	return !1;
 }
-var R = "PATTERN", me = "defaultMode";
-function he(e, t) {
-	let r = (t = Object.assign({
+var G = "PATTERN", Ie = "defaultMode";
+function Le(e, t) {
+	let n = (t = Object.assign({
 		safeMode: !1,
 		positionTracking: "full",
 		lineTerminatorCharacters: ["\r", "\n"],
 		tracer: (e, t) => t()
-	}, t)).tracer, i;
-	r("initCharCodeToOptimizedIndexMap", () => {
+	}, t)).tracer, r;
+	n("initCharCodeToOptimizedIndexMap", () => {
 		(function() {
-			if (De.length === 0) {
-				De = Array(65536);
-				for (let e = 0; e < 65536; e++) De[e] = e > 255 ? 255 + ~~(e / 255) : e;
+			if (Ye.length === 0) {
+				Ye = Array(65536);
+				for (let e = 0; e < 65536; e++) Ye[e] = e > 255 ? 255 + ~~(e / 255) : e;
 			}
 		})();
-	}), r("Reject Lexer.NA", () => {
-		i = e.filter((e) => e[R] !== W.NA);
+	}), n("Reject Lexer.NA", () => {
+		r = e.filter((e) => e[G] !== J.NA);
 	});
-	let a, o, s, c, l, u, d, f, p, m, h, g = !1;
-	r("Transform Patterns", () => {
-		g = !1, a = i.map((e) => {
-			let t = e[R];
+	let i, a, o, s, c, l, u, d, f, p, m, h = !1;
+	n("Transform Patterns", () => {
+		h = !1, i = r.map((e) => {
+			let t = e[G];
 			if (t instanceof RegExp) {
 				let e = t.source;
 				return e.length !== 1 || e === "^" || e === "$" || e === "." || t.ignoreCase ? e.length !== 2 || e[0] !== "\\" || [
@@ -1162,86 +1162,113 @@ function he(e, t) {
 					"v",
 					"w",
 					"W"
-				].includes(e[1]) ? ye(t) : e[1] : e;
+				].includes(e[1]) ? Ve(t) : e[1] : e;
 			}
-			if (typeof t == "function") return g = !0, { exec: t };
-			if (typeof t == "object") return g = !0, t;
+			if (typeof t == "function") return h = !0, { exec: t };
+			if (typeof t == "object") return h = !0, t;
 			if (typeof t == "string") {
 				if (t.length === 1) return t;
 				{
 					let e = t.replace(/[\\^$.*+?()[\]{}|]/g, "\\$&");
-					return ye(new RegExp(e));
+					return Ve(new RegExp(e));
 				}
 			}
 			throw Error("non exhaustive match");
 		});
-	}), r("misc mapping", () => {
-		o = i.map((e) => e.tokenTypeIdx), s = i.map((e) => {
+	}), n("misc mapping", () => {
+		a = r.map((e) => e.tokenTypeIdx), o = r.map((e) => {
 			let t = e.GROUP;
-			if (t !== W.SKIPPED) {
+			if (t !== J.SKIPPED) {
 				if (typeof t == "string") return t;
 				if (t === void 0) return !1;
 				throw Error("non exhaustive match");
 			}
-		}), c = i.map((e) => {
+		}), s = r.map((e) => {
 			let t = e.LONGER_ALT;
-			if (t) return Array.isArray(t) ? t.map((e) => i.indexOf(e)) : [i.indexOf(t)];
-		}), l = i.map((e) => e.PUSH_MODE), u = i.map((e) => Object.hasOwn(e, "POP_MODE"));
-	}), r("Line Terminator Handling", () => {
-		let e = Te(t.lineTerminatorCharacters);
-		d = i.map((e) => !1), t.positionTracking !== "onlyOffset" && (d = i.map((t) => Object.hasOwn(t, "LINE_BREAKS") ? !!t.LINE_BREAKS : !1 === Ce(t, e) && pe(e, t.PATTERN)));
-	}), r("Misc Mapping #2", () => {
-		f = i.map(be), p = a.map(xe), m = i.reduce((e, t) => {
+			if (t) return Array.isArray(t) ? t.map((e) => r.indexOf(e)) : [r.indexOf(t)];
+		}), c = r.map((e) => e.PUSH_MODE), l = r.map((e) => Object.hasOwn(e, "POP_MODE"));
+	}), n("Line Terminator Handling", () => {
+		let e = qe(t.lineTerminatorCharacters);
+		u = r.map((e) => !1), t.positionTracking !== "onlyOffset" && (u = r.map((t) => Object.hasOwn(t, "LINE_BREAKS") ? !!t.LINE_BREAKS : !1 === Ge(t, e) && Fe(e, t.PATTERN)));
+	}), n("Misc Mapping #2", () => {
+		d = r.map(He), f = i.map(Ue), p = r.reduce((e, t) => {
 			let n = t.GROUP;
-			return typeof n == "string" && n !== W.SKIPPED && (e[n] = []), e;
-		}, {}), h = a.map((e, t) => ({
-			pattern: a[t],
-			longerAlt: c[t],
-			canLineTerminator: d[t],
-			isCustom: f[t],
-			short: p[t],
-			group: s[t],
-			push: l[t],
-			pop: u[t],
-			tokenTypeIdx: o[t],
-			tokenType: i[t]
-		}));
+			return typeof n == "string" && n !== J.SKIPPED && (e[n] = []), e;
+		}, {}), m = i.map((e, t) => {
+			let n = o[t] === void 0 && s[t] === void 0 ? function(e) {
+				if (!(e instanceof RegExp) || e.flags !== "") return;
+				let t;
+				try {
+					t = Ee(e);
+				} catch {
+					return;
+				}
+				if (t.value.value.length !== 1 || t.value.value[0].value.length !== 1) return;
+				let n, r = t.value.value[0].value[0];
+				for (; r.type === "Group";) {
+					if (r.capturing || r.quantifier !== void 0 && n !== void 0 || r.value.value.length !== 1 || r.value.value[0].value.length !== 1) return;
+					n = r.quantifier ?? n, r = r.value.value[0].value[0];
+				}
+				if (r.type !== "Set" || r.complement || r.quantifier !== void 0 && n !== void 0 || (n = r.quantifier ?? n, n?.atLeast !== 1 || n.atMost !== 1 / 0 || !n.greedy)) return;
+				let i = /* @__PURE__ */ new Uint8Array(128);
+				for (let e of r.value) {
+					let t = typeof e == "number" ? e : e.from, n = typeof e == "number" ? e : e.to;
+					if (t < 0 || n >= i.length) return;
+					i.fill(1, t, n + 1);
+				}
+				return i;
+			}(r[t].PATTERN) : void 0;
+			return {
+				pattern: i[t],
+				asciiClass: n,
+				longerAlt: s[t],
+				canLineTerminator: u[t],
+				matchType: n === void 0 ? !1 === f[t] ? d[t] ? 1 : 2 : 0 : 3,
+				short: f[t],
+				group: o[t],
+				push: c[t],
+				pop: l[t],
+				tokenTypeIdx: a[t],
+				tokenType: r[t]
+			};
+		});
 	});
-	let _ = !0, v = [];
-	return t.safeMode || r("First Char Optimization", () => {
-		v = i.reduce((e, r, i) => {
-			if (typeof r.PATTERN == "string") Ee(e, z(r.PATTERN.charCodeAt(0)), h[i]);
-			else if (Array.isArray(r.START_CHARS_HINT)) {
+	let g = !0, _ = [];
+	return t.safeMode || n("First Char Optimization", () => {
+		_ = r.reduce((e, n, r) => {
+			if (typeof n.PATTERN == "string") Je(e, K(n.PATTERN.charCodeAt(0)), m[r]);
+			else if (Array.isArray(n.START_CHARS_HINT)) {
 				let t;
-				r.START_CHARS_HINT.forEach((n) => {
-					let r = z(typeof n == "string" ? n.charCodeAt(0) : n);
-					t !== r && (t = r, Ee(e, r, h[i]));
-				});
-			} else if (r.PATTERN instanceof RegExp) if (r.PATTERN.unicode) _ = !1, t.ensureOptimizations && n(`${oe}\tUnable to analyze < ${r.PATTERN.toString()} > pattern.\n\tThe regexp unicode flag is not currently supported by the regexp-to-ast library.\n\tThis will disable the lexer's first char optimizations.\n\tFor details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNICODE_OPTIMIZE`);
-			else {
-				let n = se(r.PATTERN, t.ensureOptimizations);
-				n.length === 0 && (_ = !1), n.forEach((t) => {
-					Ee(e, t, h[i]);
+				n.START_CHARS_HINT.forEach((n) => {
+					let i = K(typeof n == "string" ? n.charCodeAt(0) : n);
+					t !== i && (t = i, Je(e, i, m[r]));
 				});
-			}
-			else t.ensureOptimizations && n(`${oe}\tTokenType: <${r.name}> is using a custom token pattern without providing <start_chars_hint> parameter.\n\tThis will disable the lexer's first char optimizations.\n\tFor details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#CUSTOM_OPTIMIZE`), _ = !1;
+			} else if (n.PATTERN instanceof RegExp) {
+				if (n.PATTERN.unicode) g = !1, t.ensureOptimizations && E(`${Oe}\tUnable to analyze < ${n.PATTERN.toString()} > pattern.\n\tThe regexp unicode flag is not currently supported by the regexp-to-ast library.\n\tThis will disable the lexer's first char optimizations.\n\tFor details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNICODE_OPTIMIZE`);
+				else {
+					let i = ke(n.PATTERN, t.ensureOptimizations);
+					i.length === 0 && (g = !1), i.forEach((t) => {
+						Je(e, t, m[r]);
+					});
+				}
+			} else t.ensureOptimizations && E(`${Oe}\tTokenType: <${n.name}> is using a custom token pattern without providing <start_chars_hint> parameter.\n\tThis will disable the lexer's first char optimizations.\n\tFor details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#CUSTOM_OPTIMIZE`), g = !1;
 			return e;
 		}, []);
 	}), {
-		emptyGroups: m,
-		patternIdxToConfig: h,
-		charCodeToPatternIdxToConfig: v,
-		hasCustom: g,
-		canBeOptimized: _
+		emptyGroups: p,
+		patternIdxToConfig: m,
+		charCodeToPatternIdxToConfig: _,
+		hasCustom: h,
+		canBeOptimized: g
 	};
 }
-function ge(e, t) {
+function Re(e, t) {
 	let n = [], r = function(e) {
-		let t = e.filter((e) => !Object.hasOwn(e, R));
+		let t = e.filter((e) => !Object.hasOwn(e, G));
 		return {
 			errors: t.map((e) => ({
 				message: "Token Type: ->" + e.name + "<- missing static 'PATTERN' property",
-				type: H.MISSING_PATTERN,
+				type: q.MISSING_PATTERN,
 				tokenTypes: [e]
 			})),
 			valid: e.filter((e) => !t.includes(e))
@@ -1250,22 +1277,22 @@ function ge(e, t) {
 	n = n.concat(r.errors);
 	let i = function(e) {
 		let t = e.filter((e) => {
-			let t = e[R];
+			let t = e[G];
 			return !(t instanceof RegExp || typeof t == "function" || Object.hasOwn(t, "exec") || typeof t == "string");
 		});
 		return {
 			errors: t.map((e) => ({
 				message: "Token Type: ->" + e.name + "<- static 'PATTERN' can only be a RegExp, a Function matching the {CustomPatternMatcherFunc} type or an Object matching the {ICustomPattern} interface.",
-				type: H.INVALID_PATTERN,
+				type: q.INVALID_PATTERN,
 				tokenTypes: [e]
 			})),
 			valid: e.filter((e) => !t.includes(e))
 		};
 	}(r.valid), a = i.valid;
 	return n = n.concat(i.errors), n = n.concat(function(e) {
-		let t = [], n = e.filter((e) => e[R] instanceof RegExp);
+		let t = [], n = e.filter((e) => e[G] instanceof RegExp);
 		return t = t.concat(function(e) {
-			class t extends I {
+			class t extends Ce {
 				constructor() {
 					super(...arguments), this.found = !1;
 				}
@@ -1276,18 +1303,18 @@ function ge(e, t) {
 			return e.filter((e) => {
 				let n = e.PATTERN;
 				try {
-					let e = ie(n), r = new t();
+					let e = Ee(n), r = new t();
 					return r.visit(e), r.found;
 				} catch {
-					return _e.test(n.source);
+					return ze.test(n.source);
 				}
 			}).map((e) => ({
 				message: "Unexpected RegExp Anchor Error:\n	Token Type: ->" + e.name + "<- static 'PATTERN' cannot contain end of input anchor '$'\n	See chevrotain.io/docs/guide/resolving_lexer_errors.html#ANCHORS	for details.",
-				type: H.EOI_ANCHOR_FOUND,
+				type: q.EOI_ANCHOR_FOUND,
 				tokenTypes: [e]
 			}));
 		}(n)), t = t.concat(function(e) {
-			class t extends I {
+			class t extends Ce {
 				constructor() {
 					super(...arguments), this.found = !1;
 				}
@@ -1298,39 +1325,39 @@ function ge(e, t) {
 			return e.filter((e) => {
 				let n = e.PATTERN;
 				try {
-					let e = ie(n), r = new t();
+					let e = Ee(n), r = new t();
 					return r.visit(e), r.found;
 				} catch {
-					return ve.test(n.source);
+					return Be.test(n.source);
 				}
 			}).map((e) => ({
 				message: "Unexpected RegExp Anchor Error:\n	Token Type: ->" + e.name + "<- static 'PATTERN' cannot contain start of input anchor '^'\n	See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#ANCHORS	for details.",
-				type: H.SOI_ANCHOR_FOUND,
+				type: q.SOI_ANCHOR_FOUND,
 				tokenTypes: [e]
 			}));
 		}(n)), t = t.concat(function(e) {
 			return e.filter((e) => {
-				let t = e[R];
+				let t = e[G];
 				return t instanceof RegExp && (t.multiline || t.global);
 			}).map((e) => ({
 				message: "Token Type: ->" + e.name + "<- static 'PATTERN' may NOT contain global('g') or multiline('m')",
-				type: H.UNSUPPORTED_FLAGS_FOUND,
+				type: q.UNSUPPORTED_FLAGS_FOUND,
 				tokenTypes: [e]
 			}));
 		}(n)), t = t.concat(function(e) {
-			let t = [], n = e.map((n) => e.reduce((e, r) => (n.PATTERN.source !== r.PATTERN.source || t.includes(r) || r.PATTERN === W.NA || (t.push(r), e.push(r)), e), []));
+			let t = [], n = e.map((n) => e.reduce((e, r) => (n.PATTERN.source !== r.PATTERN.source || t.includes(r) || r.PATTERN === J.NA || (t.push(r), e.push(r)), e), []));
 			return n = n.filter(Boolean), n.filter((e) => e.length > 1).map((e) => {
 				let t = e.map((e) => e.name);
 				return {
 					message: `The same RegExp pattern ->${e[0].PATTERN}<-has been used in all of the following Token Types: ${t.join(", ")} <-`,
-					type: H.DUPLICATE_PATTERNS_FOUND,
+					type: q.DUPLICATE_PATTERNS_FOUND,
 					tokenTypes: e
 				};
 			});
 		}(n)), t = t.concat(function(e) {
 			return e.filter((e) => e.PATTERN.test("")).map((e) => ({
 				message: "Token Type: ->" + e.name + "<- static 'PATTERN' must not match an empty string",
-				type: H.EMPTY_MATCH_PATTERN,
+				type: q.EMPTY_MATCH_PATTERN,
 				tokenTypes: [e]
 			}));
 		}(n)), t;
@@ -1338,22 +1365,22 @@ function ge(e, t) {
 		return e.filter((e) => {
 			if (!Object.hasOwn(e, "GROUP")) return !1;
 			let t = e.GROUP;
-			return t !== W.SKIPPED && t !== W.NA && typeof t != "string";
+			return t !== J.SKIPPED && t !== J.NA && typeof t != "string";
 		}).map((e) => ({
 			message: "Token Type: ->" + e.name + "<- static 'GROUP' can only be Lexer.SKIPPED/Lexer.NA/A String",
-			type: H.INVALID_GROUP_TYPE_FOUND,
+			type: q.INVALID_GROUP_TYPE_FOUND,
 			tokenTypes: [e]
 		}));
 	}(a)), n = n.concat(function(e, t) {
 		return e.filter((e) => e.PUSH_MODE !== void 0 && !t.includes(e.PUSH_MODE)).map((e) => ({
 			message: `Token Type: ->${e.name}<- static 'PUSH_MODE' value cannot refer to a Lexer Mode ->${e.PUSH_MODE}<-which does not exist`,
-			type: H.PUSH_MODE_DOES_NOT_EXIST,
+			type: q.PUSH_MODE_DOES_NOT_EXIST,
 			tokenTypes: [e]
 		}));
 	}(a, t)), n = n.concat(function(e) {
 		let t = [], n = e.reduce((e, t, n) => {
 			let r = t.PATTERN;
-			return r === W.NA || (typeof r == "string" ? e.push({
+			return r === J.NA || (typeof r == "string" ? e.push({
 				str: r,
 				idx: n,
 				tokenType: t
@@ -1394,7 +1421,7 @@ function ge(e, t) {
 					let n = `Token: ->${a.name}<- can never be matched.\nBecause it appears AFTER the Token Type ->${e.name}<-in the lexer's definition.\nSee https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
 					t.push({
 						message: n,
-						type: H.UNREACHABLE_PATTERN,
+						type: q.UNREACHABLE_PATTERN,
 						tokenTypes: [e, a]
 					});
 				}
@@ -1402,74 +1429,74 @@ function ge(e, t) {
 		}), t;
 	}(a)), n;
 }
-var _e = /[^\\][$]/, ve = /[^\\[][\^]|^\^/;
-function ye(e) {
+var ze = /[^\\][$]/, Be = /[^\\[][\^]|^\^/;
+function Ve(e) {
 	let t = e.ignoreCase ? "iy" : "y";
 	return RegExp(`${e.source}`, t);
 }
-function be(e) {
+function He(e) {
 	let t = e.PATTERN;
 	if (t instanceof RegExp) return !1;
 	if (typeof t == "function" || Object.hasOwn(t, "exec")) return !0;
 	if (typeof t == "string") return !1;
 	throw Error("non exhaustive match");
 }
-function xe(e) {
+function Ue(e) {
 	return typeof e == "string" && e.length === 1 && e.charCodeAt(0);
 }
-var Se = {
+var We = {
 	test: function(e) {
 		let t = e.length;
 		for (let n = this.lastIndex; n < t; n++) {
 			let t = e.charCodeAt(n);
 			if (t === 10) return this.lastIndex = n + 1, !0;
-			if (t === 13) return e.charCodeAt(n + 1) === 10 ? this.lastIndex = n + 2 : this.lastIndex = n + 1, !0;
+			if (t === 13) return this.lastIndex = e.charCodeAt(n + 1) === 10 ? n + 2 : n + 1, !0;
 		}
 		return !1;
 	},
 	lastIndex: 0
 };
-function Ce(e, t) {
+function Ge(e, t) {
 	if (Object.hasOwn(e, "LINE_BREAKS")) return !1;
 	if (e.PATTERN instanceof RegExp) {
 		try {
-			pe(t, e.PATTERN);
+			Fe(t, e.PATTERN);
 		} catch (e) {
 			return {
-				issue: H.IDENTIFY_TERMINATOR,
+				issue: q.IDENTIFY_TERMINATOR,
 				errMsg: e.message
 			};
 		}
 		return !1;
 	}
 	if (typeof e.PATTERN == "string") return !1;
-	if (be(e)) return { issue: H.CUSTOM_LINE_BREAK };
+	if (He(e)) return { issue: q.CUSTOM_LINE_BREAK };
 	throw Error("non exhaustive match");
 }
-function we(e, t) {
-	if (t.issue === H.IDENTIFY_TERMINATOR) return `Warning: unable to identify line terminator usage in pattern.\n\tThe problem is in the <${e.name}> Token Type\n\t Root cause: ${t.errMsg}.\n\tFor details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#IDENTIFY_TERMINATOR`;
-	if (t.issue === H.CUSTOM_LINE_BREAK) return `Warning: A Custom Token Pattern should specify the <line_breaks> option.\n\tThe problem is in the <${e.name}> Token Type\n\tFor details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#CUSTOM_LINE_BREAK`;
+function Ke(e, t) {
+	if (t.issue === q.IDENTIFY_TERMINATOR) return `Warning: unable to identify line terminator usage in pattern.\n\tThe problem is in the <${e.name}> Token Type\n\t Root cause: ${t.errMsg}.\n\tFor details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#IDENTIFY_TERMINATOR`;
+	if (t.issue === q.CUSTOM_LINE_BREAK) return `Warning: A Custom Token Pattern should specify the <line_breaks> option.\n\tThe problem is in the <${e.name}> Token Type\n\tFor details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#CUSTOM_LINE_BREAK`;
 	throw Error("non exhaustive match");
 }
-function Te(e) {
+function qe(e) {
 	return e.map((e) => typeof e == "string" ? e.charCodeAt(0) : e);
 }
-function Ee(e, t, n) {
+function Je(e, t, n) {
 	e[t] === void 0 ? e[t] = [n] : e[t].push(n);
 }
-var De = [];
-function z(e) {
-	return e < 256 ? e : De[e];
+var Ye = [];
+function K(e) {
+	return e < 256 ? e : Ye[e];
 }
-function B(e, t) {
+function Xe(e, t) {
 	let n = e.tokenTypeIdx;
 	return n === t.tokenTypeIdx || !0 === t.isParent && !0 === t.categoryMatchesMap[n];
 }
-function Oe(e, t) {
+function Ze(e, t) {
 	return e.tokenTypeIdx === t.tokenTypeIdx;
 }
-var ke = 1, Ae = {};
-function V(e) {
+var Qe = 1, $e = {};
+function et(e) {
 	let t = function(e) {
 		let t = [...e], n = e, r = !0;
 		for (; r;) {
@@ -1482,107 +1509,107 @@ function V(e) {
 	(function(e) {
 		e.forEach((e) => {
 			var t;
-			Me(e) || (Ae[ke] = e, e.tokenTypeIdx = ke++), Ne(e) && !Array.isArray(e.CATEGORIES) && (e.CATEGORIES = [e.CATEGORIES]), Ne(e) || (e.CATEGORIES = []), t = e, Object.hasOwn(t ?? {}, "categoryMatches") || (e.categoryMatches = []), function(e) {
+			nt(e) || ($e[Qe] = e, e.tokenTypeIdx = Qe++), rt(e) && !Array.isArray(e.CATEGORIES) && (e.CATEGORIES = [e.CATEGORIES]), rt(e) || (e.CATEGORIES = []), t = e, Object.hasOwn(t ?? {}, "categoryMatches") || (e.categoryMatches = []), function(e) {
 				return Object.hasOwn(e ?? {}, "categoryMatchesMap");
 			}(e) || (e.categoryMatchesMap = {});
 		});
 	})(t), function(e) {
 		e.forEach((e) => {
-			je([], e);
+			tt([], e);
 		});
 	}(t), function(e) {
 		e.forEach((e) => {
 			e.categoryMatches = [], Object.keys(e.categoryMatchesMap).forEach((t) => {
-				e.categoryMatches.push(Ae[t].tokenTypeIdx);
+				e.categoryMatches.push($e[t].tokenTypeIdx);
 			});
 		});
 	}(t), t.forEach((e) => {
 		e.isParent = e.categoryMatches.length > 0;
 	});
 }
-function je(e, t) {
+function tt(e, t) {
 	e.forEach((e) => {
 		t.categoryMatchesMap[e.tokenTypeIdx] = !0;
 	}), t.CATEGORIES.forEach((n) => {
 		let r = e.concat(t);
-		r.includes(n) || je(r, n);
+		r.includes(n) || tt(r, n);
 	});
 }
-function Me(e) {
+function nt(e) {
 	return Object.hasOwn(e ?? {}, "tokenTypeIdx");
 }
-function Ne(e) {
+function rt(e) {
 	return Object.hasOwn(e ?? {}, "CATEGORIES");
 }
-function Pe(e) {
+function it(e) {
 	return Object.hasOwn(e ?? {}, "tokenTypeIdx");
 }
-var H, Fe = {
+var q, at = {
 	buildUnableToPopLexerModeMessage: (e) => `Unable to pop Lexer Mode after encountering Token ->${e.image}<- The Mode Stack is empty`,
 	buildUnexpectedCharactersMessage: (e, t, n, r, i, a) => `unexpected character: ->${e.charAt(t)}<- at offset: ${t}, skipped ${n} characters.`
 };
 (function(e) {
 	e[e.MISSING_PATTERN = 0] = "MISSING_PATTERN", e[e.INVALID_PATTERN = 1] = "INVALID_PATTERN", e[e.EOI_ANCHOR_FOUND = 2] = "EOI_ANCHOR_FOUND", e[e.UNSUPPORTED_FLAGS_FOUND = 3] = "UNSUPPORTED_FLAGS_FOUND", e[e.DUPLICATE_PATTERNS_FOUND = 4] = "DUPLICATE_PATTERNS_FOUND", e[e.INVALID_GROUP_TYPE_FOUND = 5] = "INVALID_GROUP_TYPE_FOUND", e[e.PUSH_MODE_DOES_NOT_EXIST = 6] = "PUSH_MODE_DOES_NOT_EXIST", e[e.MULTI_MODE_LEXER_WITHOUT_DEFAULT_MODE = 7] = "MULTI_MODE_LEXER_WITHOUT_DEFAULT_MODE", e[e.MULTI_MODE_LEXER_WITHOUT_MODES_PROPERTY = 8] = "MULTI_MODE_LEXER_WITHOUT_MODES_PROPERTY", e[e.MULTI_MODE_LEXER_DEFAULT_MODE_VALUE_DOES_NOT_EXIST = 9] = "MULTI_MODE_LEXER_DEFAULT_MODE_VALUE_DOES_NOT_EXIST", e[e.LEXER_DEFINITION_CANNOT_CONTAIN_UNDEFINED = 10] = "LEXER_DEFINITION_CANNOT_CONTAIN_UNDEFINED", e[e.SOI_ANCHOR_FOUND = 11] = "SOI_ANCHOR_FOUND", e[e.EMPTY_MATCH_PATTERN = 12] = "EMPTY_MATCH_PATTERN", e[e.NO_LINE_BREAKS_FLAGS = 13] = "NO_LINE_BREAKS_FLAGS", e[e.UNREACHABLE_PATTERN = 14] = "UNREACHABLE_PATTERN", e[e.IDENTIFY_TERMINATOR = 15] = "IDENTIFY_TERMINATOR", e[e.CUSTOM_LINE_BREAK = 16] = "CUSTOM_LINE_BREAK", e[e.MULTI_MODE_LEXER_LONGER_ALT_NOT_IN_CURRENT_MODE = 17] = "MULTI_MODE_LEXER_LONGER_ALT_NOT_IN_CURRENT_MODE";
-})(H ||= {});
-var U = {
+})(q ||= {});
+var ot = {
 	deferDefinitionErrorsHandling: !1,
 	positionTracking: "full",
 	lineTerminatorsPattern: /\n|\r\n?/g,
 	lineTerminatorCharacters: ["\n", "\r"],
 	ensureOptimizations: !1,
 	safeMode: !1,
-	errorMessageProvider: Fe,
+	errorMessageProvider: at,
 	traceInitPerf: !1,
 	skipValidations: !1,
 	recoveryEnabled: !0
 };
-Object.freeze(U);
-var W = class {
-	constructor(e, t = U) {
+Object.freeze(ot);
+var J = class {
+	constructor(e, t = ot) {
 		if (this.lexerDefinition = e, this.lexerDefinitionErrors = [], this.lexerDefinitionWarning = [], this.patternIdxToConfig = {}, this.charCodeToPatternIdxToConfig = {}, this.modes = [], this.emptyGroups = {}, this.cachedGroupKeys = [], this.trackStartLines = !0, this.trackEndLines = !0, this.hasCustom = !1, this.canModeBeOptimized = {}, this.TRACE_INIT = (e, t) => {
 			if (!0 === this.traceInitPerf) {
 				this.traceInitIndent++;
 				let n = Array(this.traceInitIndent + 1).join("	");
 				this.traceInitIndent < this.traceInitMaxIdent && console.log(`${n}--\x3e <${e}>`);
-				let { time: r, value: a } = i(t), o = r > 10 ? console.warn : console.log;
-				return this.traceInitIndent < this.traceInitMaxIdent && o(`${n}<-- <${e}> time: ${r}ms`), this.traceInitIndent--, a;
+				let { time: r, value: i } = ae(t), a = r > 10 ? console.warn : console.log;
+				return this.traceInitIndent < this.traceInitMaxIdent && a(`${n}<-- <${e}> time: ${r}ms`), this.traceInitIndent--, i;
 			}
 			return t();
 		}, typeof t == "boolean") throw Error("The second argument to the Lexer constructor is now an ILexerConfig Object.\na boolean 2nd argument is no longer supported");
-		this.config = Object.assign({}, U, t);
+		this.config = Object.assign({}, ot, t);
 		let n = this.config.traceInitPerf;
-		!0 === n ? (this.traceInitMaxIdent = Infinity, this.traceInitPerf = !0) : typeof n == "number" && (this.traceInitMaxIdent = n, this.traceInitPerf = !0), this.traceInitIndent = -1, this.TRACE_INIT("Lexer Constructor", () => {
-			let n, i = !0;
+		!0 === n ? (this.traceInitMaxIdent = 1 / 0, this.traceInitPerf = !0) : typeof n == "number" && (this.traceInitMaxIdent = n, this.traceInitPerf = !0), this.traceInitIndent = -1, this.TRACE_INIT("Lexer Constructor", () => {
+			let n, r = !0;
 			this.TRACE_INIT("Lexer Config handling", () => {
-				if (this.config.lineTerminatorsPattern === U.lineTerminatorsPattern) this.config.lineTerminatorsPattern = Se;
-				else if (this.config.lineTerminatorCharacters === U.lineTerminatorCharacters) throw Error("Error: Missing <lineTerminatorCharacters> property on the Lexer config.\n	For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#MISSING_LINE_TERM_CHARS");
+				if (this.config.lineTerminatorsPattern === ot.lineTerminatorsPattern) this.config.lineTerminatorsPattern = We;
+				else if (this.config.lineTerminatorCharacters === ot.lineTerminatorCharacters) throw Error("Error: Missing <lineTerminatorCharacters> property on the Lexer config.\n	For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#MISSING_LINE_TERM_CHARS");
 				if (t.safeMode && t.ensureOptimizations) throw Error("\"safeMode\" and \"ensureOptimizations\" flags are mutually exclusive.");
 				this.trackStartLines = /full|onlyStart/i.test(this.config.positionTracking), this.trackEndLines = /full/i.test(this.config.positionTracking), Array.isArray(e) ? n = {
 					modes: { defaultMode: [...e] },
-					defaultMode: me
-				} : (i = !1, n = Object.assign({}, e));
+					defaultMode: Ie
+				} : (r = !1, n = Object.assign({}, e));
 			}), !1 === this.config.skipValidations && (this.TRACE_INIT("performRuntimeChecks", () => {
 				this.lexerDefinitionErrors = this.lexerDefinitionErrors.concat(function(e) {
 					let t = [];
 					return Object.hasOwn(e, "defaultMode") || t.push({
 						message: "A MultiMode Lexer cannot be initialized without a <defaultMode> property in its definition\n",
-						type: H.MULTI_MODE_LEXER_WITHOUT_DEFAULT_MODE
+						type: q.MULTI_MODE_LEXER_WITHOUT_DEFAULT_MODE
 					}), Object.hasOwn(e, "modes") || t.push({
 						message: "A MultiMode Lexer cannot be initialized without a <modes> property in its definition\n",
-						type: H.MULTI_MODE_LEXER_WITHOUT_MODES_PROPERTY
+						type: q.MULTI_MODE_LEXER_WITHOUT_MODES_PROPERTY
 					}), Object.hasOwn(e, "modes") && Object.hasOwn(e, "defaultMode") && !Object.hasOwn(e.modes, e.defaultMode) && t.push({
-						message: `A MultiMode Lexer cannot be initialized with a ${me}: <${e.defaultMode}>which does not exist\n`,
-						type: H.MULTI_MODE_LEXER_DEFAULT_MODE_VALUE_DOES_NOT_EXIST
+						message: `A MultiMode Lexer cannot be initialized with a ${Ie}: <${e.defaultMode}>which does not exist\n`,
+						type: q.MULTI_MODE_LEXER_DEFAULT_MODE_VALUE_DOES_NOT_EXIST
 					}), Object.hasOwn(e, "modes") && Object.keys(e.modes).forEach((n) => {
 						let r = e.modes[n];
 						r.forEach((e, i) => {
 							e === void 0 ? t.push({
 								message: `A Lexer cannot be initialized using an undefined Token Type. Mode:<${n}> at index: <${i}>\n`,
-								type: H.LEXER_DEFINITION_CANNOT_CONTAIN_UNDEFINED
+								type: q.LEXER_DEFINITION_CANNOT_CONTAIN_UNDEFINED
 							}) : Object.hasOwn(e, "LONGER_ALT") && (Array.isArray(e.LONGER_ALT) ? e.LONGER_ALT : [e.LONGER_ALT]).forEach((i) => {
 								i === void 0 || r.includes(i) || t.push({
 									message: `A MultiMode Lexer cannot be initialized with a longer_alt <${i.name}> on token <${e.name}> outside of mode <${n}>\n`,
-									type: H.MULTI_MODE_LEXER_LONGER_ALT_NOT_IN_CURRENT_MODE
+									type: q.MULTI_MODE_LEXER_LONGER_ALT_NOT_IN_CURRENT_MODE
 								});
 							});
 						});
@@ -1590,34 +1617,34 @@ var W = class {
 				}(n, this.trackStartLines, this.config.lineTerminatorCharacters));
 			}), this.TRACE_INIT("performWarningRuntimeChecks", () => {
 				this.lexerDefinitionWarning = this.lexerDefinitionWarning.concat(function(e, t, n) {
-					let r = [], i = !1, a = Object.values(e.modes || {}).flat().filter(Boolean).filter((e) => e[R] !== W.NA), o = Te(n);
+					let r = [], i = !1, a = Object.values(e.modes || {}).flat().filter(Boolean).filter((e) => e[G] !== J.NA), o = qe(n);
 					return t && a.forEach((e) => {
-						let t = Ce(e, o);
+						let t = Ge(e, o);
 						if (!1 !== t) {
 							let n = {
-								message: we(e, t),
+								message: Ke(e, t),
 								type: t.issue,
 								tokenType: e
 							};
 							r.push(n);
-						} else Object.hasOwn(e, "LINE_BREAKS") ? !0 === e.LINE_BREAKS && (i = !0) : pe(o, e.PATTERN) && (i = !0);
+						} else Object.hasOwn(e, "LINE_BREAKS") ? !0 === e.LINE_BREAKS && (i = !0) : Fe(o, e.PATTERN) && (i = !0);
 					}), t && !i && r.push({
 						message: "Warning: No LINE_BREAKS Found.\n	This Lexer has been defined to track line and column information,\n	But none of the Token Types can be identified as matching a line terminator.\n	See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#LINE_BREAKS \n	for details.",
-						type: H.NO_LINE_BREAKS_FLAGS
+						type: q.NO_LINE_BREAKS_FLAGS
 					}), r;
 				}(n, this.trackStartLines, this.config.lineTerminatorCharacters));
 			})), n.modes = n.modes ? n.modes : {}, Object.entries(n.modes).forEach(([e, t]) => {
 				n.modes[e] = t.filter((e) => e !== void 0);
 			});
-			let o = Object.keys(n.modes);
+			let i = Object.keys(n.modes);
 			if (Object.entries(n.modes).forEach(([e, n]) => {
 				this.TRACE_INIT(`Mode: <${e}> processing`, () => {
 					if (this.modes.push(e), !1 === this.config.skipValidations && this.TRACE_INIT("validatePatterns", () => {
-						this.lexerDefinitionErrors = this.lexerDefinitionErrors.concat(ge(n, o));
+						this.lexerDefinitionErrors = this.lexerDefinitionErrors.concat(Re(n, i));
 					}), this.lexerDefinitionErrors.length === 0) {
 						let r;
-						V(n), this.TRACE_INIT("analyzeTokenTypes", () => {
-							r = he(n, {
+						et(n), this.TRACE_INIT("analyzeTokenTypes", () => {
+							r = Le(n, {
 								lineTerminatorCharacters: this.config.lineTerminatorCharacters,
 								positionTracking: t.positionTracking,
 								ensureOptimizations: t.ensureOptimizations,
@@ -1632,9 +1659,9 @@ var W = class {
 				throw Error("Errors detected in definition of Lexer:\n" + e);
 			}
 			this.lexerDefinitionWarning.forEach((e) => {
-				r(e.message);
+				D(e.message);
 			}), this.TRACE_INIT("Choosing sub-methods implementations", () => {
-				if (i && (this.handleModes = () => {}), !1 === this.trackStartLines && (this.computeNewColumn = (e) => e), !1 === this.trackEndLines && (this.updateTokenEndLineColumnLocation = () => {}), /full/i.test(this.config.positionTracking)) this.createTokenInstance = this.createFullToken;
+				if (r && (this.handleModes = () => {}), !1 === this.trackStartLines && (this.computeNewColumn = (e) => e), !1 === this.trackEndLines && (this.updateTokenEndLineColumnLocation = () => {}), /full/i.test(this.config.positionTracking)) this.createTokenInstance = this.createFullToken;
 				else if (/onlyStart/i.test(this.config.positionTracking)) this.createTokenInstance = this.createStartOnlyToken;
 				else {
 					if (!/onlyOffset/i.test(this.config.positionTracking)) throw Error(`Invalid <positionTracking> config option: "${this.config.positionTracking}"`);
@@ -1645,9 +1672,9 @@ var W = class {
 				let e = Object.entries(this.canModeBeOptimized).reduce((e, [t, n]) => (!1 === n && e.push(t), e), []);
 				if (t.ensureOptimizations && e.length > 0) throw Error(`Lexer Modes: < ${e.join(", ")} > cannot be optimized.\n\t Disable the "ensureOptimizations" lexer config flag to silently ignore this and run the lexer in an un-optimized mode.\n\t Or inspect the console log for details on how to resolve these issues.`);
 			}), this.TRACE_INIT("clearRegExpParserCache", () => {
-				L = {};
+				we = {};
 			}), this.TRACE_INIT("toFastProperties", () => {
-				a(this);
+				O(this);
 			});
 		});
 	}
@@ -1659,14 +1686,14 @@ var W = class {
 		return this.tokenizeInternal(e, t);
 	}
 	tokenizeInternal(e, t) {
-		let n, r, i, a, o, s, c, l, u, d, f, p, m, h, g, _ = e, v = _.length, y = 0, b = 0, x = this.hasCustom ? 0 : Math.floor(e.length / 10), S = Array(x), C = [], w = this.trackStartLines ? 1 : void 0, T = this.trackStartLines ? 1 : void 0, E = {};
-		for (let e = 0; e < this.cachedGroupKeys.length; e++) E[this.cachedGroupKeys[e]] = [];
-		let D = this.trackStartLines, O = this.config.lineTerminatorsPattern, k = 0, A = [], j = [], M = [], N = [];
-		Object.freeze(N);
-		let P = !1, ee = (e) => {
-			if (M.length === 1 && e.tokenType.PUSH_MODE === void 0) {
+		let n, r, i, a, o, s, c, l, u, d, f, p, m, h, g, _ = e, v = _.length, y = 0, b = 0, x = this.hasCustom ? 0 : Math.floor(e.length / 10), S = Array(x), ee = [], te = this.trackStartLines ? 1 : void 0, C = this.trackStartLines ? 1 : void 0, w = {};
+		for (let e = 0; e < this.cachedGroupKeys.length; e++) w[this.cachedGroupKeys[e]] = [];
+		let ne = this.trackStartLines, re = this.config.lineTerminatorsPattern, ie = 0, T = [], E = [], D = [], ae = [];
+		Object.freeze(ae);
+		let O = !1, k = (e) => {
+			if (D.length === 1 && e.tokenType.PUSH_MODE === void 0) {
 				let t = this.config.errorMessageProvider.buildUnableToPopLexerModeMessage(e);
-				C.push({
+				ee.push({
 					offset: e.startOffset,
 					line: e.startLine,
 					column: e.startColumn,
@@ -1674,42 +1701,60 @@ var W = class {
 					message: t
 				});
 			} else {
-				M.pop();
-				let e = M.at(-1);
-				A = this.patternIdxToConfig[e], j = this.charCodeToPatternIdxToConfig[e], k = A.length;
+				D.pop();
+				let e = D.at(-1);
+				T = this.patternIdxToConfig[e], E = this.charCodeToPatternIdxToConfig[e], ie = T.length;
 				let t = this.canModeBeOptimized[e] && !1 === this.config.safeMode;
-				P = !(!j || !t);
+				O = !(!E || !t);
 			}
 		};
-		function te(e) {
-			M.push(e), j = this.charCodeToPatternIdxToConfig[e], A = this.patternIdxToConfig[e], k = A.length;
+		function A(e) {
+			D.push(e), E = this.charCodeToPatternIdxToConfig[e], T = this.patternIdxToConfig[e], ie = T.length;
 			let t = this.canModeBeOptimized[e] && !1 === this.config.safeMode;
-			P = !(!j || !t);
+			O = !(!E || !t);
 		}
-		let F;
-		te.call(this, t);
-		let ne = this.config.recoveryEnabled;
+		let j;
+		A.call(this, t);
+		let M = this.config.recoveryEnabled;
 		for (; y < v;) {
 			s = null, u = -1;
 			let t = _.charCodeAt(y), x;
-			if (P) {
-				let e = z(t), n = j[e];
-				x = n === void 0 ? N : n;
-			} else x = A;
-			let I = x.length;
-			for (n = 0; n < I; n++) {
-				F = x[n];
-				let r = F.pattern;
-				c = null;
-				let d = F.short;
-				if (!1 === d ? !0 === F.isCustom ? (g = r.exec(_, y, S, E), g === null ? s = null : (s = g[0], u = s.length, g.payload !== void 0 && (c = g.payload))) : (r.lastIndex = y, u = this.matchLength(r, e, y)) : t === d && (u = 1, s = r), u !== -1) {
-					if (o = F.longerAlt, o !== void 0) {
+			if (O) {
+				let e = K(t), n = E[e];
+				x = n === void 0 ? ae : n;
+			} else x = T;
+			let N = x.length;
+			for (n = 0; n < N; n++) {
+				j = x[n];
+				let r = j.pattern;
+				switch (c = null, j.matchType) {
+					case 0:
+						t === j.short && (u = 1, s = r);
+						break;
+					case 1:
+						g = r.exec(_, y, S, w), g === null ? s = null : (s = g[0], u = s.length, g.payload !== void 0 && (c = g.payload));
+						break;
+					case 3: {
+						let e = j.asciiClass;
+						if (e[t] !== 1) {
+							r.lastIndex = 0;
+							break;
+						}
+						let n = y + 1;
+						for (; e[_.charCodeAt(n)] === 1;) n++;
+						u = n - y, r.lastIndex = n;
+						break;
+					}
+					case 2: r.lastIndex = y, u = this.matchLength(r, e, y);
+				}
+				if (u !== -1) {
+					if (o = j.longerAlt, o !== void 0) {
 						s = e.substring(y, y + u);
 						let t = o.length;
 						for (i = 0; i < t; i++) {
-							let t = A[o[i]], n = t.pattern;
-							if (l = null, !0 === t.isCustom ? (g = n.exec(_, y, S, E), g === null ? a = null : (a = g[0], g.payload !== void 0 && (l = g.payload))) : (n.lastIndex = y, a = this.match(n, e, y)), a && a.length > s.length) {
-								s = a, u = a.length, c = l, F = t;
+							let t = T[o[i]], n = t.pattern;
+							if (l = null, t.matchType === 1 ? (g = n.exec(_, y, S, w), g === null ? a = null : (a = g[0], g.payload !== void 0 && (l = g.payload))) : (n.lastIndex = y, a = this.match(n, e, y)), a && a.length > s.length) {
+								s = a, u = a.length, c = l, j = t;
 								break;
 							}
 						}
@@ -1718,34 +1763,44 @@ var W = class {
 				}
 			}
 			if (u !== -1) {
-				if (d = F.group, d !== void 0 && (s = s === null ? e.substring(y, y + u) : s, f = F.tokenTypeIdx, p = this.createTokenInstance(s, y, f, F.tokenType, w, T, u), this.handlePayload(p, c), !1 === d ? b = this.addToken(S, b, p) : E[d].push(p)), !0 === D && !0 === F.canLineTerminator) {
+				if (d = j.group, d !== void 0 && (s = s === null ? e.substring(y, y + u) : s, f = j.tokenTypeIdx, p = this.createTokenInstance(s, y, f, j.tokenType, te, C, u), this.handlePayload(p, c), !1 === d ? b = this.addToken(S, b, p) : w[d].push(p)), !0 === ne && !0 === j.canLineTerminator) {
 					let t, n, r = 0;
-					O.lastIndex = 0;
+					re.lastIndex = 0;
 					do
-						s = s === null ? e.substring(y, y + u) : s, t = O.test(s), !0 === t && (n = O.lastIndex - 1, r++);
+						s = s === null ? e.substring(y, y + u) : s, t = re.test(s), !0 === t && (n = re.lastIndex - 1, r++);
 					while (!0 === t);
-					r === 0 ? T = this.computeNewColumn(T, u) : (w += r, T = u - n, this.updateTokenEndLineColumnLocation(p, d, n, r, w, T, u));
-				} else T = this.computeNewColumn(T, u);
-				y += u, this.handleModes(F, ee, te, p);
+					r === 0 ? C = this.computeNewColumn(C, u) : (te += r, C = u - n, this.updateTokenEndLineColumnLocation(p, d, n, r, te, C, u));
+				} else C = this.computeNewColumn(C, u);
+				y += u, this.handleModes(j, k, A, p);
 			} else {
-				let t = y, n = w, i = T, a = !1 === ne;
-				for (; !1 === a && y < v;) for (y++, r = 0; r < k; r++) {
-					let t = A[r], n = t.pattern, i = t.short;
-					if (!1 === i ? !0 === t.isCustom ? a = n.exec(_, y, S, E) !== null : (n.lastIndex = y, a = n.exec(e) !== null) : _.charCodeAt(y) === i && (a = !0), !0 === a) break;
+				let t = y, n = te, i = C, a = !1 === M;
+				for (; !1 === a && y < v;) for (y++, r = 0; r < ie; r++) {
+					let t = T[r], n = t.pattern;
+					switch (t.matchType) {
+						case 0:
+							_.charCodeAt(y) === t.short && (a = !0);
+							break;
+						case 1:
+							a = n.exec(_, y, S, w) !== null;
+							break;
+						case 3:
+						case 2: n.lastIndex = y, a = n.exec(e) !== null;
+					}
+					if (!0 === a) break;
 				}
-				if (m = y - t, T = this.computeNewColumn(T, m), h = this.config.errorMessageProvider.buildUnexpectedCharactersMessage(_, t, m, n, i, M.at(-1)), C.push({
+				if (m = y - t, C = this.computeNewColumn(C, m), h = this.config.errorMessageProvider.buildUnexpectedCharactersMessage(_, t, m, n, i, D.at(-1)), ee.push({
 					offset: t,
 					line: n,
 					column: i,
 					length: m,
 					message: h
-				}), !1 === ne) break;
+				}), !1 === M) break;
 			}
 		}
 		return this.hasCustom || (S.length = b), {
 			tokens: S,
-			groups: E,
-			errors: C
+			groups: w,
+			errors: ee
 		};
 	}
 	handleModes(e, t, n, r) {
@@ -1809,26 +1864,26 @@ var W = class {
 		return !0 === e.test(t) ? e.lastIndex - n : -1;
 	}
 };
-function G(e) {
-	return Ie(e) ? e.LABEL : e.name;
+function st(e) {
+	return ct(e) ? e.LABEL : e.name;
 }
-function Ie(e) {
+function ct(e) {
 	return typeof e.LABEL == "string" && e.LABEL !== "";
 }
-W.SKIPPED = "This marks a skipped Token pattern, this means each token identified by it will be consumed and then thrown into oblivion, this can be used to for example to completely ignore whitespace.", W.NA = /NOT_APPLICABLE/;
-var Le = "parent", Re = "categories", ze = "label", Be = "group", Ve = "push_mode", He = "pop_mode", Ue = "longer_alt", We = "line_breaks", Ge = "start_chars_hint";
-function K(e) {
+J.SKIPPED = "This marks a skipped Token pattern, this means each token identified by it will be consumed and then thrown into oblivion, this can be used to for example to completely ignore whitespace.", J.NA = /NOT_APPLICABLE/;
+var lt = "parent", ut = "categories", dt = "label", ft = "group", pt = "push_mode", mt = "pop_mode", ht = "longer_alt", gt = "line_breaks", _t = "start_chars_hint";
+function Y(e) {
 	return function(e) {
 		let t = e.pattern, n = {};
-		if (n.name = e.name, t !== void 0 && (n.PATTERN = t), Object.hasOwn(e, Le)) throw "The parent property is no longer supported.\nSee: https://github.com/chevrotain/chevrotain/issues/564#issuecomment-349062346 for details.";
-		return Object.hasOwn(e, Re) && (n.CATEGORIES = e[Re]), V([n]), Object.hasOwn(e, ze) && (n.LABEL = e[ze]), Object.hasOwn(e, Be) && (n.GROUP = e[Be]), Object.hasOwn(e, He) && (n.POP_MODE = e[He]), Object.hasOwn(e, Ve) && (n.PUSH_MODE = e[Ve]), Object.hasOwn(e, Ue) && (n.LONGER_ALT = e[Ue]), Object.hasOwn(e, We) && (n.LINE_BREAKS = e[We]), Object.hasOwn(e, Ge) && (n.START_CHARS_HINT = e[Ge]), n;
+		if (n.name = e.name, t !== void 0 && (n.PATTERN = t), Object.hasOwn(e, lt)) throw "The parent property is no longer supported.\nSee: https://github.com/chevrotain/chevrotain/issues/564#issuecomment-349062346 for details.";
+		return Object.hasOwn(e, ut) && (n.CATEGORIES = e[ut]), et([n]), Object.hasOwn(e, dt) && (n.LABEL = e[dt]), Object.hasOwn(e, ft) && (n.GROUP = e[ft]), Object.hasOwn(e, mt) && (n.POP_MODE = e[mt]), Object.hasOwn(e, pt) && (n.PUSH_MODE = e[pt]), Object.hasOwn(e, ht) && (n.LONGER_ALT = e[ht]), Object.hasOwn(e, gt) && (n.LINE_BREAKS = e[gt]), Object.hasOwn(e, _t) && (n.START_CHARS_HINT = e[_t]), n;
 	}(e);
 }
-var q = K({
+var X = Y({
 	name: "EOF",
-	pattern: W.NA
+	pattern: J.NA
 });
-function Ke(e, t, n, r, i, a, o, s) {
+function vt(e, t, n, r, i, a, o, s) {
 	return {
 		image: t,
 		startOffset: n,
@@ -1841,38 +1896,38 @@ function Ke(e, t, n, r, i, a, o, s) {
 		tokenType: e
 	};
 }
-V([q]);
-var qe = {
-	buildMismatchTokenMessage: ({ expected: e, actual: t, previous: n, ruleName: r }) => `Expecting ${Ie(e) ? `--\x3e ${G(e)} <--` : `token of type --\x3e ${e.name} <--`} but found --\x3e '${t.image}' <--`,
+et([X]);
+var yt = {
+	buildMismatchTokenMessage: ({ expected: e, actual: t, previous: n, ruleName: r }) => `Expecting ${ct(e) ? `--\x3e ${st(e)} <--` : `token of type --\x3e ${e.name} <--`} but found --\x3e '${t.image}' <--`,
 	buildNotAllInputParsedMessage: ({ firstRedundant: e, ruleName: t }) => "Redundant input, expecting EOF but found: " + e.image,
 	buildNoViableAltMessage({ expectedPathsPerAlt: e, actual: t, previous: n, customUserDescription: r, ruleName: i }) {
 		let a = "\nbut found: '" + t[0].image + "'";
-		return r ? "Expecting: " + r + a : `Expecting: one of these possible Token sequences:\n${e.reduce((e, t) => e.concat(t), []).map((e) => `[${e.map((e) => G(e)).join(", ")}]`).map((e, t) => `  ${t + 1}. ${e}`).join("\n")}` + a;
+		return r ? "Expecting: " + r + a : `Expecting: one of these possible Token sequences:\n${e.reduce((e, t) => e.concat(t), []).map((e) => `[${e.map((e) => st(e)).join(", ")}]`).map((e, t) => `  ${t + 1}. ${e}`).join("\n")}` + a;
 	},
 	buildEarlyExitMessage({ expectedIterationPaths: e, actual: t, customUserDescription: n, ruleName: r }) {
 		let i = "\nbut found: '" + t[0].image + "'";
-		return n ? "Expecting: " + n + i : `Expecting: expecting at least one iteration which starts with one of these possible Token sequences::\n  <${e.map((e) => `[${e.map((e) => G(e)).join(",")}]`).join(" ,")}>` + i;
+		return n ? "Expecting: " + n + i : `Expecting: expecting at least one iteration which starts with one of these possible Token sequences::\n  <${e.map((e) => `[${e.map((e) => st(e)).join(",")}]`).join(" ,")}>` + i;
 	}
 };
-Object.freeze(qe);
-var Je = { buildRuleNotFoundError: (e, t) => "Invalid grammar, reference to a rule which is not defined: ->" + t.nonTerminalName + "<-\ninside top level rule: ->" + e.name + "<-" }, J = {
+Object.freeze(yt);
+var bt = { buildRuleNotFoundError: (e, t) => "Invalid grammar, reference to a rule which is not defined: ->" + t.nonTerminalName + "<-\ninside top level rule: ->" + e.name + "<-" }, xt = {
 	buildDuplicateFoundError(e, t) {
-		let n = e.name, r = t[0], i = r.idx, a = x(r), o = (c = r) instanceof g ? c.terminalType.name : c instanceof s ? c.nonTerminalName : "";
-		var c;
-		let l = `->${a}${i > 0 ? i : ""}<- ${o ? `with argument: ->${o}<-` : ""}\n                  appears more than once (${t.length} times) in the top level rule: ->${n}<-.                  \n                  For further details see: https://chevrotain.io/docs/FAQ.html#NUMERICAL_SUFFIXES \n                  `;
-		return l = l.replace(/[ \t]+/g, " "), l = l.replace(/\s\s+/g, "\n"), l;
+		let n = e.name, r = t[0], i = r.idx, a = V(r), o = (s = r) instanceof z ? s.terminalType.name : s instanceof A ? s.nonTerminalName : "";
+		var s;
+		let c = `->${a}${i > 0 ? i : ""}<- ${o ? `with argument: ->${o}<-` : ""}\n                  appears more than once (${t.length} times) in the top level rule: ->${n}<-.                  \n                  For further details see: https://chevrotain.io/docs/FAQ.html#NUMERICAL_SUFFIXES \n                  `;
+		return c = c.replace(/[ \t]+/g, " "), c = c.replace(/\s\s+/g, "\n"), c;
 	},
 	buildNamespaceConflictError: (e) => `Namespace conflict found in grammar.\nThe grammar has both a Terminal(Token) and a Non-Terminal(Rule) named: <${e.name}>.\nTo resolve this make sure each Terminal and Non-Terminal names are unique\nThis is easy to accomplish by using the convention that Terminal names start with an uppercase letter\nand Non-Terminal names start with a lower case letter.`,
 	buildAlternationPrefixAmbiguityError(e) {
-		let t = e.prefixPath.map((e) => G(e)).join(", "), n = e.alternation.idx === 0 ? "" : e.alternation.idx;
+		let t = e.prefixPath.map((e) => st(e)).join(", "), n = e.alternation.idx === 0 ? "" : e.alternation.idx;
 		return `Ambiguous alternatives: <${e.ambiguityIndices.join(" ,")}> due to common lookahead prefix\nin <OR${n}> inside <${e.topLevelRule.name}> Rule,\n<${t}> may appears as a prefix path in all these alternatives.\nSee: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#COMMON_PREFIX\nFor Further details.`;
 	},
 	buildAlternationAmbiguityError(e) {
 		let t = e.alternation.idx === 0 ? "" : e.alternation.idx, n = e.prefixPath.length === 0, r = `Ambiguous Alternatives Detected: <${e.ambiguityIndices.join(" ,")}> in <OR${t}> inside <${e.topLevelRule.name}> Rule,\n`;
-		return n ? r += "These alternatives are all empty (match no tokens), making them indistinguishable.\nOnly the last alternative may be empty.\n" : r += `<${e.prefixPath.map((e) => G(e)).join(", ")}> may appears as a prefix path in all these alternatives.\n`, r += "See: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#AMBIGUOUS_ALTERNATIVES\nFor Further details.", r;
+		return r += n ? "These alternatives are all empty (match no tokens), making them indistinguishable.\nOnly the last alternative may be empty.\n" : `<${e.prefixPath.map((e) => st(e)).join(", ")}> may appears as a prefix path in all these alternatives.\n`, r += "See: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#AMBIGUOUS_ALTERNATIVES\nFor Further details.", r;
 	},
 	buildEmptyRepetitionError(e) {
-		let t = x(e.repetition);
+		let t = V(e.repetition);
 		return e.repetition.idx !== 0 && (t += e.repetition.idx), `The repetition <${t}> within Rule <${e.topLevelRule.name}> can never consume any tokens.\nThis could lead to an infinite loop.`;
 	},
 	buildTokenNameError: (e) => "deprecated",
@@ -1885,9 +1940,9 @@ var Je = { buildRuleNotFoundError: (e, t) => "Invalid grammar, reference to a ru
 	buildInvalidRuleNameError: (e) => "deprecated",
 	buildDuplicateRuleNameError(e) {
 		let t;
-		return t = e.topLevelRule instanceof c ? e.topLevelRule.name : e.topLevelRule, `Duplicate definition, rule: ->${t}<- is already defined in the grammar: ->${e.grammarName}<-`;
+		return t = e.topLevelRule instanceof j ? e.topLevelRule.name : e.topLevelRule, `Duplicate definition, rule: ->${t}<- is already defined in the grammar: ->${e.grammarName}<-`;
 	}
-}, Y, Ye = class extends y {
+}, Z, St = class extends se {
 	constructor(e, t) {
 		super(), this.nameToTopRule = e, this.errMsgProvider = t, this.errors = [];
 	}
@@ -1909,7 +1964,7 @@ var Je = { buildRuleNotFoundError: (e, t) => "Invalid grammar, reference to a ru
 			});
 		}
 	}
-}, Xe = class extends S {
+}, Ct = class extends le {
 	constructor(e, t) {
 		super(), this.topProd = e, this.path = t, this.possibleTokTypes = [], this.nextProductionName = "", this.nextProductionOccurrence = 0, this.found = !1, this.isAtEndOfPath = !1;
 	}
@@ -1929,17 +1984,17 @@ var Je = { buildRuleNotFoundError: (e, t) => "Invalid grammar, reference to a ru
 	updateExpectedNext() {
 		this.ruleStack.length === 0 ? (this.nextProductionName = "", this.nextProductionOccurrence = 0, this.isAtEndOfPath = !0) : (this.nextProductionName = this.ruleStack.pop(), this.nextProductionOccurrence = this.occurrenceStack.pop());
 	}
-}, Ze = class extends Xe {
+}, wt = class extends Ct {
 	constructor(e, t) {
 		super(e, t), this.path = t, this.nextTerminalName = "", this.nextTerminalOccurrence = 0, this.nextTerminalName = this.path.lastTok.name, this.nextTerminalOccurrence = this.path.lastTokOccurrence;
 	}
 	walkTerminal(e, t, n) {
 		if (this.isAtEndOfPath && e.terminalType.name === this.nextTerminalName && e.idx === this.nextTerminalOccurrence && !this.found) {
-			let e = new l({ definition: t.concat(n) });
-			this.possibleTokTypes = w(e), this.found = !0;
+			let e = new M({ definition: t.concat(n) });
+			this.possibleTokTypes = de(e), this.found = !0;
 		}
 	}
-}, Qe = class extends S {
+}, Tt = class extends le {
 	constructor(e, t) {
 		super(), this.topRule = e, this.occurrence = t, this.result = {
 			token: void 0,
@@ -1950,56 +2005,56 @@ var Je = { buildRuleNotFoundError: (e, t) => "Invalid grammar, reference to a ru
 	startWalking() {
 		return this.walk(this.topRule), this.result;
 	}
-}, $e = class extends Qe {
+}, Et = class extends Tt {
 	walkMany(e, t, n) {
 		if (e.idx === this.occurrence) {
 			let e = t.concat(n)[0];
-			this.result.isEndOfRule = e === void 0, e instanceof g && (this.result.token = e.terminalType, this.result.occurrence = e.idx);
+			this.result.isEndOfRule = e === void 0, e instanceof z && (this.result.token = e.terminalType, this.result.occurrence = e.idx);
 		} else super.walkMany(e, t, n);
 	}
-}, et = class extends Qe {
+}, Dt = class extends Tt {
 	walkManySep(e, t, n) {
 		if (e.idx === this.occurrence) {
 			let e = t.concat(n)[0];
-			this.result.isEndOfRule = e === void 0, e instanceof g && (this.result.token = e.terminalType, this.result.occurrence = e.idx);
+			this.result.isEndOfRule = e === void 0, e instanceof z && (this.result.token = e.terminalType, this.result.occurrence = e.idx);
 		} else super.walkManySep(e, t, n);
 	}
-}, tt = class extends Qe {
+}, Ot = class extends Tt {
 	walkAtLeastOne(e, t, n) {
 		if (e.idx === this.occurrence) {
 			let e = t.concat(n)[0];
-			this.result.isEndOfRule = e === void 0, e instanceof g && (this.result.token = e.terminalType, this.result.occurrence = e.idx);
+			this.result.isEndOfRule = e === void 0, e instanceof z && (this.result.token = e.terminalType, this.result.occurrence = e.idx);
 		} else super.walkAtLeastOne(e, t, n);
 	}
-}, nt = class extends Qe {
+}, kt = class extends Tt {
 	walkAtLeastOneSep(e, t, n) {
 		if (e.idx === this.occurrence) {
 			let e = t.concat(n)[0];
-			this.result.isEndOfRule = e === void 0, e instanceof g && (this.result.token = e.terminalType, this.result.occurrence = e.idx);
+			this.result.isEndOfRule = e === void 0, e instanceof z && (this.result.token = e.terminalType, this.result.occurrence = e.idx);
 		} else super.walkAtLeastOneSep(e, t, n);
 	}
 };
-function rt(e, t, n = []) {
+function At(e, t, n = []) {
 	n = [...n];
 	let r = [], i = 0;
 	function a(a) {
-		let o = rt(a.concat(e.slice(i + 1)), t, n);
+		let o = At(a.concat(e.slice(i + 1)), t, n);
 		return r.concat(o);
 	}
 	for (; n.length < t && i < e.length;) {
 		let t = e[i];
-		if (t instanceof l || t instanceof s) return a(t.definition);
-		if (t instanceof u) r = a(t.definition);
+		if (t instanceof M || t instanceof A) return a(t.definition);
+		if (t instanceof N) r = a(t.definition);
 		else {
-			if (t instanceof d) return a(t.definition.concat([new p({ definition: t.definition })]));
-			if (t instanceof f) return a([new l({ definition: t.definition }), new p({ definition: [new g({ terminalType: t.separator })].concat(t.definition) })]);
-			if (t instanceof m) r = a(t.definition.concat([new p({ definition: [new g({ terminalType: t.separator })].concat(t.definition) })]));
-			else if (t instanceof p) r = a(t.definition.concat([new p({ definition: t.definition })]));
+			if (t instanceof P) return a(t.definition.concat([new I({ definition: t.definition })]));
+			if (t instanceof F) return a([new M({ definition: t.definition }), new I({ definition: [new z({ terminalType: t.separator })].concat(t.definition) })]);
+			if (t instanceof L) r = a(t.definition.concat([new I({ definition: [new z({ terminalType: t.separator })].concat(t.definition) })]));
+			else if (t instanceof I) r = a(t.definition.concat([new I({ definition: t.definition })]));
 			else {
-				if (t instanceof h) return t.definition.forEach((e) => {
+				if (t instanceof R) return t.definition.forEach((e) => {
 					e.definition.length !== 0 && (r = a(e.definition));
 				}), r;
-				if (!(t instanceof g)) throw Error("non exhaustive match");
+				if (!(t instanceof z)) throw Error("non exhaustive match");
 				n.push(t.terminalType);
 			}
 		}
@@ -2010,7 +2065,7 @@ function rt(e, t, n = []) {
 		suffixDef: e.slice(i)
 	}), r;
 }
-function it(e, t, n, r) {
+function jt(e, t, n, r) {
 	let i = [...n];
 	i.push(e.name);
 	let a = [...r];
@@ -2021,16 +2076,16 @@ function it(e, t, n, r) {
 		occurrenceStack: a
 	};
 }
-function at(e) {
-	if (e instanceof u || e === "Option") return Y.OPTION;
-	if (e instanceof p || e === "Repetition") return Y.REPETITION;
-	if (e instanceof d || e === "RepetitionMandatory") return Y.REPETITION_MANDATORY;
-	if (e instanceof f || e === "RepetitionMandatoryWithSeparator") return Y.REPETITION_MANDATORY_WITH_SEPARATOR;
-	if (e instanceof m || e === "RepetitionWithSeparator") return Y.REPETITION_WITH_SEPARATOR;
-	if (e instanceof h || e === "Alternation") return Y.ALTERNATION;
+function Mt(e) {
+	if (e instanceof N || e === "Option") return Z.OPTION;
+	if (e instanceof I || e === "Repetition") return Z.REPETITION;
+	if (e instanceof P || e === "RepetitionMandatory") return Z.REPETITION_MANDATORY;
+	if (e instanceof F || e === "RepetitionMandatoryWithSeparator") return Z.REPETITION_MANDATORY_WITH_SEPARATOR;
+	if (e instanceof L || e === "RepetitionWithSeparator") return Z.REPETITION_WITH_SEPARATOR;
+	if (e instanceof R || e === "Alternation") return Z.ALTERNATION;
 	throw Error("non exhaustive match");
 }
-function ot(e, t, n, r) {
+function Nt(e, t, n, r) {
 	let i = e.length, a = e.every((e) => e.every((e) => e.length === 1));
 	if (t) return function(t) {
 		let r = t.map((e) => e.GATE);
@@ -2065,7 +2120,7 @@ function ot(e, t, n, r) {
 		}
 	};
 }
-function st(e, t, n) {
+function Pt(e, t, n) {
 	let r = e.every((e) => e.length === 1), i = e.length;
 	if (r && !n) {
 		let t = e.flat();
@@ -2096,8 +2151,8 @@ function st(e, t, n) {
 }
 (function(e) {
 	e[e.OPTION = 0] = "OPTION", e[e.REPETITION = 1] = "REPETITION", e[e.REPETITION_MANDATORY = 2] = "REPETITION_MANDATORY", e[e.REPETITION_MANDATORY_WITH_SEPARATOR = 3] = "REPETITION_MANDATORY_WITH_SEPARATOR", e[e.REPETITION_WITH_SEPARATOR = 4] = "REPETITION_WITH_SEPARATOR", e[e.ALTERNATION = 5] = "ALTERNATION";
-})(Y ||= {});
-var ct = class extends S {
+})(Z ||= {});
+var Ft = class extends le {
 	constructor(e, t, n) {
 		super(), this.topProd = e, this.targetOccurrence = t, this.targetProdType = n;
 	}
@@ -2108,21 +2163,21 @@ var ct = class extends S {
 		return e.idx === this.targetOccurrence && this.targetProdType === t && (this.restDef = n.concat(r), !0);
 	}
 	walkOption(e, t, n) {
-		this.checkIsTarget(e, Y.OPTION, t, n) || super.walkOption(e, t, n);
+		this.checkIsTarget(e, Z.OPTION, t, n) || super.walkOption(e, t, n);
 	}
 	walkAtLeastOne(e, t, n) {
-		this.checkIsTarget(e, Y.REPETITION_MANDATORY, t, n) || super.walkOption(e, t, n);
+		this.checkIsTarget(e, Z.REPETITION_MANDATORY, t, n) || super.walkOption(e, t, n);
 	}
 	walkAtLeastOneSep(e, t, n) {
-		this.checkIsTarget(e, Y.REPETITION_MANDATORY_WITH_SEPARATOR, t, n) || super.walkOption(e, t, n);
+		this.checkIsTarget(e, Z.REPETITION_MANDATORY_WITH_SEPARATOR, t, n) || super.walkOption(e, t, n);
 	}
 	walkMany(e, t, n) {
-		this.checkIsTarget(e, Y.REPETITION, t, n) || super.walkOption(e, t, n);
+		this.checkIsTarget(e, Z.REPETITION, t, n) || super.walkOption(e, t, n);
 	}
 	walkManySep(e, t, n) {
-		this.checkIsTarget(e, Y.REPETITION_WITH_SEPARATOR, t, n) || super.walkOption(e, t, n);
+		this.checkIsTarget(e, Z.REPETITION_WITH_SEPARATOR, t, n) || super.walkOption(e, t, n);
 	}
-}, lt = class extends y {
+}, It = class extends se {
 	constructor(e, t, n) {
 		super(), this.targetOccurrence = e, this.targetProdType = t, this.targetRef = n, this.result = [];
 	}
@@ -2130,30 +2185,30 @@ var ct = class extends S {
 		e.idx !== this.targetOccurrence || this.targetProdType !== t || this.targetRef !== void 0 && e !== this.targetRef || (this.result = e.definition);
 	}
 	visitOption(e) {
-		this.checkIsTarget(e, Y.OPTION);
+		this.checkIsTarget(e, Z.OPTION);
 	}
 	visitRepetition(e) {
-		this.checkIsTarget(e, Y.REPETITION);
+		this.checkIsTarget(e, Z.REPETITION);
 	}
 	visitRepetitionMandatory(e) {
-		this.checkIsTarget(e, Y.REPETITION_MANDATORY);
+		this.checkIsTarget(e, Z.REPETITION_MANDATORY);
 	}
 	visitRepetitionMandatoryWithSeparator(e) {
-		this.checkIsTarget(e, Y.REPETITION_MANDATORY_WITH_SEPARATOR);
+		this.checkIsTarget(e, Z.REPETITION_MANDATORY_WITH_SEPARATOR);
 	}
 	visitRepetitionWithSeparator(e) {
-		this.checkIsTarget(e, Y.REPETITION_WITH_SEPARATOR);
+		this.checkIsTarget(e, Z.REPETITION_WITH_SEPARATOR);
 	}
 	visitAlternation(e) {
-		this.checkIsTarget(e, Y.ALTERNATION);
+		this.checkIsTarget(e, Z.ALTERNATION);
 	}
 };
-function ut(e) {
+function Lt(e) {
 	let t = Array(e);
 	for (let n = 0; n < e; n++) t[n] = [];
 	return t;
 }
-function dt(e) {
+function Rt(e) {
 	let t = [""];
 	for (let n = 0; n < e.length; n++) {
 		let r = e[n], i = [];
@@ -2169,7 +2224,7 @@ function dt(e) {
 	}
 	return t;
 }
-function ft(e, t, n) {
+function zt(e, t, n) {
 	for (let r = 0; r < e.length; r++) {
 		if (r === n) continue;
 		let i = e[r];
@@ -2177,25 +2232,25 @@ function ft(e, t, n) {
 	}
 	return !0;
 }
-function pt(e, t) {
-	let n = e.map((e) => rt([e], 1)), r = ut(n.length), i = n.map((e) => {
+function Bt(e, t) {
+	let n = e.map((e) => At([e], 1)), r = Lt(n.length), i = n.map((e) => {
 		let t = {};
 		return e.forEach((e) => {
-			dt(e.partialPath).forEach((e) => {
+			Rt(e.partialPath).forEach((e) => {
 				t[e] = !0;
 			});
 		}), t;
 	}), a = n;
 	for (let e = 1; e <= t; e++) {
 		let n = a;
-		a = ut(n.length);
+		a = Lt(n.length);
 		for (let o = 0; o < n.length; o++) {
 			let s = n[o];
 			for (let n = 0; n < s.length; n++) {
-				let c = s[n].partialPath, l = s[n].suffixDef, u = dt(c);
-				if (ft(i, u, o) || l.length === 0 || c.length === t) {
+				let c = s[n].partialPath, l = s[n].suffixDef, u = Rt(c);
+				if (zt(i, u, o) || l.length === 0 || c.length === t) {
 					let e = r[o];
-					if (!1 === gt(e, c)) {
+					if (!1 === Ut(e, c)) {
 						e.push(c);
 						for (let e = 0; e < u.length; e++) {
 							let t = u[e];
@@ -2203,9 +2258,9 @@ function pt(e, t) {
 						}
 					}
 				} else {
-					let t = rt(l, e + 1, c);
+					let t = At(l, e + 1, c);
 					a[o] = a[o].concat(t), t.forEach((e) => {
-						dt(e.partialPath).forEach((e) => {
+						Rt(e.partialPath).forEach((e) => {
 							i[o][e] = !0;
 						});
 					});
@@ -2215,17 +2270,17 @@ function pt(e, t) {
 	}
 	return r;
 }
-function mt(e, t, n, r) {
-	let i = new lt(e, Y.ALTERNATION, r);
-	return t.accept(i), pt(i.result, n);
+function Vt(e, t, n, r) {
+	let i = new It(e, Z.ALTERNATION, r);
+	return t.accept(i), Bt(i.result, n);
 }
-function ht(e, t, n, r) {
-	let i = new lt(e, n);
+function Ht(e, t, n, r) {
+	let i = new It(e, n);
 	t.accept(i);
-	let a = i.result, o = new ct(t, e, n).startWalking();
-	return pt([new l({ definition: a }), new l({ definition: o })], r);
+	let a = i.result, o = new Ft(t, e, n).startWalking();
+	return Bt([new M({ definition: a }), new M({ definition: o })], r);
 }
-function gt(e, t) {
+function Ut(e, t) {
 	e: for (let n = 0; n < e.length; n++) {
 		let r = e[n];
 		if (r.length === t.length) {
@@ -2238,22 +2293,22 @@ function gt(e, t) {
 	}
 	return !1;
 }
-function _t(e) {
+function Wt(e) {
 	return e.every((e) => e.every((e) => e.every((e) => e.categoryMatches.length === 0)));
 }
-function vt(e, t, n, r) {
+function Gt(e, t, n, r) {
 	let i = e.flatMap((e) => function(e, t) {
-		let n = new xt();
+		let n = new Jt();
 		e.accept(n);
-		let r = n.allProductions, i = Object.groupBy(r, yt), a = Object.fromEntries(Object.entries(i).filter(([e, t]) => t.length > 1));
+		let r = n.allProductions, i = Object.groupBy(r, Kt), a = Object.fromEntries(Object.entries(i).filter(([e, t]) => t.length > 1));
 		return Object.values(a).map((n) => {
-			let r = n[0], i = t.buildDuplicateFoundError(e, n), a = x(r), o = {
+			let r = n[0], i = t.buildDuplicateFoundError(e, n), a = V(r), o = {
 				message: i,
 				type: Q.DUPLICATE_PRODUCTIONS,
 				ruleName: e.name,
 				dslName: a,
 				occurrence: r.idx
-			}, s = bt(r);
+			}, s = qt(r);
 			return s && (o.parameter = s), o;
 		});
 	}(e, n)), a = function(e, t, n) {
@@ -2270,7 +2325,7 @@ function vt(e, t, n, r) {
 			}
 		}), r;
 	}(e, t, n), o = e.flatMap((e) => function(e, t) {
-		let n = new wt();
+		let n = new Zt();
 		return e.accept(n), n.alternations.flatMap((n) => n.definition.length > 255 ? [{
 			message: t.buildTooManyAlternativesError({
 				topLevelRule: e,
@@ -2297,13 +2352,13 @@ function vt(e, t, n, r) {
 	}(t, e, r, n));
 	return i.concat(a, o, s);
 }
-function yt(e) {
-	return `${x(e)}_#_${e.idx}_#_${bt(e)}`;
+function Kt(e) {
+	return `${V(e)}_#_${e.idx}_#_${qt(e)}`;
 }
-function bt(e) {
-	return e instanceof g ? e.terminalType.name : e instanceof s ? e.nonTerminalName : "";
+function qt(e) {
+	return e instanceof z ? e.terminalType.name : e instanceof A ? e.nonTerminalName : "";
 }
-var xt = class extends y {
+var Jt = class extends se {
 	constructor() {
 		super(...arguments), this.allProductions = [];
 	}
@@ -2332,8 +2387,8 @@ var xt = class extends y {
 		this.allProductions.push(e);
 	}
 };
-function St(e, t, n, r = []) {
-	let i = [], a = Ct(t.definition);
+function Yt(e, t, n, r = []) {
+	let i = [], a = Xt(t.definition);
 	if (a.length === 0) return [];
 	{
 		let t = e.name;
@@ -2347,27 +2402,27 @@ function St(e, t, n, r = []) {
 		});
 		let o = r.concat([e]), s = a.filter((e) => !o.includes(e)).flatMap((t) => {
 			let i = [...r];
-			return i.push(t), St(e, t, n, i);
+			return i.push(t), Yt(e, t, n, i);
 		});
 		return i.concat(s);
 	}
 }
-function Ct(e) {
+function Xt(e) {
 	let t = [];
 	if (e.length === 0) return t;
 	let n = e[0];
-	if (n instanceof s) t.push(n.referencedRule);
-	else if (n instanceof l || n instanceof u || n instanceof d || n instanceof f || n instanceof m || n instanceof p) t = t.concat(Ct(n.definition));
-	else if (n instanceof h) t = n.definition.map((e) => Ct(e.definition)).flat();
-	else if (!(n instanceof g)) throw Error("non exhaustive match");
-	let r = b(n), i = e.length > 1;
+	if (n instanceof A) t.push(n.referencedRule);
+	else if (n instanceof M || n instanceof N || n instanceof P || n instanceof F || n instanceof L || n instanceof I) t = t.concat(Xt(n.definition));
+	else if (n instanceof R) t = n.definition.map((e) => Xt(e.definition)).flat();
+	else if (!(n instanceof z)) throw Error("non exhaustive match");
+	let r = ce(n), i = e.length > 1;
 	if (r && i) {
 		let n = e.slice(1);
-		return t.concat(Ct(n));
+		return t.concat(Xt(n));
 	}
 	return t;
 }
-var wt = class extends y {
+var Zt = class extends se {
 	constructor() {
 		super(...arguments), this.alternations = [];
 	}
@@ -2375,159 +2430,160 @@ var wt = class extends y {
 		this.alternations.push(e);
 	}
 };
-function Tt(e, t) {
-	let n = new wt();
+function Qt(e, t) {
+	let n = new Zt();
 	return e.accept(n), n.alternations.flatMap((n) => n.definition.slice(0, -1).flatMap((r, i) => function(e, t, n, r) {
-		let i = "EXIT_NONE_TERMINAL", a = [i], o = "EXIT_ALTERNATIVE", _ = !1, v = t.length, y = v - r - 1, b = [], x = [];
-		for (x.push({
+		let i = "EXIT_NONE_TERMINAL", a = [i], o = "EXIT_ALTERNATIVE", s = !1, c = t.length, l = c - r - 1, u = [], d = [];
+		for (d.push({
 			idx: -1,
 			def: e,
 			ruleStack: [],
 			occurrenceStack: []
-		}); x.length !== 0;) {
-			let e = x.pop();
+		}); d.length !== 0;) {
+			let e = d.pop();
 			if (e === o) {
-				_ && x.at(-1).idx <= y && x.pop();
+				s && d.at(-1).idx <= l && d.pop();
 				continue;
 			}
-			let r = e.def, S = e.idx, C = e.ruleStack, w = e.occurrenceStack;
+			let r = e.def, f = e.idx, p = e.ruleStack, m = e.occurrenceStack;
 			if (r.length === 0) continue;
-			let T = r[0];
-			if (T === i) {
+			let h = r[0];
+			if (h === i) {
 				let e = {
-					idx: S,
+					idx: f,
 					def: r.slice(1),
-					ruleStack: C.slice(0, -1),
-					occurrenceStack: w.slice(0, -1)
+					ruleStack: p.slice(0, -1),
+					occurrenceStack: m.slice(0, -1)
 				};
-				x.push(e);
-			} else if (T instanceof g) if (S < v - 1) {
-				let e = S + 1;
-				if (n(t[e], T.terminalType)) {
-					let t = {
-						idx: e,
-						def: r.slice(1),
-						ruleStack: C,
-						occurrenceStack: w
-					};
-					x.push(t);
+				d.push(e);
+			} else if (h instanceof z) {
+				if (f < c - 1) {
+					let e = f + 1;
+					if (n(t[e], h.terminalType)) {
+						let t = {
+							idx: e,
+							def: r.slice(1),
+							ruleStack: p,
+							occurrenceStack: m
+						};
+						d.push(t);
+					}
+				} else {
+					if (f !== c - 1) throw Error("non exhaustive match");
+					u.push({
+						nextTokenType: h.terminalType,
+						nextTokenOccurrence: h.idx,
+						ruleStack: p,
+						occurrenceStack: m
+					}), s = !0;
 				}
-			} else {
-				if (S !== v - 1) throw Error("non exhaustive match");
-				b.push({
-					nextTokenType: T.terminalType,
-					nextTokenOccurrence: T.idx,
-					ruleStack: C,
-					occurrenceStack: w
-				}), _ = !0;
-			}
-			else if (T instanceof s) {
-				let e = [...C];
-				e.push(T.nonTerminalName);
-				let t = [...w];
-				t.push(T.idx);
+			} else if (h instanceof A) {
+				let e = [...p];
+				e.push(h.nonTerminalName);
+				let t = [...m];
+				t.push(h.idx);
 				let n = {
-					idx: S,
-					def: T.definition.concat(a, r.slice(1)),
+					idx: f,
+					def: h.definition.concat(a, r.slice(1)),
 					ruleStack: e,
 					occurrenceStack: t
 				};
-				x.push(n);
-			} else if (T instanceof u) {
+				d.push(n);
+			} else if (h instanceof N) {
 				let e = {
-					idx: S,
+					idx: f,
 					def: r.slice(1),
-					ruleStack: C,
-					occurrenceStack: w
+					ruleStack: p,
+					occurrenceStack: m
 				};
-				x.push(e), x.push(o);
+				d.push(e), d.push(o);
 				let t = {
-					idx: S,
-					def: T.definition.concat(r.slice(1)),
-					ruleStack: C,
-					occurrenceStack: w
+					idx: f,
+					def: h.definition.concat(r.slice(1)),
+					ruleStack: p,
+					occurrenceStack: m
 				};
-				x.push(t);
-			} else if (T instanceof d) {
-				let e = new p({
-					definition: T.definition,
-					idx: T.idx
+				d.push(t);
+			} else if (h instanceof P) {
+				let e = new I({
+					definition: h.definition,
+					idx: h.idx
 				}), t = {
-					idx: S,
-					def: T.definition.concat([e], r.slice(1)),
-					ruleStack: C,
-					occurrenceStack: w
+					idx: f,
+					def: h.definition.concat([e], r.slice(1)),
+					ruleStack: p,
+					occurrenceStack: m
 				};
-				x.push(t);
-			} else if (T instanceof f) {
-				let e = new p({
-					definition: [new g({ terminalType: T.separator })].concat(T.definition),
-					idx: T.idx
+				d.push(t);
+			} else if (h instanceof F) {
+				let e = new I({
+					definition: [new z({ terminalType: h.separator })].concat(h.definition),
+					idx: h.idx
 				}), t = {
-					idx: S,
-					def: T.definition.concat([e], r.slice(1)),
-					ruleStack: C,
-					occurrenceStack: w
+					idx: f,
+					def: h.definition.concat([e], r.slice(1)),
+					ruleStack: p,
+					occurrenceStack: m
 				};
-				x.push(t);
-			} else if (T instanceof m) {
+				d.push(t);
+			} else if (h instanceof L) {
 				let e = {
-					idx: S,
+					idx: f,
 					def: r.slice(1),
-					ruleStack: C,
-					occurrenceStack: w
+					ruleStack: p,
+					occurrenceStack: m
 				};
-				x.push(e), x.push(o);
-				let t = new p({
-					definition: [new g({ terminalType: T.separator })].concat(T.definition),
-					idx: T.idx
+				d.push(e), d.push(o);
+				let t = new I({
+					definition: [new z({ terminalType: h.separator })].concat(h.definition),
+					idx: h.idx
 				}), n = {
-					idx: S,
-					def: T.definition.concat([t], r.slice(1)),
-					ruleStack: C,
-					occurrenceStack: w
+					idx: f,
+					def: h.definition.concat([t], r.slice(1)),
+					ruleStack: p,
+					occurrenceStack: m
 				};
-				x.push(n);
-			} else if (T instanceof p) {
+				d.push(n);
+			} else if (h instanceof I) {
 				let e = {
-					idx: S,
+					idx: f,
 					def: r.slice(1),
-					ruleStack: C,
-					occurrenceStack: w
+					ruleStack: p,
+					occurrenceStack: m
 				};
-				x.push(e), x.push(o);
-				let t = new p({
-					definition: T.definition,
-					idx: T.idx
+				d.push(e), d.push(o);
+				let t = new I({
+					definition: h.definition,
+					idx: h.idx
 				}), n = {
-					idx: S,
-					def: T.definition.concat([t], r.slice(1)),
-					ruleStack: C,
-					occurrenceStack: w
+					idx: f,
+					def: h.definition.concat([t], r.slice(1)),
+					ruleStack: p,
+					occurrenceStack: m
 				};
-				x.push(n);
-			} else if (T instanceof h) for (let e = T.definition.length - 1; e >= 0; e--) {
+				d.push(n);
+			} else if (h instanceof R) for (let e = h.definition.length - 1; e >= 0; e--) {
 				let t = {
-					idx: S,
-					def: T.definition[e].definition.concat(r.slice(1)),
-					ruleStack: C,
-					occurrenceStack: w
+					idx: f,
+					def: h.definition[e].definition.concat(r.slice(1)),
+					ruleStack: p,
+					occurrenceStack: m
 				};
-				x.push(t), x.push(o);
+				d.push(t), d.push(o);
 			}
-			else if (T instanceof l) x.push({
-				idx: S,
-				def: T.definition.concat(r.slice(1)),
-				ruleStack: C,
-				occurrenceStack: w
+			else if (h instanceof M) d.push({
+				idx: f,
+				def: h.definition.concat(r.slice(1)),
+				ruleStack: p,
+				occurrenceStack: m
 			});
 			else {
-				if (!(T instanceof c)) throw Error("non exhaustive match");
-				x.push(it(T, S, C, w));
+				if (!(h instanceof j)) throw Error("non exhaustive match");
+				d.push(jt(h, f, p, m));
 			}
 		}
-		return b;
-	}([r], [], B, 1).length === 0 ? [{
+		return u;
+	}([r], [], Xe, 1).length === 0 ? [{
 		message: t.buildEmptyAlternationError({
 			topLevelRule: e,
 			alternation: n,
@@ -2539,18 +2595,18 @@ function Tt(e, t) {
 		alternative: i + 1
 	}] : []));
 }
-function Et(e, t, n) {
-	let r = new wt();
+function $t(e, t, n) {
+	let r = new Zt();
 	e.accept(r);
 	let i = r.alternations;
 	return i = i.filter((e) => !0 !== e.ignoreAmbiguities), i.flatMap((r) => {
-		let i = mt(r.idx, e, r.maxLookahead || t, r), a = function(e, t, n, r) {
+		let i = r.idx, a = Vt(i, e, r.maxLookahead || t, r), o = function(e, t, n, r) {
 			let i = [];
 			return e.reduce((n, r, a) => (!0 === t.definition[a].ignoreAmbiguities || r.forEach((r) => {
 				let o = [a];
 				e.forEach((e, n) => {
-					a !== n && gt(e, r) && !0 !== t.definition[n].ignoreAmbiguities && o.push(n);
-				}), o.length > 1 && !gt(i, r) && (i.push(r), n.push({
+					a !== n && Ut(e, r) && !0 !== t.definition[n].ignoreAmbiguities && o.push(n);
+				}), o.length > 1 && !Ut(i, r) && (i.push(r), n.push({
 					alts: o,
 					path: r
 				}));
@@ -2569,7 +2625,7 @@ function Et(e, t, n) {
 					alternatives: e.alts
 				};
 			});
-		}(i, r, e, n), o = function(e, t, n, r) {
+		}(a, r, e, n), s = function(e, t, n, r) {
 			let i = e.reduce((e, t, n) => {
 				let r = t.map((e) => ({
 					idx: n,
@@ -2602,11 +2658,11 @@ function Et(e, t, n) {
 					};
 				});
 			});
-		}(i, r, e, n);
-		return a.concat(o);
+		}(a, r, e, n);
+		return o.concat(s);
 	});
 }
-var Dt = class extends y {
+var en = class extends se {
 	constructor() {
 		super(...arguments), this.allProductions = [];
 	}
@@ -2623,64 +2679,61 @@ var Dt = class extends y {
 		this.allProductions.push(e);
 	}
 };
-function Ot(e) {
-	let t = Object.assign({ errMsgProvider: Je }, e), n = {};
+function tn(e) {
+	let t = Object.assign({ errMsgProvider: bt }, e), n = {};
 	return e.rules.forEach((e) => {
 		n[e.name] = e;
 	}), function(e, t) {
-		let n = new Ye(e, t);
+		let n = new St(e, t);
 		return n.resolveRefs(), n.errors;
 	}(n, t.errMsgProvider);
 }
-var kt = "MismatchedTokenException", At = "NoViableAltException", jt = "EarlyExitException", Mt = "NotAllInputParsedException", Nt = [
-	kt,
-	At,
-	jt,
-	Mt
+var nn = "MismatchedTokenException", rn = "NoViableAltException", an = "EarlyExitException", on = "NotAllInputParsedException", sn = [
+	nn,
+	rn,
+	an,
+	on
 ];
-function Pt(e) {
-	return Nt.includes(e.name);
+function cn(e) {
+	return sn.includes(e.name);
 }
-Object.freeze(Nt);
-var Ft = class extends Error {
+Object.freeze(sn);
+var ln = class extends Error {
 	constructor(e, t) {
 		super(e), this.token = t, this.resyncedTokens = [], Object.setPrototypeOf(this, new.target.prototype), Error.captureStackTrace && Error.captureStackTrace(this, this.constructor);
 	}
-}, It = class extends Ft {
+}, un = class extends ln {
 	constructor(e, t, n) {
-		super(e, t), this.previousToken = n, this.name = kt;
+		super(e, t), this.previousToken = n, this.name = nn;
 	}
-}, Lt = class extends Ft {
+}, dn = class extends ln {
 	constructor(e, t, n) {
-		super(e, t), this.previousToken = n, this.name = At;
+		super(e, t), this.previousToken = n, this.name = rn;
 	}
-}, Rt = class extends Ft {
+}, fn = class extends ln {
 	constructor(e, t) {
-		super(e, t), this.name = Mt;
+		super(e, t), this.name = on;
 	}
-}, zt = class extends Ft {
+}, pn = class extends ln {
 	constructor(e, t, n) {
-		super(e, t), this.previousToken = n, this.name = jt;
+		super(e, t), this.previousToken = n, this.name = an;
 	}
-}, Bt = {}, Vt = class extends Error {
+}, mn = {}, hn = class extends Error {
 	constructor(e) {
 		super(e), this.name = "InRuleRecoveryException";
 	}
 };
-function Ht(e, t, n, r, i, a, o) {
-	let s = this.getKeyForAutomaticLookahead(r, i), c = this.firstAfterRepMap[s];
-	if (c === void 0) {
+function gn(e, t, n, r, i, a, o) {
+	var s, c;
+	let l = r | i, u = (s = this.firstAfterRepMap)[c = this.currRuleShortName] ?? (s[c] = []), d = u[l];
+	if (d === void 0) {
 		let e = this.getCurrRuleFullName();
-		c = new a(this.getGAstProductions()[e], i).startWalking(), this.firstAfterRepMap[s] = c;
+		d = new a(this.getGAstProductions()[e], i).startWalking(), u[l] = d;
 	}
-	let l = c.token, u = c.occurrence, d = c.isEndOfRule;
-	this.RULE_STACK_IDX === 0 && d && l === void 0 && (l = q, u = 1), l !== void 0 && u !== void 0 && this.shouldInRepetitionRecoveryBeTried(l, u, o) && this.tryInRepetitionRecovery(e, t, n, l);
-}
-var Ut = 1024, Wt = 1280, Gt = 1536;
-function Kt(e, t, n) {
-	return n | t | e;
+	let f = d.token, p = d.occurrence, m = d.isEndOfRule;
+	this.RULE_STACK_IDX === 0 && m && f === void 0 && (f = X, p = 1), f !== void 0 && p !== void 0 && this.shouldInRepetitionRecoveryBeTried(f, p, o) && this.tryInRepetitionRecovery(e, t, n, f);
 }
-var qt = class {
+var _n = 1024, vn = 1280, yn = 1536, bn = class {
 	constructor(e) {
 		this.maxLookahead = e?.maxLookahead ?? $.maxLookahead;
 	}
@@ -2698,22 +2751,22 @@ var qt = class {
 		return t;
 	}
 	validateNoLeftRecursion(e) {
-		return e.flatMap((e) => St(e, e, J));
+		return e.flatMap((e) => Yt(e, e, xt));
 	}
 	validateEmptyOrAlternatives(e) {
-		return e.flatMap((e) => Tt(e, J));
+		return e.flatMap((e) => Qt(e, xt));
 	}
 	validateAmbiguousAlternationAlternatives(e, t) {
-		return e.flatMap((e) => Et(e, t, J));
+		return e.flatMap((e) => $t(e, t, xt));
 	}
 	validateSomeNonEmptyLookaheadPath(e, t) {
 		return function(e, t, n) {
 			let r = [];
 			return e.forEach((e) => {
-				let i = new Dt();
+				let i = new en();
 				e.accept(i), i.allProductions.forEach((i) => {
-					let a = at(i), o = i.maxLookahead || t;
-					if (ht(i.idx, e, a, o)[0].flat().length === 0) {
+					let a = Mt(i), o = i.maxLookahead || t;
+					if (Ht(i.idx, e, a, o)[0].flat().length === 0) {
 						let t = n.buildEmptyRepetitionError({
 							topLevelRule: e,
 							repetition: i
@@ -2726,21 +2779,21 @@ var qt = class {
 					}
 				});
 			}), r;
-		}(e, t, J);
+		}(e, t, xt);
 	}
 	buildLookaheadForAlternation(e) {
 		return function(e, t, n, r, i, a) {
-			let o = mt(e, t, n);
-			return a(o, r, _t(o) ? Oe : B, i);
-		}(e.prodOccurrence, e.rule, e.maxLookahead, e.hasPredicates, e.dynamicTokensEnabled, ot);
+			let o = Vt(e, t, n);
+			return a(o, r, Wt(o) ? Ze : Xe, i);
+		}(e.prodOccurrence, e.rule, e.maxLookahead, e.hasPredicates, e.dynamicTokensEnabled, Nt);
 	}
 	buildLookaheadForOptional(e) {
 		return function(e, t, n, r, i, a) {
-			let o = ht(e, t, i, n), s = _t(o) ? Oe : B;
+			let o = Ht(e, t, i, n), s = Wt(o) ? Ze : Xe;
 			return a(o[0], s, r);
-		}(e.prodOccurrence, e.rule, e.maxLookahead, e.dynamicTokensEnabled, at(e.prodType), st);
+		}(e.prodOccurrence, e.rule, e.maxLookahead, e.dynamicTokensEnabled, Mt(e.prodType), Pt);
 	}
-}, Jt = new class extends y {
+}, xn = new class extends se {
 	constructor() {
 		super(...arguments), this.dslMethods = {
 			option: [],
@@ -2780,14 +2833,14 @@ var qt = class {
 		this.dslMethods.alternation.push(e);
 	}
 }();
-function Yt(e, t) {
+function Sn(e, t) {
 	e.startOffset === -1 ? (e.startOffset = t.startOffset, e.endOffset = t.endOffset) : e.endOffset < t.endOffset == 1 && (e.endOffset = t.endOffset);
 }
-function Xt(e, t) {
+function Cn(e, t) {
 	e.startOffset === -1 ? (e.startOffset = t.startOffset, e.startColumn = t.startColumn, e.startLine = t.startLine, e.endOffset = t.endOffset, e.endColumn = t.endColumn, e.endLine = t.endLine) : e.endOffset < t.endOffset == 1 && (e.endOffset = t.endOffset, e.endColumn = t.endColumn, e.endLine = t.endLine);
 }
-var Zt;
-function Qt(e, t) {
+var wn;
+function Tn(e, t) {
 	Object.defineProperty(e, "name", {
 		enumerable: !1,
 		configurable: !0,
@@ -2795,7 +2848,7 @@ function Qt(e, t) {
 		value: t
 	});
 }
-function $t(e, t) {
+function En(e, t) {
 	let n = Object.keys(e), r = n.length;
 	for (let i = 0; i < r; i++) {
 		let r = e[n[i]], a = r.length;
@@ -2805,9 +2858,9 @@ function $t(e, t) {
 		}
 	}
 }
-function en(e, t) {
+function Dn(e, t) {
 	let n = function() {};
-	return Qt(n, e + "BaseSemantics"), n.prototype = {
+	return Tn(n, e + "BaseSemantics"), n.prototype = {
 		visit: function(e, t) {
 			if (Array.isArray(e) && (e = e[0]), e !== void 0) return this[e.name](e.children, t);
 		},
@@ -2816,7 +2869,7 @@ function en(e, t) {
 				return function(e, t) {
 					return t.filter((t) => typeof e[t] == "function" == 0).map((t) => ({
 						msg: `Missing visitor method: <${t}> on ${e.constructor.name} CST Visitor.`,
-						type: Zt.MISSING_METHOD,
+						type: wn.MISSING_METHOD,
 						methodName: t
 					})).filter(Boolean);
 				}(e, t);
@@ -2830,68 +2883,68 @@ function en(e, t) {
 }
 (function(e) {
 	e[e.REDUNDANT_METHOD = 0] = "REDUNDANT_METHOD", e[e.MISSING_METHOD = 1] = "MISSING_METHOD";
-})(Zt ||= {});
-var tn = { description: "This Object indicates the Parser is during Recording Phase" };
-Object.freeze(tn);
-var nn = !0, rn = 2 ** 8 - 1, an = K({
+})(wn ||= {});
+var On = { description: "This Object indicates the Parser is during Recording Phase" };
+Object.freeze(On);
+var kn = !0, An = Y({
 	name: "RECORDING_PHASE_TOKEN",
-	pattern: W.NA
+	pattern: J.NA
 });
-V([an]);
-var on = Ke(an, "This IToken indicates the Parser is in Recording Phase\n	See: https://chevrotain.io/docs/guide/internals.html#grammar-recording for details", -1, -1, -1, -1, -1, -1);
-Object.freeze(on);
-var sn = {
+et([An]);
+var jn = vt(An, "This IToken indicates the Parser is in Recording Phase\n	See: https://chevrotain.io/docs/guide/internals.html#grammar-recording for details", -1, -1, -1, -1, -1, -1);
+Object.freeze(jn);
+var Mn = {
 	name: "This CSTNode indicates the Parser is in Recording Phase\n	See: https://chevrotain.io/docs/guide/internals.html#grammar-recording for details",
 	children: {}
 };
-function X(e, t, n, r = !1) {
-	un(n);
+function Nn(e, t, n, r = !1) {
+	In(n);
 	let i = this.recordingProdStack.at(-1), a = typeof t == "function" ? t : t.DEF, o = new e({
 		definition: [],
 		idx: n
 	});
-	return r && (o.separator = t.SEP), Object.hasOwn(t, "MAX_LOOKAHEAD") && (o.maxLookahead = t.MAX_LOOKAHEAD), this.recordingProdStack.push(o), a.call(this), i.definition.push(o), this.recordingProdStack.pop(), tn;
+	return r && (o.separator = t.SEP), Object.hasOwn(t, "MAX_LOOKAHEAD") && (o.maxLookahead = t.MAX_LOOKAHEAD), this.recordingProdStack.push(o), a.call(this), i.definition.push(o), this.recordingProdStack.pop(), On;
 }
-function cn(e, t) {
-	un(t);
-	let n = this.recordingProdStack.at(-1), r = !1 === Array.isArray(e), i = !1 === r ? e : e.DEF, a = new h({
+function Pn(e, t) {
+	In(t);
+	let n = this.recordingProdStack.at(-1), r = !1 === Array.isArray(e), i = !1 === r ? e : e.DEF, a = new R({
 		definition: [],
 		idx: t,
 		ignoreAmbiguities: r && !0 === e.IGNORE_AMBIGUITIES
 	});
 	return Object.hasOwn(e, "MAX_LOOKAHEAD") && (a.maxLookahead = e.MAX_LOOKAHEAD), a.hasPredicates = i.some((e) => typeof e.GATE == "function"), n.definition.push(a), i.forEach((e) => {
-		let t = new l({ definition: [] });
+		let t = new M({ definition: [] });
 		a.definition.push(t), Object.hasOwn(e, "IGNORE_AMBIGUITIES") ? t.ignoreAmbiguities = e.IGNORE_AMBIGUITIES : Object.hasOwn(e, "GATE") && (t.ignoreAmbiguities = !0), this.recordingProdStack.push(t), e.ALT.call(this), this.recordingProdStack.pop();
-	}), tn;
+	}), On;
 }
-function ln(e) {
+function Fn(e) {
 	return e === 0 ? "" : `${e}`;
 }
-function un(e) {
-	if (e < 0 || e > rn) {
-		let t = /* @__PURE__ */ Error(`Invalid DSL Method idx value: <${e}>\n\tIdx value must be a none negative value smaller than ${rn + 1}`);
+function In(e) {
+	if (e < 0 || e > 255) {
+		let t = /* @__PURE__ */ Error(`Invalid DSL Method idx value: <${e}>\n\tIdx value must be a none negative value smaller than 256`);
 		throw t.KNOWN_RECORDER_ERROR = !0, t;
 	}
 }
-var Z = Ke(q, "", -1, -1, -1, -1, -1, -1);
-Object.freeze(Z);
+var Ln = vt(X, "", -1, -1, -1, -1, -1, -1);
+Object.freeze(Ln);
 var Q, $ = Object.freeze({
 	recoveryEnabled: !1,
 	maxLookahead: 3,
 	dynamicTokensEnabled: !1,
 	outputCst: !0,
-	errorMessageProvider: qe,
+	errorMessageProvider: yt,
 	nodeLocationTracking: "none",
 	traceInitPerf: !1,
 	skipValidations: !1
-}), dn = Object.freeze({
+}), Rn = Object.freeze({
 	recoveryValueFunc: () => {},
 	resyncEnabled: !0
 });
 (function(e) {
 	e[e.INVALID_RULE_NAME = 0] = "INVALID_RULE_NAME", e[e.DUPLICATE_RULE_NAME = 1] = "DUPLICATE_RULE_NAME", e[e.INVALID_RULE_OVERRIDE = 2] = "INVALID_RULE_OVERRIDE", e[e.DUPLICATE_PRODUCTIONS = 3] = "DUPLICATE_PRODUCTIONS", e[e.UNRESOLVED_SUBRULE_REF = 4] = "UNRESOLVED_SUBRULE_REF", e[e.LEFT_RECURSION = 5] = "LEFT_RECURSION", e[e.NONE_LAST_EMPTY_ALT = 6] = "NONE_LAST_EMPTY_ALT", e[e.AMBIGUOUS_ALTS = 7] = "AMBIGUOUS_ALTS", e[e.CONFLICT_TOKENS_RULES_NAMESPACE = 8] = "CONFLICT_TOKENS_RULES_NAMESPACE", e[e.INVALID_TOKEN_NAME = 9] = "INVALID_TOKEN_NAME", e[e.NO_NON_EMPTY_LOOKAHEAD = 10] = "NO_NON_EMPTY_LOOKAHEAD", e[e.AMBIGUOUS_PREFIX_ALTS = 11] = "AMBIGUOUS_PREFIX_ALTS", e[e.TOO_MANY_ALTS = 12] = "TOO_MANY_ALTS", e[e.CUSTOM_LOOKAHEAD_VALIDATION = 13] = "CUSTOM_LOOKAHEAD_VALIDATION";
 })(Q ||= {});
-var fn, pn = class e {
+var zn, Bn = class e {
 	static performSelfAnalysis(e) {
 		throw Error("The **static** `performSelfAnalysis` method has been deprecated.	\nUse the **instance** method with the same name instead.");
 	}
@@ -2901,7 +2954,7 @@ var fn, pn = class e {
 			this.selfAnalysisDone = !0;
 			let n = this.className;
 			this.TRACE_INIT("toFastProps", () => {
-				a(this);
+				O(this);
 			}), this.TRACE_INIT("Grammar Recording", () => {
 				try {
 					this.enableRecording(), this.definedRulesNames.forEach((e) => {
@@ -2916,16 +2969,16 @@ var fn, pn = class e {
 			});
 			let r = [];
 			if (this.TRACE_INIT("Grammar Resolving", () => {
-				r = Ot({ rules: Object.values(this.gastProductionsCache) }), this.definitionErrors = this.definitionErrors.concat(r);
+				r = tn({ rules: Object.values(this.gastProductionsCache) }), this.definitionErrors = this.definitionErrors.concat(r);
 			}), this.TRACE_INIT("Grammar Validations", () => {
 				if (r.length === 0 && !1 === this.skipValidations) {
 					let t = function(e) {
-						let t = e.errMsgProvider ?? J;
-						return vt(e.rules, e.tokenTypes, t, e.grammarName);
+						let t = e.errMsgProvider ?? xt;
+						return Gt(e.rules, e.tokenTypes, t, e.grammarName);
 					}({
 						rules: Object.values(this.gastProductionsCache),
 						tokenTypes: Object.values(this.tokensMap),
-						errMsgProvider: J,
+						errMsgProvider: xt,
 						grammarName: n
 					}), r = (e = {
 						lookaheadStrategy: this.lookaheadStrategy,
@@ -2944,7 +2997,7 @@ var fn, pn = class e {
 				let e = function(e) {
 					let t = {};
 					return e.forEach((e) => {
-						let n = new E(e).startWalking();
+						let n = new pe(e).startWalking();
 						Object.assign(t, n);
 					}), t;
 				}(Object.values(this.gastProductionsCache));
@@ -2962,13 +3015,13 @@ var fn, pn = class e {
 		this.skipValidations = Object.hasOwn(t, "skipValidations") ? t.skipValidations : $.skipValidations;
 	}
 };
-pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
+Bn.DEFER_DEFINITION_ERRORS_HANDLING = !1, zn = Bn, [
 	class {
 		initRecoverable(e) {
-			this.firstAfterRepMap = {}, this.resyncFollows = {}, this.recoveryEnabled = Object.hasOwn(e, "recoveryEnabled") ? e.recoveryEnabled : $.recoveryEnabled, this.recoveryEnabled && (this.attemptInRepetitionRecovery = Ht);
+			this.firstAfterRepMap = [], this.resyncFollows = {}, this.recoveryEnabled = Object.hasOwn(e, "recoveryEnabled") ? e.recoveryEnabled : $.recoveryEnabled, this.recoveryEnabled && (this.attemptInRepetitionRecovery = gn);
 		}
 		getTokenToInsert(e) {
-			let t = Ke(e, "", -1, -1, -1, -1, -1, -1);
+			let t = vt(e, "", -1, -1, -1, -1, -1, -1);
 			return t.isInsertedInRecovery = !0, t;
 		}
 		canTokenTypeBeInsertedInRecovery(e) {
@@ -2979,7 +3032,7 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 		}
 		tryInRepetitionRecovery(e, t, n, r) {
 			let i = this.findReSyncTokenType(), a = this.exportLexerState(), o = [], s = !1, c = this.LA_FAST(1), l = this.LA_FAST(1), u = () => {
-				let e = this.LA(0), t = new It(this.errorMessageProvider.buildMismatchTokenMessage({
+				let e = this.LA(0), t = new un(this.errorMessageProvider.buildMismatchTokenMessage({
 					expected: r,
 					actual: c,
 					previous: e,
@@ -2999,7 +3052,7 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 		}
 		getNextPossibleTokenTypes(e) {
 			let t = e.ruleStack[0], n = this.getGAstProductions()[t];
-			return new Ze(n, e).startWalking();
+			return new wt(n, e).startWalking();
 		}
 		getFollowsForInRuleRecovery(e, t) {
 			let n = this.getCurrentGrammarPath(e, t);
@@ -3011,7 +3064,7 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 				let e = this.SKIP_TOKEN();
 				return this.consumeToken(), e;
 			}
-			throw new Vt("sad sad panda");
+			throw new hn("sad sad panda");
 		}
 		canPerformInRuleRecovery(e, t) {
 			return this.canRecoverWithSingleTokenInsertion(e, t) || this.canRecoverWithSingleTokenDeletion(e);
@@ -3031,13 +3084,13 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 		findReSyncTokenType() {
 			let e = this.flattenFollowSet(), t = this.LA_FAST(1), n = 2;
 			for (;;) {
-				let r = e.find((e) => B(t, e));
+				let r = e.find((e) => Xe(t, e));
 				if (r !== void 0) return r;
 				t = this.LA(n), n++;
 			}
 		}
 		getCurrFollowKey() {
-			if (this.RULE_STACK_IDX === 0) return Bt;
+			if (this.RULE_STACK_IDX === 0) return mn;
 			let e = this.currRuleShortName, t = this.getLastExplicitRuleOccurrenceIndex(), n = this.getPreviousExplicitRuleShortName();
 			return {
 				ruleName: this.shortRuleNameToFullName(e),
@@ -3047,7 +3100,7 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 		}
 		buildFullFollowKeyStack() {
 			let e = this.RULE_STACK, t = this.RULE_OCCURRENCE_STACK, n = this.RULE_STACK_IDX + 1, r = Array(n);
-			for (let i = 0; i < n; i++) r[i] = i === 0 ? Bt : {
+			for (let i = 0; i < n; i++) r[i] = i === 0 ? mn : {
 				ruleName: this.shortRuleNameToFullName(e[i]),
 				idxInCallingRule: t[i],
 				inRule: this.shortRuleNameToFullName(e[i - 1])
@@ -3058,12 +3111,12 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 			return this.buildFullFollowKeyStack().map((e) => this.getFollowSetFromFollowKey(e)).flat();
 		}
 		getFollowSetFromFollowKey(e) {
-			if (e === Bt) return [q];
-			let t = e.ruleName + e.idxInCallingRule + T + e.inRule;
+			if (e === mn) return [X];
+			let t = e.ruleName + e.idxInCallingRule + fe + e.inRule;
 			return this.resyncFollows[t];
 		}
 		addToResyncTokens(e, t) {
-			return this.tokenMatcher(e, q) || t.push(e), t;
+			return this.tokenMatcher(e, X) || t.push(e), t;
 		}
 		reSyncTo(e) {
 			let t = [], n = this.LA_FAST(1);
@@ -3087,38 +3140,38 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 	},
 	class {
 		initLooksAhead(e) {
-			this.dynamicTokensEnabled = Object.hasOwn(e, "dynamicTokensEnabled") ? e.dynamicTokensEnabled : $.dynamicTokensEnabled, this.maxLookahead = Object.hasOwn(e, "maxLookahead") ? e.maxLookahead : $.maxLookahead, this.lookaheadStrategy = Object.hasOwn(e, "lookaheadStrategy") ? e.lookaheadStrategy : new qt({ maxLookahead: this.maxLookahead }), this.lookAheadFuncsCache = /* @__PURE__ */ new Map();
+			this.dynamicTokensEnabled = Object.hasOwn(e, "dynamicTokensEnabled") ? e.dynamicTokensEnabled : $.dynamicTokensEnabled, this.maxLookahead = Object.hasOwn(e, "maxLookahead") ? e.maxLookahead : $.maxLookahead, this.lookaheadStrategy = Object.hasOwn(e, "lookaheadStrategy") ? e.lookaheadStrategy : new bn({ maxLookahead: this.maxLookahead }), this.lookAheadFuncsCache = [], this.currRuleLookaheadFuncs = [];
 		}
 		preComputeLookaheadFunctions(e) {
 			e.forEach((e) => {
 				this.TRACE_INIT(`${e.name} Rule Lookahead`, () => {
 					let { alternation: t, repetition: n, option: r, repetitionMandatory: i, repetitionMandatoryWithSeparator: a, repetitionWithSeparator: o } = function(e) {
-						Jt.reset(), e.accept(Jt);
-						let t = Jt.dslMethods;
-						return Jt.reset(), t;
+						xn.reset(), e.accept(xn);
+						let t = xn.dslMethods;
+						return xn.reset(), t;
 					}(e);
 					t.forEach((t) => {
 						let n = t.idx === 0 ? "" : t.idx;
-						this.TRACE_INIT(`${x(t)}${n}`, () => {
+						this.TRACE_INIT(`${V(t)}${n}`, () => {
 							let n = this.lookaheadStrategy.buildLookaheadForAlternation({
 								prodOccurrence: t.idx,
 								rule: e,
 								maxLookahead: t.maxLookahead || this.maxLookahead,
 								hasPredicates: t.hasPredicates,
 								dynamicTokensEnabled: this.dynamicTokensEnabled
-							}), r = Kt(this.fullRuleNameToShort[e.name], 256, t.idx);
-							this.setLaFuncCache(r, n);
+							});
+							this.setLaFuncCache(this.fullRuleNameToShort[e.name], 256 | t.idx, n);
 						});
 					}), n.forEach((t) => {
-						this.computeLookaheadFunc(e, t.idx, 768, "Repetition", t.maxLookahead, x(t));
+						this.computeLookaheadFunc(e, t.idx, 768, "Repetition", t.maxLookahead, V(t));
 					}), r.forEach((t) => {
-						this.computeLookaheadFunc(e, t.idx, 512, "Option", t.maxLookahead, x(t));
+						this.computeLookaheadFunc(e, t.idx, 512, "Option", t.maxLookahead, V(t));
 					}), i.forEach((t) => {
-						this.computeLookaheadFunc(e, t.idx, Ut, "RepetitionMandatory", t.maxLookahead, x(t));
+						this.computeLookaheadFunc(e, t.idx, _n, "RepetitionMandatory", t.maxLookahead, V(t));
 					}), a.forEach((t) => {
-						this.computeLookaheadFunc(e, t.idx, Gt, "RepetitionMandatoryWithSeparator", t.maxLookahead, x(t));
+						this.computeLookaheadFunc(e, t.idx, yn, "RepetitionMandatoryWithSeparator", t.maxLookahead, V(t));
 					}), o.forEach((t) => {
-						this.computeLookaheadFunc(e, t.idx, Wt, "RepetitionWithSeparator", t.maxLookahead, x(t));
+						this.computeLookaheadFunc(e, t.idx, vn, "RepetitionWithSeparator", t.maxLookahead, V(t));
 					});
 				});
 			});
@@ -3131,29 +3184,25 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 					maxLookahead: i || this.maxLookahead,
 					dynamicTokensEnabled: this.dynamicTokensEnabled,
 					prodType: r
-				}), o = Kt(this.fullRuleNameToShort[e.name], n, t);
-				this.setLaFuncCache(o, a);
+				});
+				this.setLaFuncCache(this.fullRuleNameToShort[e.name], n | t, a);
 			});
 		}
-		getKeyForAutomaticLookahead(e, t) {
-			return Kt(this.currRuleShortName, e, t);
-		}
-		getLaFuncFromCache(e) {
-			return this.lookAheadFuncsCache.get(e);
-		}
-		setLaFuncCache(e, t) {
-			this.lookAheadFuncsCache.set(e, t);
+		setLaFuncCache(e, t, n) {
+			let r = this.lookAheadFuncsCache[e];
+			r === void 0 && (r = [], this.lookAheadFuncsCache[e] = r), r[t] = n;
 		}
 	},
 	class {
 		initTreeBuilder(e) {
-			if (this.CST_STACK = [], this.outputCst = e.outputCst, this.nodeLocationTracking = Object.hasOwn(e, "nodeLocationTracking") ? e.nodeLocationTracking : $.nodeLocationTracking, this.outputCst) if (/full/i.test(this.nodeLocationTracking)) this.recoveryEnabled ? (this.setNodeLocationFromToken = Xt, this.setNodeLocationFromNode = Xt, this.cstPostRule = () => {}, this.setInitialNodeLocation = this.setInitialNodeLocationFullRecovery) : (this.setNodeLocationFromToken = () => {}, this.setNodeLocationFromNode = () => {}, this.cstPostRule = this.cstPostRuleFull, this.setInitialNodeLocation = this.setInitialNodeLocationFullRegular);
-			else if (/onlyOffset/i.test(this.nodeLocationTracking)) this.recoveryEnabled ? (this.setNodeLocationFromToken = Yt, this.setNodeLocationFromNode = Yt, this.cstPostRule = () => {}, this.setInitialNodeLocation = this.setInitialNodeLocationOnlyOffsetRecovery) : (this.setNodeLocationFromToken = () => {}, this.setNodeLocationFromNode = () => {}, this.cstPostRule = this.cstPostRuleOnlyOffset, this.setInitialNodeLocation = this.setInitialNodeLocationOnlyOffsetRegular);
-			else {
-				if (!/none/i.test(this.nodeLocationTracking)) throw Error(`Invalid <nodeLocationTracking> config option: "${e.nodeLocationTracking}"`);
-				this.setNodeLocationFromToken = () => {}, this.setNodeLocationFromNode = () => {}, this.cstPostRule = () => {}, this.setInitialNodeLocation = () => {};
-			}
-			else this.cstInvocationStateUpdate = () => {}, this.cstFinallyStateUpdate = () => {}, this.cstPostTerminal = () => {}, this.cstPostNonTerminal = () => {}, this.cstPostRule = () => {};
+			if (this.CST_STACK = [], this.outputCst = e.outputCst, this.nodeLocationTracking = Object.hasOwn(e, "nodeLocationTracking") ? e.nodeLocationTracking : $.nodeLocationTracking, this.outputCst) {
+				if (/full/i.test(this.nodeLocationTracking)) this.recoveryEnabled ? (this.setNodeLocationFromToken = Cn, this.setNodeLocationFromNode = Cn, this.cstPostRule = () => {}, this.setInitialNodeLocation = this.setInitialNodeLocationFullRecovery) : (this.setNodeLocationFromToken = () => {}, this.setNodeLocationFromNode = () => {}, this.cstPostRule = this.cstPostRuleFull, this.setInitialNodeLocation = this.setInitialNodeLocationFullRegular);
+				else if (/onlyOffset/i.test(this.nodeLocationTracking)) this.recoveryEnabled ? (this.setNodeLocationFromToken = Sn, this.setNodeLocationFromNode = Sn, this.cstPostRule = () => {}, this.setInitialNodeLocation = this.setInitialNodeLocationOnlyOffsetRecovery) : (this.setNodeLocationFromToken = () => {}, this.setNodeLocationFromNode = () => {}, this.cstPostRule = this.cstPostRuleOnlyOffset, this.setInitialNodeLocation = this.setInitialNodeLocationOnlyOffsetRegular);
+				else {
+					if (!/none/i.test(this.nodeLocationTracking)) throw Error(`Invalid <nodeLocationTracking> config option: "${e.nodeLocationTracking}"`);
+					this.setNodeLocationFromToken = () => {}, this.setNodeLocationFromNode = () => {}, this.cstPostRule = () => {}, this.setInitialNodeLocation = () => {};
+				}
+			} else this.cstInvocationStateUpdate = () => {}, this.cstFinallyStateUpdate = () => {}, this.cstPostTerminal = () => {}, this.cstPostNonTerminal = () => {}, this.cstPostRule = () => {};
 		}
 		setInitialNodeLocationOnlyOffsetRecovery(e) {
 			e.location = {
@@ -3222,7 +3271,7 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 		}
 		getBaseCstVisitorConstructor() {
 			if (this.baseCstVisitorConstructor === void 0) {
-				let e = en(this.className, Object.keys(this.gastProductionsCache));
+				let e = Dn(this.className, Object.keys(this.gastProductionsCache));
 				return this.baseCstVisitorConstructor = e, e;
 			}
 			return this.baseCstVisitorConstructor;
@@ -3231,10 +3280,10 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 			if (this.baseCstVisitorWithDefaultsConstructor === void 0) {
 				let e = function(e, t, n) {
 					let r = function() {};
-					Qt(r, e + "BaseSemanticsWithDefaults");
+					Tn(r, e + "BaseSemanticsWithDefaults");
 					let i = Object.create(n.prototype);
 					return t.forEach((e) => {
-						i[e] = $t;
+						i[e] = En;
 					}), (r.prototype = i).constructor = r, r;
 				}(this.className, Object.keys(this.gastProductionsCache), this.getBaseCstVisitorConstructor());
 				return this.baseCstVisitorWithDefaultsConstructor = e, e;
@@ -3260,7 +3309,7 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 			return this.tokVector;
 		}
 		SKIP_TOKEN() {
-			return this.currIdx <= this.tokVectorLength - 2 ? (this.consumeToken(), this.LA_FAST(1)) : Z;
+			return this.currIdx <= this.tokVectorLength - 2 ? (this.consumeToken(), this.LA_FAST(1)) : Ln;
 		}
 		LA_FAST(e) {
 			let t = this.currIdx + e;
@@ -3268,7 +3317,7 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 		}
 		LA(e) {
 			let t = this.currIdx + e;
-			return t < 0 || this.tokVectorLength <= t ? Z : this.tokVector[t];
+			return t < 0 || this.tokVectorLength <= t ? Ln : this.tokVector[t];
 		}
 		consumeToken() {
 			this.currIdx++;
@@ -3291,27 +3340,27 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 	},
 	class {
 		initRecognizerEngine(e, t) {
-			if (this.className = this.constructor.name, this.shortRuleNameToFull = {}, this.fullRuleNameToShort = {}, this.ruleShortNameIdx = 256, this.tokenMatcher = Oe, this.subruleIdx = 0, this.currRuleShortName = 0, this.definedRulesNames = [], this.tokensMap = {}, this.isBackTrackingStack = [], this.RULE_STACK = [], this.RULE_STACK_IDX = -1, this.RULE_OCCURRENCE_STACK = [], this.RULE_OCCURRENCE_STACK_IDX = -1, this.gastProductionsCache = {}, Object.hasOwn(t, "serializedGrammar")) throw Error("The Parser's configuration can no longer contain a <serializedGrammar> property.\n	See: https://chevrotain.io/docs/changes/BREAKING_CHANGES.html#_6-0-0\n	For Further details.");
+			if (this.className = this.constructor.name, this.shortRuleNameToFull = [], this.fullRuleNameToShort = {}, this.ruleShortNameIdx = 0, this.tokenMatcher = Ze, this.subruleIdx = 0, this.currRuleShortName = -1, this.definedRulesNames = [], this.tokensMap = {}, this.isBackTrackingStack = [], this.RULE_STACK = [], this.RULE_STACK_IDX = -1, this.RULE_OCCURRENCE_STACK = [], this.RULE_OCCURRENCE_STACK_IDX = -1, this.gastProductionsCache = {}, Object.hasOwn(t, "serializedGrammar")) throw Error("The Parser's configuration can no longer contain a <serializedGrammar> property.\n	See: https://chevrotain.io/docs/changes/BREAKING_CHANGES.html#_6-0-0\n	For Further details.");
 			if (Array.isArray(e)) {
 				if (e.length === 0) throw Error("A Token Vocabulary cannot be empty.\n	Note that the first argument for the parser constructor\n	is no longer a Token vector (since v4.0).");
 				if (typeof e[0].startOffset == "number") throw Error("The Parser constructor no longer accepts a token vector as the first argument.\n	See: https://chevrotain.io/docs/changes/BREAKING_CHANGES.html#_4-0-0\n	For Further details.");
 			}
 			if (Array.isArray(e)) this.tokensMap = e.reduce((e, t) => (e[t.name] = t, e), {});
-			else if (Object.hasOwn(e, "modes") && Object.values(e.modes).flat().every(Pe)) {
+			else if (Object.hasOwn(e, "modes") && Object.values(e.modes).flat().every(it)) {
 				let t = Object.values(e.modes).flat(), n = [...new Set(t)];
 				this.tokensMap = n.reduce((e, t) => (e[t.name] = t, e), {});
 			} else {
 				if (typeof e != "object" || !e) throw Error("<tokensDictionary> argument must be An Array of Token constructors, A dictionary of Token constructors or an IMultiModeLexerDefinition");
 				this.tokensMap = Object.assign({}, e);
 			}
-			this.tokensMap.EOF = q;
+			this.tokensMap.EOF = X;
 			let n = (Object.hasOwn(e, "modes") ? Object.values(e.modes).flat() : Object.values(e)).every((e) => e.categoryMatches?.length == 0);
-			this.tokenMatcher = n ? Oe : B, V(Object.values(this.tokensMap));
+			this.tokenMatcher = n ? Ze : Xe, et(Object.values(this.tokensMap));
 		}
 		defineRule(e, t, n) {
 			if (this.selfAnalysisDone) throw Error(`Grammar rule <${e}> may not be defined after the 'performSelfAnalysis' method has been called'\nMake sure that all grammar rule definitions are done before 'performSelfAnalysis' is called.`);
-			let r = Object.hasOwn(n, "resyncEnabled") ? n.resyncEnabled : dn.resyncEnabled, i = Object.hasOwn(n, "recoveryValueFunc") ? n.recoveryValueFunc : dn.recoveryValueFunc, a = this.ruleShortNameIdx << 12, o;
-			return this.ruleShortNameIdx++, this.shortRuleNameToFull[a] = e, this.fullRuleNameToShort[e] = a, o = !0 === this.outputCst ? function(...n) {
+			let r = Object.hasOwn(n, "resyncEnabled") ? n.resyncEnabled : Rn.resyncEnabled, i = Object.hasOwn(n, "recoveryValueFunc") ? n.recoveryValueFunc : Rn.recoveryValueFunc, a = this.ruleShortNameIdx++, o;
+			return this.shortRuleNameToFull[a] = e, this.fullRuleNameToShort[e] = a, o = !0 === this.outputCst ? function(...n) {
 				try {
 					this.ruleInvocationStateUpdate(a, e, this.subruleIdx), t.apply(this, n);
 					let r = this.CST_STACK[this.CST_STACK.length - 1];
@@ -3344,7 +3393,7 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 		}
 		invokeRuleCatch(e, t, n) {
 			let r = this.RULE_STACK_IDX === 0, i = t && !this.isBackTracking() && this.recoveryEnabled;
-			if (Pt(e)) {
+			if (cn(e)) {
 				let t = e;
 				if (i) {
 					let r = this.findReSyncTokenType();
@@ -3367,11 +3416,11 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 			throw e;
 		}
 		optionInternal(e, t) {
-			let n = this.getKeyForAutomaticLookahead(512, t);
+			let n = 512 | t;
 			return this.optionInternalLogic(e, t, n);
 		}
 		optionInternalLogic(e, t, n) {
-			let r, i = this.getLaFuncFromCache(n);
+			let r, i = this.currRuleLookaheadFuncs[n];
 			if (typeof e != "function") {
 				r = e.DEF;
 				let t = e.GATE;
@@ -3383,11 +3432,11 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 			if (!0 === i.call(this)) return r.call(this);
 		}
 		atLeastOneInternal(e, t) {
-			let n = this.getKeyForAutomaticLookahead(Ut, e);
+			let n = _n | e;
 			return this.atLeastOneInternalLogic(e, t, n);
 		}
 		atLeastOneInternalLogic(e, t, n) {
-			let r, i = this.getLaFuncFromCache(n);
+			let r, i = this.currRuleLookaheadFuncs[n];
 			if (typeof t != "function") {
 				r = t.DEF;
 				let e = t.GATE;
@@ -3396,20 +3445,20 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 					i = () => e.call(this) && t.call(this);
 				}
 			} else r = t;
-			if (!0 !== i.call(this)) throw this.raiseEarlyExitException(e, Y.REPETITION_MANDATORY, t.ERR_MSG);
+			if (!0 !== i.call(this)) throw this.raiseEarlyExitException(e, Z.REPETITION_MANDATORY, t.ERR_MSG);
 			{
 				let e = this.doSingleRepetition(r);
 				for (; !0 === i.call(this) && !0 === e;) e = this.doSingleRepetition(r);
 			}
-			this.attemptInRepetitionRecovery(this.atLeastOneInternal, [e, t], i, Ut, e, tt);
+			this.attemptInRepetitionRecovery(this.atLeastOneInternal, [e, t], i, _n, e, Ot);
 		}
 		atLeastOneSepFirstInternal(e, t) {
-			let n = this.getKeyForAutomaticLookahead(Gt, e);
+			let n = yn | e;
 			this.atLeastOneSepFirstInternalLogic(e, t, n);
 		}
 		atLeastOneSepFirstInternalLogic(e, t, n) {
 			let r = t.DEF, i = t.SEP;
-			if (!0 !== this.getLaFuncFromCache(n).call(this)) throw this.raiseEarlyExitException(e, Y.REPETITION_MANDATORY_WITH_SEPARATOR, t.ERR_MSG);
+			if (!0 !== this.currRuleLookaheadFuncs[n].call(this)) throw this.raiseEarlyExitException(e, Z.REPETITION_MANDATORY_WITH_SEPARATOR, t.ERR_MSG);
 			{
 				r.call(this);
 				let t = () => this.tokenMatcher(this.LA_FAST(1), i);
@@ -3419,16 +3468,16 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 					i,
 					t,
 					r,
-					nt
-				], t, Gt, e, nt);
+					kt
+				], t, yn, e, kt);
 			}
 		}
 		manyInternal(e, t) {
-			let n = this.getKeyForAutomaticLookahead(768, e);
+			let n = 768 | e;
 			return this.manyInternalLogic(e, t, n);
 		}
 		manyInternalLogic(e, t, n) {
-			let r, i = this.getLaFuncFromCache(n);
+			let r, i = this.currRuleLookaheadFuncs[n];
 			if (typeof t != "function") {
 				r = t.DEF;
 				let e = t.GATE;
@@ -3439,15 +3488,15 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 			} else r = t;
 			let a = !0;
 			for (; !0 === i.call(this) && !0 === a;) a = this.doSingleRepetition(r);
-			this.attemptInRepetitionRecovery(this.manyInternal, [e, t], i, 768, e, $e, a);
+			this.attemptInRepetitionRecovery(this.manyInternal, [e, t], i, 768, e, Et, a);
 		}
 		manySepFirstInternal(e, t) {
-			let n = this.getKeyForAutomaticLookahead(Wt, e);
+			let n = vn | e;
 			this.manySepFirstInternalLogic(e, t, n);
 		}
 		manySepFirstInternalLogic(e, t, n) {
 			let r = t.DEF, i = t.SEP;
-			if (!0 === this.getLaFuncFromCache(n).call(this)) {
+			if (!0 === this.currRuleLookaheadFuncs[n].call(this)) {
 				r.call(this);
 				let t = () => this.tokenMatcher(this.LA_FAST(1), i);
 				for (; !0 === this.tokenMatcher(this.LA_FAST(1), i);) this.CONSUME(i), r.call(this);
@@ -3456,8 +3505,8 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 					i,
 					t,
 					r,
-					et
-				], t, Wt, e, et);
+					Dt
+				], t, vn, e, Dt);
 			}
 		}
 		repetitionSepSecondInternal(e, t, n, r, i) {
@@ -3468,19 +3517,19 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 				n,
 				r,
 				i
-			], n, Gt, e, i);
+			], n, yn, e, i);
 		}
 		doSingleRepetition(e) {
 			let t = this.getLexerPosition();
 			return e.call(this), this.getLexerPosition() > t;
 		}
 		orInternal(e, t) {
-			let n = this.getKeyForAutomaticLookahead(256, t), r = Array.isArray(e) ? e : e.DEF, i = this.getLaFuncFromCache(n).call(this, r);
+			let n = 256 | t, r = Array.isArray(e) ? e : e.DEF, i = this.currRuleLookaheadFuncs[n].call(this, r);
 			if (i !== void 0) return r[i].ALT.call(this);
 			this.raiseNoAltException(t, e.ERR_MSG);
 		}
 		ruleFinallyStateUpdate() {
-			this.RULE_STACK_IDX--, this.RULE_OCCURRENCE_STACK_IDX--, this.RULE_STACK_IDX >= 0 && (this.currRuleShortName = this.RULE_STACK[this.RULE_STACK_IDX]), this.cstFinallyStateUpdate();
+			this.RULE_STACK_IDX--, this.RULE_OCCURRENCE_STACK_IDX--, this.RULE_STACK_IDX >= 0 && (this.currRuleShortName = this.RULE_STACK[this.RULE_STACK_IDX], this.currRuleLookaheadFuncs = this.lookAheadFuncsCache[this.currRuleShortName]), this.cstFinallyStateUpdate();
 		}
 		subruleInternal(e, t, n) {
 			let r;
@@ -3492,7 +3541,7 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 			}
 		}
 		subruleInternalError(e, t, n) {
-			throw Pt(e) && e.partialCstResult !== void 0 && (this.cstPostNonTerminal(e.partialCstResult, t !== void 0 && t.LABEL !== void 0 ? t.LABEL : n), delete e.partialCstResult), e;
+			throw cn(e) && e.partialCstResult !== void 0 && (this.cstPostNonTerminal(e.partialCstResult, t !== void 0 && t.LABEL !== void 0 ? t.LABEL : n), delete e.partialCstResult), e;
 		}
 		consumeInternal(e, t, n) {
 			let r;
@@ -3511,7 +3560,7 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 				actual: t,
 				previous: i,
 				ruleName: this.getCurrRuleFullName()
-			}), this.SAVE_ERROR(new It(r, t, i));
+			}), this.SAVE_ERROR(new un(r, t, i));
 		}
 		consumeInternalRecovery(e, t, n) {
 			if (!this.recoveryEnabled || n.name !== "MismatchedTokenException" || this.isBackTracking()) throw n;
@@ -3537,10 +3586,10 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 			this.errors = e.errors, this.importLexerState(e.lexerState);
 			let t = e.RULE_STACK;
 			for (let e = 0; e < t.length; e++) this.RULE_STACK[e] = t[e];
-			this.RULE_STACK_IDX = t.length - 1, this.RULE_STACK_IDX >= 0 && (this.currRuleShortName = this.RULE_STACK[this.RULE_STACK_IDX]);
+			this.RULE_STACK_IDX = t.length - 1, this.RULE_STACK_IDX >= 0 && (this.currRuleShortName = this.RULE_STACK[this.RULE_STACK_IDX], this.currRuleLookaheadFuncs = this.lookAheadFuncsCache[this.currRuleShortName]);
 		}
 		ruleInvocationStateUpdate(e, t, n) {
-			this.RULE_OCCURRENCE_STACK[++this.RULE_OCCURRENCE_STACK_IDX] = n, this.RULE_STACK[++this.RULE_STACK_IDX] = e, this.currRuleShortName = e, this.cstInvocationStateUpdate(t);
+			this.RULE_OCCURRENCE_STACK[++this.RULE_OCCURRENCE_STACK_IDX] = n, this.RULE_STACK[++this.RULE_STACK_IDX] = e, this.currRuleShortName = e, this.currRuleLookaheadFuncs = this.lookAheadFuncsCache[e], this.cstInvocationStateUpdate(t);
 		}
 		isBackTracking() {
 			return this.isBackTrackingStack.length !== 0;
@@ -3553,13 +3602,13 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 			return this.shortRuleNameToFull[e];
 		}
 		isAtEndOfInput() {
-			return this.tokenMatcher(this.LA(1), q);
+			return this.tokenMatcher(this.LA(1), X);
 		}
 		reset() {
-			this.resetLexerState(), this.subruleIdx = 0, this.currRuleShortName = 0, this.isBackTrackingStack = [], this.errors = [], this.RULE_STACK_IDX = -1, this.RULE_OCCURRENCE_STACK_IDX = -1, this.CST_STACK = [];
+			this.resetLexerState(), this.subruleIdx = 0, this.currRuleShortName = -1, this.currRuleLookaheadFuncs = [], this.isBackTrackingStack = [], this.errors = [], this.RULE_STACK_IDX = -1, this.RULE_OCCURRENCE_STACK_IDX = -1, this.CST_STACK = [];
 		}
 		onBeforeParse(e) {
-			for (let e = 0; e < this.maxLookahead + 1; e++) this.tokVector.push(Z);
+			for (let e = 0; e < this.maxLookahead + 1; e++) this.tokVector.push(Ln);
 		}
 		onAfterParse(e) {
 			if (!1 === this.isAtEndOfInput()) {
@@ -3567,9 +3616,9 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 					firstRedundant: e,
 					ruleName: this.getCurrRuleFullName()
 				});
-				this.SAVE_ERROR(new Rt(t, e));
+				this.SAVE_ERROR(new fn(t, e));
 			}
-			for (; this.tokVector.at(-1) === Z;) this.tokVector.pop();
+			for (; this.tokVector.at(-1) === Ln;) this.tokVector.pop();
 		}
 	},
 	class {
@@ -3834,10 +3883,10 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 		AT_LEAST_ONE_SEP9(e) {
 			this.atLeastOneSepFirstInternal(9, e);
 		}
-		RULE(e, t, n = dn) {
+		RULE(e, t, n = Rn) {
 			if (this.definedRulesNames.includes(e)) {
 				let t = {
-					message: J.buildDuplicateRuleNameError({
+					message: xt.buildDuplicateRuleNameError({
 						topLevelRule: e,
 						grammarName: this.className
 					}),
@@ -3850,7 +3899,7 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 			let r = this.defineRule(e, t, n);
 			return this[e] = r, r;
 		}
-		OVERRIDE_RULE(e, t, n = dn) {
+		OVERRIDE_RULE(e, t, n = Rn) {
 			let r = function(e, t, n) {
 				let r = [], i;
 				return t.includes(e) || (i = `Invalid rule override, rule: ->${e}<- cannot be overridden in the grammar: ->${n}<-as it is not defined in any of the super grammars `, r.push({
@@ -3871,7 +3920,7 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 				try {
 					return n.apply(this, t), !0;
 				} catch (e) {
-					if (Pt(e)) return !1;
+					if (cn(e)) return !1;
 					throw e;
 				} finally {
 					this.reloadRecogState(e), this.isBackTrackingStack.pop();
@@ -3882,7 +3931,7 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 			return this.gastProductionsCache;
 		}
 		getSerializedGastProductions() {
-			return Object.values(this.gastProductionsCache).map(_);
+			return Object.values(this.gastProductionsCache).map(oe);
 		}
 	},
 	class {
@@ -3890,7 +3939,7 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 			this._errors = [], this.errorMessageProvider = Object.hasOwn(e, "errorMessageProvider") ? e.errorMessageProvider : $.errorMessageProvider;
 		}
 		SAVE_ERROR(e) {
-			if (Pt(e)) return e.context = {
+			if (cn(e)) return e.context = {
 				ruleStack: this.getHumanReadableRuleStack(),
 				ruleOccurrenceStack: this.RULE_OCCURRENCE_STACK.slice(0, this.RULE_OCCURRENCE_STACK_IDX + 1)
 			}, this._errors.push(e), e;
@@ -3903,7 +3952,7 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 			this._errors = e;
 		}
 		raiseEarlyExitException(e, t, n) {
-			let r = this.getCurrRuleFullName(), i = ht(e, this.getGAstProductions()[r], t, this.maxLookahead)[0], a = [];
+			let r = this.getCurrRuleFullName(), i = Ht(e, this.getGAstProductions()[r], t, this.maxLookahead)[0], a = [];
 			for (let e = 1; e <= this.maxLookahead; e++) a.push(this.LA(e));
 			let o = this.errorMessageProvider.buildEarlyExitMessage({
 				expectedIterationPaths: i,
@@ -3912,10 +3961,10 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 				customUserDescription: n,
 				ruleName: r
 			});
-			throw this.SAVE_ERROR(new zt(o, this.LA(1), this.LA(0)));
+			throw this.SAVE_ERROR(new pn(o, this.LA(1), this.LA(0)));
 		}
 		raiseNoAltException(e, t) {
-			let n = this.getCurrRuleFullName(), r = mt(e, this.getGAstProductions()[n], this.maxLookahead), i = [];
+			let n = this.getCurrRuleFullName(), r = Vt(e, this.getGAstProductions()[n], this.maxLookahead), i = [];
 			for (let e = 1; e <= this.maxLookahead; e++) i.push(this.LA(e));
 			let a = this.LA(0), o = this.errorMessageProvider.buildNoViableAltMessage({
 				expectedPathsPerAlt: r,
@@ -3924,7 +3973,7 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 				customUserDescription: t,
 				ruleName: this.getCurrRuleFullName()
 			});
-			throw this.SAVE_ERROR(new Lt(o, this.LA(1), a));
+			throw this.SAVE_ERROR(new dn(o, this.LA(1), a));
 		}
 	},
 	class {
@@ -3983,11 +4032,11 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 			return () => !0;
 		}
 		LA_RECORD(e) {
-			return Z;
+			return Ln;
 		}
 		topLevelRuleRecord(e, t) {
 			try {
-				let n = new c({
+				let n = new j({
 					definition: [],
 					name: e
 				});
@@ -4002,54 +4051,54 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 			}
 		}
 		optionInternalRecord(e, t) {
-			return X.call(this, u, e, t);
+			return Nn.call(this, N, e, t);
 		}
 		atLeastOneInternalRecord(e, t) {
-			X.call(this, d, t, e);
+			Nn.call(this, P, t, e);
 		}
 		atLeastOneSepFirstInternalRecord(e, t) {
-			X.call(this, f, t, e, nn);
+			Nn.call(this, F, t, e, kn);
 		}
 		manyInternalRecord(e, t) {
-			X.call(this, p, t, e);
+			Nn.call(this, I, t, e);
 		}
 		manySepFirstInternalRecord(e, t) {
-			X.call(this, m, t, e, nn);
+			Nn.call(this, L, t, e, kn);
 		}
 		orInternalRecord(e, t) {
-			return cn.call(this, e, t);
+			return Pn.call(this, e, t);
 		}
 		subruleInternalRecord(e, t, n) {
-			if (un(t), !e || !Object.hasOwn(e, "ruleName")) {
-				let n = /* @__PURE__ */ Error(`<SUBRULE${ln(t)}> argument is invalid expecting a Parser method reference but got: <${JSON.stringify(e)}>\n inside top level rule: <${this.recordingProdStack[0].name}>`);
+			if (In(t), !e || !Object.hasOwn(e, "ruleName")) {
+				let n = /* @__PURE__ */ Error(`<SUBRULE${Fn(t)}> argument is invalid expecting a Parser method reference but got: <${JSON.stringify(e)}>\n inside top level rule: <${this.recordingProdStack[0].name}>`);
 				throw n.KNOWN_RECORDER_ERROR = !0, n;
 			}
-			let r = this.recordingProdStack.at(-1), i = e.ruleName, a = new s({
+			let r = this.recordingProdStack.at(-1), i = e.ruleName, a = new A({
 				idx: t,
 				nonTerminalName: i,
 				label: n?.LABEL,
 				referencedRule: void 0
 			});
-			return r.definition.push(a), this.outputCst ? sn : tn;
+			return r.definition.push(a), this.outputCst ? Mn : On;
 		}
 		consumeInternalRecord(e, t, n) {
-			if (un(t), !Me(e)) {
-				let n = /* @__PURE__ */ Error(`<CONSUME${ln(t)}> argument is invalid expecting a TokenType reference but got: <${JSON.stringify(e)}>\n inside top level rule: <${this.recordingProdStack[0].name}>`);
+			if (In(t), !nt(e)) {
+				let n = /* @__PURE__ */ Error(`<CONSUME${Fn(t)}> argument is invalid expecting a TokenType reference but got: <${JSON.stringify(e)}>\n inside top level rule: <${this.recordingProdStack[0].name}>`);
 				throw n.KNOWN_RECORDER_ERROR = !0, n;
 			}
-			let r = this.recordingProdStack.at(-1), i = new g({
+			let r = this.recordingProdStack.at(-1), i = new z({
 				idx: t,
 				terminalType: e,
 				label: n?.LABEL
 			});
-			return r.definition.push(i), on;
+			return r.definition.push(i), jn;
 		}
 	},
 	class {
 		initPerformanceTracer(e) {
 			if (Object.hasOwn(e, "traceInitPerf")) {
 				let t = e.traceInitPerf, n = typeof t == "number";
-				this.traceInitMaxIdent = n ? t : Infinity, this.traceInitPerf = n ? t > 0 : t;
+				this.traceInitMaxIdent = n ? t : 1 / 0, this.traceInitPerf = n ? t > 0 : t;
 			} else this.traceInitMaxIdent = 0, this.traceInitPerf = $.traceInitPerf;
 			this.traceInitIndent = -1;
 		}
@@ -4058,8 +4107,8 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 				this.traceInitIndent++;
 				let n = Array(this.traceInitIndent + 1).join("	");
 				this.traceInitIndent < this.traceInitMaxIdent && console.log(`${n}--\x3e <${e}>`);
-				let { time: r, value: a } = i(t), o = r > 10 ? console.warn : console.log;
-				return this.traceInitIndent < this.traceInitMaxIdent && o(`${n}<-- <${e}> time: ${r}ms`), this.traceInitIndent--, a;
+				let { time: r, value: i } = ae(t), a = r > 10 ? console.warn : console.log;
+				return this.traceInitIndent < this.traceInitMaxIdent && a(`${n}<-- <${e}> time: ${r}ms`), this.traceInitIndent--, i;
 			}
 			return t();
 		}
@@ -4069,67 +4118,84 @@ pn.DEFER_DEFINITION_ERRORS_HANDLING = !1, fn = pn, [
 	Object.getOwnPropertyNames(t).forEach((n) => {
 		if (n === "constructor") return;
 		let r = Object.getOwnPropertyDescriptor(t, n);
-		r && (r.get || r.set) ? Object.defineProperty(fn.prototype, n, r) : fn.prototype[n] = e.prototype[n];
+		r && (r.get || r.set) ? Object.defineProperty(zn.prototype, n, r) : zn.prototype[n] = e.prototype[n];
 	});
 });
-var mn = class extends pn {
+var Vn = class extends Bn {
 	constructor(e, t = $) {
 		let n = Object.assign({}, t);
 		n.outputCst = !1, super(e, n);
 	}
-}, hn = class n {
+}, Hn = class e {
 	static shared(t) {
-		let r = t?.locale ?? e, i = t?.maxColumn ?? yn, a = t?.maxRow ?? bn, o = vn.get(r);
-		o || (o = /* @__PURE__ */ new Map(), vn.set(r, o));
-		let s = `${i}:${a}`, c = o.get(s);
-		return c || (c = new n({
-			locale: r,
-			maxColumn: i,
-			maxRow: a
-		}), o.set(s, c)), c;
-	}
-	constructor(t) {
-		let n = t?.maxColumn ?? yn, r = t?.maxRow ?? bn, i = t?.locale ?? e;
-		this._locale = i, this._maxColumn = n, this._maxRow = r;
-		let { separatorFunction: a, separatorColumn: o, separatorRow: s, separatorDecimal: c } = i.separators;
-		if (o === s) throw Error(`FormulaLexer: separatorColumn and separatorRow must differ (both '${o}')`);
-		let l = K({
+		let n = t?.locale ?? re, r = t?.maxColumn ?? Kn, i = t?.maxRow ?? qn, a = Gn.get(n);
+		a || (a = /* @__PURE__ */ new Map(), Gn.set(n, a));
+		let o = `${r}:${i}`, s = a.get(o);
+		return s || (s = new e({
+			locale: n,
+			maxColumn: r,
+			maxRow: i
+		}), a.set(o, s)), s;
+	}
+	constructor(e) {
+		let t = e?.maxColumn ?? Kn, n = e?.maxRow ?? qn, r = e?.locale ?? re;
+		this._locale = r, this._maxColumn = t, this._maxRow = n;
+		let { separatorFunction: i, separatorColumn: a, separatorRow: o, separatorDecimal: s } = r.separators;
+		if (a === o) throw Error(`FormulaLexer: separatorColumn and separatorRow must differ (both '${a}')`);
+		let c = Y({
 			name: "WhiteSpace",
-			pattern: /\s+/,
-			group: W.SKIPPED
-		}), u = K({
+			pattern: /[ \n\v\f\r\u00a0\u1680\u2000-\u200a\u2028\u2029\u202f\u205f\u3000\ufeff]+/,
+			group: J.SKIPPED
+		}), l = Y({
 			name: "StringToken",
 			pattern: /"(""|[^"])*"/
-		}), d = K({
+		}), u = Y({
 			name: "FunctionToken",
 			pattern: /[a-zA-Z_\u007F-\uFFFF]+[a-zA-Z0-9_.\u007F-\uFFFF]*(?=\()/
-		}), f = K({
+		}), d = Y({
 			name: "TableReference",
-			pattern: { exec: wn },
+			pattern: { exec: ne },
 			line_breaks: !1,
-			start_chars_hint: _n
-		}), p = K({
+			start_chars_hint: Wn
+		}), f = Y({
 			name: "BracketedString",
-			pattern: { exec: En },
+			pattern: { exec: te },
 			line_breaks: !1,
 			start_chars_hint: [91],
-			longer_alt: [f, u]
-		}), m = (e) => (e ?? []).map((e) => e?.trim()).filter(Boolean).map((e) => e.replace(/[.*+?^${}()|[\]\\]/g, "\\$&")).map((e) => e + "|").join(""), h = K({
+			longer_alt: [d, l]
+		}), p = (e) => (e ?? []).map((e) => e?.trim()).filter(Boolean).map((e) => e.replace(/[.*+?^${}()|[\]\\]/g, "\\$&")).map((e) => e + "|").join(""), m = (e) => e.replace(/[A-Za-z]/g, (e) => `[${e.toUpperCase()}${e.toLowerCase()}]`), h = Y({
 			name: "LiteralError",
-			pattern: RegExp(m(i.errorLiterals) + "#PARSE!|#NULL!|#DIV\\/0!|#VALUE!|#NUM!|#FIELD!|#N\\/A|#GETTING_DATA|#SPILL!|#CONNECT!|#BLOCKED!|#UNKNOWN!|#CALC!|#BUSY!|#PYTHON!|#TIMEOUT!")
-		}), g = K({
+			pattern: new RegExp(p(r.errorLiterals) + [
+				"#PARSE!",
+				"#NULL!",
+				"#DIV\\/0!",
+				"#VALUE!",
+				"#NUM!",
+				"#FIELD!",
+				"#N\\/A",
+				"#GETTING_DATA",
+				"#SPILL!",
+				"#CONNECT!",
+				"#BLOCKED!",
+				"#UNKNOWN!",
+				"#CALC!",
+				"#BUSY!",
+				"#PYTHON!",
+				"#TIMEOUT!"
+			].map(m).join("|"))
+		}), g = Y({
 			name: "RefError",
-			pattern: RegExp(m(i.errorRefs) + "#REF!|#NAME\\?")
-		}), _ = K({
+			pattern: new RegExp(p(r.errorRefs) + ["#REF!", "#NAME\\?"].map(m).join("|"))
+		}), _ = Y({
 			name: "SingleQuotedString",
 			pattern: /'(''|[^'])*'/
-		}), v = K({
+		}), v = Y({
 			name: "SheetQuoted",
 			pattern: /'(?:''|[^'])*?'!/
-		}), y = K({
+		}), y = Y({
 			name: "Sheet",
 			pattern: /[A-Za-z_.\d\u007F-\uFFFF]*!/
-		}), b = /[a-zA-Z_\\\u007F-\uFFFF][a-zA-Z0-9_.?\\\u007F-\uFFFF]*:?/y, x = K({
+		}), b = /[a-zA-Z_\\\u007F-\uFFFF][a-zA-Z0-9_.?\\\u007F-\uFFFF]*:?/y, x = Y({
 			name: "NamedToken",
 			pattern: { exec: (e, t) => {
 				b.lastIndex = t;
@@ -4139,186 +4205,186 @@ var mn = class extends pn {
 				return i === -1 ? r.endsWith(":") && (r = r.slice(0, -1)) : r = r.substring(0, i), [r];
 			} },
 			line_breaks: !1,
-			start_chars_hint: _n
-		}), S = K({
+			start_chars_hint: Wn
+		}), S = Y({
 			name: "Cell",
-			pattern: { exec: Cn(n, r) },
+			pattern: { exec: Xn(t, n) },
 			line_breaks: !1,
-			start_chars_hint: [36, ...gn],
+			start_chars_hint: [36, ...Un],
 			longer_alt: x
-		}), C = K({
+		}), ee = Y({
 			name: "Column",
-			pattern: { exec: Sn(n) },
+			pattern: { exec: Yn(t) },
 			line_breaks: !1,
-			start_chars_hint: [36, ...gn],
+			start_chars_hint: [36, ...Un],
 			longer_alt: x
-		}), w = K({
+		}), C = Y({
 			name: "AbsRow",
 			pattern: /[$][0-9]+/
-		}), T = c === "." ? "\\." : c, E = K({
+		}), w = s === "." ? "\\." : s, ie = Y({
 			name: "NumberToken",
-			pattern: RegExp(`[0-9]+${T}(?!:)[0-9]*([eE][+-]?[0-9]+|\\*\\*[+-]?[0-9]+)?|${T}[0-9]+([eE][+-]?[0-9]+|\\*\\*[+-]?[0-9]+)?|[0-9]+[eE][+-]?[0-9]+`)
-		}), D = K({
+			pattern: RegExp(`[0-9]+${w}(?!:)[0-9]*([eE][+-]?[0-9]+|\\*\\*[+-]?[0-9]+)?|${w}[0-9]+([eE][+-]?[0-9]+|\\*\\*[+-]?[0-9]+)?|[0-9]+[eE][+-]?[0-9]+`)
+		}), T = Y({
 			name: "ScientificDigit",
 			pattern: /[0-9]+\*\*[+-]?[0-9]+/
-		}), O = K({
+		}), E = Y({
 			name: "DigitToken",
 			pattern: /[0-9]+/
-		}), k = ["TRUE", "FALSE"];
-		for (let e of [i.booleanTrue, i.booleanFalse]) {
+		}), D = ["TRUE", "FALSE"];
+		for (let e of [r.booleanTrue, r.booleanFalse]) {
 			let t = e?.trim();
-			t && !k.some((e) => e.toLowerCase() === t.toLowerCase()) && k.push(t.replace(/[.*+?^${}()|[\]\\]/g, "\\$&"));
+			t && !D.some((e) => e.toLowerCase() === t.toLowerCase()) && D.push(t.replace(/[.*+?^${}()|[\]\\]/g, "\\$&"));
 		}
-		let A = K({
+		let ae = Y({
 			name: "BooleanToken",
-			pattern: new RegExp(k.join("|"), "i")
-		}), j = K({
+			pattern: new RegExp(D.join("|"), "i")
+		}), O = Y({
 			name: "ArgSeparator",
-			pattern: Tn(a)
-		}), M = K({
+			pattern: Zn(i)
+		}), k = Y({
 			name: "ColSeparator",
-			pattern: Tn(o)
-		}), N = K({
+			pattern: Zn(a)
+		}), A = Y({
 			name: "RowSeparator",
-			pattern: Tn(s)
-		}), P = K({
+			pattern: Zn(o)
+		}), j = Y({
 			name: "RangeOp",
 			pattern: /:/
-		}), ee = K({
+		}), M = Y({
 			name: "RangeTrimFullOp",
 			pattern: /\.:\./
-		}), te = K({
+		}), N = Y({
 			name: "RangeTrimLeadingOp",
 			pattern: /\.:/
-		}), F = K({
+		}), P = Y({
 			name: "RangeTrimTrailingOp",
 			pattern: /:\./
-		}), ne = K({
+		}), F = Y({
 			name: "OpenParen",
 			pattern: /\(/
-		}), I = K({
+		}), I = Y({
 			name: "CloseParen",
 			pattern: /\)/
-		}), L = K({
+		}), L = Y({
 			name: "OpenCurlyParen",
 			pattern: /{/
-		}), re = K({
+		}), R = Y({
 			name: "CloseCurlyParen",
 			pattern: /}/
-		}), ie = K({
+		}), z = Y({
 			name: "QuoteS",
 			pattern: /'/
-		}), ae = K({
+		}), oe = Y({
 			name: "MulOp",
 			pattern: /\*(?!\*)/
-		}), oe = K({
+		}), B = Y({
 			name: "PlusOp",
 			pattern: /\+/
-		}), se = K({
+		}), se = Y({
 			name: "DivOp",
 			pattern: /\//
-		}), ce = K({
+		}), ce = Y({
 			name: "MinOp",
 			pattern: /-/
-		}), le = K({
+		}), V = Y({
 			name: "ImplicitIntersectOp",
 			pattern: /@/
-		}), ue = K({
+		}), le = Y({
 			name: "ConcatOp",
 			pattern: /&/
-		}), de = K({
+		}), ue = Y({
 			name: "ExOp",
 			pattern: /\^/
-		}), fe = K({
+		}), de = Y({
 			name: "PercentOp",
 			pattern: /%/
-		}), pe = K({
+		}), fe = Y({
 			name: "ArrayAnchorOp",
 			pattern: /#/,
 			longer_alt: [h, g]
-		}), R = K({
+		}), pe = Y({
 			name: "GtOp",
 			pattern: />/
-		}), me = K({
+		}), H = Y({
 			name: "EqOp",
 			pattern: /=/
-		}), he = K({
+		}), me = Y({
 			name: "LtOp",
 			pattern: /</
-		}), ge = [
+		}), U = [
+			c,
 			l,
-			u,
 			v,
 			_,
 			y,
+			u,
 			d,
 			f,
-			p,
 			h,
 			g,
-			j,
-			...o === a ? [] : [M],
+			O,
+			...a === i ? [] : [k],
+			A,
+			M,
 			N,
-			ee,
-			te,
-			F,
 			P,
+			j,
 			S,
-			A,
+			ae,
+			ee,
 			C,
-			w,
+			ie,
+			T,
 			E,
-			D,
-			O,
-			pe,
-			le,
+			fe,
+			V,
 			x,
-			ne,
+			F,
 			I,
 			L,
-			re,
-			ie,
-			ae,
+			R,
+			z,
 			oe,
+			B,
 			se,
 			ce,
+			le,
 			ue,
 			de,
-			fe,
-			K({
+			Y({
 				name: "NeqOp",
 				pattern: /<>/
 			}),
-			K({
+			Y({
 				name: "GteOp",
 				pattern: />=/
 			}),
-			K({
+			Y({
 				name: "LteOp",
 				pattern: /<=/
 			}),
-			R,
-			me,
-			he
+			pe,
+			H,
+			me
 		];
-		this._lexer = new W(ge, { ensureOptimizations: !0 });
-		let _e = {};
-		ge.forEach((e) => {
-			_e[e.name] = e;
-		}), o === a && (_e.ColSeparator = j), this._vocabulary = _e;
-	}
-	tokenize(e, n = !0) {
-		let r = this._lexer.tokenize(e);
-		if (n && r.errors.length > 0) {
-			let n = r.errors[0], i = n.line, a = n.column, o = e.substr(n.offset, n.length || 1), s = o ? `Unexpected character '${o}'` : n.message;
-			throw new t.Parse(s, {
-				line: i,
-				column: a,
-				offset: n.offset,
-				length: n.length
+		this._lexer = new J(U, { ensureOptimizations: !0 });
+		let W = {};
+		U.forEach((e) => {
+			W[e.name] = e;
+		}), a === i && (W.ColSeparator = O), this._vocabulary = W;
+	}
+	tokenize(e, t = !0) {
+		let n = this._lexer.tokenize(e);
+		if (t && n.errors.length > 0) {
+			let t = n.errors[0], r = t.line, i = t.column, a = e.substr(t.offset, t.length || 1), o = a ? `Unexpected character '${a}'` : t.message;
+			throw new T.Parse(o, {
+				line: r,
+				column: i,
+				offset: t.offset,
+				length: t.length
 			});
 		}
-		return r;
+		return n;
 	}
 	getVocabulary() {
 		return this._vocabulary;
@@ -4335,22 +4401,22 @@ var mn = class extends pn {
 	getSeparators() {
 		return this._locale.separators;
 	}
-}, gn = (() => {
+}, Un = (() => {
 	let e = [];
 	for (let t = 65; t <= 90; t++) e.push(t);
 	for (let t = 97; t <= 122; t++) e.push(t);
 	for (let t = 48; t <= 57; t++) e.push(t);
 	return e;
-})().filter((e) => e < 48 || e > 57), _n = (() => {
+})().filter((e) => e < 48 || e > 57), Wn = (() => {
 	let e = [
-		...gn,
+		...Un,
 		95,
 		92
 	];
 	for (let t = 127; t <= 65535; t++) e.push(t);
 	return e;
-})(), vn = /* @__PURE__ */ new WeakMap(), yn = 16384, bn = 1048576;
-function xn(e, t, n) {
+})(), Gn = /* @__PURE__ */ new WeakMap(), Kn = 16384, qn = 1048576;
+function Jn(e, t, n) {
 	let r = 0;
 	for (let i = t; i < n; i++) {
 		let t = e.charCodeAt(i);
@@ -4358,7 +4424,7 @@ function xn(e, t, n) {
 	}
 	return r;
 }
-function Sn(e) {
+function Yn(e) {
 	return (t, n) => {
 		let r = n;
 		t.charCodeAt(r) === 36 && r++;
@@ -4368,7 +4434,7 @@ function Sn(e) {
 			if (!(e >= 65 && e <= 90 || e >= 97 && e <= 122)) break;
 			r++;
 		}
-		if (r - i === 0 || xn(t, i, r) > e) return null;
+		if (r - i === 0 || Jn(t, i, r) > e) return null;
 		if (r < t.length) {
 			let e = t.charCodeAt(r);
 			if (e >= 48 && e <= 57) return null;
@@ -4376,7 +4442,7 @@ function Sn(e) {
 		return [t.substring(n, r)];
 	};
 }
-function Cn(e, t) {
+function Xn(e, t) {
 	return (n, r) => {
 		let i = r;
 		n.charCodeAt(i) === 36 && i++;
@@ -4386,51 +4452,681 @@ function Cn(e, t) {
 			if (!(e >= 65 && e <= 90 || e >= 97 && e <= 122)) break;
 			i++;
 		}
-		if (i - a === 0 || xn(n, a, i) > e) return null;
+		if (i - a === 0 || Jn(n, a, i) > e) return null;
 		i < n.length && n.charCodeAt(i) === 36 && i++;
 		let o = i;
-		if (i >= n.length) return null;
-		let s = n.charCodeAt(i);
-		if (s < 49 || s > 57) return null;
-		for (i++; i < n.length;) {
+		for (; i < n.length;) {
 			let e = n.charCodeAt(i);
 			if (!(e >= 48 && e <= 57)) break;
 			i++;
 		}
-		return parseInt(n.substring(o, i), 10) > t ? null : [n.substring(r, i)];
+		if (i === o) return null;
+		let s = parseInt(n.substring(o, i), 10);
+		return s < 1 || s > t ? null : [n.substring(r, i)];
 	};
 }
-function wn(e, t) {
-	let n = e.charCodeAt(t);
-	if (!(n >= 65 && n <= 90 || n >= 97 && n <= 122 || n === 95 || n >= 127 && n <= 65535)) return null;
-	let r = t + 1;
-	for (; r < e.length;) {
-		let t = e.charCodeAt(r);
-		if (!(t >= 65 && t <= 90 || t >= 97 && t <= 122 || t >= 48 && t <= 57 || t === 95 || t === 46 || t >= 127 && t <= 65535)) break;
-		r++;
-	}
-	if (r >= e.length || e.charCodeAt(r) !== 91) return null;
-	let i = 0;
-	for (; r < e.length;) {
-		let n = e.charCodeAt(r);
-		if (n === 91) i++;
-		else if (n === 93 && (i--, i === 0)) return [e.substring(t, r + 1)];
-		r++;
-	}
-	return null;
-}
-function Tn(e) {
+function Zn(e) {
 	return new RegExp(e.replace(/[.*+?^${}()|[\]\\]/g, "\\$&"));
 }
-function En(e, t) {
-	if (e.charCodeAt(t) !== 91) return null;
-	let n = 0, r = t;
-	for (; r < e.length;) {
-		let i = e.charCodeAt(r);
-		if (i === 91) n++;
-		else if (i === 93 && (n--, n === 0)) return [e.substring(t, r + 1)];
-		r++;
-	}
-	return null;
+var Qn = class {
+	constructor(e = re) {
+		let t = function(e) {
+			let t = [...p];
+			if (e) for (let n of Object.values(e)) {
+				let e = n?.trim();
+				e && !t.some((t) => t.toLowerCase() === e.toLowerCase()) && t.push(e);
+			}
+			return t.sort((e, t) => t.length - e.length), t.map((e) => e.replace(/[.*+?^${}()|[\]\\]/g, "\\$&")).join("|");
+		}(e.specifiers), n = Y({
+			name: "WhiteSpace",
+			pattern: /\s+/,
+			group: J.SKIPPED
+		}), r = Y({
+			name: "TableSpecifier",
+			pattern: RegExp(`\\[#(?:${t})\\]`, "i")
+		}), i = [
+			n,
+			r,
+			Y({
+				name: "BracketedColumn",
+				pattern: /\[(?:'['#[\]]|'(?!['#[\]])|[^'[\]])*\]/,
+				longer_alt: [r]
+			}),
+			Y({
+				name: "BareSpecifier",
+				pattern: RegExp(`#(?:${t})`, "i")
+			}),
+			Y({
+				name: "ColumnSep",
+				pattern: /:/
+			}),
+			Y({
+				name: "ListSep",
+				pattern: new RegExp(e.separators.separatorFunction.replace(/[.*+?^${}()|[\]\\]/g, "\\$&"))
+			})
+		];
+		this._lexer = new J(i, { ensureOptimizations: !0 });
+		let a = {};
+		i.forEach((e) => {
+			a[e.name] = e;
+		}), this._vocabulary = a;
+	}
+	getVocabulary() {
+		return this._vocabulary;
+	}
+	tokenize(e) {
+		return this._lexer.tokenize(e);
+	}
+}, $n = class extends Vn {
+	constructor(e = re) {
+		let t = new Qn(e), n = t.getVocabulary();
+		super(n, {
+			nodeLocationTracking: "none",
+			maxLookahead: 2,
+			skipValidations: !0,
+			recoveryEnabled: !1
+		}), this._lexer = t;
+		let { TableSpecifier: r, BracketedColumn: i, BareSpecifier: a, ColumnSep: o, ListSep: s } = n, c = this;
+		c.RULE("ruleContent", () => {
+			let e = [], t = c.SUBRULE(c.ruleItem);
+			return c.ACTION(() => {
+				t && e.push(t);
+			}), c.MANY(() => {
+				c.CONSUME(s), c.OPTION(() => {
+					let t = c.SUBRULE2(c.ruleItem);
+					c.ACTION(() => {
+						t && e.push(t);
+					});
+				});
+			}), e;
+		}), c.RULE("ruleItem", () => c.OR([{ ALT: () => c.SUBRULE(c.ruleSpecifier) }, { ALT: () => c.SUBRULE(c.ruleColumnOrRange) }])), c.RULE("ruleSpecifier", () => c.OR([{ ALT: () => {
+			let t = c.CONSUME(r);
+			return c.ACTION(() => {
+				let n = y(t.image, e);
+				return n.image = t.image, n;
+			});
+		} }, { ALT: () => {
+			let t = c.CONSUME(a);
+			return c.ACTION(() => {
+				let n = y(t.image, e);
+				return n.image = t.image, n;
+			});
+		} }])), c.RULE("ruleColumnOrRange", () => {
+			let e = c.CONSUME(i), t, n;
+			return c.OPTION(() => {
+				t = c.CONSUME(o), n = c.CONSUME2(i);
+			}), c.ACTION(() => {
+				let r = v(e.image);
+				if (r.image = e.image, !n) return r;
+				let i = v(n.image);
+				i.image = n.image;
+				let a = l(":", r, i, !0);
+				return a.image = t?.image ?? ":", a;
+			});
+		}), c.performSelfAnalysis();
+	}
+	_parseInner(e) {
+		let t = this._lexer.tokenize(e);
+		return t.errors.length > 0 || t.tokens.length === 0 ? [] : (this.input = t.tokens, this.reset(), this.ruleContent() ?? []);
+	}
+	_parseContent(e) {
+		if (!e) return [];
+		let t = e.trim();
+		if (!t) return [];
+		let n = t[0];
+		if (n === "@") {
+			let e = t.slice(1).trim();
+			if (!e) {
+				let e = g("@", null, !0);
+				return e.image = "@", [e];
+			}
+			if (e.charAt(0) === "[") {
+				let t = this._parseInner(e);
+				if (t.length === 1 && t[0].type === "infix") {
+					let e = g("@", t[0], !0);
+					return e.image = "@", [e];
+				}
+			}
+			let n = v(e);
+			n.image = e;
+			let r = g("@", n, !0);
+			return r.image = "@", [r];
+		}
+		if (n !== "[" && n !== "#") {
+			let t = v(e);
+			return t.image = e, [t];
+		}
+		return this._parseInner(t);
+	}
+	parse(e, t, n) {
+		this.reset();
+		let r = () => ({
+			root: _("", []),
+			errors: []
+		});
+		if (!n) return r();
+		let i = 0;
+		if (n.charAt(0) === "[") {
+			let e = n.indexOf("]");
+			e !== -1 && n.charAt(e + 1) === "!" && (i = e + 2);
+		}
+		let a = n.indexOf("[", i);
+		if (a === -1) return r();
+		let o = n.slice(0, a), s = n.slice(a + 1, -1), c = this._parseContent(s);
+		return {
+			root: _(o, c),
+			errors: this.errors.length > 0 ? [...this.errors] : []
+		};
+	}
+}, er = /* @__PURE__ */ new Set([
+	":",
+	".:.",
+	".:",
+	":."
+]), tr = /* @__PURE__ */ new Set([
+	".:.",
+	".:",
+	":."
+]), nr = (e) => {
+	if (!e) return null;
+	if (e.type === b.Cell) {
+		let t = e.value;
+		return t.rowIndex === -(2 ** 53 - 1) ? "col" : t.colIndex === -(2 ** 53 - 1) ? "row" : null;
+	}
+	return Number.isInteger(e.value) ? "row" : null;
+}, rr = (e, t) => {
+	let n = parseInt(e.charCodeAt(0) === 36 ? e.substring(1) : e, 10);
+	return n >= 1 && n <= t;
+}, ir = "A formula must not be empty", ar = (e, t) => `A formula must not be longer than ${t} characters (this one is ${e})`;
+function or(e, t) {
+	let n = e?.[0]?.image;
+	if (!n) {
+		let e = t?.image;
+		return e ? `Expected a value after '${e}'` : "Expected a value";
+	}
+	return `Unexpected '${n}'`;
 }
-export { K as a, q as i, mn as n, W as o, qe as r, hn as t };
+var sr = {
+	...yt,
+	buildNoViableAltMessage: (e) => or(e.actual, e.previous),
+	buildEarlyExitMessage: (e) => or(e.actual, e.previous),
+	buildNotAllInputParsedMessage: (e) => {
+		let t = e.firstRedundant?.image;
+		return t ? `Unexpected '${t}'` : yt.buildNotAllInputParsedMessage(e);
+	},
+	buildMismatchTokenMessage: (e) => {
+		let t = e.actual?.image;
+		return e.expected === X && t ? `Unexpected '${t}'` : yt.buildMismatchTokenMessage(e);
+	}
+}, cr = class extends Vn {
+	constructor(p) {
+		let _ = p?.lexer ?? Hn.shared(p?.lexerOptions), v = _.getVocabulary();
+		super(v, {
+			skipValidations: !0,
+			recoveryEnabled: !0,
+			...p,
+			nodeLocationTracking: "full",
+			errorMessageProvider: sr,
+			maxLookahead: 1
+		}), this._ruleInfixOp = this.RULE("ruleInfixOp", () => {
+			let { PlusOp: e, MinOp: t, MulOp: r, DivOp: i, ExOp: a, ConcatOp: o, GtOp: s, EqOp: c, LtOp: u, NeqOp: d, GteOp: f, LteOp: p } = this._vocab, m = [];
+			return m.push({ node: this.SUBRULE(this._rulePostfixOp) }), this.MANY(() => {
+				let n = this.OR(this._c1 ||= [
+					{ ALT: () => this.CONSUME(e).image },
+					{ ALT: () => this.CONSUME(t).image },
+					{ ALT: () => this.CONSUME(r).image },
+					{ ALT: () => this.CONSUME(i).image },
+					{ ALT: () => this.CONSUME(a).image },
+					{ ALT: () => this.CONSUME(o).image },
+					{ ALT: () => this.CONSUME(s).image },
+					{ ALT: () => this.CONSUME(c).image },
+					{ ALT: () => this.CONSUME(u).image },
+					{ ALT: () => this.CONSUME(d).image },
+					{ ALT: () => this.CONSUME(f).image },
+					{ ALT: () => this.CONSUME(p).image }
+				]), l = {
+					value: n,
+					index: this.getLexerPosition(),
+					isRange: x.includes(n)
+				}, h = this.SUBRULE2(this._rulePostfixOp);
+				m.push({
+					op: l,
+					node: h
+				});
+			}), this.ACTION(() => {
+				let e = m.length - 1, t = n.length;
+				for (let r = 0; e > 0 && r < t; r++) {
+					let t = n[r], i = 1;
+					for (; i < m.length;) {
+						let n = m[i].op;
+						if (t.includes(n.value)) {
+							let t = m[i - 1].node, r = m[i].node, a = l(n.value, t, r, n.isRange);
+							a = this._tag(a, n.index), m[i - 1].node = a, m.splice(i, 1), e--;
+						} else i++;
+					}
+				}
+			}), m[0].node;
+		}), this._rulePlusMinusOp = this.RULE("rulePlusMinusOp", () => {
+			let { PlusOp: e, MinOp: t } = this._vocab;
+			return this.OR([{ ALT: () => this.CONSUME(e) }, { ALT: () => this.CONSUME(t) }]);
+		}), this._rulePostfixOp = this.RULE("rulePostfixOp", () => {
+			let { PercentOp: e } = this._vocab, t = this.SUBRULE(this._rulePrefixOp), n = [];
+			return this.MANY(() => {
+				let t = this.CONSUME(e).image;
+				this.ACTION(() => {
+					n.push([t, this.getLexerPosition()]);
+				});
+			}), this.ACTION(() => {
+				let e = n.length;
+				if (e !== 0) for (let r = 0; r < e; r++) {
+					let e = n[r], i = e[0], a = e[1], o = x.includes(i);
+					t = m(i, t, o), t = this._tag(t, a);
+				}
+			}), t;
+		}), this._rulePrefixOp = this.RULE("rulePrefixOp", () => {
+			let { PlusOp: e, MinOp: t, ImplicitIntersectOp: n } = this._vocab, r = [];
+			this.MANY(() => {
+				let i = this.OR([
+					{ ALT: () => this.CONSUME(e).image },
+					{ ALT: () => this.CONSUME(t).image },
+					{ ALT: () => this.CONSUME(n).image }
+				]);
+				this.ACTION(() => {
+					r.push([i, this.getLexerPosition()]);
+				});
+			});
+			let i = this.SUBRULE(this._ruleRangeOp);
+			return this.ACTION(() => {
+				let e = r.length;
+				if (e !== 0) for (let t = e - 1; t >= 0; t--) {
+					let e = r[t], n = e[0], a = e[1], o = x.includes(n);
+					i = g(n, i, o), i = this._tag(i, a);
+				}
+			}), i;
+		}), this._ruleRangeOp = this.RULE("ruleRangeOp", () => {
+			let { RangeOp: e, RangeTrimFullOp: t, RangeTrimLeadingOp: n, RangeTrimTrailingOp: r, ArrayAnchorOp: i } = this._vocab, a = [];
+			return a.push({ node: this.SUBRULE(this._ruleCallOp) }), this.MANY2(() => {
+				this.CONSUME(i), a.push({ anchor: this.getLexerPosition() });
+			}), this.MANY(() => {
+				let o = {
+					value: this.OR(this._c2 ||= [
+						{ ALT: () => this.CONSUME(e).image },
+						{ ALT: () => this.CONSUME(t).image },
+						{ ALT: () => this.CONSUME(n).image },
+						{ ALT: () => this.CONSUME(r).image }
+					]),
+					index: this.getLexerPosition()
+				}, s = this.SUBRULE2(this._ruleCallOp);
+				a.push({
+					op: o,
+					node: s
+				}), this.MANY3(() => {
+					this.CONSUME2(i), a.push({ anchor: this.getLexerPosition() });
+				});
+			}), this.ACTION(() => {
+				for (let e = 1; e < a.length; e++) {
+					let t = a[e];
+					if (t.anchor !== void 0) {
+						a[0].node = this._tag(m("#", a[0].node, !0), t.anchor);
+						continue;
+					}
+					let n = t.op, r = l(n.value, a[0].node, t.node, !0);
+					r = this._tag(r, n.index), a[0].node = r;
+				}
+			}), a[0].node;
+		}), this._ruleCallOp = this.RULE("ruleCallOp", () => {
+			let { OpenParen: e, CloseParen: t } = this._vocab, n = this.SUBRULE(this._ruleFormula);
+			return this.MANY({
+				GATE: () => {
+					let t = this.LA(0), n = this.LA(1);
+					return !(!t || !n || n.tokenType !== e) && n.startOffset === t.endOffset + 1;
+				},
+				DEF: () => {
+					this.CONSUME(e);
+					let r = this.getLexerPosition(), i = this.SUBRULE(this._ruleFunctionArguments), a = n, o = this.ACTION(() => this._tag(S(a, i), r)), s = this.OPTION(() => this.CONSUME(t));
+					this.ACTION(() => {
+						s || this._reportError(o, "Missing closing parenthesis ')'", r), this._tagClose(o, this.getLexerPosition()), n = o;
+					});
+				}
+			}), n;
+		}), this._ruleIntersectOp = this.RULE("ruleIntersectOp", () => {
+			let e = [this.SUBRULE(this._ruleInfixOp)];
+			return this.MANY(() => {
+				this.OPTION({
+					GATE: () => {
+						let e = this.LA(0);
+						return this.LA(1).startOffset > e.endOffset + 1;
+					},
+					DEF: () => {
+						e.push(this.SUBRULE3(this._ruleInfixOp));
+					}
+				});
+			}), this.ACTION(() => {
+				for (; e.length > 1;) {
+					let t = e.length - 1;
+					for (let n = 0; n < t; n++) {
+						let r = e[n], i = e[n + 1], a = l(" ", r, i, !0), o = this._tokenMap.get(r);
+						o && delete o.tokenIndexClose;
+						let s = this._tokenMap.get(i), c = s?.tokenIndex;
+						if (c !== void 0) {
+							let e = this.input[c], t = this.input[c - 1]?.endOffset ?? -1, n = this._inputText.slice(t + 1, e.startOffset).slice(0, -1);
+							n.length > 0 && (a.wsBefore = n);
+						}
+						s && delete s.tokenIndex, n + 1 < t && s && delete s.tokenIndexClose, e.splice(n, 2, a), n--, t--;
+					}
+				}
+			}), e[0];
+		}), this._ruleFormula = this.RULE("ruleFormula", () => this.OR9([
+			{ ALT: () => this.SUBRULE(this._ruleLiteral) },
+			{ ALT: () => this.SUBRULE(this._ruleReference) },
+			{ ALT: () => this.SUBRULE(this._ruleFunction) },
+			{ ALT: () => this.SUBRULE(this._ruleParen) },
+			{ ALT: () => this.SUBRULE(this._ruleTableReference) },
+			{ ALT: () => this.SUBRULE(this._ruleBracketedString) },
+			{ ALT: () => this.SUBRULE(this._ruleLiteralArray) }
+		])), this._ruleGroup = this.RULE("ruleGroup", () => {
+			let { ArgSeparator: e } = this._vocab, t = [];
+			return this.MANY(() => {
+				this.CONSUME(e);
+				let n = this.SUBRULE2(this._ruleIntersectOp);
+				this.ACTION(() => {
+					t.push(n);
+				});
+			}), t;
+		}), this._ruleParen = this.RULE("ruleParen", () => {
+			let { OpenParen: e, CloseParen: t } = this._vocab;
+			return this._processParen(b.Paren, e, t);
+		}), this._ruleLiteralArray = this.RULE("ruleLiteralArray", () => {
+			let { OpenCurlyParen: e, CloseCurlyParen: n, ColSeparator: r, RowSeparator: i } = this._vocab, a = t();
+			this.CONSUME(e);
+			let o = this.getLexerPosition(), s = this.ACTION(() => this._tag(f(a), o)), c = this.SUBRULE(this._ruleLiteralForArray);
+			this.ACTION(() => {
+				a.value.push(c);
+			}), this.MANY(() => {
+				let e = !1;
+				this.OR([{ ALT: () => {
+					this.CONSUME(r), e = !0;
+				} }, { ALT: () => this.CONSUME(i) }]);
+				let n = this.SUBRULE2(this._ruleLiteralForArray);
+				this.ACTION(() => {
+					e || (a = t(), s.value.push(a)), a.value.push(n);
+				});
+			});
+			let l = this.OPTION(() => this.CONSUME(n));
+			return s = this.ACTION(() => (l || this._reportError(s, "Missing closing parenthesis '}'", o), this._tagClose(s, this.getLexerPosition()))), s;
+		}), this._ruleLiteralForArray = this.RULE("ruleLiteralForArray", () => {
+			let { StringToken: t, BooleanToken: n, LiteralError: r, RefError: o } = this._vocab;
+			return this.OR([
+				{ ALT: () => {
+					let e = this.OPTION(() => this.SUBRULE(this._rulePlusMinusOp)), t = this.SUBRULE(this._ruleNumber), n = this.ACTION(() => this._tag(a(t.image, this._locale), this.getLexerPosition()));
+					return this.ACTION(() => e ? i(e.image, n) : n);
+				} },
+				{ ALT: () => {
+					let e = this.CONSUME(t);
+					return this.ACTION(() => this._tag(s(e.image), this.getLexerPosition()));
+				} },
+				{ ALT: () => {
+					let t = this.CONSUME(n);
+					return this.ACTION(() => this._tag(e(t.image, this._locale), this.getLexerPosition()));
+				} },
+				{ ALT: () => {
+					let e = this.CONSUME(r);
+					return this.ACTION(() => this._tag(ie(e.image, this._locale), this.getLexerPosition()));
+				} },
+				{ ALT: () => {
+					let e = this.CONSUME(o);
+					return this.ACTION(() => this._tag(c(e.image, this._locale), this.getLexerPosition()));
+				} }
+			]);
+		}), this._ruleLiteral = this.RULE("ruleLiteral", () => {
+			let { StringToken: t, BooleanToken: n, LiteralError: r, RefError: i } = this._vocab;
+			return this.OR([
+				{ ALT: () => {
+					let e = this.SUBRULE(this._ruleNumber);
+					return this.ACTION(() => this._tag(a(e.image, this._locale), this.getLexerPosition()));
+				} },
+				{ ALT: () => {
+					let e = this.CONSUME(t);
+					return this.ACTION(() => this._tag(s(e.image), this.getLexerPosition()));
+				} },
+				{ ALT: () => {
+					let t = this.CONSUME(n);
+					return this.ACTION(() => this._tag(e(t.image, this._locale), this.getLexerPosition()));
+				} },
+				{ ALT: () => {
+					let e = this.CONSUME(r);
+					return this.ACTION(() => this._tag(ie(e.image, this._locale), this.getLexerPosition()));
+				} },
+				{ ALT: () => {
+					let e = this.CONSUME(i);
+					return this.ACTION(() => this._tag(c(e.image, this._locale), this.getLexerPosition()));
+				} }
+			]);
+		}), this._ruleFunction = this.RULE("ruleFunction", () => {
+			let { FunctionToken: e, OpenParen: t, CloseParen: n } = this._vocab, r = this.CONSUME(e).image, i = this.getLexerPosition();
+			this.CONSUME(t);
+			let a = this.SUBRULE(this._ruleFunctionArguments), s = this.ACTION(() => this._tag(o(r, a), i)), c = this.OPTION(() => this.CONSUME(n));
+			return s = this.ACTION(() => (c || this._reportError(s, "Missing closing parenthesis ')'", i), this._tagClose(s, this.getLexerPosition()))), s;
+		}), this._ruleFunctionArguments = this.RULE("ruleFunctionArguments", () => {
+			let { ArgSeparator: e, CloseParen: t } = this._vocab, n = [];
+			return this.OPTION({
+				GATE: () => this.LA(1).tokenType !== t,
+				DEF: () => {
+					let t;
+					this.OPTION2(() => {
+						t = this.SUBRULE(this._ruleIntersectOp);
+					}), t = this.ACTION(() => t ?? this._tagClose(r(), this.getLexerPosition())), n.push(t), this.MANY(() => {
+						let t;
+						this.CONSUME(e), this.OPTION3(() => {
+							t = this.SUBRULE2(this._ruleIntersectOp);
+						}), t = this.ACTION(() => t ?? this._tagClose(r(), this.getLexerPosition())), n.push(t);
+					});
+				}
+			}), n;
+		}), this._ruleBracketedString = this.RULE("ruleBracketedString", () => {
+			let { BracketedString: e } = this._vocab, t = this.CONSUME(e), n = this.getLexerPosition();
+			return this.ACTION(() => {
+				let e = this._srParser.parse(this.rowIndex, this.colIndex, t.image);
+				for (let t of e.errors) this._astErrors.push(t);
+				return this._tag(e.root, n);
+			});
+		}), this._ruleTableReference = this.RULE("ruleTableReference", () => {
+			let { TableReference: e } = this._vocab, t = this.CONSUME(e), n = this.getLexerPosition();
+			return this.ACTION(() => {
+				let e = this._srParser.parse(this.rowIndex, this.colIndex, t.image);
+				for (let t of e.errors) this._astErrors.push(t);
+				return this._tag(e.root, n);
+			});
+		}), this._ruleReference = this.RULE("ruleReference", () => {
+			let { Sheet: e, SheetQuoted: t, DivOp: n, MulOp: r, PlusOp: i, MinOp: a, ArgSeparator: o, Cell: s, NamedToken: l, SingleQuotedString: f, Column: p, AbsRow: m, DigitToken: g, RefError: _ } = this._vocab, v, y;
+			this.OPTION2({
+				GATE: () => {
+					for (let s = 1; s < 6; s++) {
+						let c = this.LA(s);
+						if (c.tokenType === e || c.tokenType === t) return !0;
+						if (c.image === "" || c.image === ")" || c.tokenType === n || c.tokenType === r || c.tokenType === i || c.tokenType === a || c.tokenType === o) break;
+					}
+					return !1;
+				},
+				DEF: () => {
+					y = this.getLexerPosition() + 1, v = this.SUBRULE(this._rulePrefixSheetName);
+				}
+			});
+			let x = this.OR([
+				{ ALT: () => {
+					let e = this.CONSUME(s), t = this.getLexerPosition();
+					return this.ACTION(() => this._tag(u(e.image, this.rowIndex, this.colIndex), t));
+				} },
+				{ ALT: () => {
+					let e = this.OR2([{ ALT: () => this.CONSUME(l) }, { ALT: () => this.CONSUME(f) }]);
+					return this.ACTION(() => this._tag(h(e.image), this.getLexerPosition()));
+				} },
+				{ ALT: () => this.SUBRULE(this._ruleBracketedString) },
+				{ ALT: () => this.SUBRULE(this._ruleFunction) },
+				{ ALT: () => {
+					let e = this.CONSUME(p);
+					return this.ACTION(() => this._tag(d(e.image, this.colIndex), this.getLexerPosition()));
+				} },
+				{ ALT: () => {
+					let e = this.CONSUME(m);
+					return this.ACTION(() => this._tag(w(e.image, this.rowIndex), this.getLexerPosition()));
+				} },
+				{ ALT: () => {
+					let e = this.CONSUME(g);
+					return this.ACTION(() => this._tag(w(e.image, this.rowIndex), this.getLexerPosition()));
+				} },
+				{ ALT: () => {
+					let e = this.CONSUME(_);
+					return this.ACTION(() => this._tag(c(e.image, this._locale), this.getLexerPosition()));
+				} }
+			]);
+			return this.ACTION(() => {
+				if (v && x) {
+					if (v.name === "") return void this._reportError(x, `'${v.image}' is not a valid sheet reference — a '!' needs a sheet name before it`);
+					let e = x;
+					if (x.type === b.Postfix && x.inputs?.[0] && (e = x.inputs[0]), e.type === b.Cell || e.type === b.Named || e.type === b.Row || e.type === b.TableColumn || e.type === b.Error) {
+						e.value.scope = v.name, e.value.scopeImage = v.image;
+						let t = this._tokenMap.get(e);
+						t && y !== void 0 && (t.tokenIndex = y);
+					}
+				}
+			}), x;
+		}), this._rulePrefixSheetName = this.RULE("rulePrefixSheetName", () => {
+			let { SheetQuoted: e, BracketedString: t, NamedToken: n, RangeOp: r, Sheet: i } = this._vocab;
+			return this.OR([{ ALT: () => {
+				let t = this.CONSUME(e).image;
+				return {
+					name: t.slice(1, -2).replace(/''/g, "'"),
+					image: t
+				};
+			} }, { ALT: () => {
+				let e = "";
+				this.OPTION(() => {
+					e += this.CONSUME(t).image;
+				}), this.OPTION2({
+					GATE: () => this.LA(2).tokenType === r,
+					DEF: () => {
+						e += this.CONSUME(n).image, this.CONSUME(r), e += ":";
+					}
+				});
+				let a = this.CONSUME(i).image;
+				return {
+					name: e + a.slice(0, -1),
+					image: e + a
+				};
+			} }]);
+		}), this._ruleNumber = this.RULE("ruleNumber", () => {
+			let { NumberToken: e, ScientificDigit: t, DigitToken: n } = this._vocab;
+			return this.OR([
+				{ ALT: () => this.CONSUME(e) },
+				{ ALT: () => this.CONSUME(t) },
+				{ ALT: () => this.CONSUME(n) }
+			]);
+		}), this._ruleRoot = this.RULE("ruleRoot", () => {
+			let { ArgSeparator: e } = this._vocab, t = this.SUBRULE(this._ruleIntersectOp), n = [];
+			return this.MANY(() => {
+				this.CONSUME(e), n.push(this.SUBRULE2(this._ruleIntersectOp));
+			}), this.ACTION(() => n.length === 0 ? t : {
+				type: b.List,
+				value: ",",
+				inputs: [t, ...n],
+				isReference: !0
+			});
+		}), this._lexer = _, this._locale = _.getLocale(), this._vocab = v, this._srParser = p?.srParser ?? new $n(this._locale), this.performSelfAnalysis();
+	}
+	getLexer() {
+		return this._lexer;
+	}
+	parse(e, t, n) {
+		let r = this._lexer.tokenize(n), i;
+		if (!r) return {
+			root: {
+				type: b.Unparsed,
+				value: n
+			},
+			errors: []
+		};
+		let a = r.tokens;
+		if (a.length === 0) throw new T.Parse(ir);
+		return this.input = a, this._inputText = n, this._inputTextLength = n.length, this.rowIndex = e, this.colIndex = t, this._astErrors = [], this._tokenMap = /* @__PURE__ */ new Map(), this.reset(), i = this._ruleRoot(), i && this._bindAllWhitespace(i), i = C(i, (t, n) => {
+			let r = t.type, i = n?.isReference ? n.value : void 0, a = typeof i == "string" && er.has(i), o = typeof i == "string" && tr.has(i), s = a ? n.inputs : void 0, c = s ? s[0] === t ? s[1] : s[0] : void 0, l = this._lexer.getMaxRow();
+			if (a && r !== b.Cell && Number.isInteger(t.value)) {
+				let n = w(t.image, e);
+				return ee(n, t), nr(c) === "row" ? rr(t.image, l) || this._reportError(n, `'${t.image}' is not a valid row — rows run from 1 to ${l}`) : this._reportError(n, `'${t.image}' is not a valid reference — a whole row can only pair with another row (as in ${t.image}:${t.image})`), n;
+			}
+			if (o && r === b.Named) return this._reportError(t, `'${t.image ?? t.value?.nameId}' is a name — '${i}' needs a cell or range on both sides`), t;
+			if (r === b.Cell) {
+				let e = t.value, n = e.colIndex === -(2 ** 53 - 1), r = e.rowIndex === -(2 ** 53 - 1);
+				if ((n || r) && nr(c) === (n ? "row" : "col")) return n && !rr(t.image, l) && this._reportError(t, `'${t.image}' is not a valid row — rows run from 1 to ${l}`), t;
+				if (n || r || e.colIndex >= 16384) {
+					let a = h(t.image);
+					ee(a, t);
+					let s = e.scope;
+					return s && (a.value.scope = s, a.value.scopeImage = e.scopeImage), n ? this._reportError(a, `'${t.image}' is not a valid reference — a row needs a column (use ${t.image}:${t.image} for the whole row)`) : r && t.image.includes("$") ? this._reportError(a, `'${t.image}' is not a valid reference — a whole column can only pair with another column (as in ${t.image}:${t.image})`) : o && this._reportError(a, `'${t.image}' is a name — '${i}' needs a cell or range on both sides`), a;
+				}
+			}
+			return t;
+		}), {
+			root: i,
+			errors: [...this.errors, ...this._astErrors]
+		};
+	}
+	_processParen(e, t, n) {
+		let r;
+		this.CONSUME(t);
+		let i = this.getLexerPosition();
+		r = this.ACTION(() => (r = {
+			type: e,
+			value: null,
+			inputs: null
+		}, this._tag(r, i)));
+		let a = [], o = this.SUBRULE(this._ruleIntersectOp);
+		o && a.push(o);
+		let s = this.SUBRULE(this._ruleGroup), c = this.OPTION(() => this.CONSUME(n));
+		return r = this.ACTION(() => {
+			if (s) for (let e = 0; e < s.length; e++) a.push(s[e]);
+			return r && (c || this._reportError(r, "Missing closing parenthesis", i), r.inputs = a), this._tagClose(r, this.getLexerPosition());
+		}), r;
+	}
+	_reportError(e, t, n = void 0, r = "SyntaxError") {
+		n === void 0 && (n = this.getLexerPosition()), e.error = !0, this._astErrors.push({
+			name: r,
+			message: t,
+			previousToken: this.input[n],
+			ast: e
+		});
+	}
+	_tag(e, t) {
+		return e ? (e.image ??= this.input[t].image, this._tokenMap.set(e, {
+			tokenIndex: t,
+			tokenIndexClose: t
+		}), e) : (console.warn("node is null"), e);
+	}
+	_tagClose(e, t) {
+		let n = this._tokenMap.get(e);
+		return n ? n.tokenIndexClose = t : this._tokenMap.set(e, { tokenIndexClose: t }), e;
+	}
+	_bindNodeWhitespace(e) {
+		let t = this._tokenMap.get(e);
+		if (!t) return;
+		let n = this.input, r = this._inputText, i = t.tokenIndex;
+		if (i !== void 0) {
+			let t = n[i], a = n[i - 1]?.endOffset ?? -1;
+			a + 1 < t.startOffset && (e.wsBefore = r.slice(a + 1, t.startOffset));
+		}
+		let a = t.tokenIndexClose;
+		if (a !== void 0) {
+			let t = n[a], i = n[a + 1]?.startOffset ?? this._inputTextLength;
+			t.endOffset + 1 < i && (e.wsAfter = r.slice(t.endOffset + 1, i));
+		}
+	}
+	_bindAllWhitespace(e) {
+		if (e) {
+			if (this._bindNodeWhitespace(e), e.inputs) for (let t of e.inputs) t && this._bindAllWhitespace(t);
+			if (e.type === b.Array && Array.isArray(e.value)) {
+				for (let t of e.value) if (t && Array.isArray(t.value)) for (let e of t.value) e && this._bindAllWhitespace(e);
+			}
+		}
+	}
+};
+export { Hn as i, ar as n, cr as r, ir as t };