@loopstack/loopstack-studio 0.25.0 → 0.25.2

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

@@ -1,13 +1,3 @@
-import isObject_default from "../../../../../../lodash-es/isObject.js";
-import isArray_default from "../../../../../../lodash-es/isArray.js";
-import isEmpty_default from "../../../../../../lodash-es/isEmpty.js";
-import flatten_default from "../../../../../../lodash-es/flatten.js";
-import clone_default from "../../../../../../lodash-es/clone.js";
-import every_default from "../../../../../../lodash-es/every.js";
-import has_default from "../../../../../../lodash-es/has.js";
-import values_default from "../../../../../../lodash-es/values.js";
-import reduce_default from "../../../../../../lodash-es/reduce.js";
-import uniq_default from "../../../../../../lodash-es/uniq.js";
 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";
@@ -15,261 +5,281 @@ 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 } from "../parser.js";
+import { DEFAULT_RULE_CONFIG, END_OF_FILE } from "../parser.js";
 var RecognizerEngine = class {
-	initRecognizerEngine(M, N) {
-		if (this.className = this.constructor.name, this.shortRuleNameToFull = {}, this.fullRuleNameToShort = {}, this.ruleShortNameIdx = 256, this.tokenMatcher = tokenStructuredMatcherNoCategories, this.subruleIdx = 0, this.definedRulesNames = [], this.tokensMap = {}, this.isBackTrackingStack = [], this.RULE_STACK = [], this.RULE_OCCURRENCE_STACK = [], this.gastProductionsCache = {}, has_default(N, "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 (isArray_default(M)) {
-			if (isEmpty_default(M)) 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 M[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.");
+	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 (isArray_default(M)) this.tokensMap = reduce_default(M, (l, E) => (l[E.name] = E, l), {});
-		else if (has_default(M, "modes") && every_default(flatten_default(values_default(M.modes)), isTokenType)) this.tokensMap = reduce_default(uniq_default(flatten_default(values_default(M.modes))), (l, E) => (l[E.name] = E, l), {});
-		else if (isObject_default(M)) this.tokensMap = clone_default(M);
+		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 = EOF, this.tokenMatcher = every_default(has_default(M, "modes") ? flatten_default(values_default(M.modes)) : values_default(M), (l) => isEmpty_default(l.categoryMatches)) ? tokenStructuredMatcherNoCategories : tokenStructuredMatcher, augmentTokenTypes(values_default(this.tokensMap));
-	}
-	defineRule(l, E, D) {
-		if (this.selfAnalysisDone) throw Error(`Grammar rule <${l}> 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 O = has_default(D, "resyncEnabled") ? D.resyncEnabled : DEFAULT_RULE_CONFIG.resyncEnabled, k = has_default(D, "recoveryValueFunc") ? D.recoveryValueFunc : DEFAULT_RULE_CONFIG.recoveryValueFunc, A = this.ruleShortNameIdx << 12;
-		this.ruleShortNameIdx++, this.shortRuleNameToFull[A] = l, this.fullRuleNameToShort[l] = A;
-		let j;
-		return j = this.outputCst === !0 ? function(...D) {
+		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, 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 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, l, this.subruleIdx), E.apply(this, D);
-				let O = this.CST_STACK[this.CST_STACK.length - 1];
-				return this.cstPostRule(O), O;
-			} catch (l) {
-				return this.invokeRuleCatch(l, O, k);
+				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, x, S);
 			} finally {
 				this.ruleFinallyStateUpdate();
 			}
-		} : function(...D) {
+		} : function(...b) {
 			try {
-				return this.ruleInvocationStateUpdate(A, l, this.subruleIdx), E.apply(this, D);
-			} catch (l) {
-				return this.invokeRuleCatch(l, O, k);
+				return this.ruleInvocationStateUpdate(C, e, this.subruleIdx), y.apply(this, b);
+			} catch (e) {
+				return this.invokeRuleCatch(e, x, S);
 			} finally {
 				this.ruleFinallyStateUpdate();
 			}
-		}, Object.assign(j, {
-			ruleName: l,
-			originalGrammarAction: E
+		}, Object.assign(function(...y) {
+			this.onBeforeParse(e);
+			try {
+				return w.apply(this, y);
+			} finally {
+				this.onAfterParse(e);
+			}
+		}, {
+			ruleName: e,
+			originalGrammarAction: y,
+			coreRule: w
 		});
 	}
-	invokeRuleCatch(l, E, D) {
-		let O = this.RULE_STACK.length === 1, k = E && !this.isBackTracking() && this.recoveryEnabled;
-		if (isRecognitionException(l)) {
-			let E = l;
-			if (k) {
-				let O = this.findReSyncTokenType();
-				if (this.isInCurrentRuleReSyncSet(O)) if (E.resyncedTokens = this.reSyncTo(O), this.outputCst) {
-					let l = this.CST_STACK[this.CST_STACK.length - 1];
-					return l.recoveredNode = !0, l;
-				} else return D(l);
+	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 b(e);
 				else {
 					if (this.outputCst) {
-						let l = this.CST_STACK[this.CST_STACK.length - 1];
-						l.recoveredNode = !0, E.partialCstResult = l;
+						let e = this.CST_STACK[this.CST_STACK.length - 1];
+						e.recoveredNode = !0, y.partialCstResult = e;
 					}
-					throw E;
+					throw y;
 				}
-			} else if (O) return this.moveToTerminatedState(), D(l);
-			else throw E;
-		} else throw l;
-	}
-	optionInternal(l, E) {
-		let D = this.getKeyForAutomaticLookahead(512, E);
-		return this.optionInternalLogic(l, E, D);
-	}
-	optionInternalLogic(l, E, D) {
-		let O = this.getLaFuncFromCache(D), k;
-		if (typeof l != "function") {
-			k = l.DEF;
-			let E = l.GATE;
-			if (E !== void 0) {
-				let l = O;
-				O = () => E.call(this) && l.call(this);
+			} else if (x) return this.moveToTerminatedState(), b(e);
+			else throw y;
+		} else throw e;
+	}
+	optionInternal(e, y) {
+		let b = this.getKeyForAutomaticLookahead(512, y);
+		return this.optionInternalLogic(e, y, b);
+	}
+	optionInternalLogic(e, y, b) {
+		let x = this.getLaFuncFromCache(b), S;
+		if (typeof e != "function") {
+			S = e.DEF;
+			let y = e.GATE;
+			if (y !== void 0) {
+				let e = x;
+				x = () => y.call(this) && e.call(this);
 			}
-		} else k = l;
-		if (O.call(this) === !0) return k.call(this);
-	}
-	atLeastOneInternal(l, E) {
-		let D = this.getKeyForAutomaticLookahead(AT_LEAST_ONE_IDX, l);
-		return this.atLeastOneInternalLogic(l, E, D);
-	}
-	atLeastOneInternalLogic(l, E, D) {
-		let O = this.getLaFuncFromCache(D), k;
-		if (typeof E != "function") {
-			k = E.DEF;
-			let l = E.GATE;
-			if (l !== void 0) {
-				let E = O;
-				O = () => l.call(this) && E.call(this);
+		} 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 y = x;
+				x = () => e.call(this) && y.call(this);
 			}
-		} else k = E;
-		if (O.call(this) === !0) {
-			let l = this.doSingleRepetition(k);
-			for (; O.call(this) === !0 && l === !0;) l = this.doSingleRepetition(k);
-		} else throw this.raiseEarlyExitException(l, PROD_TYPE.REPETITION_MANDATORY, E.ERR_MSG);
-		this.attemptInRepetitionRecovery(this.atLeastOneInternal, [l, E], O, AT_LEAST_ONE_IDX, l, NextTerminalAfterAtLeastOneWalker);
-	}
-	atLeastOneSepFirstInternal(l, E) {
-		let D = this.getKeyForAutomaticLookahead(AT_LEAST_ONE_SEP_IDX, l);
-		this.atLeastOneSepFirstInternalLogic(l, E, D);
-	}
-	atLeastOneSepFirstInternalLogic(l, E, D) {
-		let O = E.DEF, k = E.SEP;
-		if (this.getLaFuncFromCache(D).call(this) === !0) {
-			O.call(this);
-			let E = () => this.tokenMatcher(this.LA(1), k);
-			for (; this.tokenMatcher(this.LA(1), k) === !0;) this.CONSUME(k), O.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, [
-				l,
-				k,
-				E,
-				O,
+				e,
+				S,
+				y,
+				x,
 				NextTerminalAfterAtLeastOneSepWalker
-			], E, AT_LEAST_ONE_SEP_IDX, l, NextTerminalAfterAtLeastOneSepWalker);
-		} else throw this.raiseEarlyExitException(l, PROD_TYPE.REPETITION_MANDATORY_WITH_SEPARATOR, E.ERR_MSG);
-	}
-	manyInternal(l, E) {
-		let D = this.getKeyForAutomaticLookahead(768, l);
-		return this.manyInternalLogic(l, E, D);
-	}
-	manyInternalLogic(l, E, D) {
-		let O = this.getLaFuncFromCache(D), k;
-		if (typeof E != "function") {
-			k = E.DEF;
-			let l = E.GATE;
-			if (l !== void 0) {
-				let E = O;
-				O = () => l.call(this) && E.call(this);
+			], 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 y = x;
+				x = () => e.call(this) && y.call(this);
 			}
-		} else k = E;
-		let A = !0;
-		for (; O.call(this) === !0 && A === !0;) A = this.doSingleRepetition(k);
-		this.attemptInRepetitionRecovery(this.manyInternal, [l, E], O, 768, l, NextTerminalAfterManyWalker, A);
-	}
-	manySepFirstInternal(l, E) {
-		let D = this.getKeyForAutomaticLookahead(MANY_SEP_IDX, l);
-		this.manySepFirstInternalLogic(l, E, D);
-	}
-	manySepFirstInternalLogic(l, E, D) {
-		let O = E.DEF, k = E.SEP;
-		if (this.getLaFuncFromCache(D).call(this) === !0) {
-			O.call(this);
-			let E = () => this.tokenMatcher(this.LA(1), k);
-			for (; this.tokenMatcher(this.LA(1), k) === !0;) this.CONSUME(k), O.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, [
-				l,
-				k,
-				E,
-				O,
+				e,
+				S,
+				y,
+				x,
 				NextTerminalAfterManySepWalker
-			], E, MANY_SEP_IDX, l, NextTerminalAfterManySepWalker);
+			], y, MANY_SEP_IDX, e, NextTerminalAfterManySepWalker);
 		}
 	}
-	repetitionSepSecondInternal(l, E, D, O, k) {
-		for (; D();) this.CONSUME(E), O.call(this);
+	repetitionSepSecondInternal(e, y, b, x, S) {
+		for (; b();) this.CONSUME(y), x.call(this);
 		/* istanbul ignore else */
 		this.attemptInRepetitionRecovery(this.repetitionSepSecondInternal, [
-			l,
-			E,
-			D,
-			O,
-			k
-		], D, AT_LEAST_ONE_SEP_IDX, l, k);
-	}
-	doSingleRepetition(l) {
-		let E = this.getLexerPosition();
-		return l.call(this), this.getLexerPosition() > E;
-	}
-	orInternal(l, D) {
-		let O = this.getKeyForAutomaticLookahead(256, D), k = isArray_default(l) ? l : l.DEF, A = this.getLaFuncFromCache(O).call(this, k);
-		if (A !== void 0) return k[A].ALT.call(this);
-		this.raiseNoAltException(D, l.ERR_MSG);
+			e,
+			y,
+			b,
+			x,
+			S
+		], b, AT_LEAST_ONE_SEP_IDX, e, S);
+	}
+	doSingleRepetition(e) {
+		let y = this.getLexerPosition();
+		return e.call(this), this.getLexerPosition() > y;
+	}
+	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() {
-		if (this.RULE_STACK.pop(), this.RULE_OCCURRENCE_STACK.pop(), this.cstFinallyStateUpdate(), this.RULE_STACK.length === 0 && this.isAtEndOfInput() === !1) {
-			let l = this.LA(1), E = this.errorMessageProvider.buildNotAllInputParsedMessage({
-				firstRedundant: l,
-				ruleName: this.getCurrRuleFullName()
-			});
-			this.SAVE_ERROR(new NotAllInputParsedException(E, l));
-		}
+		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(l, E, D) {
-		let O;
+	subruleInternal(e, y, b) {
+		let x;
 		try {
-			let k = D === void 0 ? void 0 : D.ARGS;
-			return this.subruleIdx = E, O = l.apply(this, k), this.cstPostNonTerminal(O, D !== void 0 && D.LABEL !== void 0 ? D.LABEL : l.ruleName), O;
-		} catch (E) {
-			throw this.subruleInternalError(E, D, l.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(l, E, D) {
-		throw isRecognitionException(l) && l.partialCstResult !== void 0 && (this.cstPostNonTerminal(l.partialCstResult, E !== void 0 && E.LABEL !== void 0 ? E.LABEL : D), delete l.partialCstResult), l;
+	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(l, E, D) {
-		let O;
+	consumeInternal(e, y, b) {
+		let x;
 		try {
-			let E = this.LA(1);
-			this.tokenMatcher(E, l) === !0 ? (this.consumeToken(), O = E) : this.consumeInternalError(l, E, D);
-		} catch (D) {
-			O = this.consumeInternalRecovery(l, E, D);
+			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(D !== void 0 && D.LABEL !== void 0 ? D.LABEL : l.name, O), O;
-	}
-	consumeInternalError(l, E, D) {
-		let O, k = this.LA(0);
-		throw O = D !== void 0 && D.ERR_MSG ? D.ERR_MSG : this.errorMessageProvider.buildMismatchTokenMessage({
-			expected: l,
-			actual: E,
-			previous: k,
+		return this.cstPostTerminal(b !== void 0 && b.LABEL !== void 0 ? b.LABEL : e.name, x), x;
+	}
+	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: y,
+			previous: S,
 			ruleName: this.getCurrRuleFullName()
-		}), this.SAVE_ERROR(new MismatchedTokenException(O, E, k));
+		}), this.SAVE_ERROR(new MismatchedTokenException(x, y, S));
 	}
-	consumeInternalRecovery(l, E, D) {
-		if (this.recoveryEnabled && D.name === "MismatchedTokenException" && !this.isBackTracking()) {
-			let O = this.getFollowsForInRuleRecovery(l, E);
+	consumeInternalRecovery(e, y, b) {
+		if (this.recoveryEnabled && b.name === "MismatchedTokenException" && !this.isBackTracking()) {
+			let x = this.getFollowsForInRuleRecovery(e, y);
 			try {
-				return this.tryInRuleRecovery(l, O);
-			} catch (l) {
-				throw l.name === "InRuleRecoveryException" ? D : l;
+				return this.tryInRuleRecovery(e, x);
+			} catch (e) {
+				throw e.name === "InRuleRecoveryException" ? b : e;
 			}
-		} else throw D;
+		} else throw b;
 	}
 	saveRecogState() {
-		let l = this.errors, E = clone_default(this.RULE_STACK);
+		let e = this.errors, y = this.RULE_STACK.slice(0, this.RULE_STACK_IDX + 1);
 		return {
-			errors: l,
+			errors: e,
 			lexerState: this.exportLexerState(),
-			RULE_STACK: E,
+			RULE_STACK: y,
 			CST_STACK: this.CST_STACK
 		};
 	}
-	reloadRecogState(l) {
-		this.errors = l.errors, this.importLexerState(l.lexerState), this.RULE_STACK = l.RULE_STACK;
+	reloadRecogState(e) {
+		this.errors = e.errors, this.importLexerState(e.lexerState);
+		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(l, E, D) {
-		this.RULE_OCCURRENCE_STACK.push(D), this.RULE_STACK.push(l), this.cstInvocationStateUpdate(E);
+	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;
 	}
 	getCurrRuleFullName() {
-		let l = this.getLastExplicitRuleShortName();
-		return this.shortRuleNameToFull[l];
+		let e = this.currRuleShortName;
+		return this.shortRuleNameToFull[e];
 	}
-	shortRuleNameToFullName(l) {
-		return this.shortRuleNameToFull[l];
+	shortRuleNameToFullName(e) {
+		return this.shortRuleNameToFull[e];
 	}
 	isAtEndOfInput() {
 		return this.tokenMatcher(this.LA(1), EOF);
 	}
 	reset() {
-		this.resetLexerState(), this.subruleIdx = 0, this.isBackTrackingStack = [], this.errors = [], this.RULE_STACK = [], this.CST_STACK = [], this.RULE_OCCURRENCE_STACK = [];
+		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(END_OF_FILE);
+	}
+	onAfterParse(e) {
+		if (this.isAtEndOfInput() === !1) {
+			let e = this.LA(1), y = this.errorMessageProvider.buildNotAllInputParsedMessage({
+				firstRedundant: e,
+				ruleName: this.getCurrRuleFullName()
+			});
+			this.SAVE_ERROR(new NotAllInputParsedException(y, e));
+		}
+		for (; this.tokVector.at(-1) === END_OF_FILE;) this.tokVector.pop();
 	}
 };
 export { RecognizerEngine };