@antdv-next/x 1.2.1-beta.1 → 1.2.2

package/es/{chunk-XZSTWKYB-DYKLwCEy.js → chunk-XZSTWKYB-kjAdbx6i.js}

@@ -1,9 +1,9 @@
-import { a as e, i as t, n, o as r, r as i, t as a } from "./rolldown-runtime-CEY2VRuR.js";
+import { a as e, i as t, n, o as r, r as i, t as a } from "./rolldown-runtime-Dv1pqm0U.js";
 import { B as o, C as s, E as c, H as l, O as u, R as d, S as f, U as p, V as m, _ as h, j as g, k as _, t as v, v as y, w as ee, x as b, z as x } from "./isArrayLikeObject-Dqk_yOP-.js";
-import { D as S, M as C, O as te, S as w, _ as ne, a as T, b as re, f as E, g as ie, i as D, j as O, k as ae, l as oe, n as k, o as A, r as j, s as M, t as se, u as N, v as ce, x as le } from "./_baseUniq-B-qU_Imh.js";
-import { a as ue, d as de, f as fe, l as pe, n as me, o as P, p as he, s as F, t as ge, u as _e } from "./_basePickBy-CrbncDqR.js";
-import { t as I } from "./clone-yzFtXY5G.js";
-import { o as L } from "./mermaid.core-BVGVwWcu.js";
+import { D as S, M as C, O as te, S as w, _ as ne, a as T, b as re, f as E, g as ie, i as D, j as O, k as ae, l as oe, n as k, o as A, r as j, s as M, t as se, u as N, v as ce, x as le } from "./_baseUniq-CyFYmJd-.js";
+import { a as ue, d as de, f as fe, l as pe, n as me, o as P, p as he, s as F, t as ge, u as _e } from "./_basePickBy-BL4DHvHb.js";
+import { t as I } from "./isEmpty-BJdINx-6.js";
+import { t as L } from "./clone-DIGEZsKS.js";
 //#region ../../node_modules/.pnpm/langium@4.2.1/node_modules/langium/lib/syntax-tree.js
 function R(e) {
 	return typeof e == "object" && !!e && typeof e.$type == "string";
@@ -1601,7 +1601,9 @@ var Hn = [
 			case "u":
 				In(n, "unicode");
 				break;
-			case "y": In(n, "sticky");
+			case "y":
+				In(n, "sticky");
+				break;
 		}
 		if (this.idx !== this.input.length) throw Error("Redundant input: " + this.input.substring(this.idx));
 		return {
@@ -1666,12 +1668,14 @@ var Hn = [
 					case "!":
 						t = "NegativeLookahead";
 						break;
-					case "<": switch (this.popChar()) {
-						case "=":
-							t = "Lookbehind";
-							break;
-						case "!": t = "NegativeLookbehind";
-					}
+					case "<":
+						switch (this.popChar()) {
+							case "=":
+								t = "Lookbehind";
+								break;
+							case "!": t = "NegativeLookbehind";
+						}
+						break;
 				}
 				Ln(t);
 				let n = this.disjunction();
@@ -1723,9 +1727,11 @@ var Hn = [
 							atLeast: n,
 							atMost: Infinity
 						}, this.consumeChar("}");
+						break;
 				}
 				if (e === !0 && t === void 0) return;
 				Ln(t);
+				break;
 		}
 		if ((e !== !0 || t !== void 0) && Ln(t)) return this.peekChar(0) === "?" ? (this.consumeChar("?"), t.greedy = !1) : t.greedy = !0, t.type = "Quantifier", t.loc = this.loc(n), t;
 	}
@@ -1741,7 +1747,9 @@ var Hn = [
 			case "[":
 				e = this.characterClass();
 				break;
-			case "(": e = this.group();
+			case "(":
+				e = this.group();
+				break;
 		}
 		// istanbul ignore next
 		return e === void 0 && this.isPatternCharacter() && (e = this.patternCharacter()), Ln(e) ? (e.loc = this.loc(t), this.isQuantifier() && (e.quantifier = this.quantifier()), e) : Rn();
@@ -1811,7 +1819,9 @@ var Hn = [
 			case "w":
 				e = Vn;
 				break;
-			case "W": e = Vn, t = !0;
+			case "W":
+				e = Vn, t = !0;
+				break;
 		}
 		// istanbul ignore next
 		return Ln(e) ? {
@@ -1835,7 +1845,9 @@ var Hn = [
 			case "t":
 				e = V("	");
 				break;
-			case "v": e = V("\v");
+			case "v":
+				e = V("\v");
+				break;
 		}
 		// istanbul ignore next
 		return Ln(e) ? {
@@ -1958,7 +1970,9 @@ var Hn = [
 			case "?":
 				this.consumeChar("?"), this.consumeChar(":"), e = !1;
 				break;
-			default: this.groupIdx++;
+			default:
+				this.groupIdx++;
+				break;
 		}
 		let t = this.disjunction();
 		this.consumeChar(")");
@@ -2196,7 +2210,9 @@ var Hn = [
 			case "GroupBackReference":
 				this.visitGroupBackReference(e);
 				break;
-			case "Quantifier": this.visitQuantifier(e);
+			case "Quantifier":
+				this.visitQuantifier(e);
+				break;
 		}
 		this.visitChildren(e);
 	}
@@ -2302,7 +2318,9 @@ function nr(e) {
 					case "k":
 						s(n.indexOf(">", r) - r + 1);
 						break;
-					default: s(2);
+					default:
+						s(2);
+						break;
 				}
 				break;
 			case "[":
@@ -2330,18 +2348,24 @@ function nr(e) {
 					case "!":
 						a = r, r += 3, i(), e += n.substr(a, r - a);
 						break;
-					case "<": switch (n[r + 3]) {
-						case "=":
-						case "!":
-							a = r, r += 4, i(), e += n.substr(a, r - a);
-							break;
-						default: o(n.indexOf(">", r) - r + 1), e += i() + "|$)";
-					}
+					case "<":
+						switch (n[r + 3]) {
+							case "=":
+							case "!":
+								a = r, r += 4, i(), e += n.substr(a, r - a);
+								break;
+							default:
+								o(n.indexOf(">", r) - r + 1), e += i() + "|$)";
+								break;
+						}
+						break;
 				}
 				else o(1), e += i() + "|$)";
 				break;
 			case ")": return ++r, e;
-			default: s(1);
+			default:
+				s(1);
+				break;
 		}
 		return e;
 	}
@@ -2493,10 +2517,9 @@ function Tr(e, t) {
 			lookahead: e.lookahead,
 			parenthesized: e.parenthesized
 		});
-	}
-	if (Pt(e)) return kr(e);
-	if (_n(e)) return Or(e);
-	if (Gt(e)) {
+	} else if (Pt(e)) return kr(e);
+	else if (_n(e)) return Or(e);
+	else if (Gt(e)) {
 		let n = e.regex.lastIndexOf("/"), r = e.regex.substring(1, n), i = e.regex.substring(n + 1);
 		return t && (t.i = i.includes("i"), t.s = i.includes("s"), t.u = i.includes("u")), Mr(r, {
 			cardinality: e.cardinality,
@@ -2504,13 +2527,12 @@ function Tr(e, t) {
 			parenthesized: e.parenthesized,
 			wrap: !1
 		});
-	}
-	if (bn(e)) return Mr(wr, {
+	} else if (bn(e)) return Mr(wr, {
 		cardinality: e.cardinality,
 		lookahead: e.lookahead,
 		parenthesized: e.parenthesized
 	});
-	throw Error(`Invalid terminal element: ${e?.$type}, ${e?.$cstNode?.text}`);
+	else throw Error(`Invalid terminal element: ${e?.$type}, ${e?.$cstNode?.text}`);
 }
 function Er(e) {
 	return Mr(e.elements.map((e) => Tr(e)).join("|"), {
@@ -2890,44 +2912,43 @@ function ji(e) {
 			idx: e.idx
 		};
 		return ue(e.label) && (t.label = e.label), t;
-	}
-	if (e instanceof wi) return {
+	} else if (e instanceof wi) return {
 		type: "Alternative",
 		definition: t(e.definition)
 	};
-	if (e instanceof Ti) return {
+	else if (e instanceof Ti) return {
 		type: "Option",
 		idx: e.idx,
 		definition: t(e.definition)
 	};
-	if (e instanceof Ei) return {
+	else if (e instanceof Ei) return {
 		type: "RepetitionMandatory",
 		idx: e.idx,
 		definition: t(e.definition)
 	};
-	if (e instanceof Di) return {
+	else if (e instanceof Di) return {
 		type: "RepetitionMandatoryWithSeparator",
 		idx: e.idx,
 		separator: ji(new U({ terminalType: e.separator })),
 		definition: t(e.definition)
 	};
-	if (e instanceof Oi) return {
+	else if (e instanceof Oi) return {
 		type: "RepetitionWithSeparator",
 		idx: e.idx,
 		separator: ji(new U({ terminalType: e.separator })),
 		definition: t(e.definition)
 	};
-	if (e instanceof H) return {
+	else if (e instanceof H) return {
 		type: "Repetition",
 		idx: e.idx,
 		definition: t(e.definition)
 	};
-	if (e instanceof ki) return {
+	else if (e instanceof ki) return {
 		type: "Alternation",
 		idx: e.idx,
 		definition: t(e.definition)
 	};
-	if (e instanceof U) {
+	else if (e instanceof U) {
 		let t = {
 			type: "Terminal",
 			name: e.terminalType.name,
@@ -2937,14 +2958,13 @@ function ji(e) {
 		ue(e.label) && (t.terminalLabel = e.label);
 		let n = e.terminalType.PATTERN;
 		return e.terminalType.PATTERN && (t.pattern = oi(n) ? n.source : n), t;
-	}
-	if (e instanceof Ci) return {
+	} else if (e instanceof Ci) return {
 		type: "Rule",
 		name: e.name,
 		orgText: e.orgText,
 		definition: t(e.definition)
 	};
-	throw Error("non exhaustive match");
+	else throw Error("non exhaustive match");
 }
 //#endregion
 //#region ../../node_modules/.pnpm/@chevrotain+gast@11.1.2/node_modules/@chevrotain/gast/lib/src/visitor.js
@@ -2993,7 +3013,7 @@ function Ni(e) {
 	return e instanceof wi || e instanceof Ti || e instanceof H || e instanceof Ei || e instanceof Di || e instanceof Oi || e instanceof U || e instanceof Ci;
 }
 function Pi(e, t = []) {
-	return e instanceof Ti || e instanceof H || e instanceof Oi ? !0 : e instanceof ki ? fi(e.definition, (e) => Pi(e, t)) : e instanceof Si && ei(t, e) ? !1 : e instanceof xi && (e instanceof Si && t.push(e), Jr(e.definition, (e) => Pi(e, t)));
+	return e instanceof Ti || e instanceof H || e instanceof Oi ? !0 : e instanceof ki ? fi(e.definition, (e) => Pi(e, t)) : e instanceof Si && ei(t, e) ? !1 : e instanceof xi ? (e instanceof Si && t.push(e), Jr(e.definition, (e) => Pi(e, t))) : !1;
 }
 function Fi(e) {
 	return e instanceof ki;
@@ -3082,8 +3102,7 @@ function Bi(e) {
 	return pi(t);
 }
 function Vi(e) {
-	let t = F(e.definition, (e) => zi(e));
-	return pi(fe(t));
+	return pi(fe(F(e.definition, (e) => zi(e))));
 }
 function Hi(e) {
 	return [e.terminalType];
@@ -3268,8 +3287,7 @@ function oa(e, t) {
 	if (t instanceof RegExp) {
 		let n = Yi(t), r = new aa(e);
 		return r.visit(n), r.found;
-	}
-	return pe(t, (t) => ei(e, t.charCodeAt(0))) !== void 0;
+	} else return pe(t, (t) => ei(e, t.charCodeAt(0))) !== void 0;
 }
 //#endregion
 //#region ../../node_modules/.pnpm/chevrotain@11.1.2/node_modules/chevrotain/lib/src/scan/lexer.js
@@ -3315,17 +3333,15 @@ function la(e, t) {
 					"w",
 					"W"
 				], e[1]) ? e[1] : Da(t);
-			}
-			if (d(t)) return i = !0, { exec: t };
-			if (typeof t == "object") return i = !0, t;
-			if (typeof t == "string") {
+			} else if (d(t)) return i = !0, { exec: t };
+			else if (typeof t == "object") return i = !0, t;
+			else if (typeof t == "string") {
 				if (t.length === 1) return t;
 				{
 					let e = t.replace(/[\\^$.*+?()[\]{}|]/g, "\\$&");
 					return Da(new RegExp(e));
 				}
-			}
-			throw Error("non exhaustive match");
+			} else throw Error("non exhaustive match");
 		});
 	});
 	let o, s, c, l, u;
@@ -3381,7 +3397,7 @@ function la(e, t) {
 	For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNICODE_OPTIMIZE`);
 			else {
 				let i = $i(n.PATTERN, t.ensureOptimizations);
-				L(i) && (v = !1), M(i, (t) => {
+				I(i) && (v = !1), M(i, (t) => {
 					La(e, t, _[r]);
 				});
 			}
@@ -3442,7 +3458,7 @@ function ha(e) {
 			this.found = !0;
 		}
 	}
-	let n = T(e, (e) => {
+	return F(T(e, (e) => {
 		let n = e.PATTERN;
 		try {
 			let e = Yi(n), r = new t();
@@ -3451,16 +3467,14 @@ function ha(e) {
 			/* istanbul ignore next - cannot ensure an error in regexp-to-ast*/
 			return ma.test(n.source);
 		}
-	});
-	return F(n, (e) => ({
+	}), (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: W.EOI_ANCHOR_FOUND,
 		tokenTypes: [e]
 	}));
 }
 function ga(e) {
-	let t = T(e, (e) => e.PATTERN.test(""));
-	return F(t, (e) => ({
+	return F(T(e, (e) => e.PATTERN.test("")), (e) => ({
 		message: "Token Type: ->" + e.name + "<- static 'PATTERN' must not match an empty string",
 		type: W.EMPTY_MATCH_PATTERN,
 		tokenTypes: [e]
@@ -3476,7 +3490,7 @@ function va(e) {
 			this.found = !0;
 		}
 	}
-	let n = T(e, (e) => {
+	return F(T(e, (e) => {
 		let n = e.PATTERN;
 		try {
 			let e = Yi(n), r = new t();
@@ -3485,19 +3499,17 @@ function va(e) {
 			/* istanbul ignore next - cannot ensure an error in regexp-to-ast*/
 			return _a.test(n.source);
 		}
-	});
-	return F(n, (e) => ({
+	}), (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: W.SOI_ANCHOR_FOUND,
 		tokenTypes: [e]
 	}));
 }
 function ya(e) {
-	let t = T(e, (e) => {
+	return F(T(e, (e) => {
 		let t = e[sa];
 		return t instanceof RegExp && (t.multiline || t.global);
-	});
-	return F(t, (e) => ({
+	}), (e) => ({
 		message: "Token Type: ->" + e.name + "<- static 'PATTERN' may NOT contain global('g') or multiline('m')",
 		type: W.UNSUPPORTED_FLAGS_FOUND,
 		tokenTypes: [e]
@@ -3505,9 +3517,7 @@ function ya(e) {
 }
 function ba(e) {
 	let t = [], n = F(e, (n) => k(e, (e, r) => n.PATTERN.source === r.PATTERN.source && !ei(t, r) && r.PATTERN !== io.NA ? (t.push(r), e.push(r), e) : e, []));
-	n = Lr(n);
-	let r = T(n, (e) => e.length > 1);
-	return F(r, (e) => {
+	return n = Lr(n), F(T(n, (e) => e.length > 1), (e) => {
 		let t = F(e, (e) => e.name);
 		return {
 			message: `The same RegExp pattern ->${Yr(e).PATTERN}<-has been used in all of the following Token Types: ${t.join(", ")} <-`,
@@ -3517,20 +3527,18 @@ function ba(e) {
 	});
 }
 function xa(e) {
-	let t = T(e, (e) => {
+	return F(T(e, (e) => {
 		if (!P(e, "GROUP")) return !1;
 		let t = e.GROUP;
 		return t !== io.SKIPPED && t !== io.NA && !ue(t);
-	});
-	return F(t, (e) => ({
+	}), (e) => ({
 		message: "Token Type: ->" + e.name + "<- static 'GROUP' can only be Lexer.SKIPPED/Lexer.NA/A String",
 		type: W.INVALID_GROUP_TYPE_FOUND,
 		tokenTypes: [e]
 	}));
 }
 function Sa(e, t) {
-	let n = T(e, (e) => e.PUSH_MODE !== void 0 && !ei(t, e.PUSH_MODE));
-	return F(n, (e) => ({
+	return F(T(e, (e) => e.PUSH_MODE !== void 0 && !ei(t, e.PUSH_MODE)), (e) => ({
 		message: `Token Type: ->${e.name}<- static 'PUSH_MODE' value cannot refer to a Lexer Mode ->${e.PUSH_MODE}<-which does not exist`,
 		type: W.PUSH_MODE_DOES_NOT_EXIST,
 		tokenTypes: [e]
@@ -3567,11 +3575,10 @@ function wa(e, t) {
 		if (Ea(t)) return !1;
 		let n = t.exec(e);
 		return n !== null && n.index === 0;
-	}
-	if (d(t)) return t(e, 0, [], {});
-	if (P(t, "exec")) return t.exec(e, 0, [], {});
-	if (typeof t == "string") return t === e;
-	throw Error("non exhaustive match");
+	} else if (d(t)) return t(e, 0, [], {});
+	else if (P(t, "exec")) return t.exec(e, 0, [], {});
+	else if (typeof t == "string") return t === e;
+	else throw Error("non exhaustive match");
 }
 function Ta(e) {
 	return pe([
@@ -3610,19 +3617,15 @@ function Oa(e, t, n) {
 		type: W.MULTI_MODE_LEXER_DEFAULT_MODE_VALUE_DOES_NOT_EXIST
 	}), P(e, "modes") && M(e.modes, (e, t) => {
 		M(e, (n, i) => {
-			if (j(n)) r.push({
+			j(n) ? r.push({
 				message: `A Lexer cannot be initialized using an undefined Token Type. Mode:<${t}> at index: <${i}>\n`,
 				type: W.LEXER_DEFINITION_CANNOT_CONTAIN_UNDEFINED
-			});
-			else if (P(n, "LONGER_ALT")) {
-				let i = m(n.LONGER_ALT) ? n.LONGER_ALT : [n.LONGER_ALT];
-				M(i, (i) => {
-					!j(i) && !ei(e, i) && r.push({
-						message: `A MultiMode Lexer cannot be initialized with a longer_alt <${i.name}> on token <${n.name}> outside of mode <${t}>\n`,
-						type: W.MULTI_MODE_LEXER_LONGER_ALT_NOT_IN_CURRENT_MODE
-					});
+			}) : P(n, "LONGER_ALT") && M(m(n.LONGER_ALT) ? n.LONGER_ALT : [n.LONGER_ALT], (i) => {
+				!j(i) && !ei(e, i) && r.push({
+					message: `A MultiMode Lexer cannot be initialized with a longer_alt <${i.name}> on token <${n.name}> outside of mode <${t}>\n`,
+					type: W.MULTI_MODE_LEXER_LONGER_ALT_NOT_IN_CURRENT_MODE
 				});
-			}
+			});
 		});
 	}), r;
 }
@@ -3644,8 +3647,8 @@ function ka(e, t, n) {
 	}), r;
 }
 function Aa(e) {
-	let t = {}, n = S(e);
-	return M(n, (n) => {
+	let t = {};
+	return M(S(e), (n) => {
 		let r = e[n];
 		/* istanbul ignore else */
 		if (m(r)) t[n] = [];
@@ -3669,7 +3672,7 @@ var Na = {
 		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 this.lastIndex = e.charCodeAt(n + 1) === 10 ? n + 2 : n + 1, !0;
+			if (t === 13) return e.charCodeAt(n + 1) === 10 ? this.lastIndex = n + 2 : this.lastIndex = n + 1, !0;
 		}
 		return !1;
 	},
@@ -3688,10 +3691,9 @@ function Pa(e, t) {
 			};
 		}
 		return !1;
-	}
-	if (ue(e.PATTERN)) return !1;
-	if (ja(e)) return { issue: W.CUSTOM_LINE_BREAK };
-	throw Error("non exhaustive match");
+	} else if (ue(e.PATTERN)) return !1;
+	else if (ja(e)) return { issue: W.CUSTOM_LINE_BREAK };
+	else throw Error("non exhaustive match");
 }
 function Fa(e, t) {
 	/* istanbul ignore else */
@@ -3712,7 +3714,7 @@ function za(e) {
 	return e < 256 ? e : Ra[e];
 }
 function Ba() {
-	if (L(Ra)) {
+	if (I(Ra)) {
 		Ra = Array(65536);
 		for (let e = 0; e < 65536; e++) Ra[e] = e > 255 ? 255 + ~~(e / 255) : e;
 	}
@@ -3734,11 +3736,11 @@ function Ga(e) {
 	});
 }
 function Ka(e) {
-	let t = I(e), n = e, r = !0;
+	let t = L(e), n = e, r = !0;
 	for (; r;) {
 		n = Lr(fe(F(n, (e) => e.CATEGORIES)));
 		let e = Ur(n, t);
-		t = t.concat(e), L(e) ? r = !1 : n = e;
+		t = t.concat(e), I(e) ? r = !1 : n = e;
 	}
 	return t;
 }
@@ -3817,8 +3819,7 @@ var io = class {
 				this.traceInitIndent < this.traceInitMaxIdent && console.log(`${n}--> <${e}>`);
 				let { time: r, value: i } = _i(t), a = r > 10 ? console.warn : console.log;
 				return this.traceInitIndent < this.traceInitMaxIdent && a(`${n}<-- <${e}> time: ${r}ms`), this.traceInitIndent--, i;
-			}
-			return t();
+			} else 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 = Fr({}, ro, t);
 		let n = this.config.traceInitPerf;
@@ -3829,9 +3830,9 @@ var io = class {
 				else if (this.config.lineTerminatorCharacters === ro.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), m(e) ? n = {
-					modes: { defaultMode: I(e) },
+					modes: { defaultMode: L(e) },
 					defaultMode: ca
-				} : (r = !1, n = I(e));
+				} : (r = !1, n = L(e));
 			}), this.config.skipValidations === !1 && (this.TRACE_INIT("performRuntimeChecks", () => {
 				this.lexerDefinitionErrors = this.lexerDefinitionErrors.concat(Oa(n, this.trackStartLines, this.config.lineTerminatorCharacters));
 			}), this.TRACE_INIT("performWarningRuntimeChecks", () => {
@@ -3844,7 +3845,7 @@ var io = class {
 				this.TRACE_INIT(`Mode: <${n}> processing`, () => {
 					if (this.modes.push(n), this.config.skipValidations === !1 && this.TRACE_INIT("validatePatterns", () => {
 						this.lexerDefinitionErrors = this.lexerDefinitionErrors.concat(ua(e, i));
-					}), L(this.lexerDefinitionErrors)) {
+					}), I(this.lexerDefinitionErrors)) {
 						Ga(e);
 						let r;
 						this.TRACE_INIT("analyzeTokenTypes", () => {
@@ -3858,7 +3859,7 @@ var io = class {
 						}), this.patternIdxToConfig[n] = r.patternIdxToConfig, this.charCodeToPatternIdxToConfig[n] = r.charCodeToPatternIdxToConfig, this.emptyGroups = Fr({}, this.emptyGroups, r.emptyGroups), this.hasCustom = r.hasCustom || this.hasCustom, this.canModeBeOptimized[n] = r.canBeOptimized;
 					}
 				});
-			}), this.defaultMode = n.defaultMode, !L(this.lexerDefinitionErrors) && !this.config.deferDefinitionErrorsHandling) {
+			}), this.defaultMode = n.defaultMode, !I(this.lexerDefinitionErrors) && !this.config.deferDefinitionErrorsHandling) {
 				let e = F(this.lexerDefinitionErrors, (e) => e.message).join("-----------------------\n");
 				throw Error("Errors detected in definition of Lexer:\n" + e);
 			}
@@ -3872,7 +3873,7 @@ var io = class {
 				this.hasCustom ? (this.addToken = this.addTokenUsingPush, this.handlePayload = this.handlePayloadWithCustom) : (this.addToken = this.addTokenUsingMemberAccess, this.handlePayload = this.handlePayloadNoCustom);
 			}), this.TRACE_INIT("Failed Optimization Warnings", () => {
 				let e = k(this.canModeBeOptimized, (e, t, n) => (t === !1 && e.push(n), e), []);
-				if (t.ensureOptimizations && !L(e)) throw Error(`Lexer Modes: < ${e.join(", ")} > cannot be optimized.\n	 Disable the "ensureOptimizations" lexer config flag to silently ignore this and run the lexer in an un-optimized mode.
+				if (t.ensureOptimizations && !I(e)) throw Error(`Lexer Modes: < ${e.join(", ")} > cannot be optimized.\n	 Disable the "ensureOptimizations" lexer config flag to silently ignore this and run the lexer in an un-optimized mode.
 	 Or inspect the console log for details on how to resolve these issues.`);
 			}), this.TRACE_INIT("clearRegExpParserCache", () => {
 				Xi();
@@ -3882,7 +3883,7 @@ var io = class {
 		});
 	}
 	tokenize(e, t = this.defaultMode) {
-		if (!L(this.lexerDefinitionErrors)) {
+		if (!I(this.lexerDefinitionErrors)) {
 			let e = F(this.lexerDefinitionErrors, (e) => e.message).join("-----------------------\n");
 			throw Error("Unable to Tokenize because Errors detected in definition of Lexer:\n" + e);
 		}
@@ -4086,11 +4087,7 @@ var So = {
 	},
 	buildNoViableAltMessage({ expectedPathsPerAlt: e, actual: t, previous: n, customUserDescription: r, ruleName: i }) {
 		let a = "\nbut found: '" + Yr(t).image + "'";
-		if (r) return "Expecting: " + r + a;
-		{
-			let t = k(e, (e, t) => e.concat(t), []), n = F(t, (e) => `[${F(e, (e) => ao(e)).join(", ")}]`);
-			return `Expecting: one of these possible Token sequences:\n${F(n, (e, t) => `  ${t + 1}. ${e}`).join("\n")}` + a;
-		}
+		return r ? "Expecting: " + r + a : `Expecting: one of these possible Token sequences:\n${F(F(k(e, (e, t) => e.concat(t), []), (e) => `[${F(e, (e) => ao(e)).join(", ")}]`), (e, t) => `  ${t + 1}. ${e}`).join("\n")}` + a;
 	},
 	buildEarlyExitMessage({ expectedIterationPaths: e, actual: t, customUserDescription: n, ruleName: r }) {
 		let i = "\nbut found: '" + Yr(t).image + "'";
@@ -4188,7 +4185,7 @@ var Eo = class extends Mi {
 	}
 	startWalking() {
 		if (this.found = !1, this.path.ruleStack[0] !== this.topProd.name) throw Error("The path does not start with the walker's top Rule!");
-		return this.ruleStack = I(this.path.ruleStack).reverse(), this.occurrenceStack = I(this.path.occurrenceStack).reverse(), this.ruleStack.pop(), this.occurrenceStack.pop(), this.updateExpectedNext(), this.walk(this.topProd), this.possibleTokTypes;
+		return this.ruleStack = L(this.path.ruleStack).reverse(), this.occurrenceStack = L(this.path.occurrenceStack).reverse(), this.ruleStack.pop(), this.occurrenceStack.pop(), this.updateExpectedNext(), this.walk(this.topProd), this.possibleTokTypes;
 	}
 	walk(e, t = []) {
 		this.found || super.walk(e, t);
@@ -4200,7 +4197,7 @@ var Eo = class extends Mi {
 		}
 	}
 	updateExpectedNext() {
-		L(this.ruleStack) ? (this.nextProductionName = "", this.nextProductionOccurrence = 0, this.isAtEndOfPath = !0) : (this.nextProductionName = this.ruleStack.pop(), this.nextProductionOccurrence = this.occurrenceStack.pop());
+		I(this.ruleStack) ? (this.nextProductionName = "", this.nextProductionOccurrence = 0, this.isAtEndOfPath = !0) : (this.nextProductionName = this.ruleStack.pop(), this.nextProductionOccurrence = this.occurrenceStack.pop());
 	}
 }, Oo = class extends Do {
 	constructor(e, t) {
@@ -4253,7 +4250,7 @@ var Eo = class extends Mi {
 	}
 };
 function Po(e, t, n = []) {
-	n = I(n);
+	n = L(n);
 	let r = [], i = 0;
 	function a(t) {
 		return t.concat(Wr(e, i + 1));
@@ -4271,7 +4268,7 @@ function Po(e, t, n = []) {
 		else if (t instanceof Oi) r = o(t.definition.concat([new H({ definition: [new U({ terminalType: t.separator })].concat(t.definition) })]));
 		else if (t instanceof H) r = o(t.definition.concat([new H({ definition: t.definition })]));
 		else if (t instanceof ki) return M(t.definition, (e) => {
-			L(e.definition) === !1 && (r = o(e.definition));
+			I(e.definition) === !1 && (r = o(e.definition));
 		}), r;
 		else if (t instanceof U) n.push(t.terminalType);
 		else throw Error("non exhaustive match");
@@ -4289,14 +4286,14 @@ function Fo(e, t, n, r) {
 		def: e,
 		ruleStack: [],
 		occurrenceStack: []
-	}); !L(d);) {
+	}); !I(d);) {
 		let e = d.pop();
 		if (e === o) {
 			s && _e(d).idx <= l && d.pop();
 			continue;
 		}
 		let r = e.def, f = e.idx, p = e.ruleStack, m = e.occurrenceStack;
-		if (L(r)) continue;
+		if (I(r)) continue;
 		let h = r[0];
 		/* istanbul ignore else */
 		if (h === i) {
@@ -4328,9 +4325,9 @@ function Fo(e, t, n, r) {
 		}), s = !0;
 		else throw Error("non exhaustive match");
 		else if (h instanceof Si) {
-			let e = I(p);
+			let e = L(p);
 			e.push(h.nonTerminalName);
-			let t = I(m);
+			let t = L(m);
 			t.push(h.idx);
 			let n = {
 				idx: f,
@@ -4433,9 +4430,9 @@ function Fo(e, t, n, r) {
 	return u;
 }
 function Io(e, t, n, r) {
-	let i = I(n);
+	let i = L(n);
 	i.push(e.name);
-	let a = I(r);
+	let a = L(r);
 	return a.push(1), {
 		idx: t,
 		def: e.definition,
@@ -4485,17 +4482,16 @@ function Vo(e, t, n, r) {
 		}
 	};
 	if (a && !r) {
-		let t = F(e, (e) => fe(e)), n = k(t, (e, t, n) => (M(t, (t) => {
+		let t = k(F(e, (e) => fe(e)), (e, t, n) => (M(t, (t) => {
 			P(e, t.tokenTypeIdx) || (e[t.tokenTypeIdx] = n), M(t.categoryMatches, (t) => {
 				P(e, t) || (e[t] = n);
 			});
 		}), e), {});
 		return function() {
 			let e = this.LA(1);
-			return n[e.tokenTypeIdx];
+			return t[e.tokenTypeIdx];
 		};
-	}
-	return function() {
+	} else return function() {
 		for (let t = 0; t < i; t++) {
 			let r = e[t], i = r.length;
 			nextPath: for (let e = 0; e < i; e++) {
@@ -4510,13 +4506,12 @@ function Ho(e, t, n) {
 	let r = Jr(e, (e) => e.length === 1), i = e.length;
 	if (r && !n) {
 		let t = fe(e);
-		if (t.length === 1 && L(t[0].categoryMatches)) {
+		if (t.length === 1 && I(t[0].categoryMatches)) {
 			let e = t[0].tokenTypeIdx;
 			return function() {
 				return this.LA(1).tokenTypeIdx === e;
 			};
-		}
-		{
+		} else {
 			let e = k(t, (e, t, n) => (e[t.tokenTypeIdx] = !0, M(t.categoryMatches, (t) => {
 				e[t] = !0;
 			}), e), []);
@@ -4525,8 +4520,7 @@ function Ho(e, t, n) {
 				return e[t.tokenTypeIdx] === !0;
 			};
 		}
-	}
-	return function() {
+	} else return function() {
 		nextPath: for (let n = 0; n < i; n++) {
 			let r = e[n], i = r.length;
 			for (let e = 0; e < i; e++) if (t(this.LA(e + 1), r[e]) === !1) continue nextPath;
@@ -4543,7 +4537,7 @@ var Uo = class extends Li {
 		return this.walk(this.topProd), this.restDef;
 	}
 	checkIsTarget(e, t, n, r) {
-		return e.idx === this.targetOccurrence && this.targetProdType === t && (this.restDef = n.concat(r), !0);
+		return e.idx === this.targetOccurrence && this.targetProdType === t ? (this.restDef = n.concat(r), !0) : !1;
 	}
 	walkOption(e, t, n) {
 		this.checkIsTarget(e, G.OPTION, t, n) || super.walkOption(e, t, n);
@@ -4619,8 +4613,7 @@ function Jo(e, t) {
 	let n = F(e, (e) => Po([e], 1)), r = Go(n.length), i = F(n, (e) => {
 		let t = {};
 		return M(e, (e) => {
-			let n = Ko(e.partialPath);
-			M(n, (e) => {
+			M(Ko(e.partialPath), (e) => {
 				t[e] = !0;
 			});
 		}), t;
@@ -4632,7 +4625,7 @@ function Jo(e, t) {
 			let s = n[o];
 			for (let n = 0; n < s.length; n++) {
 				let c = s[n].partialPath, l = s[n].suffixDef, u = Ko(c);
-				if (qo(i, u, o) || L(l) || c.length === t) {
+				if (qo(i, u, o) || I(l) || c.length === t) {
 					let e = r[o];
 					if (Zo(e, c) === !1) {
 						e.push(c);
@@ -4644,8 +4637,7 @@ function Jo(e, t) {
 				} else {
 					let t = Po(l, e + 1, c);
 					a[o] = a[o].concat(t), M(t, (e) => {
-						let t = Ko(e.partialPath);
-						M(t, (e) => {
+						M(Ko(e.partialPath), (e) => {
 							i[o][e] = !0;
 						});
 					});
@@ -4685,17 +4677,16 @@ function Qo(e, t) {
 	});
 }
 function $o(e) {
-	return Jr(e, (e) => Jr(e, (e) => Jr(e, (e) => L(e.categoryMatches))));
+	return Jr(e, (e) => Jr(e, (e) => Jr(e, (e) => I(e.categoryMatches))));
 }
 //#endregion
 //#region ../../node_modules/.pnpm/chevrotain@11.1.2/node_modules/chevrotain/lib/src/parse/grammar/checks.js
 function es(e) {
-	let t = e.lookaheadStrategy.validate({
+	return F(e.lookaheadStrategy.validate({
 		rules: e.rules,
 		tokenTypes: e.tokenTypes,
 		grammarName: e.grammarName
-	});
-	return F(t, (e) => Object.assign({ type: Tc.CUSTOM_LOOKAHEAD_VALIDATION }, e));
+	}), (e) => Object.assign({ type: Tc.CUSTOM_LOOKAHEAD_VALIDATION }, e));
 }
 function ts(e, t, n, r) {
 	let i = Xr(e, (e) => ns(e, n)), a = vs(e, t, n), o = Xr(e, (e) => ms(e, n)), s = Xr(e, (t) => os(t, e, r, n));
@@ -4704,8 +4695,8 @@ function ts(e, t, n, r) {
 function ns(e, t) {
 	let n = new as();
 	e.accept(n);
-	let r = n.allProductions, i = li(Qr(r, rs), (e) => e.length > 1);
-	return F(D(i), (n) => {
+	let r = n.allProductions;
+	return F(D(li(Qr(r, rs), (e) => e.length > 1)), (n) => {
 		let r = Yr(n), i = t.buildDuplicateFoundError(e, n), a = Ii(r), o = {
 			message: i,
 			type: Tc.DUPLICATE_PRODUCTIONS,
@@ -4776,7 +4767,7 @@ function ss(e, t, n) {
 }
 function cs(e, t, n, r = []) {
 	let i = [], a = ls(t.definition);
-	if (L(a)) return [];
+	if (I(a)) return [];
 	{
 		let t = e.name;
 		ei(a, e) && i.push({
@@ -4788,7 +4779,7 @@ function cs(e, t, n, r = []) {
 			ruleName: t
 		});
 		let o = Xr(Ur(a, r.concat([e])), (t) => {
-			let i = I(r);
+			let i = L(r);
 			return i.push(t), cs(e, t, n, i);
 		});
 		return i.concat(o);
@@ -4796,7 +4787,7 @@ function cs(e, t, n, r = []) {
 }
 function ls(e) {
 	let t = [];
-	if (L(e)) return t;
+	if (I(e)) return t;
 	let n = Yr(e);
 	/* istanbul ignore else */
 	if (n instanceof Si) t.push(n.referencedRule);
@@ -4807,8 +4798,7 @@ function ls(e) {
 	if (r && i) {
 		let n = Wr(e);
 		return t.concat(ls(n));
-	}
-	return t;
+	} else return t;
 }
 var us = class extends Mi {
 	constructor() {
@@ -4822,20 +4812,17 @@ function ds(e, t) {
 	let n = new us();
 	e.accept(n);
 	let r = n.alternations;
-	return Xr(r, (n) => Xr(Gr(n.definition), (r, i) => {
-		let a = Fo([r], [], Va, 1);
-		return L(a) ? [{
-			message: t.buildEmptyAlternationError({
-				topLevelRule: e,
-				alternation: n,
-				emptyChoiceIdx: i
-			}),
-			type: Tc.NONE_LAST_EMPTY_ALT,
-			ruleName: e.name,
-			occurrence: n.idx,
-			alternative: i + 1
-		}] : [];
-	}));
+	return Xr(r, (n) => Xr(Gr(n.definition), (r, i) => I(Fo([r], [], Va, 1)) ? [{
+		message: t.buildEmptyAlternationError({
+			topLevelRule: e,
+			alternation: n,
+			emptyChoiceIdx: i
+		}),
+		type: Tc.NONE_LAST_EMPTY_ALT,
+		ruleName: e.name,
+		occurrence: n.idx,
+		alternative: i + 1
+	}] : []));
 }
 function fs(e, t, n) {
 	let r = new us();
@@ -4885,7 +4872,7 @@ function hs(e, t, n) {
 		let a = i.allProductions;
 		M(a, (i) => {
 			let a = Lo(i), o = i.maxLookahead || t, s = i.idx, c = Xo(s, e, a, o)[0];
-			if (L(fe(c))) {
+			if (I(fe(c))) {
 				let t = n.buildEmptyRepetitionError({
 					topLevelRule: e,
 					repetition: i
@@ -4900,7 +4887,8 @@ function hs(e, t, n) {
 	}), r;
 }
 function gs(e, t, n, r) {
-	let i = [], a = k(e, (n, r, a) => (t.definition[a].ignoreAmbiguities === !0 || M(r, (r) => {
+	let i = [];
+	return F(k(e, (n, r, a) => (t.definition[a].ignoreAmbiguities === !0 || M(r, (r) => {
 		let o = [a];
 		M(e, (e, n) => {
 			a !== n && Zo(e, r) && t.definition[n].ignoreAmbiguities !== !0 && o.push(n);
@@ -4908,8 +4896,7 @@ function gs(e, t, n, r) {
 			alts: o,
 			path: r
 		}));
-	}), n), []);
-	return F(a, (e) => {
+	}), n), []), (e) => {
 		let i = F(e.alts, (e) => e + 1);
 		return {
 			message: r.buildAlternationAmbiguityError({
@@ -4935,8 +4922,8 @@ function _s(e, t, n, r) {
 	}, []);
 	return Lr(Xr(i, (e) => {
 		if (t.definition[e.idx].ignoreAmbiguities === !0) return [];
-		let a = e.idx, o = e.path, s = T(i, (e) => t.definition[e.idx].ignoreAmbiguities !== !0 && e.idx < a && Qo(e.path, o));
-		return F(s, (e) => {
+		let a = e.idx, o = e.path;
+		return F(T(i, (e) => t.definition[e.idx].ignoreAmbiguities !== !0 && e.idx < a && Qo(e.path, o)), (e) => {
 			let i = [e.idx + 1, a + 1], o = t.idx === 0 ? "" : t.idx;
 			return {
 				message: r.buildAlternationPrefixAmbiguityError({
@@ -5067,7 +5054,7 @@ var Ds = class extends Error {
 		return this.canRecoverWithSingleTokenInsertion(e, t) || this.canRecoverWithSingleTokenDeletion(e);
 	}
 	canRecoverWithSingleTokenInsertion(e, t) {
-		if (!this.canTokenTypeBeInsertedInRecovery(e) || L(t)) return !1;
+		if (!this.canTokenTypeBeInsertedInRecovery(e) || I(t)) return !1;
 		let n = this.LA(1);
 		return pe(t, (e) => this.tokenMatcher(n, e)) !== void 0;
 	}
@@ -5104,8 +5091,7 @@ var Ds = class extends Error {
 		});
 	}
 	flattenFollowSet() {
-		let e = F(this.buildFullFollowKeyStack(), (e) => this.getFollowSetFromFollowKey(e));
-		return fe(e);
+		return fe(F(this.buildFullFollowKeyStack(), (e) => this.getFollowSetFromFollowKey(e)));
 	}
 	getFollowSetFromFollowKey(e) {
 		if (e === Ms) return [yo];
@@ -5124,7 +5110,7 @@ var Ds = class extends Error {
 	getCurrentGrammarPath(e, t) {
 		return {
 			ruleStack: this.getHumanReadableRuleStack(),
-			occurrenceStack: I(this.RULE_OCCURRENCE_STACK),
+			occurrenceStack: L(this.RULE_OCCURRENCE_STACK),
 			lastTok: e,
 			lastTokOccurrence: t
 		};
@@ -5142,8 +5128,6 @@ function Is(e, t, n, r, i, a, o) {
 	let l = c.token, u = c.occurrence, d = c.isEndOfRule;
 	this.RULE_STACK.length === 1 && d && l === void 0 && (l = yo, u = 1), l !== void 0 && u !== void 0 && this.shouldInRepetitionRecoveryBeTried(l, u, o) && this.tryInRepetitionRecovery(e, t, n, l);
 }
-//#endregion
-//#region ../../node_modules/.pnpm/chevrotain@11.1.2/node_modules/chevrotain/lib/src/parse/grammar/keys.js
 var Ls = 1024, Rs = 1280, zs = 1536;
 function Bs(e, t, n) {
 	return n | t | e;
@@ -5156,7 +5140,7 @@ var Vs = class {
 	}
 	validate(e) {
 		let t = this.validateNoLeftRecursion(e.rules);
-		if (L(t)) {
+		if (I(t)) {
 			let n = this.validateEmptyOrAlternatives(e.rules), r = this.validateAmbiguousAlternationAlternatives(e.rules, this.maxLookahead), i = this.validateSomeNonEmptyLookaheadPath(e.rules, this.maxLookahead);
 			return [
 				...t,
@@ -5331,7 +5315,7 @@ function Qs(e, t) {
 		},
 		validateVisitor: function() {
 			let e = tc(this, t);
-			if (!L(e)) {
+			if (!I(e)) {
 				let t = F(e, (e) => e.msg);
 				throw Error(`Errors Detected in CST Visitor <${this.constructor.name}>:\n\t${t.join("\n\n").replace(/\n/g, "\n	")}`);
 			}
@@ -5354,8 +5338,7 @@ function tc(e, t) {
 	return nc(e, t);
 }
 function nc(e, t) {
-	let n = T(t, (t) => d(e[t]) === !1);
-	return Lr(F(n, (t) => ({
+	return Lr(F(T(t, (t) => d(e[t]) === !1), (t) => ({
 		msg: `Missing visitor method: <${t}> on ${e.constructor.name} CST Visitor.`,
 		type: ec.MISSING_METHOD,
 		methodName: t
@@ -5800,17 +5783,17 @@ var rc = class {
 	initRecognizerEngine(e, t) {
 		if (this.className = this.constructor.name, this.shortRuleNameToFull = {}, this.fullRuleNameToShort = {}, this.ruleShortNameIdx = 256, this.tokenMatcher = Ha, this.subruleIdx = 0, this.definedRulesNames = [], this.tokensMap = {}, this.isBackTrackingStack = [], this.RULE_STACK = [], this.RULE_OCCURRENCE_STACK = [], this.gastProductionsCache = {}, P(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 (m(e)) {
-			if (L(e)) 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 (I(e)) 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 (m(e)) this.tokensMap = k(e, (e, t) => (e[t.name] = t, e), {});
 		else if (P(e, "modes") && Jr(fe(D(e.modes)), to)) {
 			let t = pi(fe(D(e.modes)));
 			this.tokensMap = k(t, (e, t) => (e[t.name] = t, e), {});
-		} else if (o(e)) this.tokensMap = I(e);
+		} else if (o(e)) this.tokensMap = L(e);
 		else throw Error("<tokensDictionary> argument must be An Array of Token constructors, A dictionary of Token constructors or an IMultiModeLexerDefinition");
 		this.tokensMap.EOF = yo;
-		let n = Jr(P(e, "modes") ? fe(D(e.modes)) : D(e), (e) => L(e.categoryMatches));
+		let n = Jr(P(e, "modes") ? fe(D(e.modes)) : D(e), (e) => I(e.categoryMatches));
 		this.tokenMatcher = n ? Ha : Va, Ga(D(this.tokensMap));
 	}
 	defineRule(e, t, n) {
@@ -5847,23 +5830,20 @@ var rc = class {
 			let t = e;
 			if (i) {
 				let r = this.findReSyncTokenType();
-				if (this.isInCurrentRuleReSyncSet(r)) {
-					if (t.resyncedTokens = this.reSyncTo(r), this.outputCst) {
+				if (this.isInCurrentRuleReSyncSet(r)) if (t.resyncedTokens = this.reSyncTo(r), this.outputCst) {
+					let e = this.CST_STACK[this.CST_STACK.length - 1];
+					return e.recoveredNode = !0, e;
+				} else return n(e);
+				else {
+					if (this.outputCst) {
 						let e = this.CST_STACK[this.CST_STACK.length - 1];
-						return e.recoveredNode = !0, e;
+						e.recoveredNode = !0, t.partialCstResult = e;
 					}
-					return n(e);
-				}
-				if (this.outputCst) {
-					let e = this.CST_STACK[this.CST_STACK.length - 1];
-					e.recoveredNode = !0, t.partialCstResult = e;
+					throw t;
 				}
-				throw t;
-			}
-			if (r) return this.moveToTerminatedState(), n(e);
-			throw t;
-		}
-		throw e;
+			} else if (r) return this.moveToTerminatedState(), n(e);
+			else throw t;
+		} else throw e;
 	}
 	optionInternal(e, t) {
 		let n = this.getKeyForAutomaticLookahead(512, t);
@@ -6025,11 +6005,10 @@ var rc = class {
 			} catch (e) {
 				throw e.name === "InRuleRecoveryException" ? n : e;
 			}
-		}
-		throw n;
+		} else throw n;
 	}
 	saveRecogState() {
-		let e = this.errors, t = I(this.RULE_STACK);
+		let e = this.errors, t = L(this.RULE_STACK);
 		return {
 			errors: e,
 			lexerState: this.exportLexerState(),
@@ -6066,12 +6045,12 @@ var rc = class {
 	SAVE_ERROR(e) {
 		if (Es(e)) return e.context = {
 			ruleStack: this.getHumanReadableRuleStack(),
-			ruleOccurrenceStack: I(this.RULE_OCCURRENCE_STACK)
+			ruleOccurrenceStack: L(this.RULE_OCCURRENCE_STACK)
 		}, this._errors.push(e), e;
 		throw Error("Trying to save an Error which is not a RecognitionException");
 	}
 	get errors() {
-		return I(this._errors);
+		return L(this._errors);
 	}
 	set errors(e) {
 		this._errors = e;
@@ -6287,8 +6266,7 @@ var bc = class {
 			this.traceInitIndent < this.traceInitMaxIdent && console.log(`${n}--> <${e}>`);
 			let { time: r, value: i } = _i(t), a = r > 10 ? console.warn : console.log;
 			return this.traceInitIndent < this.traceInitMaxIdent && a(`${n}<-- <${e}> time: ${r}ms`), this.traceInitIndent--, i;
-		}
-		return t();
+		} else return t();
 	}
 };
 //#endregion
@@ -6355,7 +6333,7 @@ var Dc = class e {
 			if (this.TRACE_INIT("Grammar Resolving", () => {
 				r = ys({ rules: D(this.gastProductionsCache) }), this.definitionErrors = this.definitionErrors.concat(r);
 			}), this.TRACE_INIT("Grammar Validations", () => {
-				if (L(r) && this.skipValidations === !1) {
+				if (I(r) && this.skipValidations === !1) {
 					let e = bs({
 						rules: D(this.gastProductionsCache),
 						tokenTypes: D(this.tokensMap),
@@ -6369,13 +6347,13 @@ var Dc = class e {
 					});
 					this.definitionErrors = this.definitionErrors.concat(e, t);
 				}
-			}), L(this.definitionErrors) && (this.recoveryEnabled && this.TRACE_INIT("computeAllProdsFollows", () => {
+			}), I(this.definitionErrors) && (this.recoveryEnabled && this.TRACE_INIT("computeAllProdsFollows", () => {
 				let e = Gi(D(this.gastProductionsCache));
 				this.resyncFollows = e;
 			}), this.TRACE_INIT("ComputeLookaheadFunctions", () => {
 				var e, t;
 				(t = (e = this.lookaheadStrategy).initialize) == null || t.call(e, { rules: D(this.gastProductionsCache) }), this.preComputeLookaheadFunctions(D(this.gastProductionsCache));
-			})), !e.DEFER_DEFINITION_ERRORS_HANDLING && !L(this.definitionErrors)) throw t = F(this.definitionErrors, (e) => e.message), Error(`Parser Definition Errors detected:\n ${t.join("\n-------------------------------\n")}`);
+			})), !e.DEFER_DEFINITION_ERRORS_HANDLING && !I(this.definitionErrors)) throw t = F(this.definitionErrors, (e) => e.message), Error(`Parser Definition Errors detected:\n ${t.join("\n-------------------------------\n")}`);
 		});
 	}
 	constructor(e, t) {
@@ -6399,14 +6377,11 @@ Dc.DEFER_DEFINITION_ERRORS_HANDLING = !1, xc(Dc, [
 ]);
 var Oc = class extends Dc {
 	constructor(e, t = Cc) {
-		let n = I(t);
+		let n = L(t);
 		n.outputCst = !1, super(e, n);
 	}
 };
 //#endregion
-//#region ../../node_modules/.pnpm/chevrotain@11.1.2/node_modules/chevrotain/lib/src/api.js
-/* istanbul ignore file - tricky to import some things from this module during testing */
-//#endregion
 //#region ../../node_modules/.pnpm/chevrotain-allstar@0.3.1_chevrotain@11.1.2/node_modules/chevrotain-allstar/lib/atn.js
 function kc(e, t, n) {
 	return `${e.name}_${t}_${n}`;
@@ -6692,8 +6667,7 @@ var sl = class {
 				let t = this.LA(1);
 				return e[t.tokenTypeIdx];
 			};
-		}
-		return r ? function(e) {
+		} else if (r) return function(e) {
 			let t = new sl(), n = e === void 0 ? 0 : e.length;
 			for (let r = 0; r < n; r++) {
 				let n = e?.[r].GATE;
@@ -6701,7 +6675,8 @@ var sl = class {
 			}
 			let r = fl.call(this, a, c, t, o);
 			return typeof r == "number" ? r : void 0;
-		} : function() {
+		};
+		else return function() {
 			let e = fl.call(this, a, c, cl, o);
 			return typeof e == "number" ? e : void 0;
 		};
@@ -6715,13 +6690,12 @@ var sl = class {
 		}), (e) => F(e, (e) => e[0]));
 		if (ul(l) && l[0][0] && !i) {
 			let e = l[0], t = fe(e);
-			if (t.length === 1 && L(t[0].categoryMatches)) {
+			if (t.length === 1 && I(t[0].categoryMatches)) {
 				let e = t[0].tokenTypeIdx;
 				return function() {
 					return this.LA(1).tokenTypeIdx === e;
 				};
-			}
-			{
+			} else {
 				let e = k(t, (e, t) => (t !== void 0 && (e[t.tokenTypeIdx] = !0, M(t.categoryMatches, (t) => {
 					e[t] = !0;
 				})), e), {});
@@ -7456,8 +7430,7 @@ var Fl = /* @__PURE__ */ i({
 					this._workspaceEdit.documentChanges.push(r), n = new cu(e, this._changeAnnotations), this._textEditChanges[t.uri] = n;
 				}
 				return n;
-			}
-			{
+			} else {
 				if (this.initChanges(), this._workspaceEdit.changes === void 0) throw Error("Workspace edit is not configured for normal text edit changes.");
 				let t = this._textEditChanges[e];
 				if (!t) {
@@ -7626,7 +7599,7 @@ var Fl = /* @__PURE__ */ i({
 	})(Du ||= {}), (function(e) {
 		function t(e, t, ...n) {
 			let r = { label: e };
-			return Y.defined(t) && (r.documentation = t), r.parameters = Y.defined(n) ? n : [], r;
+			return Y.defined(t) && (r.documentation = t), Y.defined(n) ? r.parameters = n : r.parameters = [], r;
 		}
 		e.create = t;
 	})(Ou ||= {}), (function(e) {
@@ -8162,8 +8135,7 @@ var dd = class {
 				};
 			}
 			return this._rangeCache;
-		}
-		return {
+		} else return {
 			start: q.create(0, 0),
 			end: q.create(0, 0)
 		};
@@ -8213,11 +8185,11 @@ var yd = "​", bd = (e) => e.endsWith(yd) ? e : e + yd, xd = class {
 	constructor(e) {
 		this._unorderedGroups = /* @__PURE__ */ new Map(), this.allRules = /* @__PURE__ */ new Map(), this.lexer = e.parser.Lexer;
 		let t = this.lexer.definition, n = e.LanguageMetaData.mode === "production";
-		this.wrapper = e.shared.profilers.LangiumProfiler?.isActive("parsing") ? new Od(t, {
+		e.shared.profilers.LangiumProfiler?.isActive("parsing") ? this.wrapper = new Od(t, {
 			...e.parser.ParserConfig,
 			skipValidations: n,
 			errorMessageProvider: e.parser.ParserErrorMessageProvider
-		}, e.shared.profilers.LangiumProfiler.createTask("parsing", e.LanguageMetaData.languageId)) : new Dd(t, {
+		}, e.shared.profilers.LangiumProfiler.createTask("parsing", e.LanguageMetaData.languageId)) : this.wrapper = new Dd(t, {
 			...e.parser.ParserConfig,
 			skipValidations: n,
 			errorMessageProvider: e.parser.ParserErrorMessageProvider
@@ -8677,12 +8649,10 @@ function Pd(e, t) {
 		return (s) => {
 			o ??= Wd(e, n), e.parser.subrule(r, o, i, t, a(s));
 		};
-	}
-	if (on(n)) {
+	} else if (on(n)) {
 		let r = e.consume++, i = Kd(e, n.name);
 		return () => e.parser.consume(r, i, t);
-	}
-	if (n) Pn(n);
+	} else if (n) Pn(n);
 	else throw new Nn(t.$cstNode, `Undefined rule: ${t.rule.$refText}`);
 }
 function Fd(e, t) {
@@ -8696,8 +8666,7 @@ function Fd(e, t) {
 			for (let { parameterName: r, predicate: i } of e) r && (n[r] = i(t));
 			return n;
 		};
-	}
-	{
+	} else {
 		let n = t.map((e) => Id(e.value));
 		return (t) => {
 			let r = {};
@@ -8713,20 +8682,16 @@ function Id(e) {
 	if (ht(e)) {
 		let t = Id(e.left), n = Id(e.right);
 		return (e) => t(e) || n(e);
-	}
-	if (dt(e)) {
+	} else if (dt(e)) {
 		let t = Id(e.left), n = Id(e.right);
 		return (e) => t(e) && n(e);
-	}
-	if (It(e)) {
+	} else if (It(e)) {
 		let t = Id(e.value);
 		return (e) => !t(e);
-	}
-	if (Bt(e)) {
+	} else if (Bt(e)) {
 		let t = e.parameter.ref.name;
 		return (e) => e !== void 0 && e[t] === !0;
-	}
-	if (ot(e)) {
+	} else if (ot(e)) {
 		let t = !!e.true;
 		return () => t;
 	}
@@ -8765,7 +8730,7 @@ function Rd(e, t) {
 			}
 		};
 		let c = n.GATE;
-		return o.GATE = c ? () => c(t) : () => !s.unorderedGroups.get(i(r, s))?.[a], o;
+		return c ? o.GATE = () => c(t) : o.GATE = () => !s.unorderedGroups.get(i(r, s))?.[a], o;
 	})), "*");
 	return (t) => {
 		a(t), e.parser.isRecording() || e.parser.unorderedGroups.delete(i(r, e.parser));
@@ -8784,22 +8749,18 @@ function Vd(e, t, n = t.terminal) {
 		let n = hr(t.type.ref)?.terminal;
 		if (!n) throw Error("Could not find name assignment for type: " + br(t.type.ref));
 		return Vd(e, t, n);
-	}
-	if (Yt(n) && Ht(n.rule.ref)) {
+	} else if (Yt(n) && Ht(n.rule.ref)) {
 		let r = n.rule.ref, i = e.subrule++, a;
 		return (n) => {
 			a ??= Wd(e, r), e.parser.subrule(i, a, !1, t, n);
 		};
-	}
-	if (Yt(n) && on(n.rule.ref)) {
+	} else if (Yt(n) && on(n.rule.ref)) {
 		let r = e.consume++, i = Kd(e, n.rule.ref.name);
 		return () => e.parser.consume(r, i, t);
-	}
-	if (jt(n)) {
+	} else if (jt(n)) {
 		let r = e.consume++, i = Kd(e, n.value);
 		return () => e.parser.consume(r, i, t);
-	}
-	throw Error("Could not build cross reference parser");
+	} else throw Error("Could not build cross reference parser");
 }
 function Hd(e, t) {
 	let n = e.consume++, r = e.tokens[t.value];
@@ -8824,8 +8785,7 @@ function Ud(e, t, n, r) {
 			DEF: () => n(r),
 			GATE: i ? () => i(r) : void 0
 		});
-	}
-	if (r === "+") {
+	} else if (r === "+") {
 		let t = e.many++;
 		if (i) {
 			let r = e.or++;
@@ -8836,17 +8796,14 @@ function Ud(e, t, n, r) {
 				ALT: Ec(),
 				GATE: () => !i(a)
 			}]);
-		}
-		return (r) => e.parser.atLeastOne(t, { DEF: () => n(r) });
-	}
-	if (r === "?") {
+		} else return (r) => e.parser.atLeastOne(t, { DEF: () => n(r) });
+	} else if (r === "?") {
 		let t = e.optional++;
 		return (r) => e.parser.optional(t, {
 			DEF: () => n(r),
 			GATE: i ? () => i(r) : void 0
 		});
-	}
-	Pn(r);
+	} else Pn(r);
 }
 function Wd(e, t) {
 	let n = Gd(e, t), r = e.parser.getRule(n);
@@ -9834,16 +9791,14 @@ var wf = class {
 		if (typeof t == "string") {
 			let r = this.parse(e, t, n);
 			return this.createLangiumDocument(r, e, void 0, t);
-		}
-		if ("$model" in t) {
+		} else if ("$model" in t) {
 			let n = {
 				value: t.$model,
 				parserErrors: [],
 				lexerErrors: []
 			};
 			return this.createLangiumDocument(n, e);
-		}
-		{
+		} else {
 			let r = this.parse(e, t.getText(), n);
 			return this.createLangiumDocument(r, e, t);
 		}
@@ -9852,8 +9807,7 @@ var wf = class {
 		if (typeof t == "string") {
 			let r = await this.parseAsync(e, t, n);
 			return this.createLangiumDocument(r, e, void 0, t);
-		}
-		{
+		} else {
 			let r = await this.parseAsync(e, t.getText(), n);
 			return this.createLangiumDocument(r, e, t);
 		}
@@ -10172,8 +10126,7 @@ var kf = class {
 				for (let t of He(n)) if (ye(t.reference) && t.reference.items.some((t) => t.ref === e)) return t.reference.items.map((e) => e.ref);
 			}
 			return [e];
-		}
-		return [e];
+		} else return [e];
 	}
 	getNodeFromReferenceDescription(e) {
 		if (!e) return;
@@ -10292,7 +10245,7 @@ var kf = class {
 	}
 	delete(e) {
 		let t = this.map.get(e);
-		return t !== void 0 && (this.map.delete(e), this.inverse.delete(t), !0);
+		return t === void 0 ? !1 : (this.map.delete(e), this.inverse.delete(t), !0);
 	}
 }, Nf = class {
 	constructor(e) {
@@ -10389,7 +10342,7 @@ var kf = class {
 		if (t) {
 			let n = t();
 			return this.cache.set(e, n), n;
-		}
+		} else return;
 	}
 	delete(e) {
 		return this.throwIfDisposed(), this.cache.delete(e);
@@ -10414,7 +10367,7 @@ var kf = class {
 		if (n) {
 			let e = n();
 			return r.set(t, e), e;
-		}
+		} else return;
 	}
 	delete(e, t) {
 		return this.throwIfDisposed(), this.cacheForContext(e).delete(t);
@@ -10499,47 +10452,41 @@ var Uf = class {
 		return this.linkNode(r, r, n), r;
 	}
 	replacer(e, t, { refText: n, sourceText: r, textRegions: i, comments: a, uriConverter: o }) {
-		if (!this.ignoreProperties.has(e)) {
-			if (ve(t)) {
-				let e = t.ref, r = n ? t.$refText : void 0;
-				if (e) {
-					let t = Fe(e), n = "";
-					this.currentDocument && this.currentDocument !== t && (n = o ? o(t.uri, e) : t.uri.toString());
-					let i = this.astNodeLocator.getAstNodePath(e);
-					return {
-						$ref: `${n}#${i}`,
-						$refText: r
-					};
-				}
+		if (!this.ignoreProperties.has(e)) if (ve(t)) {
+			let e = t.ref, r = n ? t.$refText : void 0;
+			if (e) {
+				let t = Fe(e), n = "";
+				this.currentDocument && this.currentDocument !== t && (n = o ? o(t.uri, e) : t.uri.toString());
+				let i = this.astNodeLocator.getAstNodePath(e);
 				return {
-					$error: t.error?.message ?? "Could not resolve reference",
+					$ref: `${n}#${i}`,
 					$refText: r
 				};
+			} else return {
+				$error: t.error?.message ?? "Could not resolve reference",
+				$refText: r
+			};
+		} else if (ye(t)) {
+			let e = n ? t.$refText : void 0, r = [];
+			for (let e of t.items) {
+				let t = e.ref, n = Fe(e.ref), i = "";
+				this.currentDocument && this.currentDocument !== n && (i = o ? o(n.uri, t) : n.uri.toString());
+				let a = this.astNodeLocator.getAstNodePath(t);
+				r.push(`${i}#${a}`);
 			}
-			if (ye(t)) {
-				let e = n ? t.$refText : void 0, r = [];
-				for (let e of t.items) {
-					let t = e.ref, n = Fe(e.ref), i = "";
-					this.currentDocument && this.currentDocument !== n && (i = o ? o(n.uri, t) : n.uri.toString());
-					let a = this.astNodeLocator.getAstNodePath(t);
-					r.push(`${i}#${a}`);
-				}
-				return {
-					$refs: r,
-					$refText: e
-				};
-			}
-			if (R(t)) {
-				let n;
-				if (i && (n = this.addAstNodeRegionWithAssignmentsTo({ ...t }), (!e || t.$document) && n?.$textRegion && (n.$textRegion.documentURI = this.currentDocument?.uri.toString())), r && !e && (n ??= { ...t }, n.$sourceText = t.$cstNode?.text), a) {
-					n ??= { ...t };
-					let e = this.commentProvider.getComment(t);
-					e && (n.$comment = e.replace(/\r/g, ""));
-				}
-				return n ?? t;
+			return {
+				$refs: r,
+				$refText: e
+			};
+		} else if (R(t)) {
+			let n;
+			if (i && (n = this.addAstNodeRegionWithAssignmentsTo({ ...t }), (!e || t.$document) && n?.$textRegion && (n.$textRegion.documentURI = this.currentDocument?.uri.toString())), r && !e && (n ??= { ...t }, n.$sourceText = t.$cstNode?.text), a) {
+				n ??= { ...t };
+				let e = this.commentProvider.getComment(t);
+				e && (n.$comment = e.replace(/\r/g, ""));
 			}
-			return t;
-		}
+			return n ?? t;
+		} else return t;
 	}
 	addAstNodeRegionWithAssignmentsTo(e) {
 		let t = (e) => ({
@@ -11270,7 +11217,9 @@ var ip = class {
 					case n.Last:
 						this.addItemLast(i);
 						break;
-					default: this.addItemLast(i);
+					default:
+						this.addItemLast(i);
+						break;
 				}
 				this._map.set(e, i), this._size++;
 			}
@@ -11307,8 +11256,7 @@ var ip = class {
 							done: !1
 						};
 						return t = t.next, e;
-					}
-					return {
+					} else return {
 						value: void 0,
 						done: !0
 					};
@@ -11327,8 +11275,7 @@ var ip = class {
 							done: !1
 						};
 						return t = t.next, e;
-					}
-					return {
+					} else return {
 						value: void 0,
 						done: !0
 					};
@@ -11347,8 +11294,7 @@ var ip = class {
 							done: !1
 						};
 						return t = t.next, e;
-					}
-					return {
+					} else return {
 						value: void 0,
 						done: !0
 					};
@@ -12078,8 +12024,7 @@ var ip = class {
 					if (a !== void 0) {
 						a.cancel(), Ne(e);
 						return;
-					}
-					A.add(t);
+					} else A.add(t);
 				}
 				ge(oe, e);
 			} finally {
@@ -12177,8 +12122,7 @@ var ip = class {
 				let t = e.params.id;
 				A.delete(t), Ne(e);
 				return;
-			}
-			{
+			} else {
 				let r = D.get(e.method);
 				r && (n = r.handler, t = r.type);
 			}
@@ -12307,6 +12251,7 @@ var ip = class {
 					n = [];
 					for (let e = 0; e < t.length && e < r; e++) n.push(ze(t[e]));
 					if (t.length < r) for (let e = t.length; e < r; e++) n.push(null);
+					break;
 			}
 			return n;
 		}
@@ -12329,6 +12274,7 @@ var ip = class {
 						default:
 							if (s === r.ParameterStructures.byName) throw Error(`Received ${l} parameters for 'by Name' notification parameter structure.`);
 							a = t.slice(o, c).map((e) => ze(e));
+							break;
 					}
 				} else {
 					let n = t;
@@ -12387,6 +12333,7 @@ var ip = class {
 						default:
 							if (u === r.ParameterStructures.byName) throw Error(`Received ${f} parameters for 'by Name' request parameter structure.`);
 							a = t.slice(l, d).map((e) => ze(e));
+							break;
 					}
 				} else {
 					let n = t;
@@ -14598,7 +14545,7 @@ function gm(e, t) {
 		let i = mm(e);
 		return new xm(r, i, t, J.create(n.range.start, i.range.end));
 	}
-	{
+	else {
 		let e = n.range;
 		return new xm(r, new wm([], e), t, e);
 	}
@@ -14624,8 +14571,7 @@ function ym(e, t) {
 	if (typeof e == "string" || typeof e == "object") {
 		let n = typeof e == "string" ? er(e) : e.source;
 		return RegExp(t ? `^\\s*${n}` : `\\s*${n}\\s*$`);
-	}
-	return e;
+	} else return e;
 }
 var bm = class {
 	constructor(e, t) {
@@ -14750,7 +14696,7 @@ var Dm = class {
 		if (r && r.nameSegment) {
 			let e = r.nameSegment.range.start.line + 1, t = r.nameSegment.range.start.character + 1;
 			return `[${n}](${r.documentUri.with({ fragment: `L${e},${t}` }).toString()})`;
-		}
+		} else return;
 	}
 	documentationTagRenderer(e, t) {}
 	findNameInLocalSymbols(e, t) {
@@ -15033,8 +14979,7 @@ function zm(e, t, n, r) {
 		if (e[t] instanceof Error) throw Error("Construction failure. Please make sure that your dependencies are constructable. Cause: " + e[t]);
 		if (e[t] === Rm) throw Error("Cycle detected. Please make \"" + String(t) + "\" lazy. Visit https://langium.org/docs/reference/configuration-services/#resolving-cyclic-dependencies");
 		return e[t];
-	}
-	if (t in n) {
+	} else if (t in n) {
 		let i = n[t];
 		e[t] = Rm;
 		try {
@@ -15043,13 +14988,13 @@ function zm(e, t, n, r) {
 			throw e[t] = n instanceof Error ? n : void 0, n;
 		}
 		return e[t];
-	}
+	} else return;
 }
 function Bm(e, t) {
 	if (t) {
 		for (let [n, r] of Object.entries(t)) if (r != null) if (typeof r == "object") {
 			let t = e[n];
-			e[n] = Bm(typeof t == "object" && t ? t : {}, r);
+			typeof t == "object" && t ? e[n] = Bm(t, r) : e[n] = Bm({}, r);
 		} else e[n] = r;
 	}
 	return e;