@loopstack/loopstack-studio 0.28.0 → 0.29.1

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

@@ -1,144 +0,0 @@
-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 = IN_RULE_RECOVERY_EXCEPTION;
-	}
-}, Recoverable = class {
-	initRecoverable(e) {
-		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 = createTokenInstance(e, "", NaN, NaN, NaN, NaN, NaN, NaN);
-		return t.isInsertedInRecovery = !0, t;
-	}
-	canTokenTypeBeInsertedInRecovery(e) {
-		return !0;
-	}
-	canTokenTypeBeDeletedInRecovery(e) {
-		return !0;
-	}
-	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 MismatchedTokenException(this.errorMessageProvider.buildMismatchTokenMessage({
-				expected: r,
-				actual: l,
-				previous: e,
-				ruleName: this.getCurrRuleFullName()
-			}), l, this.LA(0));
-			t.resyncedTokens = s.slice(0, -1), this.SAVE_ERROR(t);
-		};
-		for (; !c;) if (this.tokenMatcher(u, r)) {
-			d();
-			return;
-		} else if (n.call(this)) {
-			d(), e.apply(this, t);
-			return;
-		} else this.tokenMatcher(u, i) ? c = !0 : (u = this.SKIP_TOKEN(), this.addToResyncTokens(u, s));
-		this.importLexerState(o);
-	}
-	shouldInRepetitionRecoveryBeTried(e, t, n) {
-		return !(n === !1 || this.tokenMatcher(this.LA_FAST(1), e) || this.isBackTracking() || this.canPerformInRuleRecovery(e, this.getFollowsForInRuleRecovery(e, t)));
-	}
-	getNextPossibleTokenTypes(e) {
-		let t = e.ruleStack[0], n = this.getGAstProductions()[t];
-		return new NextAfterTokenWalker(n, e).startWalking();
-	}
-	getFollowsForInRuleRecovery(e, t) {
-		let n = this.getCurrentGrammarPath(e, t);
-		return this.getNextPossibleTokenTypes(n);
-	}
-	tryInRuleRecovery(e, t) {
-		if (this.canRecoverWithSingleTokenInsertion(e, t)) return this.getTokenToInsert(e);
-		if (this.canRecoverWithSingleTokenDeletion(e)) {
-			let e = this.SKIP_TOKEN();
-			return this.consumeToken(), e;
-		}
-		throw new InRuleRecoveryException("sad sad panda");
-	}
-	canPerformInRuleRecovery(e, t) {
-		return this.canRecoverWithSingleTokenInsertion(e, t) || this.canRecoverWithSingleTokenDeletion(e);
-	}
-	canRecoverWithSingleTokenInsertion(e, t) {
-		if (!this.canTokenTypeBeInsertedInRecovery(e) || t.length === 0) return !1;
-		let n = this.LA_FAST(1);
-		return t.find((e) => this.tokenMatcher(n, e)) !== void 0;
-	}
-	canRecoverWithSingleTokenDeletion(e) {
-		return this.canTokenTypeBeDeletedInRecovery(e) ? this.tokenMatcher(this.LA(2), e) : !1;
-	}
-	isInCurrentRuleReSyncSet(e) {
-		let t = this.getCurrFollowKey();
-		return this.getFollowSetFromFollowKey(t).includes(e);
-	}
-	findReSyncTokenType() {
-		let e = this.flattenFollowSet(), t = this.LA_FAST(1), n = 2;
-		for (;;) {
-			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 EOF_FOLLOW_KEY;
-		let e = this.currRuleShortName, t = this.getLastExplicitRuleOccurrenceIndex(), n = this.getPreviousExplicitRuleShortName();
-		return {
-			ruleName: this.shortRuleNameToFullName(e),
-			idxInCallingRule: t,
-			inRule: this.shortRuleNameToFullName(n)
-		};
-	}
-	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] = EOF_FOLLOW_KEY : r[i] = {
-			ruleName: this.shortRuleNameToFullName(e[i]),
-			idxInCallingRule: t[i],
-			inRule: this.shortRuleNameToFullName(e[i - 1])
-		};
-		return r;
-	}
-	flattenFollowSet() {
-		return this.buildFullFollowKeyStack().map((e) => this.getFollowSetFromFollowKey(e)).flat();
-	}
-	getFollowSetFromFollowKey(n) {
-		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, EOF) || n.push(e), n;
-	}
-	reSyncTo(e) {
-		let t = [], n = this.LA_FAST(1);
-		for (; this.tokenMatcher(n, e) === !1;) n = this.SKIP_TOKEN(), this.addToResyncTokens(n, t);
-		return t.slice(0, -1);
-	}
-	attemptInRepetitionRecovery(e, t, n, r, i, a, o) {}
-	getCurrentGrammarPath(e, t) {
-		return {
-			ruleStack: this.getHumanReadableRuleStack(),
-			occurrenceStack: this.RULE_OCCURRENCE_STACK.slice(0, this.RULE_OCCURRENCE_STACK_IDX + 1),
-			lastTok: e,
-			lastTokOccurrence: t
-		};
-	}
-	getHumanReadableRuleStack() {
-		let e = this.RULE_STACK_IDX + 1, t = Array(e);
-		for (let n = 0; n < e; n++) t[n] = this.shortRuleNameToFullName(this.RULE_STACK[n]);
-		return t;
-	}
-};
-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 = EOF, d = 1), !(u === void 0 || d === void 0) && this.shouldInRepetitionRecoveryBeTried(u, d, s) && this.tryInRepetitionRecovery(e, n, r, u);
-}
-export { IN_RULE_RECOVERY_EXCEPTION, Recoverable };

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

@@ -1,92 +0,0 @@
-import { addNoneTerminalToCst, addTerminalToCst, setNodeLocationFull, setNodeLocationOnlyOffset } from "../../cst/cst.js";
-import { createBaseSemanticVisitorConstructor, createBaseVisitorConstructorWithDefaults } from "../../cst/cst_visitor.js";
-import { DEFAULT_PARSER_CONFIG } from "../parser.js";
-var TreeBuilder = class {
-	initTreeBuilder(e) {
-		if (this.CST_STACK = [], this.outputCst = e.outputCst, this.nodeLocationTracking = Object.hasOwn(e, "nodeLocationTracking") ? e.nodeLocationTracking : DEFAULT_PARSER_CONFIG.nodeLocationTracking, !this.outputCst) this.cstInvocationStateUpdate = () => {}, this.cstFinallyStateUpdate = () => {}, this.cstPostTerminal = () => {}, this.cstPostNonTerminal = () => {}, this.cstPostRule = () => {};
-		else if (/full/i.test(this.nodeLocationTracking)) this.recoveryEnabled ? (this.setNodeLocationFromToken = setNodeLocationFull, this.setNodeLocationFromNode = setNodeLocationFull, this.cstPostRule = () => {}, this.setInitialNodeLocation = this.setInitialNodeLocationFullRecovery) : (this.setNodeLocationFromToken = () => {}, this.setNodeLocationFromNode = () => {}, this.cstPostRule = this.cstPostRuleFull, this.setInitialNodeLocation = this.setInitialNodeLocationFullRegular);
-		else if (/onlyOffset/i.test(this.nodeLocationTracking)) this.recoveryEnabled ? (this.setNodeLocationFromToken = setNodeLocationOnlyOffset, this.setNodeLocationFromNode = setNodeLocationOnlyOffset, this.cstPostRule = () => {}, this.setInitialNodeLocation = this.setInitialNodeLocationOnlyOffsetRecovery) : (this.setNodeLocationFromToken = () => {}, this.setNodeLocationFromNode = () => {}, this.cstPostRule = this.cstPostRuleOnlyOffset, this.setInitialNodeLocation = this.setInitialNodeLocationOnlyOffsetRegular);
-		else if (/none/i.test(this.nodeLocationTracking)) this.setNodeLocationFromToken = () => {}, this.setNodeLocationFromNode = () => {}, this.cstPostRule = () => {}, this.setInitialNodeLocation = () => {};
-		else throw Error(`Invalid <nodeLocationTracking> config option: "${e.nodeLocationTracking}"`);
-	}
-	setInitialNodeLocationOnlyOffsetRecovery(e) {
-		e.location = {
-			startOffset: NaN,
-			endOffset: NaN
-		};
-	}
-	setInitialNodeLocationOnlyOffsetRegular(e) {
-		e.location = {
-			startOffset: this.LA_FAST(1).startOffset,
-			endOffset: NaN
-		};
-	}
-	setInitialNodeLocationFullRecovery(e) {
-		e.location = {
-			startOffset: NaN,
-			startLine: NaN,
-			startColumn: NaN,
-			endOffset: NaN,
-			endLine: NaN,
-			endColumn: NaN
-		};
-	}
-	setInitialNodeLocationFullRegular(e) {
-		let a = this.LA_FAST(1);
-		e.location = {
-			startOffset: a.startOffset,
-			startLine: a.startLine,
-			startColumn: a.startColumn,
-			endOffset: NaN,
-			endLine: NaN,
-			endColumn: NaN
-		};
-	}
-	cstInvocationStateUpdate(e) {
-		let a = {
-			name: e,
-			children: Object.create(null)
-		};
-		this.setInitialNodeLocation(a), this.CST_STACK.push(a);
-	}
-	cstFinallyStateUpdate() {
-		this.CST_STACK.pop();
-	}
-	cstPostRuleFull(e) {
-		let a = this.LA(0), o = e.location;
-		o.startOffset <= a.startOffset ? (o.endOffset = a.endOffset, o.endLine = a.endLine, o.endColumn = a.endColumn) : (o.startOffset = NaN, o.startLine = NaN, o.startColumn = NaN);
-	}
-	cstPostRuleOnlyOffset(e) {
-		let a = this.LA(0), o = e.location;
-		o.startOffset <= a.startOffset ? o.endOffset = a.endOffset : o.startOffset = NaN;
-	}
-	cstPostTerminal(e, o) {
-		let s = this.CST_STACK[this.CST_STACK.length - 1];
-		addTerminalToCst(s, o, e), this.setNodeLocationFromToken(s.location, o);
-	}
-	cstPostNonTerminal(a, o) {
-		let s = this.CST_STACK[this.CST_STACK.length - 1];
-		addNoneTerminalToCst(s, o, a), this.setNodeLocationFromNode(s.location, a.location);
-	}
-	getBaseCstVisitorConstructor() {
-		if (this.baseCstVisitorConstructor === void 0) {
-			let e = createBaseSemanticVisitorConstructor(this.className, Object.keys(this.gastProductionsCache));
-			return this.baseCstVisitorConstructor = e, e;
-		}
-		return this.baseCstVisitorConstructor;
-	}
-	getBaseCstVisitorConstructorWithDefaults() {
-		if (this.baseCstVisitorWithDefaultsConstructor === void 0) {
-			let e = createBaseVisitorConstructorWithDefaults(this.className, Object.keys(this.gastProductionsCache), this.getBaseCstVisitorConstructor());
-			return this.baseCstVisitorWithDefaultsConstructor = e, e;
-		}
-		return this.baseCstVisitorWithDefaultsConstructor;
-	}
-	getPreviousExplicitRuleShortName() {
-		return this.RULE_STACK[this.RULE_STACK_IDX - 1];
-	}
-	getLastExplicitRuleOccurrenceIndex() {
-		return this.RULE_OCCURRENCE_STACK[this.RULE_OCCURRENCE_STACK_IDX];
-	}
-};
-export { TreeBuilder };

package/dist/node_modules/chevrotain/lib/src/parse/parser/utils/apply_mixins.js

@@ -1,11 +0,0 @@
-function applyMixins(e, t) {
-	t.forEach((t) => {
-		let n = t.prototype;
-		Object.getOwnPropertyNames(n).forEach((r) => {
-			if (r === "constructor") return;
-			let i = Object.getOwnPropertyDescriptor(n, r);
-			i && (i.get || i.set) ? Object.defineProperty(e.prototype, r, i) : e.prototype[r] = t.prototype[r];
-		});
-	});
-}
-export { applyMixins };

package/dist/node_modules/chevrotain/lib/src/scan/lexer.js

@@ -1,437 +0,0 @@
-import { BaseRegExpVisitor } from "../../../../@chevrotain/regexp-to-ast/lib/src/base-regexp-visitor.js";
-import "../../../../@chevrotain/regexp-to-ast/lib/src/api.js";
-import { PRINT_ERROR } from "../../../../@chevrotain/utils/lib/src/print.js";
-import { getRegExpAst } from "./reg_exp_parser.js";
-import { canMatchCharCode, failedOptimizationPrefixMsg, getOptimizedStartCodesIndices } from "./reg_exp.js";
-import { Lexer, LexerDefinitionErrorType } from "./lexer_public.js";
-var PATTERN = "PATTERN";
-const DEFAULT_MODE = "defaultMode";
-function analyzeTokenTypes(e, S) {
-	S = Object.assign({
-		safeMode: !1,
-		positionTracking: "full",
-		lineTerminatorCharacters: ["\r", "\n"],
-		tracer: (e, x) => x()
-	}, S);
-	let D = S.tracer;
-	D("initCharCodeToOptimizedIndexMap", () => {
-		initCharCodeToOptimizedIndexMap();
-	});
-	let O;
-	D("Reject Lexer.NA", () => {
-		O = e.filter((e) => e[PATTERN] !== Lexer.NA);
-	});
-	let k = !1, A;
-	D("Transform Patterns", () => {
-		k = !1, A = O.map((e) => {
-			let x = e[PATTERN];
-			/* istanbul ignore else */
-			if (x instanceof RegExp) {
-				let e = x.source;
-				return e.length === 1 && e !== "^" && e !== "$" && e !== "." && !x.ignoreCase ? e : e.length === 2 && e[0] === "\\" && ![
-					"d",
-					"D",
-					"s",
-					"S",
-					"t",
-					"r",
-					"n",
-					"t",
-					"0",
-					"c",
-					"b",
-					"B",
-					"f",
-					"v",
-					"w",
-					"W"
-				].includes(e[1]) ? e[1] : addStickyFlag(x);
-			} else if (typeof x == "function") return k = !0, { exec: x };
-			else if (typeof x == "object") return k = !0, x;
-			else if (typeof x == "string") {
-				if (x.length === 1) return x;
-				{
-					let e = x.replace(/[\\^$.*+?()[\]{}|]/g, "\\$&");
-					return addStickyFlag(new RegExp(e));
-				}
-			} else throw Error("non exhaustive match");
-		});
-	});
-	let j, M, N, P, F;
-	D("misc mapping", () => {
-		j = O.map((e) => e.tokenTypeIdx), M = O.map((e) => {
-			let x = e.GROUP;
-			if (x !== Lexer.SKIPPED) {
-				if (typeof x == "string") return x;
-				if (x === void 0) return !1;
-				throw Error("non exhaustive match");
-			}
-		}), N = O.map((e) => {
-			let x = e.LONGER_ALT;
-			if (x) return Array.isArray(x) ? x.map((e) => O.indexOf(e)) : [O.indexOf(x)];
-		}), P = O.map((e) => e.PUSH_MODE), F = O.map((e) => Object.hasOwn(e, "POP_MODE"));
-	});
-	let I;
-	D("Line Terminator Handling", () => {
-		let e = getCharCodes(S.lineTerminatorCharacters);
-		I = O.map((e) => !1), S.positionTracking !== "onlyOffset" && (I = O.map((x) => Object.hasOwn(x, "LINE_BREAKS") ? !!x.LINE_BREAKS : checkLineBreaksIssues(x, e) === !1 && canMatchCharCode(e, x.PATTERN)));
-	});
-	let L, R, z, B;
-	D("Misc Mapping #2", () => {
-		L = O.map(isCustomPattern), R = A.map(isShortPattern), z = O.reduce((e, x) => {
-			let S = x.GROUP;
-			return typeof S == "string" && S !== Lexer.SKIPPED && (e[S] = []), e;
-		}, {}), B = A.map((e, x) => ({
-			pattern: A[x],
-			longerAlt: N[x],
-			canLineTerminator: I[x],
-			isCustom: L[x],
-			short: R[x],
-			group: M[x],
-			push: P[x],
-			pop: F[x],
-			tokenTypeIdx: j[x],
-			tokenType: O[x]
-		}));
-	});
-	let V = !0, H = [];
-	return S.safeMode || D("First Char Optimization", () => {
-		H = O.reduce((e, C, E) => {
-			if (typeof C.PATTERN == "string") addToMapOfArrays(e, charCodeToOptimizedIndex(C.PATTERN.charCodeAt(0)), B[E]);
-			else if (Array.isArray(C.START_CHARS_HINT)) {
-				let x;
-				C.START_CHARS_HINT.forEach((S) => {
-					let C = charCodeToOptimizedIndex(typeof S == "string" ? S.charCodeAt(0) : S);
-					/* istanbul ignore else */
-					x !== C && (x = C, addToMapOfArrays(e, C, B[E]));
-				});
-			} else if (C.PATTERN instanceof RegExp) if (C.PATTERN.unicode) V = !1, S.ensureOptimizations && PRINT_ERROR(`${failedOptimizationPrefixMsg}\tUnable to analyze < ${C.PATTERN.toString()} > pattern.\n	The regexp unicode flag is not currently supported by the regexp-to-ast library.
-	This will disable the lexer's first char optimizations.
-	For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNICODE_OPTIMIZE`);
-			else {
-				let x = getOptimizedStartCodesIndices(C.PATTERN, S.ensureOptimizations);
-				x.length === 0 && (V = !1), x.forEach((x) => {
-					addToMapOfArrays(e, x, B[E]);
-				});
-			}
-			else S.ensureOptimizations && PRINT_ERROR(`${failedOptimizationPrefixMsg}\tTokenType: <${C.name}> is using a custom token pattern without providing <start_chars_hint> parameter.\n	This will disable the lexer's first char optimizations.
-	For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#CUSTOM_OPTIMIZE`), V = !1;
-			return e;
-		}, []);
-	}), {
-		emptyGroups: z,
-		patternIdxToConfig: B,
-		charCodeToPatternIdxToConfig: H,
-		hasCustom: k,
-		canBeOptimized: V
-	};
-}
-function validatePatterns(e, x) {
-	let S = [], C = findMissingPatterns(e);
-	S = S.concat(C.errors);
-	let w = findInvalidPatterns(C.valid), T = w.valid;
-	return S = S.concat(w.errors), S = S.concat(validateRegExpPattern(T)), S = S.concat(findInvalidGroupType(T)), S = S.concat(findModesThatDoNotExist(T, x)), S = S.concat(findUnreachablePatterns(T)), S;
-}
-function validateRegExpPattern(e) {
-	let x = [], S = e.filter((e) => e[PATTERN] instanceof RegExp);
-	return x = x.concat(findEndOfInputAnchor(S)), x = x.concat(findStartOfInputAnchor(S)), x = x.concat(findUnsupportedFlags(S)), x = x.concat(findDuplicatePatterns(S)), x = x.concat(findEmptyMatchRegExps(S)), x;
-}
-function findMissingPatterns(e) {
-	let x = e.filter((e) => !Object.hasOwn(e, PATTERN));
-	return {
-		errors: x.map((e) => ({
-			message: "Token Type: ->" + e.name + "<- missing static 'PATTERN' property",
-			type: LexerDefinitionErrorType.MISSING_PATTERN,
-			tokenTypes: [e]
-		})),
-		valid: e.filter((e) => !x.includes(e))
-	};
-}
-function findInvalidPatterns(e) {
-	let x = e.filter((e) => {
-		let x = e[PATTERN];
-		return !(x instanceof RegExp) && typeof x != "function" && !Object.hasOwn(x, "exec") && typeof x != "string";
-	});
-	return {
-		errors: x.map((e) => ({
-			message: "Token Type: ->" + e.name + "<- static 'PATTERN' can only be a RegExp, a Function matching the {CustomPatternMatcherFunc} type or an Object matching the {ICustomPattern} interface.",
-			type: LexerDefinitionErrorType.INVALID_PATTERN,
-			tokenTypes: [e]
-		})),
-		valid: e.filter((e) => !x.includes(e))
-	};
-}
-var end_of_input = /[^\\][$]/;
-function findEndOfInputAnchor(x) {
-	class C extends BaseRegExpVisitor {
-		constructor() {
-			super(...arguments), this.found = !1;
-		}
-		visitEndAnchor(e) {
-			this.found = !0;
-		}
-	}
-	return x.filter((e) => {
-		let x = e.PATTERN;
-		try {
-			let e = getRegExpAst(x), w = new C();
-			return w.visit(e), w.found;
-		} catch {
-			/* istanbul ignore next - cannot ensure an error in regexp-to-ast*/
-			return end_of_input.test(x.source);
-		}
-	}).map((e) => ({
-		message: "Unexpected RegExp Anchor Error:\n	Token Type: ->" + e.name + "<- static 'PATTERN' cannot contain end of input anchor '$'\n	See chevrotain.io/docs/guide/resolving_lexer_errors.html#ANCHORS	for details.",
-		type: LexerDefinitionErrorType.EOI_ANCHOR_FOUND,
-		tokenTypes: [e]
-	}));
-}
-function findEmptyMatchRegExps(e) {
-	return e.filter((e) => e.PATTERN.test("")).map((e) => ({
-		message: "Token Type: ->" + e.name + "<- static 'PATTERN' must not match an empty string",
-		type: LexerDefinitionErrorType.EMPTY_MATCH_PATTERN,
-		tokenTypes: [e]
-	}));
-}
-var start_of_input = /[^\\[][\^]|^\^/;
-function findStartOfInputAnchor(x) {
-	class C extends BaseRegExpVisitor {
-		constructor() {
-			super(...arguments), this.found = !1;
-		}
-		visitStartAnchor(e) {
-			this.found = !0;
-		}
-	}
-	return x.filter((e) => {
-		let x = e.PATTERN;
-		try {
-			let e = getRegExpAst(x), w = new C();
-			return w.visit(e), w.found;
-		} catch {
-			/* istanbul ignore next - cannot ensure an error in regexp-to-ast*/
-			return start_of_input.test(x.source);
-		}
-	}).map((e) => ({
-		message: "Unexpected RegExp Anchor Error:\n	Token Type: ->" + e.name + "<- static 'PATTERN' cannot contain start of input anchor '^'\n	See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#ANCHORS	for details.",
-		type: LexerDefinitionErrorType.SOI_ANCHOR_FOUND,
-		tokenTypes: [e]
-	}));
-}
-function findUnsupportedFlags(e) {
-	return e.filter((e) => {
-		let x = e[PATTERN];
-		return x instanceof RegExp && (x.multiline || x.global);
-	}).map((e) => ({
-		message: "Token Type: ->" + e.name + "<- static 'PATTERN' may NOT contain global('g') or multiline('m')",
-		type: LexerDefinitionErrorType.UNSUPPORTED_FLAGS_FOUND,
-		tokenTypes: [e]
-	}));
-}
-function findDuplicatePatterns(e) {
-	let x = [], S = e.map((S) => e.reduce((e, C) => S.PATTERN.source === C.PATTERN.source && !x.includes(C) && C.PATTERN !== Lexer.NA ? (x.push(C), e.push(C), e) : e, []));
-	return S = S.filter(Boolean), S.filter((e) => e.length > 1).map((e) => {
-		let x = e.map((e) => e.name);
-		return {
-			message: `The same RegExp pattern ->${e[0].PATTERN}<-has been used in all of the following Token Types: ${x.join(", ")} <-`,
-			type: LexerDefinitionErrorType.DUPLICATE_PATTERNS_FOUND,
-			tokenTypes: e
-		};
-	});
-}
-function findInvalidGroupType(e) {
-	return e.filter((e) => {
-		if (!Object.hasOwn(e, "GROUP")) return !1;
-		let x = e.GROUP;
-		return x !== Lexer.SKIPPED && x !== Lexer.NA && typeof x != "string";
-	}).map((e) => ({
-		message: "Token Type: ->" + e.name + "<- static 'GROUP' can only be Lexer.SKIPPED/Lexer.NA/A String",
-		type: LexerDefinitionErrorType.INVALID_GROUP_TYPE_FOUND,
-		tokenTypes: [e]
-	}));
-}
-function findModesThatDoNotExist(e, x) {
-	return e.filter((e) => e.PUSH_MODE !== void 0 && !x.includes(e.PUSH_MODE)).map((e) => ({
-		message: `Token Type: ->${e.name}<- static 'PUSH_MODE' value cannot refer to a Lexer Mode ->${e.PUSH_MODE}<-which does not exist`,
-		type: LexerDefinitionErrorType.PUSH_MODE_DOES_NOT_EXIST,
-		tokenTypes: [e]
-	}));
-}
-function findUnreachablePatterns(e) {
-	let x = [], S = e.reduce((e, x, S) => {
-		let C = x.PATTERN;
-		return C === Lexer.NA || (typeof C == "string" ? e.push({
-			str: C,
-			idx: S,
-			tokenType: x
-		}) : C instanceof RegExp && noMetaChar(C) && e.push({
-			str: C.source,
-			idx: S,
-			tokenType: x
-		})), e;
-	}, []);
-	return e.forEach((e, C) => {
-		S.forEach(({ str: S, idx: w, tokenType: T }) => {
-			if (C < w && tryToMatchStrToPattern(S, e.PATTERN)) {
-				let S = `Token: ->${T.name}<- can never be matched.\nBecause it appears AFTER the Token Type ->${e.name}<-in the lexer's definition.\nSee https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
-				x.push({
-					message: S,
-					type: LexerDefinitionErrorType.UNREACHABLE_PATTERN,
-					tokenTypes: [e, T]
-				});
-			}
-		});
-	}), x;
-}
-function tryToMatchStrToPattern(e, x) {
-	if (x instanceof RegExp) {
-		if (usesLookAheadOrBehind(x)) return !1;
-		let S = x.exec(e);
-		return S !== null && S.index === 0;
-	} else if (typeof x == "function") return x(e, 0, [], {});
-	else if (Object.hasOwn(x, "exec")) return x.exec(e, 0, [], {});
-	else if (typeof x == "string") return x === e;
-	else throw Error("non exhaustive match");
-}
-function noMetaChar(e) {
-	return [
-		".",
-		"\\",
-		"[",
-		"]",
-		"|",
-		"^",
-		"$",
-		"(",
-		")",
-		"?",
-		"*",
-		"+",
-		"{"
-	].find((x) => e.source.indexOf(x) !== -1) === void 0;
-}
-function usesLookAheadOrBehind(e) {
-	return /(\(\?=)|(\(\?!)|(\(\?<=)|(\(\?<!)/.test(e.source);
-}
-function addStickyFlag(e) {
-	let x = e.ignoreCase ? "iy" : "y";
-	return RegExp(`${e.source}`, x);
-}
-function performRuntimeChecks(e, x, S) {
-	let C = [];
-	return Object.hasOwn(e, "defaultMode") || C.push({
-		message: "A MultiMode Lexer cannot be initialized without a <" + DEFAULT_MODE + "> property in its definition\n",
-		type: LexerDefinitionErrorType.MULTI_MODE_LEXER_WITHOUT_DEFAULT_MODE
-	}), Object.hasOwn(e, "modes") || C.push({
-		message: "A MultiMode Lexer cannot be initialized without a <modes> property in its definition\n",
-		type: LexerDefinitionErrorType.MULTI_MODE_LEXER_WITHOUT_MODES_PROPERTY
-	}), Object.hasOwn(e, "modes") && Object.hasOwn(e, "defaultMode") && !Object.hasOwn(e.modes, e.defaultMode) && C.push({
-		message: `A MultiMode Lexer cannot be initialized with a ${DEFAULT_MODE}: <${e.defaultMode}>which does not exist\n`,
-		type: LexerDefinitionErrorType.MULTI_MODE_LEXER_DEFAULT_MODE_VALUE_DOES_NOT_EXIST
-	}), Object.hasOwn(e, "modes") && Object.keys(e.modes).forEach((x) => {
-		let S = e.modes[x];
-		S.forEach((e, w) => {
-			e === void 0 ? C.push({
-				message: `A Lexer cannot be initialized using an undefined Token Type. Mode:<${x}> at index: <${w}>\n`,
-				type: LexerDefinitionErrorType.LEXER_DEFINITION_CANNOT_CONTAIN_UNDEFINED
-			}) : Object.hasOwn(e, "LONGER_ALT") && (Array.isArray(e.LONGER_ALT) ? e.LONGER_ALT : [e.LONGER_ALT]).forEach((w) => {
-				w !== void 0 && !S.includes(w) && C.push({
-					message: `A MultiMode Lexer cannot be initialized with a longer_alt <${w.name}> on token <${e.name}> outside of mode <${x}>\n`,
-					type: LexerDefinitionErrorType.MULTI_MODE_LEXER_LONGER_ALT_NOT_IN_CURRENT_MODE
-				});
-			});
-		});
-	}), C;
-}
-function performWarningRuntimeChecks(e, x, S) {
-	let w = [], T = !1, O = Object.values(e.modes || {}).flat().filter(Boolean).filter((e) => e[PATTERN] !== Lexer.NA), k = getCharCodes(S);
-	return x && O.forEach((e) => {
-		let x = checkLineBreaksIssues(e, k);
-		if (x !== !1) {
-			let S = {
-				message: buildLineBreakIssueMessage(e, x),
-				type: x.issue,
-				tokenType: e
-			};
-			w.push(S);
-		} else Object.hasOwn(e, "LINE_BREAKS") ? e.LINE_BREAKS === !0 && (T = !0) : canMatchCharCode(k, e.PATTERN) && (T = !0);
-	}), x && !T && w.push({
-		message: "Warning: No LINE_BREAKS Found.\n	This Lexer has been defined to track line and column information,\n	But none of the Token Types can be identified as matching a line terminator.\n	See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#LINE_BREAKS \n	for details.",
-		type: LexerDefinitionErrorType.NO_LINE_BREAKS_FLAGS
-	}), w;
-}
-function cloneEmptyGroups(e) {
-	let x = {};
-	return Object.keys(e).forEach((S) => {
-		let C = e[S];
-		/* istanbul ignore else */
-		if (Array.isArray(C)) x[S] = [];
-		else throw Error("non exhaustive match");
-	}), x;
-}
-function isCustomPattern(e) {
-	let x = e.PATTERN;
-	/* istanbul ignore else */
-	if (x instanceof RegExp) return !1;
-	if (typeof x == "function" || Object.hasOwn(x, "exec")) return !0;
-	if (typeof x == "string") return !1;
-	throw Error("non exhaustive match");
-}
-function isShortPattern(e) {
-	return typeof e == "string" && e.length === 1 ? e.charCodeAt(0) : !1;
-}
-const LineTerminatorOptimizedTester = {
-	test: function(e) {
-		let x = e.length;
-		for (let S = this.lastIndex; S < x; S++) {
-			let x = e.charCodeAt(S);
-			if (x === 10) return this.lastIndex = S + 1, !0;
-			if (x === 13) return e.charCodeAt(S + 1) === 10 ? this.lastIndex = S + 2 : this.lastIndex = S + 1, !0;
-		}
-		return !1;
-	},
-	lastIndex: 0
-};
-function checkLineBreaksIssues(e, x) {
-	if (Object.hasOwn(e, "LINE_BREAKS")) return !1;
-	if (e.PATTERN instanceof RegExp) {
-		try {
-			canMatchCharCode(x, e.PATTERN);
-		} catch (e) {
-			/* istanbul ignore next - to test this we would have to mock <canMatchCharCode> to throw an error */
-			return {
-				issue: LexerDefinitionErrorType.IDENTIFY_TERMINATOR,
-				errMsg: e.message
-			};
-		}
-		return !1;
-	} else if (typeof e.PATTERN == "string") return !1;
-	else if (isCustomPattern(e)) return { issue: LexerDefinitionErrorType.CUSTOM_LINE_BREAK };
-	else throw Error("non exhaustive match");
-}
-function buildLineBreakIssueMessage(e, x) {
-	/* istanbul ignore else */
-	if (x.issue === LexerDefinitionErrorType.IDENTIFY_TERMINATOR) return `Warning: unable to identify line terminator usage in pattern.
-\tThe problem is in the <${e.name}> Token Type\n\t Root cause: ${x.errMsg}.\n	For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#IDENTIFY_TERMINATOR`;
-	if (x.issue === LexerDefinitionErrorType.CUSTOM_LINE_BREAK) return `Warning: A Custom Token Pattern should specify the <line_breaks> option.
-\tThe problem is in the <${e.name}> Token Type\n	For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#CUSTOM_LINE_BREAK`;
-	throw Error("non exhaustive match");
-}
-function getCharCodes(e) {
-	return e.map((e) => typeof e == "string" ? e.charCodeAt(0) : e);
-}
-function addToMapOfArrays(e, x, S) {
-	e[x] === void 0 ? e[x] = [S] : e[x].push(S);
-}
-const minOptimizationVal = 256;
-var charCodeToOptimizedIdxMap = [];
-function charCodeToOptimizedIndex(e) {
-	return e < 256 ? e : charCodeToOptimizedIdxMap[e];
-}
-function initCharCodeToOptimizedIndexMap() {
-	if (charCodeToOptimizedIdxMap.length === 0) {
-		charCodeToOptimizedIdxMap = Array(65536);
-		for (let e = 0; e < 65536; e++) charCodeToOptimizedIdxMap[e] = e > 255 ? 255 + ~~(e / 255) : e;
-	}
-}
-export { DEFAULT_MODE, LineTerminatorOptimizedTester, analyzeTokenTypes, charCodeToOptimizedIndex, cloneEmptyGroups, minOptimizationVal, performRuntimeChecks, performWarningRuntimeChecks, validatePatterns };