@loopstack/loopstack-studio 0.25.1 → 0.26.0

package/dist/node_modules/chevrotain/lib/src/parse/parser/traits/recognizer_engine.js

@@ -1,257 +1,256 @@
-import { augmentTokenTypes as e, isTokenType as t, tokenStructuredMatcher as n, tokenStructuredMatcherNoCategories as r } from "../../../scan/tokens.js";
-import { EOF as i } from "../../../scan/tokens_public.js";
-import { NextTerminalAfterAtLeastOneSepWalker as a, NextTerminalAfterAtLeastOneWalker as o, NextTerminalAfterManySepWalker as s, NextTerminalAfterManyWalker as c } from "../../grammar/interpreter.js";
-import { PROD_TYPE as l } from "../../grammar/lookahead.js";
-import { MismatchedTokenException as u, NotAllInputParsedException as d, isRecognitionException as f } from "../../exceptions_public.js";
-import "./recoverable.js";
-import { AT_LEAST_ONE_IDX as p, AT_LEAST_ONE_SEP_IDX as m, MANY_SEP_IDX as h } from "../../grammar/keys.js";
-import { DEFAULT_RULE_CONFIG as g, END_OF_FILE as _ } from "../parser.js";
-//#region ../../node_modules/chevrotain/lib/src/parse/parser/traits/recognizer_engine.js
-var v = class {
-	initRecognizerEngine(a, o) {
-		if (this.className = this.constructor.name, this.shortRuleNameToFull = {}, this.fullRuleNameToShort = {}, this.ruleShortNameIdx = 256, this.tokenMatcher = r, 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(o, "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(a)) {
-			if (a.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 a[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.");
+import { augmentTokenTypes, isTokenType, tokenStructuredMatcher, tokenStructuredMatcherNoCategories } from "../../../scan/tokens.js";
+import { EOF } from "../../../scan/tokens_public.js";
+import { NextTerminalAfterAtLeastOneSepWalker, NextTerminalAfterAtLeastOneWalker, NextTerminalAfterManySepWalker, NextTerminalAfterManyWalker } from "../../grammar/interpreter.js";
+import { PROD_TYPE } from "../../grammar/lookahead.js";
+import { MismatchedTokenException, NotAllInputParsedException, isRecognitionException } from "../../exceptions_public.js";
+import { IN_RULE_RECOVERY_EXCEPTION } from "./recoverable.js";
+import { AT_LEAST_ONE_IDX, AT_LEAST_ONE_SEP_IDX, BITS_FOR_METHOD_TYPE, BITS_FOR_OCCURRENCE_IDX, MANY_IDX, MANY_SEP_IDX, OPTION_IDX, OR_IDX } from "../../grammar/keys.js";
+import { DEFAULT_RULE_CONFIG, END_OF_FILE } from "../parser.js";
+var RecognizerEngine = class {
+	initRecognizerEngine(C, w) {
+		if (this.className = this.constructor.name, this.shortRuleNameToFull = {}, this.fullRuleNameToShort = {}, this.ruleShortNameIdx = 256, this.tokenMatcher = tokenStructuredMatcherNoCategories, 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(w, "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(C)) {
+			if (C.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 C[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(a)) this.tokensMap = a.reduce((e, t) => (e[t.name] = t, e), {});
-		else if (Object.hasOwn(a, "modes") && Object.values(a.modes).flat().every(t)) {
-			let e = Object.values(a.modes).flat();
-			this.tokensMap = [...new Set(e)].reduce((e, t) => (e[t.name] = t, e), {});
-		} else if (typeof a == "object" && a) this.tokensMap = Object.assign({}, a);
+		if (Array.isArray(C)) this.tokensMap = C.reduce((e, y) => (e[y.name] = y, e), {});
+		else if (Object.hasOwn(C, "modes") && Object.values(C.modes).flat().every(isTokenType)) {
+			let e = Object.values(C.modes).flat();
+			this.tokensMap = [...new Set(e)].reduce((e, y) => (e[y.name] = y, e), {});
+		} else if (typeof C == "object" && C) this.tokensMap = Object.assign({}, C);
 		else throw Error("<tokensDictionary> argument must be An Array of Token constructors, A dictionary of Token constructors or an IMultiModeLexerDefinition");
-		this.tokensMap.EOF = i, this.tokenMatcher = (Object.hasOwn(a, "modes") ? Object.values(a.modes).flat() : Object.values(a)).every((e) => e.categoryMatches?.length == 0) ? r : n, e(Object.values(this.tokensMap));
+		this.tokensMap.EOF = EOF, this.tokenMatcher = (Object.hasOwn(C, "modes") ? Object.values(C.modes).flat() : Object.values(C)).every((e) => e.categoryMatches?.length == 0) ? tokenStructuredMatcherNoCategories : tokenStructuredMatcher, augmentTokenTypes(Object.values(this.tokensMap));
 	}
-	defineRule(e, t, n) {
+	defineRule(e, y, b) {
 		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 : g.resyncEnabled, i = Object.hasOwn(n, "recoveryValueFunc") ? n.recoveryValueFunc : g.recoveryValueFunc, a = this.ruleShortNameIdx << 12;
-		this.ruleShortNameIdx++, this.shortRuleNameToFull[a] = e, this.fullRuleNameToShort[e] = a;
-		let o;
-		return o = this.outputCst === !0 ? function(...n) {
+		let x = Object.hasOwn(b, "resyncEnabled") ? b.resyncEnabled : DEFAULT_RULE_CONFIG.resyncEnabled, S = Object.hasOwn(b, "recoveryValueFunc") ? b.recoveryValueFunc : DEFAULT_RULE_CONFIG.recoveryValueFunc, C = this.ruleShortNameIdx << 12;
+		this.ruleShortNameIdx++, this.shortRuleNameToFull[C] = e, this.fullRuleNameToShort[e] = C;
+		let w;
+		return w = this.outputCst === !0 ? function(...b) {
 			try {
-				this.ruleInvocationStateUpdate(a, e, this.subruleIdx), t.apply(this, n);
-				let r = this.CST_STACK[this.CST_STACK.length - 1];
-				return this.cstPostRule(r), r;
+				this.ruleInvocationStateUpdate(C, e, this.subruleIdx), y.apply(this, b);
+				let x = this.CST_STACK[this.CST_STACK.length - 1];
+				return this.cstPostRule(x), x;
 			} catch (e) {
-				return this.invokeRuleCatch(e, r, i);
+				return this.invokeRuleCatch(e, x, S);
 			} finally {
 				this.ruleFinallyStateUpdate();
 			}
-		} : function(...n) {
+		} : function(...b) {
 			try {
-				return this.ruleInvocationStateUpdate(a, e, this.subruleIdx), t.apply(this, n);
+				return this.ruleInvocationStateUpdate(C, e, this.subruleIdx), y.apply(this, b);
 			} catch (e) {
-				return this.invokeRuleCatch(e, r, i);
+				return this.invokeRuleCatch(e, x, S);
 			} finally {
 				this.ruleFinallyStateUpdate();
 			}
-		}, Object.assign(function(...t) {
+		}, Object.assign(function(...y) {
 			this.onBeforeParse(e);
 			try {
-				return o.apply(this, t);
+				return w.apply(this, y);
 			} finally {
 				this.onAfterParse(e);
 			}
 		}, {
 			ruleName: e,
-			originalGrammarAction: t,
-			coreRule: o
+			originalGrammarAction: y,
+			coreRule: w
 		});
 	}
-	invokeRuleCatch(e, t, n) {
-		let r = this.RULE_STACK_IDX === 0, i = t && !this.isBackTracking() && this.recoveryEnabled;
-		if (f(e)) {
-			let t = e;
-			if (i) {
-				let r = this.findReSyncTokenType();
-				if (this.isInCurrentRuleReSyncSet(r)) if (t.resyncedTokens = this.reSyncTo(r), this.outputCst) {
+	invokeRuleCatch(e, y, b) {
+		let x = this.RULE_STACK_IDX === 0, S = y && !this.isBackTracking() && this.recoveryEnabled;
+		if (isRecognitionException(e)) {
+			let y = e;
+			if (S) {
+				let x = this.findReSyncTokenType();
+				if (this.isInCurrentRuleReSyncSet(x)) if (y.resyncedTokens = this.reSyncTo(x), this.outputCst) {
 					let e = this.CST_STACK[this.CST_STACK.length - 1];
 					return e.recoveredNode = !0, e;
-				} else return n(e);
+				} else return b(e);
 				else {
 					if (this.outputCst) {
 						let e = this.CST_STACK[this.CST_STACK.length - 1];
-						e.recoveredNode = !0, t.partialCstResult = e;
+						e.recoveredNode = !0, y.partialCstResult = e;
 					}
-					throw t;
+					throw y;
 				}
-			} else if (r) return this.moveToTerminatedState(), n(e);
-			else throw t;
+			} else if (x) return this.moveToTerminatedState(), b(e);
+			else throw y;
 		} else throw e;
 	}
-	optionInternal(e, t) {
-		let n = this.getKeyForAutomaticLookahead(512, t);
-		return this.optionInternalLogic(e, t, n);
+	optionInternal(e, y) {
+		let b = this.getKeyForAutomaticLookahead(512, y);
+		return this.optionInternalLogic(e, y, b);
 	}
-	optionInternalLogic(e, t, n) {
-		let r = this.getLaFuncFromCache(n), i;
+	optionInternalLogic(e, y, b) {
+		let x = this.getLaFuncFromCache(b), S;
 		if (typeof e != "function") {
-			i = e.DEF;
-			let t = e.GATE;
-			if (t !== void 0) {
-				let e = r;
-				r = () => t.call(this) && e.call(this);
+			S = e.DEF;
+			let y = e.GATE;
+			if (y !== void 0) {
+				let e = x;
+				x = () => y.call(this) && e.call(this);
 			}
-		} else i = e;
-		if (r.call(this) === !0) return i.call(this);
-	}
-	atLeastOneInternal(e, t) {
-		let n = this.getKeyForAutomaticLookahead(p, e);
-		return this.atLeastOneInternalLogic(e, t, n);
-	}
-	atLeastOneInternalLogic(e, t, n) {
-		let r = this.getLaFuncFromCache(n), i;
-		if (typeof t != "function") {
-			i = t.DEF;
-			let e = t.GATE;
+		} else S = e;
+		if (x.call(this) === !0) return S.call(this);
+	}
+	atLeastOneInternal(e, y) {
+		let b = this.getKeyForAutomaticLookahead(AT_LEAST_ONE_IDX, e);
+		return this.atLeastOneInternalLogic(e, y, b);
+	}
+	atLeastOneInternalLogic(e, y, b) {
+		let x = this.getLaFuncFromCache(b), S;
+		if (typeof y != "function") {
+			S = y.DEF;
+			let e = y.GATE;
 			if (e !== void 0) {
-				let t = r;
-				r = () => e.call(this) && t.call(this);
+				let y = x;
+				x = () => e.call(this) && y.call(this);
 			}
-		} else i = t;
-		if (r.call(this) === !0) {
-			let e = this.doSingleRepetition(i);
-			for (; r.call(this) === !0 && e === !0;) e = this.doSingleRepetition(i);
-		} else throw this.raiseEarlyExitException(e, l.REPETITION_MANDATORY, t.ERR_MSG);
-		this.attemptInRepetitionRecovery(this.atLeastOneInternal, [e, t], r, p, e, o);
-	}
-	atLeastOneSepFirstInternal(e, t) {
-		let n = this.getKeyForAutomaticLookahead(m, e);
-		this.atLeastOneSepFirstInternalLogic(e, t, n);
-	}
-	atLeastOneSepFirstInternalLogic(e, t, n) {
-		let r = t.DEF, i = t.SEP;
-		if (this.getLaFuncFromCache(n).call(this) === !0) {
-			r.call(this);
-			let t = () => this.tokenMatcher(this.LA_FAST(1), i);
-			for (; this.tokenMatcher(this.LA_FAST(1), i) === !0;) this.CONSUME(i), r.call(this);
+		} else S = y;
+		if (x.call(this) === !0) {
+			let e = this.doSingleRepetition(S);
+			for (; x.call(this) === !0 && e === !0;) e = this.doSingleRepetition(S);
+		} else throw this.raiseEarlyExitException(e, PROD_TYPE.REPETITION_MANDATORY, y.ERR_MSG);
+		this.attemptInRepetitionRecovery(this.atLeastOneInternal, [e, y], x, AT_LEAST_ONE_IDX, e, NextTerminalAfterAtLeastOneWalker);
+	}
+	atLeastOneSepFirstInternal(e, y) {
+		let b = this.getKeyForAutomaticLookahead(AT_LEAST_ONE_SEP_IDX, e);
+		this.atLeastOneSepFirstInternalLogic(e, y, b);
+	}
+	atLeastOneSepFirstInternalLogic(e, y, b) {
+		let x = y.DEF, S = y.SEP;
+		if (this.getLaFuncFromCache(b).call(this) === !0) {
+			x.call(this);
+			let y = () => this.tokenMatcher(this.LA_FAST(1), S);
+			for (; this.tokenMatcher(this.LA_FAST(1), S) === !0;) this.CONSUME(S), x.call(this);
 			this.attemptInRepetitionRecovery(this.repetitionSepSecondInternal, [
 				e,
-				i,
-				t,
-				r,
-				a
-			], t, m, e, a);
-		} else throw this.raiseEarlyExitException(e, l.REPETITION_MANDATORY_WITH_SEPARATOR, t.ERR_MSG);
-	}
-	manyInternal(e, t) {
-		let n = this.getKeyForAutomaticLookahead(768, e);
-		return this.manyInternalLogic(e, t, n);
-	}
-	manyInternalLogic(e, t, n) {
-		let r = this.getLaFuncFromCache(n), i;
-		if (typeof t != "function") {
-			i = t.DEF;
-			let e = t.GATE;
+				S,
+				y,
+				x,
+				NextTerminalAfterAtLeastOneSepWalker
+			], y, AT_LEAST_ONE_SEP_IDX, e, NextTerminalAfterAtLeastOneSepWalker);
+		} else throw this.raiseEarlyExitException(e, PROD_TYPE.REPETITION_MANDATORY_WITH_SEPARATOR, y.ERR_MSG);
+	}
+	manyInternal(e, y) {
+		let b = this.getKeyForAutomaticLookahead(768, e);
+		return this.manyInternalLogic(e, y, b);
+	}
+	manyInternalLogic(e, y, b) {
+		let x = this.getLaFuncFromCache(b), S;
+		if (typeof y != "function") {
+			S = y.DEF;
+			let e = y.GATE;
 			if (e !== void 0) {
-				let t = r;
-				r = () => e.call(this) && t.call(this);
+				let y = x;
+				x = () => e.call(this) && y.call(this);
 			}
-		} else i = t;
-		let a = !0;
-		for (; r.call(this) === !0 && a === !0;) a = this.doSingleRepetition(i);
-		this.attemptInRepetitionRecovery(this.manyInternal, [e, t], r, 768, e, c, a);
-	}
-	manySepFirstInternal(e, t) {
-		let n = this.getKeyForAutomaticLookahead(h, e);
-		this.manySepFirstInternalLogic(e, t, n);
-	}
-	manySepFirstInternalLogic(e, t, n) {
-		let r = t.DEF, i = t.SEP;
-		if (this.getLaFuncFromCache(n).call(this) === !0) {
-			r.call(this);
-			let t = () => this.tokenMatcher(this.LA_FAST(1), i);
-			for (; this.tokenMatcher(this.LA_FAST(1), i) === !0;) this.CONSUME(i), r.call(this);
+		} else S = y;
+		let C = !0;
+		for (; x.call(this) === !0 && C === !0;) C = this.doSingleRepetition(S);
+		this.attemptInRepetitionRecovery(this.manyInternal, [e, y], x, 768, e, NextTerminalAfterManyWalker, C);
+	}
+	manySepFirstInternal(e, y) {
+		let b = this.getKeyForAutomaticLookahead(MANY_SEP_IDX, e);
+		this.manySepFirstInternalLogic(e, y, b);
+	}
+	manySepFirstInternalLogic(e, y, b) {
+		let x = y.DEF, S = y.SEP;
+		if (this.getLaFuncFromCache(b).call(this) === !0) {
+			x.call(this);
+			let y = () => this.tokenMatcher(this.LA_FAST(1), S);
+			for (; this.tokenMatcher(this.LA_FAST(1), S) === !0;) this.CONSUME(S), x.call(this);
 			this.attemptInRepetitionRecovery(this.repetitionSepSecondInternal, [
 				e,
-				i,
-				t,
-				r,
-				s
-			], t, h, e, s);
+				S,
+				y,
+				x,
+				NextTerminalAfterManySepWalker
+			], y, MANY_SEP_IDX, e, NextTerminalAfterManySepWalker);
 		}
 	}
-	repetitionSepSecondInternal(e, t, n, r, i) {
-		for (; n();) this.CONSUME(t), r.call(this);
+	repetitionSepSecondInternal(e, y, b, x, S) {
+		for (; b();) this.CONSUME(y), x.call(this);
 		/* istanbul ignore else */
 		this.attemptInRepetitionRecovery(this.repetitionSepSecondInternal, [
 			e,
-			t,
-			n,
-			r,
-			i
-		], n, m, e, i);
+			y,
+			b,
+			x,
+			S
+		], b, AT_LEAST_ONE_SEP_IDX, e, S);
 	}
 	doSingleRepetition(e) {
-		let t = this.getLexerPosition();
-		return e.call(this), this.getLexerPosition() > t;
+		let y = this.getLexerPosition();
+		return e.call(this), this.getLexerPosition() > y;
 	}
-	orInternal(e, t) {
-		let n = this.getKeyForAutomaticLookahead(256, t), r = Array.isArray(e) ? e : e.DEF, i = this.getLaFuncFromCache(n).call(this, r);
-		if (i !== void 0) return r[i].ALT.call(this);
-		this.raiseNoAltException(t, e.ERR_MSG);
+	orInternal(e, y) {
+		let b = this.getKeyForAutomaticLookahead(256, y), x = Array.isArray(e) ? e : e.DEF, S = this.getLaFuncFromCache(b).call(this, x);
+		if (S !== void 0) return x[S].ALT.call(this);
+		this.raiseNoAltException(y, 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();
 	}
-	subruleInternal(e, t, n) {
-		let r;
+	subruleInternal(e, y, b) {
+		let x;
 		try {
-			let i = n === void 0 ? void 0 : n.ARGS;
-			return this.subruleIdx = t, r = e.coreRule.apply(this, i), this.cstPostNonTerminal(r, n !== void 0 && n.LABEL !== void 0 ? n.LABEL : e.ruleName), r;
-		} catch (t) {
-			throw this.subruleInternalError(t, n, e.ruleName);
+			let S = b === void 0 ? void 0 : b.ARGS;
+			return this.subruleIdx = y, x = e.coreRule.apply(this, S), this.cstPostNonTerminal(x, b !== void 0 && b.LABEL !== void 0 ? b.LABEL : e.ruleName), x;
+		} catch (y) {
+			throw this.subruleInternalError(y, b, e.ruleName);
 		}
 	}
-	subruleInternalError(e, t, n) {
-		throw f(e) && e.partialCstResult !== void 0 && (this.cstPostNonTerminal(e.partialCstResult, t !== void 0 && t.LABEL !== void 0 ? t.LABEL : n), delete e.partialCstResult), e;
+	subruleInternalError(e, y, b) {
+		throw isRecognitionException(e) && e.partialCstResult !== void 0 && (this.cstPostNonTerminal(e.partialCstResult, y !== void 0 && y.LABEL !== void 0 ? y.LABEL : b), delete e.partialCstResult), e;
 	}
-	consumeInternal(e, t, n) {
-		let r;
+	consumeInternal(e, y, b) {
+		let x;
 		try {
-			let t = this.LA_FAST(1);
-			this.tokenMatcher(t, e) === !0 ? (this.consumeToken(), r = t) : this.consumeInternalError(e, t, n);
-		} catch (n) {
-			r = this.consumeInternalRecovery(e, t, n);
+			let y = this.LA_FAST(1);
+			this.tokenMatcher(y, e) === !0 ? (this.consumeToken(), x = y) : this.consumeInternalError(e, y, b);
+		} catch (b) {
+			x = this.consumeInternalRecovery(e, y, b);
 		}
-		return this.cstPostTerminal(n !== void 0 && n.LABEL !== void 0 ? n.LABEL : e.name, r), r;
+		return this.cstPostTerminal(b !== void 0 && b.LABEL !== void 0 ? b.LABEL : e.name, x), x;
 	}
-	consumeInternalError(e, t, n) {
-		let r, i = this.LA(0);
-		throw r = n !== void 0 && n.ERR_MSG ? n.ERR_MSG : this.errorMessageProvider.buildMismatchTokenMessage({
+	consumeInternalError(e, y, b) {
+		let x, S = this.LA(0);
+		throw x = b !== void 0 && b.ERR_MSG ? b.ERR_MSG : this.errorMessageProvider.buildMismatchTokenMessage({
 			expected: e,
-			actual: t,
-			previous: i,
+			actual: y,
+			previous: S,
 			ruleName: this.getCurrRuleFullName()
-		}), this.SAVE_ERROR(new u(r, t, i));
+		}), this.SAVE_ERROR(new MismatchedTokenException(x, y, S));
 	}
-	consumeInternalRecovery(e, t, n) {
-		if (this.recoveryEnabled && n.name === "MismatchedTokenException" && !this.isBackTracking()) {
-			let r = this.getFollowsForInRuleRecovery(e, t);
+	consumeInternalRecovery(e, y, b) {
+		if (this.recoveryEnabled && b.name === "MismatchedTokenException" && !this.isBackTracking()) {
+			let x = this.getFollowsForInRuleRecovery(e, y);
 			try {
-				return this.tryInRuleRecovery(e, r);
+				return this.tryInRuleRecovery(e, x);
 			} catch (e) {
-				throw e.name === "InRuleRecoveryException" ? n : e;
+				throw e.name === "InRuleRecoveryException" ? b : e;
 			}
-		} else throw n;
+		} else throw b;
 	}
 	saveRecogState() {
-		let e = this.errors, t = this.RULE_STACK.slice(0, this.RULE_STACK_IDX + 1);
+		let e = this.errors, y = this.RULE_STACK.slice(0, this.RULE_STACK_IDX + 1);
 		return {
 			errors: e,
 			lexerState: this.exportLexerState(),
-			RULE_STACK: t,
+			RULE_STACK: y,
 			CST_STACK: this.CST_STACK
 		};
 	}
 	reloadRecogState(e) {
 		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]);
+		let y = e.RULE_STACK;
+		for (let e = 0; e < y.length; e++) this.RULE_STACK[e] = y[e];
+		this.RULE_STACK_IDX = y.length - 1, this.RULE_STACK_IDX >= 0 && (this.currRuleShortName = this.RULE_STACK[this.RULE_STACK_IDX]);
 	}
-	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);
+	ruleInvocationStateUpdate(e, y, b) {
+		this.RULE_OCCURRENCE_STACK[++this.RULE_OCCURRENCE_STACK_IDX] = b, this.RULE_STACK[++this.RULE_STACK_IDX] = e, this.currRuleShortName = e, this.cstInvocationStateUpdate(y);
 	}
 	isBackTracking() {
 		return this.isBackTrackingStack.length !== 0;
@@ -264,24 +263,23 @@ var v = class {
 		return this.shortRuleNameToFull[e];
 	}
 	isAtEndOfInput() {
-		return this.tokenMatcher(this.LA(1), i);
+		return this.tokenMatcher(this.LA(1), EOF);
 	}
 	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 = [];
 	}
 	onBeforeParse(e) {
-		for (let e = 0; e < this.maxLookahead + 1; e++) this.tokVector.push(_);
+		for (let e = 0; e < this.maxLookahead + 1; e++) this.tokVector.push(END_OF_FILE);
 	}
 	onAfterParse(e) {
 		if (this.isAtEndOfInput() === !1) {
-			let e = this.LA(1), t = this.errorMessageProvider.buildNotAllInputParsedMessage({
+			let e = this.LA(1), y = this.errorMessageProvider.buildNotAllInputParsedMessage({
 				firstRedundant: e,
 				ruleName: this.getCurrRuleFullName()
 			});
-			this.SAVE_ERROR(new d(t, e));
+			this.SAVE_ERROR(new NotAllInputParsedException(y, e));
 		}
-		for (; this.tokVector.at(-1) === _;) this.tokVector.pop();
+		for (; this.tokVector.at(-1) === END_OF_FILE;) this.tokVector.pop();
 	}
 };
-//#endregion
-export { v as RecognizerEngine };
+export { RecognizerEngine };

package/dist/node_modules/chevrotain/lib/src/parse/parser/traits/recoverable.js

@@ -1,19 +1,19 @@
-import { IN as e } from "../../constants.js";
-import { EOF as t, createTokenInstance as n, tokenMatcher as r } from "../../../scan/tokens_public.js";
-import { NextAfterTokenWalker as i } from "../../grammar/interpreter.js";
-import { MismatchedTokenException as a } from "../../exceptions_public.js";
-import { DEFAULT_PARSER_CONFIG as o } from "../parser.js";
-//#region ../../node_modules/chevrotain/lib/src/parse/parser/traits/recoverable.js
-var s = {}, c = "InRuleRecoveryException", l = class extends Error {
+import { IN } from "../../constants.js";
+import { EOF, createTokenInstance, tokenMatcher } from "../../../scan/tokens_public.js";
+import { NextAfterTokenWalker } from "../../grammar/interpreter.js";
+import { MismatchedTokenException } from "../../exceptions_public.js";
+import { DEFAULT_PARSER_CONFIG } from "../parser.js";
+const EOF_FOLLOW_KEY = {}, IN_RULE_RECOVERY_EXCEPTION = "InRuleRecoveryException";
+var InRuleRecoveryException = class extends Error {
 	constructor(e) {
-		super(e), this.name = c;
+		super(e), this.name = IN_RULE_RECOVERY_EXCEPTION;
 	}
-}, u = class {
+}, Recoverable = class {
 	initRecoverable(e) {
-		this.firstAfterRepMap = {}, this.resyncFollows = {}, this.recoveryEnabled = Object.hasOwn(e, "recoveryEnabled") ? e.recoveryEnabled : o.recoveryEnabled, this.recoveryEnabled && (this.attemptInRepetitionRecovery = d);
+		this.firstAfterRepMap = {}, this.resyncFollows = {}, this.recoveryEnabled = Object.hasOwn(e, "recoveryEnabled") ? e.recoveryEnabled : DEFAULT_PARSER_CONFIG.recoveryEnabled, this.recoveryEnabled && (this.attemptInRepetitionRecovery = attemptInRepetitionRecovery);
 	}
 	getTokenToInsert(e) {
-		let t = n(e, "", NaN, NaN, NaN, NaN, NaN, NaN);
+		let t = createTokenInstance(e, "", NaN, NaN, NaN, NaN, NaN, NaN);
 		return t.isInsertedInRecovery = !0, t;
 	}
 	canTokenTypeBeInsertedInRecovery(e) {
@@ -24,7 +24,7 @@ var s = {}, c = "InRuleRecoveryException", l = class extends Error {
 	}
 	tryInRepetitionRecovery(e, t, n, r) {
 		let i = this.findReSyncTokenType(), o = this.exportLexerState(), s = [], c = !1, l = this.LA_FAST(1), u = this.LA_FAST(1), d = () => {
-			let e = this.LA(0), t = new a(this.errorMessageProvider.buildMismatchTokenMessage({
+			let e = this.LA(0), t = new MismatchedTokenException(this.errorMessageProvider.buildMismatchTokenMessage({
 				expected: r,
 				actual: l,
 				previous: e,
@@ -46,7 +46,7 @@ var s = {}, c = "InRuleRecoveryException", l = class extends Error {
 	}
 	getNextPossibleTokenTypes(e) {
 		let t = e.ruleStack[0], n = this.getGAstProductions()[t];
-		return new i(n, e).startWalking();
+		return new NextAfterTokenWalker(n, e).startWalking();
 	}
 	getFollowsForInRuleRecovery(e, t) {
 		let n = this.getCurrentGrammarPath(e, t);
@@ -58,7 +58,7 @@ var s = {}, c = "InRuleRecoveryException", l = class extends Error {
 			let e = this.SKIP_TOKEN();
 			return this.consumeToken(), e;
 		}
-		throw new l("sad sad panda");
+		throw new InRuleRecoveryException("sad sad panda");
 	}
 	canPerformInRuleRecovery(e, t) {
 		return this.canRecoverWithSingleTokenInsertion(e, t) || this.canRecoverWithSingleTokenDeletion(e);
@@ -78,13 +78,13 @@ var s = {}, c = "InRuleRecoveryException", l = class extends Error {
 	findReSyncTokenType() {
 		let e = this.flattenFollowSet(), t = this.LA_FAST(1), n = 2;
 		for (;;) {
-			let i = e.find((e) => r(t, e));
+			let i = e.find((e) => tokenMatcher(t, e));
 			if (i !== void 0) return i;
 			t = this.LA(n), n++;
 		}
 	}
 	getCurrFollowKey() {
-		if (this.RULE_STACK_IDX === 0) return s;
+		if (this.RULE_STACK_IDX === 0) return EOF_FOLLOW_KEY;
 		let e = this.currRuleShortName, t = this.getLastExplicitRuleOccurrenceIndex(), n = this.getPreviousExplicitRuleShortName();
 		return {
 			ruleName: this.shortRuleNameToFullName(e),
@@ -94,7 +94,7 @@ var s = {}, c = "InRuleRecoveryException", l = class extends Error {
 	}
 	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++) i === 0 ? r[i] = s : r[i] = {
+		for (let i = 0; i < n; i++) i === 0 ? r[i] = EOF_FOLLOW_KEY : r[i] = {
 			ruleName: this.shortRuleNameToFullName(e[i]),
 			idxInCallingRule: t[i],
 			inRule: this.shortRuleNameToFullName(e[i - 1])
@@ -105,12 +105,12 @@ var s = {}, c = "InRuleRecoveryException", l = class extends Error {
 		return this.buildFullFollowKeyStack().map((e) => this.getFollowSetFromFollowKey(e)).flat();
 	}
 	getFollowSetFromFollowKey(n) {
-		if (n === s) return [t];
-		let r = n.ruleName + n.idxInCallingRule + e + n.inRule;
+		if (n === EOF_FOLLOW_KEY) return [EOF];
+		let r = n.ruleName + n.idxInCallingRule + IN + n.inRule;
 		return this.resyncFollows[r];
 	}
 	addToResyncTokens(e, n) {
-		return this.tokenMatcher(e, t) || n.push(e), n;
+		return this.tokenMatcher(e, EOF) || n.push(e), n;
 	}
 	reSyncTo(e) {
 		let t = [], n = this.LA_FAST(1);
@@ -132,14 +132,13 @@ var s = {}, c = "InRuleRecoveryException", l = class extends Error {
 		return t;
 	}
 };
-function d(e, n, r, i, a, o, s) {
+function attemptInRepetitionRecovery(e, n, r, i, a, o, s) {
 	let c = this.getKeyForAutomaticLookahead(i, a), l = this.firstAfterRepMap[c];
 	if (l === void 0) {
 		let e = this.getCurrRuleFullName(), t = this.getGAstProductions()[e];
 		l = new o(t, a).startWalking(), this.firstAfterRepMap[c] = l;
 	}
 	let u = l.token, d = l.occurrence, f = l.isEndOfRule;
-	this.RULE_STACK_IDX === 0 && f && u === void 0 && (u = t, d = 1), !(u === void 0 || d === void 0) && this.shouldInRepetitionRecoveryBeTried(u, d, s) && this.tryInRepetitionRecovery(e, n, r, u);
+	this.RULE_STACK_IDX === 0 && f && u === void 0 && (u = EOF, d = 1), !(u === void 0 || d === void 0) && this.shouldInRepetitionRecoveryBeTried(u, d, s) && this.tryInRepetitionRecovery(e, n, r, u);
 }
-//#endregion
-export { c as IN_RULE_RECOVERY_EXCEPTION, u as Recoverable };
+export { IN_RULE_RECOVERY_EXCEPTION, Recoverable };