@loopstack/loopstack-studio 0.24.0 → 0.25.1

package/dist/node_modules/chevrotain/lib/src/parse/grammar/lookahead.js

@@ -1,248 +1,243 @@
-import isEmpty_default from "../../../../../lodash-es/isEmpty.js";
-import flatten_default from "../../../../../lodash-es/flatten.js";
-import forEach_default from "../../../../../lodash-es/forEach.js";
-import every_default from "../../../../../lodash-es/every.js";
-import map_default from "../../../../../lodash-es/map.js";
-import has_default from "../../../../../lodash-es/has.js";
-import reduce_default from "../../../../../lodash-es/reduce.js";
-import { Alternation, Alternative, Option, Repetition, RepetitionMandatory, RepetitionMandatoryWithSeparator, RepetitionWithSeparator } from "../../../../../@chevrotain/gast/lib/src/model.js";
-import { GAstVisitor } from "../../../../../@chevrotain/gast/lib/src/visitor.js";
-import { RestWalker } from "./rest.js";
-import { tokenStructuredMatcher, tokenStructuredMatcherNoCategories } from "../../scan/tokens.js";
-import { possiblePathsFrom } from "./interpreter.js";
-var PROD_TYPE;
-(function(a) {
-	a[a.OPTION = 0] = "OPTION", a[a.REPETITION = 1] = "REPETITION", a[a.REPETITION_MANDATORY = 2] = "REPETITION_MANDATORY", a[a.REPETITION_MANDATORY_WITH_SEPARATOR = 3] = "REPETITION_MANDATORY_WITH_SEPARATOR", a[a.REPETITION_WITH_SEPARATOR = 4] = "REPETITION_WITH_SEPARATOR", a[a.ALTERNATION = 5] = "ALTERNATION";
-})(PROD_TYPE ||= {});
-function getProdType(a) {
+import { Alternation as e, Alternative as t, Option as n, Repetition as r, RepetitionMandatory as i, RepetitionMandatoryWithSeparator as a, RepetitionWithSeparator as o } from "../../../../../@chevrotain/gast/lib/src/model.js";
+import { GAstVisitor as s } from "../../../../../@chevrotain/gast/lib/src/visitor.js";
+import { RestWalker as c } from "./rest.js";
+import { tokenStructuredMatcher as l, tokenStructuredMatcherNoCategories as u } from "../../scan/tokens.js";
+import { possiblePathsFrom as d } from "./interpreter.js";
+//#region ../../node_modules/chevrotain/lib/src/parse/grammar/lookahead.js
+var f;
+(function(e) {
+	e[e.OPTION = 0] = "OPTION", e[e.REPETITION = 1] = "REPETITION", e[e.REPETITION_MANDATORY = 2] = "REPETITION_MANDATORY", e[e.REPETITION_MANDATORY_WITH_SEPARATOR = 3] = "REPETITION_MANDATORY_WITH_SEPARATOR", e[e.REPETITION_WITH_SEPARATOR = 4] = "REPETITION_WITH_SEPARATOR", e[e.ALTERNATION = 5] = "ALTERNATION";
+})(f ||= {});
+function p(t) {
 	/* istanbul ignore else */
-	if (a instanceof Option || a === "Option") return PROD_TYPE.OPTION;
-	if (a instanceof Repetition || a === "Repetition") return PROD_TYPE.REPETITION;
-	if (a instanceof RepetitionMandatory || a === "RepetitionMandatory") return PROD_TYPE.REPETITION_MANDATORY;
-	if (a instanceof RepetitionMandatoryWithSeparator || a === "RepetitionMandatoryWithSeparator") return PROD_TYPE.REPETITION_MANDATORY_WITH_SEPARATOR;
-	if (a instanceof RepetitionWithSeparator || a === "RepetitionWithSeparator") return PROD_TYPE.REPETITION_WITH_SEPARATOR;
-	if (a instanceof Alternation || a === "Alternation") return PROD_TYPE.ALTERNATION;
+	if (t instanceof n || t === "Option") return f.OPTION;
+	if (t instanceof r || t === "Repetition") return f.REPETITION;
+	if (t instanceof i || t === "RepetitionMandatory") return f.REPETITION_MANDATORY;
+	if (t instanceof a || t === "RepetitionMandatoryWithSeparator") return f.REPETITION_MANDATORY_WITH_SEPARATOR;
+	if (t instanceof o || t === "RepetitionWithSeparator") return f.REPETITION_WITH_SEPARATOR;
+	if (t instanceof e || t === "Alternation") return f.ALTERNATION;
 	throw Error("non exhaustive match");
 }
-function getLookaheadPaths(a) {
-	let { occurrence: T, rule: E, prodType: D, maxLookahead: O } = a, k = getProdType(D);
-	return k === PROD_TYPE.ALTERNATION ? getLookaheadPathsForOr(T, E, O) : getLookaheadPathsForOptionalProd(T, E, k, O);
+function m(e) {
+	let { occurrence: t, rule: n, prodType: r, maxLookahead: i } = e, a = p(r);
+	return a === f.ALTERNATION ? T(t, n, i) : E(t, n, a, i);
 }
-function buildLookaheadFuncForOr(a, T, E, D, O, k) {
-	let A = getLookaheadPathsForOr(a, T, E);
-	return k(A, D, areTokenCategoriesNotUsed(A) ? tokenStructuredMatcherNoCategories : tokenStructuredMatcher, O);
+function h(e, t, n, r, i, a) {
+	let o = T(e, t, n);
+	return a(o, r, k(o) ? u : l, i);
 }
-function buildLookaheadFuncForOptionalProd(a, T, E, D, O, k) {
-	let A = getLookaheadPathsForOptionalProd(a, T, O, E), j = areTokenCategoriesNotUsed(A) ? tokenStructuredMatcherNoCategories : tokenStructuredMatcher;
-	return k(A[0], j, D);
+function g(e, t, n, r, i, a) {
+	let o = E(e, t, i, n), s = k(o) ? u : l;
+	return a(o[0], s, r);
 }
-function buildAlternativesLookAheadFunc(a, j, M, N) {
-	let P = a.length, F = every_default(a, (a) => every_default(a, (a) => a.length === 1));
-	if (j) return function(T) {
-		let E = map_default(T, (a) => a.GATE);
-		for (let T = 0; T < P; T++) {
-			let D = a[T], O = D.length, k = E[T];
-			if (!(k !== void 0 && k.call(this) === !1)) nextPath: for (let a = 0; a < O; a++) {
-				let E = D[a], O = E.length;
-				for (let a = 0; a < O; a++) if (M(this.LA(a + 1), E[a]) === !1) continue nextPath;
-				return T;
+function _(e, t, n, r) {
+	let i = e.length, a = e.every((e) => e.every((e) => e.length === 1));
+	if (t) return function(t) {
+		let r = t.map((e) => e.GATE);
+		for (let t = 0; t < i; t++) {
+			let i = e[t], a = i.length, o = r[t];
+			if (!(o !== void 0 && o.call(this) === !1)) nextPath: for (let e = 0; e < a; e++) {
+				let r = i[e], a = r.length;
+				for (let e = 0; e < a; e++) if (n(this.LA_FAST(e + 1), r[e]) === !1) continue nextPath;
+				return t;
 			}
 		}
 	};
-	if (F && !N) {
-		let D = reduce_default(map_default(a, (a) => flatten_default(a)), (a, T, D) => (forEach_default(T, (T) => {
-			has_default(a, T.tokenTypeIdx) || (a[T.tokenTypeIdx] = D), forEach_default(T.categoryMatches, (T) => {
-				has_default(a, T) || (a[T] = D);
+	if (a && !r) {
+		let t = e.map((e) => e.flat()).reduce((e, t, n) => (t.forEach((t) => {
+			t.tokenTypeIdx in e || (e[t.tokenTypeIdx] = n), t.categoryMatches.forEach((t) => {
+				Object.hasOwn(e, t) || (e[t] = n);
 			});
-		}), a), {});
+		}), e), {});
 		return function() {
-			return D[this.LA(1).tokenTypeIdx];
+			return t[this.LA_FAST(1).tokenTypeIdx];
 		};
 	} else return function() {
-		for (let T = 0; T < P; T++) {
-			let E = a[T], D = E.length;
-			nextPath: for (let a = 0; a < D; a++) {
-				let D = E[a], O = D.length;
-				for (let a = 0; a < O; a++) if (M(this.LA(a + 1), D[a]) === !1) continue nextPath;
-				return T;
+		for (let t = 0; t < i; t++) {
+			let r = e[t], i = r.length;
+			nextPath: for (let e = 0; e < i; e++) {
+				let i = r[e], a = i.length;
+				for (let e = 0; e < a; e++) if (n(this.LA_FAST(e + 1), i[e]) === !1) continue nextPath;
+				return t;
 			}
 		}
 	};
 }
-function buildSingleAlternativeLookaheadFunction(O, k, j) {
-	let M = every_default(O, (a) => a.length === 1), N = O.length;
-	if (M && !j) {
-		let D = flatten_default(O);
-		if (D.length === 1 && isEmpty_default(D[0].categoryMatches)) {
-			let a = D[0].tokenTypeIdx;
+function v(e, t, n) {
+	let r = e.every((e) => e.length === 1), i = e.length;
+	if (r && !n) {
+		let t = e.flat();
+		if (t.length === 1 && t[0].categoryMatches.length === 0) {
+			let e = t[0].tokenTypeIdx;
 			return function() {
-				return this.LA(1).tokenTypeIdx === a;
+				return this.LA_FAST(1).tokenTypeIdx === e;
 			};
 		} else {
-			let a = reduce_default(D, (a, T, D) => (a[T.tokenTypeIdx] = !0, forEach_default(T.categoryMatches, (T) => {
-				a[T] = !0;
-			}), a), []);
+			let e = t.reduce((e, t, n) => (e[t.tokenTypeIdx] = !0, t.categoryMatches.forEach((t) => {
+				e[t] = !0;
+			}), e), []);
 			return function() {
-				return a[this.LA(1).tokenTypeIdx] === !0;
+				return e[this.LA_FAST(1).tokenTypeIdx] === !0;
 			};
 		}
 	} else return function() {
-		nextPath: for (let a = 0; a < N; a++) {
-			let T = O[a], E = T.length;
-			for (let a = 0; a < E; a++) if (k(this.LA(a + 1), T[a]) === !1) continue nextPath;
+		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_FAST(e + 1), r[e]) === !1) continue nextPath;
 			return !0;
 		}
 		return !1;
 	};
 }
-var RestDefinitionFinderWalker = class extends RestWalker {
-	constructor(a, T, E) {
-		super(), this.topProd = a, this.targetOccurrence = T, this.targetProdType = E;
+var y = class extends c {
+	constructor(e, t, n) {
+		super(), this.topProd = e, this.targetOccurrence = t, this.targetProdType = n;
 	}
 	startWalking() {
 		return this.walk(this.topProd), this.restDef;
 	}
-	checkIsTarget(a, T, E, D) {
-		return a.idx === this.targetOccurrence && this.targetProdType === T ? (this.restDef = E.concat(D), !0) : !1;
+	checkIsTarget(e, t, n, r) {
+		return e.idx === this.targetOccurrence && this.targetProdType === t ? (this.restDef = n.concat(r), !0) : !1;
 	}
-	walkOption(a, T, E) {
-		this.checkIsTarget(a, PROD_TYPE.OPTION, T, E) || super.walkOption(a, T, E);
+	walkOption(e, t, n) {
+		this.checkIsTarget(e, f.OPTION, t, n) || super.walkOption(e, t, n);
 	}
-	walkAtLeastOne(a, T, E) {
-		this.checkIsTarget(a, PROD_TYPE.REPETITION_MANDATORY, T, E) || super.walkOption(a, T, E);
+	walkAtLeastOne(e, t, n) {
+		this.checkIsTarget(e, f.REPETITION_MANDATORY, t, n) || super.walkOption(e, t, n);
 	}
-	walkAtLeastOneSep(a, T, E) {
-		this.checkIsTarget(a, PROD_TYPE.REPETITION_MANDATORY_WITH_SEPARATOR, T, E) || super.walkOption(a, T, E);
+	walkAtLeastOneSep(e, t, n) {
+		this.checkIsTarget(e, f.REPETITION_MANDATORY_WITH_SEPARATOR, t, n) || super.walkOption(e, t, n);
 	}
-	walkMany(a, T, E) {
-		this.checkIsTarget(a, PROD_TYPE.REPETITION, T, E) || super.walkOption(a, T, E);
+	walkMany(e, t, n) {
+		this.checkIsTarget(e, f.REPETITION, t, n) || super.walkOption(e, t, n);
 	}
-	walkManySep(a, T, E) {
-		this.checkIsTarget(a, PROD_TYPE.REPETITION_WITH_SEPARATOR, T, E) || super.walkOption(a, T, E);
+	walkManySep(e, t, n) {
+		this.checkIsTarget(e, f.REPETITION_WITH_SEPARATOR, t, n) || super.walkOption(e, t, n);
 	}
-}, InsideDefinitionFinderVisitor = class extends GAstVisitor {
-	constructor(a, T, E) {
-		super(), this.targetOccurrence = a, this.targetProdType = T, this.targetRef = E, this.result = [];
+}, b = class extends s {
+	constructor(e, t, n) {
+		super(), this.targetOccurrence = e, this.targetProdType = t, this.targetRef = n, this.result = [];
 	}
-	checkIsTarget(a, T) {
-		a.idx === this.targetOccurrence && this.targetProdType === T && (this.targetRef === void 0 || a === this.targetRef) && (this.result = a.definition);
+	checkIsTarget(e, t) {
+		e.idx === this.targetOccurrence && this.targetProdType === t && (this.targetRef === void 0 || e === this.targetRef) && (this.result = e.definition);
 	}
-	visitOption(a) {
-		this.checkIsTarget(a, PROD_TYPE.OPTION);
+	visitOption(e) {
+		this.checkIsTarget(e, f.OPTION);
 	}
-	visitRepetition(a) {
-		this.checkIsTarget(a, PROD_TYPE.REPETITION);
+	visitRepetition(e) {
+		this.checkIsTarget(e, f.REPETITION);
 	}
-	visitRepetitionMandatory(a) {
-		this.checkIsTarget(a, PROD_TYPE.REPETITION_MANDATORY);
+	visitRepetitionMandatory(e) {
+		this.checkIsTarget(e, f.REPETITION_MANDATORY);
 	}
-	visitRepetitionMandatoryWithSeparator(a) {
-		this.checkIsTarget(a, PROD_TYPE.REPETITION_MANDATORY_WITH_SEPARATOR);
+	visitRepetitionMandatoryWithSeparator(e) {
+		this.checkIsTarget(e, f.REPETITION_MANDATORY_WITH_SEPARATOR);
 	}
-	visitRepetitionWithSeparator(a) {
-		this.checkIsTarget(a, PROD_TYPE.REPETITION_WITH_SEPARATOR);
+	visitRepetitionWithSeparator(e) {
+		this.checkIsTarget(e, f.REPETITION_WITH_SEPARATOR);
 	}
-	visitAlternation(a) {
-		this.checkIsTarget(a, PROD_TYPE.ALTERNATION);
+	visitAlternation(e) {
+		this.checkIsTarget(e, f.ALTERNATION);
 	}
 };
-function initializeArrayOfArrays(a) {
-	let T = Array(a);
-	for (let E = 0; E < a; E++) T[E] = [];
-	return T;
+function x(e) {
+	let t = Array(e);
+	for (let n = 0; n < e; n++) t[n] = [];
+	return t;
 }
-function pathToHashKeys(a) {
-	let T = [""];
-	for (let E = 0; E < a.length; E++) {
-		let D = a[E], O = [];
-		for (let a = 0; a < T.length; a++) {
-			let E = T[a];
-			O.push(E + "_" + D.tokenTypeIdx);
-			for (let a = 0; a < D.categoryMatches.length; a++) {
-				let T = "_" + D.categoryMatches[a];
-				O.push(E + T);
+function S(e) {
+	let t = [""];
+	for (let n = 0; n < e.length; n++) {
+		let r = e[n], i = [];
+		for (let e = 0; e < t.length; e++) {
+			let n = t[e];
+			i.push(n + "_" + r.tokenTypeIdx);
+			for (let e = 0; e < r.categoryMatches.length; e++) {
+				let t = "_" + r.categoryMatches[e];
+				i.push(n + t);
 			}
 		}
-		T = O;
+		t = i;
 	}
-	return T;
+	return t;
 }
-function isUniquePrefixHash(a, T, E) {
-	for (let D = 0; D < a.length; D++) {
-		if (D === E) continue;
-		let O = a[D];
-		for (let a = 0; a < T.length; a++) if (O[T[a]] === !0) return !1;
+function C(e, t, n) {
+	for (let r = 0; r < e.length; r++) {
+		if (r === n) continue;
+		let i = e[r];
+		for (let e = 0; e < t.length; e++) if (i[t[e]] === !0) return !1;
 	}
 	return !0;
 }
-function lookAheadSequenceFromAlternatives(T, D) {
-	let k = map_default(T, (a) => possiblePathsFrom([a], 1)), A = initializeArrayOfArrays(k.length), j = map_default(k, (a) => {
-		let T = {};
-		return forEach_default(a, (a) => {
-			forEach_default(pathToHashKeys(a.partialPath), (a) => {
-				T[a] = !0;
+function w(e, t) {
+	let n = e.map((e) => d([e], 1)), r = x(n.length), i = n.map((e) => {
+		let t = {};
+		return e.forEach((e) => {
+			S(e.partialPath).forEach((e) => {
+				t[e] = !0;
 			});
-		}), T;
-	}), M = k;
-	for (let T = 1; T <= D; T++) {
-		let O = M;
-		M = initializeArrayOfArrays(O.length);
-		for (let k = 0; k < O.length; k++) {
-			let N = O[k];
-			for (let O = 0; O < N.length; O++) {
-				let P = N[O].partialPath, F = N[O].suffixDef, I = pathToHashKeys(P);
-				if (isUniquePrefixHash(j, I, k) || isEmpty_default(F) || P.length === D) {
-					let a = A[k];
-					if (containsPath(a, P) === !1) {
-						a.push(P);
-						for (let a = 0; a < I.length; a++) {
-							let T = I[a];
-							j[k][T] = !0;
+		}), t;
+	}), a = n;
+	for (let e = 1; e <= t; e++) {
+		let n = a;
+		a = x(n.length);
+		for (let o = 0; o < n.length; o++) {
+			let s = n[o];
+			for (let n = 0; n < s.length; n++) {
+				let c = s[n].partialPath, l = s[n].suffixDef, u = S(c);
+				if (C(i, u, o) || l.length === 0 || c.length === t) {
+					let e = r[o];
+					if (D(e, c) === !1) {
+						e.push(c);
+						for (let e = 0; e < u.length; e++) {
+							let t = u[e];
+							i[o][t] = !0;
 						}
 					}
 				} else {
-					let a = possiblePathsFrom(F, T + 1, P);
-					M[k] = M[k].concat(a), forEach_default(a, (a) => {
-						forEach_default(pathToHashKeys(a.partialPath), (a) => {
-							j[k][a] = !0;
+					let t = d(l, e + 1, c);
+					a[o] = a[o].concat(t), t.forEach((e) => {
+						S(e.partialPath).forEach((e) => {
+							i[o][e] = !0;
 						});
 					});
 				}
 			}
 		}
 	}
-	return A;
+	return r;
 }
-function getLookaheadPathsForOr(a, T, E, D) {
-	let O = new InsideDefinitionFinderVisitor(a, PROD_TYPE.ALTERNATION, D);
-	return T.accept(O), lookAheadSequenceFromAlternatives(O.result, E);
+function T(e, t, n, r) {
+	let i = new b(e, f.ALTERNATION, r);
+	return t.accept(i), w(i.result, n);
 }
-function getLookaheadPathsForOptionalProd(a, T, E, D) {
-	let O = new InsideDefinitionFinderVisitor(a, E);
-	T.accept(O);
-	let k = O.result, A = new RestDefinitionFinderWalker(T, a, E).startWalking();
-	return lookAheadSequenceFromAlternatives([new Alternative({ definition: k }), new Alternative({ definition: A })], D);
+function E(e, n, r, i) {
+	let a = new b(e, r);
+	n.accept(a);
+	let o = a.result, s = new y(n, e, r).startWalking();
+	return w([new t({ definition: o }), new t({ definition: s })], i);
 }
-function containsPath(a, T) {
-	compareOtherPath: for (let E = 0; E < a.length; E++) {
-		let D = a[E];
-		if (D.length === T.length) {
-			for (let a = 0; a < D.length; a++) {
-				let E = T[a], O = D[a];
-				if (!(E === O || O.categoryMatchesMap[E.tokenTypeIdx] !== void 0)) continue compareOtherPath;
+function D(e, t) {
+	compareOtherPath: for (let n = 0; n < e.length; n++) {
+		let r = e[n];
+		if (r.length === t.length) {
+			for (let e = 0; e < r.length; e++) {
+				let n = t[e], i = r[e];
+				if (!(n === i || i.categoryMatchesMap[n.tokenTypeIdx] !== void 0)) continue compareOtherPath;
 			}
 			return !0;
 		}
 	}
 	return !1;
 }
-function isStrictPrefixOfPath(a, T) {
-	return a.length < T.length && every_default(a, (a, E) => {
-		let D = T[E];
-		return a === D || D.categoryMatchesMap[a.tokenTypeIdx];
+function O(e, t) {
+	return e.length < t.length && e.every((e, n) => {
+		let r = t[n];
+		return e === r || r.categoryMatchesMap[e.tokenTypeIdx];
 	});
 }
-function areTokenCategoriesNotUsed(T) {
-	return every_default(T, (T) => every_default(T, (T) => every_default(T, (T) => isEmpty_default(T.categoryMatches))));
+function k(e) {
+	return e.every((e) => e.every((e) => e.every((e) => e.categoryMatches.length === 0)));
 }
-export { PROD_TYPE, buildAlternativesLookAheadFunc, buildLookaheadFuncForOptionalProd, buildLookaheadFuncForOr, buildSingleAlternativeLookaheadFunction, containsPath, getLookaheadPaths, getLookaheadPathsForOptionalProd, getLookaheadPathsForOr, getProdType, isStrictPrefixOfPath };
+//#endregion
+export { f as PROD_TYPE, _ as buildAlternativesLookAheadFunc, g as buildLookaheadFuncForOptionalProd, h as buildLookaheadFuncForOr, v as buildSingleAlternativeLookaheadFunction, D as containsPath, m as getLookaheadPaths, E as getLookaheadPathsForOptionalProd, T as getLookaheadPathsForOr, p as getProdType, O as isStrictPrefixOfPath };

package/dist/node_modules/chevrotain/lib/src/parse/grammar/resolver.js

@@ -1,32 +1,32 @@
-import forEach_default from "../../../../../lodash-es/forEach.js";
-import values_default from "../../../../../lodash-es/values.js";
-import { GAstVisitor } from "../../../../../@chevrotain/gast/lib/src/visitor.js";
-import { ParserDefinitionErrorType } from "../parser/parser.js";
-function resolveGrammar(e, i) {
-	let a = new GastRefResolverVisitor(e, i);
-	return a.resolveRefs(), a.errors;
+import { GAstVisitor as e } from "../../../../../@chevrotain/gast/lib/src/visitor.js";
+import { ParserDefinitionErrorType as t } from "../parser/parser.js";
+//#region ../../node_modules/chevrotain/lib/src/parse/grammar/resolver.js
+function n(e, t) {
+	let n = new r(e, t);
+	return n.resolveRefs(), n.errors;
 }
-var GastRefResolverVisitor = class extends GAstVisitor {
-	constructor(e, i) {
-		super(), this.nameToTopRule = e, this.errMsgProvider = i, this.errors = [];
+var r = class extends e {
+	constructor(e, t) {
+		super(), this.nameToTopRule = e, this.errMsgProvider = t, this.errors = [];
 	}
 	resolveRefs() {
-		forEach_default(values_default(this.nameToTopRule), (e) => {
+		Object.values(this.nameToTopRule).forEach((e) => {
 			this.currTopLevel = e, e.accept(this);
 		});
 	}
 	visitNonTerminal(e) {
-		let i = this.nameToTopRule[e.nonTerminalName];
-		if (i) e.referencedRule = i;
+		let n = this.nameToTopRule[e.nonTerminalName];
+		if (n) e.referencedRule = n;
 		else {
-			let i = this.errMsgProvider.buildRuleNotFoundError(this.currTopLevel, e);
+			let n = this.errMsgProvider.buildRuleNotFoundError(this.currTopLevel, e);
 			this.errors.push({
-				message: i,
-				type: ParserDefinitionErrorType.UNRESOLVED_SUBRULE_REF,
+				message: n,
+				type: t.UNRESOLVED_SUBRULE_REF,
 				ruleName: this.currTopLevel.name,
 				unresolvedRefName: e.nonTerminalName
 			});
 		}
 	}
 };
-export { resolveGrammar };
+//#endregion
+export { n as resolveGrammar };

package/dist/node_modules/chevrotain/lib/src/parse/grammar/rest.js

@@ -1,58 +1,58 @@
-import drop_default from "../../../../../lodash-es/drop.js";
-import forEach_default from "../../../../../lodash-es/forEach.js";
-import { Alternation, Alternative, NonTerminal, Option, Repetition, RepetitionMandatory, RepetitionMandatoryWithSeparator, RepetitionWithSeparator, Terminal } from "../../../../../@chevrotain/gast/lib/src/model.js";
-var RestWalker = class {
-	walk(d, f = []) {
-		forEach_default(d.definition, (o, p) => {
-			let m = drop_default(d.definition, p + 1);
+import { Alternation as e, Alternative as t, NonTerminal as n, Option as r, Repetition as i, RepetitionMandatory as a, RepetitionMandatoryWithSeparator as o, RepetitionWithSeparator as s, Terminal as c } from "../../../../../@chevrotain/gast/lib/src/model.js";
+//#region ../../node_modules/chevrotain/lib/src/parse/grammar/rest.js
+var l = class {
+	walk(l, u = []) {
+		l.definition.forEach((d, f) => {
+			let p = l.definition.slice(f + 1);
 			/* istanbul ignore else */
-			if (o instanceof NonTerminal) this.walkProdRef(o, m, f);
-			else if (o instanceof Terminal) this.walkTerminal(o, m, f);
-			else if (o instanceof Alternative) this.walkFlat(o, m, f);
-			else if (o instanceof Option) this.walkOption(o, m, f);
-			else if (o instanceof RepetitionMandatory) this.walkAtLeastOne(o, m, f);
-			else if (o instanceof RepetitionMandatoryWithSeparator) this.walkAtLeastOneSep(o, m, f);
-			else if (o instanceof RepetitionWithSeparator) this.walkManySep(o, m, f);
-			else if (o instanceof Repetition) this.walkMany(o, m, f);
-			else if (o instanceof Alternation) this.walkOr(o, m, f);
+			if (d instanceof n) this.walkProdRef(d, p, u);
+			else if (d instanceof c) this.walkTerminal(d, p, u);
+			else if (d instanceof t) this.walkFlat(d, p, u);
+			else if (d instanceof r) this.walkOption(d, p, u);
+			else if (d instanceof a) this.walkAtLeastOne(d, p, u);
+			else if (d instanceof o) this.walkAtLeastOneSep(d, p, u);
+			else if (d instanceof s) this.walkManySep(d, p, u);
+			else if (d instanceof i) this.walkMany(d, p, u);
+			else if (d instanceof e) this.walkOr(d, p, u);
 			else throw Error("non exhaustive match");
 		});
 	}
-	walkTerminal(e, o, s) {}
-	walkProdRef(e, o, s) {}
-	walkFlat(e, o, s) {
-		let c = o.concat(s);
-		this.walk(e, c);
-	}
-	walkOption(e, o, s) {
-		let c = o.concat(s);
-		this.walk(e, c);
-	}
-	walkAtLeastOne(e, o, s) {
-		let c = [new Option({ definition: e.definition })].concat(o, s);
-		this.walk(e, c);
-	}
-	walkAtLeastOneSep(e, o, s) {
-		let c = restForRepetitionWithSeparator(e, o, s);
-		this.walk(e, c);
-	}
-	walkMany(e, o, s) {
-		let c = [new Option({ definition: e.definition })].concat(o, s);
-		this.walk(e, c);
-	}
-	walkManySep(e, o, s) {
-		let c = restForRepetitionWithSeparator(e, o, s);
-		this.walk(e, c);
-	}
-	walkOr(e, s, l) {
-		let u = s.concat(l);
-		forEach_default(e.definition, (e) => {
-			let o = new Alternative({ definition: [e] });
-			this.walk(o, u);
+	walkTerminal(e, t, n) {}
+	walkProdRef(e, t, n) {}
+	walkFlat(e, t, n) {
+		let r = t.concat(n);
+		this.walk(e, r);
+	}
+	walkOption(e, t, n) {
+		let r = t.concat(n);
+		this.walk(e, r);
+	}
+	walkAtLeastOne(e, t, n) {
+		let i = [new r({ definition: e.definition })].concat(t, n);
+		this.walk(e, i);
+	}
+	walkAtLeastOneSep(e, t, n) {
+		let r = u(e, t, n);
+		this.walk(e, r);
+	}
+	walkMany(e, t, n) {
+		let i = [new r({ definition: e.definition })].concat(t, n);
+		this.walk(e, i);
+	}
+	walkManySep(e, t, n) {
+		let r = u(e, t, n);
+		this.walk(e, r);
+	}
+	walkOr(e, n, r) {
+		let i = n.concat(r);
+		e.definition.forEach((e) => {
+			let n = new t({ definition: [e] });
+			this.walk(n, i);
 		});
 	}
 };
-function restForRepetitionWithSeparator(e, o, s) {
-	return [new Option({ definition: [new Terminal({ terminalType: e.separator })].concat(e.definition) })].concat(o, s);
+function u(e, t, n) {
+	return [new r({ definition: [new c({ terminalType: e.separator })].concat(e.definition) })].concat(t, n);
 }
-export { RestWalker };
+//#endregion
+export { l as RestWalker };