likec4 1.48.0 → 1.50.0

package/dist/_chunks/libs/chevrotain-allstar.mjs

@@ -1,850 +1,2 @@
-import { C as map_default, D as _baseIteratee_default, T as forEach_default, c as NonTerminal, d as RepetitionMandatory, f as RepetitionMandatoryWithSeparator, h as Terminal, ht as isSymbol_default, l as Option, o as Alternation, p as RepetitionWithSeparator, u as Repetition, ut as identity_default } from "./@chevrotain/gast.mjs";
-import { c as tokenMatcher, d as _baseUniq_default, f as reduce_default, g as flatten_default, h as filter_default, i as getLookaheadPaths, m as flatMap_default, p as isEmpty_default, r as LLkLookaheadStrategy, s as tokenLabel } from "./chevrotain.mjs";
-
-//#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseLt.js
-/**
-* The base implementation of `_.lt` which doesn't coerce arguments.
-*
-* @private
-* @param {*} value The value to compare.
-* @param {*} other The other value to compare.
-* @returns {boolean} Returns `true` if `value` is less than `other`,
-*  else `false`.
-*/
-function baseLt(value, other) {
-	return value < other;
-}
-var _baseLt_default = baseLt;
-
-//#endregion
-//#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseExtremum.js
-/**
-* The base implementation of methods like `_.max` and `_.min` which accepts a
-* `comparator` to determine the extremum value.
-*
-* @private
-* @param {Array} array The array to iterate over.
-* @param {Function} iteratee The iteratee invoked per iteration.
-* @param {Function} comparator The comparator used to compare values.
-* @returns {*} Returns the extremum value.
-*/
-function baseExtremum(array, iteratee, comparator) {
-	var index = -1, length = array.length;
-	while (++index < length) {
-		var value = array[index], current = iteratee(value);
-		if (current != null && (computed === void 0 ? current === current && !isSymbol_default(current) : comparator(current, computed))) var computed = current, result = value;
-	}
-	return result;
-}
-var _baseExtremum_default = baseExtremum;
-
-//#endregion
-//#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/min.js
-/**
-* Computes the minimum value of `array`. If `array` is empty or falsey,
-* `undefined` is returned.
-*
-* @static
-* @since 0.1.0
-* @memberOf _
-* @category Math
-* @param {Array} array The array to iterate over.
-* @returns {*} Returns the minimum value.
-* @example
-*
-* _.min([4, 2, 8, 6]);
-* // => 2
-*
-* _.min([]);
-* // => undefined
-*/
-function min(array) {
-	return array && array.length ? _baseExtremum_default(array, identity_default, _baseLt_default) : void 0;
-}
-var min_default = min;
-
-//#endregion
-//#region ../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/uniqBy.js
-/**
-* This method is like `_.uniq` except that it accepts `iteratee` which is
-* invoked for each element in `array` to generate the criterion by which
-* uniqueness is computed. The order of result values is determined by the
-* order they occur in the array. The iteratee is invoked with one argument:
-* (value).
-*
-* @static
-* @memberOf _
-* @since 4.0.0
-* @category Array
-* @param {Array} array The array to inspect.
-* @param {Function} [iteratee=_.identity] The iteratee invoked per element.
-* @returns {Array} Returns the new duplicate free array.
-* @example
-*
-* _.uniqBy([2.1, 1.2, 2.3], Math.floor);
-* // => [2.1, 1.2]
-*
-* // The `_.property` iteratee shorthand.
-* _.uniqBy([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x');
-* // => [{ 'x': 1 }, { 'x': 2 }]
-*/
-function uniqBy(array, iteratee) {
-	return array && array.length ? _baseUniq_default(array, _baseIteratee_default(iteratee, 2)) : [];
-}
-var uniqBy_default = uniqBy;
-
-//#endregion
-//#region ../../node_modules/.pnpm/chevrotain-allstar@0.3.1_chevrotain@11.0.3/node_modules/chevrotain-allstar/lib/atn.js
-/******************************************************************************
-* Copyright 2022 TypeFox GmbH
-* This program and the accompanying materials are made available under the
-* terms of the MIT License, which is available in the project root.
-******************************************************************************/
-function buildATNKey(rule, type, occurrence) {
-	return `${rule.name}_${type}_${occurrence}`;
-}
-const ATN_BASIC = 1;
-const ATN_RULE_START = 2;
-const ATN_PLUS_BLOCK_START = 4;
-const ATN_STAR_BLOCK_START = 5;
-const ATN_RULE_STOP = 7;
-const ATN_BLOCK_END = 8;
-const ATN_STAR_LOOP_BACK = 9;
-const ATN_STAR_LOOP_ENTRY = 10;
-const ATN_PLUS_LOOP_BACK = 11;
-const ATN_LOOP_END = 12;
-var AbstractTransition = class {
-	constructor(target) {
-		this.target = target;
-	}
-	isEpsilon() {
-		return false;
-	}
-};
-var AtomTransition = class extends AbstractTransition {
-	constructor(target, tokenType) {
-		super(target);
-		this.tokenType = tokenType;
-	}
-};
-var EpsilonTransition = class extends AbstractTransition {
-	constructor(target) {
-		super(target);
-	}
-	isEpsilon() {
-		return true;
-	}
-};
-var RuleTransition = class extends AbstractTransition {
-	constructor(ruleStart, rule, followState) {
-		super(ruleStart);
-		this.rule = rule;
-		this.followState = followState;
-	}
-	isEpsilon() {
-		return true;
-	}
-};
-function createATN(rules) {
-	const atn = {
-		decisionMap: {},
-		decisionStates: [],
-		ruleToStartState: /* @__PURE__ */ new Map(),
-		ruleToStopState: /* @__PURE__ */ new Map(),
-		states: []
-	};
-	createRuleStartAndStopATNStates(atn, rules);
-	const ruleLength = rules.length;
-	for (let i = 0; i < ruleLength; i++) {
-		const rule = rules[i];
-		const ruleBlock = block(atn, rule, rule);
-		if (ruleBlock === void 0) continue;
-		buildRuleHandle(atn, rule, ruleBlock);
-	}
-	return atn;
-}
-function createRuleStartAndStopATNStates(atn, rules) {
-	const ruleLength = rules.length;
-	for (let i = 0; i < ruleLength; i++) {
-		const rule = rules[i];
-		const start = newState(atn, rule, void 0, { type: ATN_RULE_START });
-		const stop = newState(atn, rule, void 0, { type: ATN_RULE_STOP });
-		start.stop = stop;
-		atn.ruleToStartState.set(rule, start);
-		atn.ruleToStopState.set(rule, stop);
-	}
-}
-function atom(atn, rule, production) {
-	if (production instanceof Terminal) return tokenRef(atn, rule, production.terminalType, production);
-	else if (production instanceof NonTerminal) return ruleRef(atn, rule, production);
-	else if (production instanceof Alternation) return alternation(atn, rule, production);
-	else if (production instanceof Option) return option(atn, rule, production);
-	else if (production instanceof Repetition) return repetition(atn, rule, production);
-	else if (production instanceof RepetitionWithSeparator) return repetitionSep(atn, rule, production);
-	else if (production instanceof RepetitionMandatory) return repetitionMandatory(atn, rule, production);
-	else if (production instanceof RepetitionMandatoryWithSeparator) return repetitionMandatorySep(atn, rule, production);
-	else return block(atn, rule, production);
-}
-function repetition(atn, rule, repetition) {
-	const starState = newState(atn, rule, repetition, { type: ATN_STAR_BLOCK_START });
-	defineDecisionState(atn, starState);
-	return star(atn, rule, repetition, makeAlts(atn, rule, starState, repetition, block(atn, rule, repetition)));
-}
-function repetitionSep(atn, rule, repetition) {
-	const starState = newState(atn, rule, repetition, { type: ATN_STAR_BLOCK_START });
-	defineDecisionState(atn, starState);
-	return star(atn, rule, repetition, makeAlts(atn, rule, starState, repetition, block(atn, rule, repetition)), tokenRef(atn, rule, repetition.separator, repetition));
-}
-function repetitionMandatory(atn, rule, repetition) {
-	const plusState = newState(atn, rule, repetition, { type: ATN_PLUS_BLOCK_START });
-	defineDecisionState(atn, plusState);
-	return plus(atn, rule, repetition, makeAlts(atn, rule, plusState, repetition, block(atn, rule, repetition)));
-}
-function repetitionMandatorySep(atn, rule, repetition) {
-	const plusState = newState(atn, rule, repetition, { type: ATN_PLUS_BLOCK_START });
-	defineDecisionState(atn, plusState);
-	return plus(atn, rule, repetition, makeAlts(atn, rule, plusState, repetition, block(atn, rule, repetition)), tokenRef(atn, rule, repetition.separator, repetition));
-}
-function alternation(atn, rule, alternation) {
-	const start = newState(atn, rule, alternation, { type: ATN_BASIC });
-	defineDecisionState(atn, start);
-	return makeAlts(atn, rule, start, alternation, ...map_default(alternation.definition, (e) => atom(atn, rule, e)));
-}
-function option(atn, rule, option) {
-	const start = newState(atn, rule, option, { type: ATN_BASIC });
-	defineDecisionState(atn, start);
-	return optional(atn, rule, option, makeAlts(atn, rule, start, option, block(atn, rule, option)));
-}
-function block(atn, rule, block) {
-	const handles = filter_default(map_default(block.definition, (e) => atom(atn, rule, e)), (e) => e !== void 0);
-	if (handles.length === 1) return handles[0];
-	else if (handles.length === 0) return;
-	else return makeBlock(atn, handles);
-}
-function plus(atn, rule, plus, handle, sep) {
-	const blkStart = handle.left;
-	const blkEnd = handle.right;
-	const loop = newState(atn, rule, plus, { type: ATN_PLUS_LOOP_BACK });
-	defineDecisionState(atn, loop);
-	const end = newState(atn, rule, plus, { type: ATN_LOOP_END });
-	blkStart.loopback = loop;
-	end.loopback = loop;
-	atn.decisionMap[buildATNKey(rule, sep ? "RepetitionMandatoryWithSeparator" : "RepetitionMandatory", plus.idx)] = loop;
-	epsilon(blkEnd, loop);
-	if (sep === void 0) {
-		epsilon(loop, blkStart);
-		epsilon(loop, end);
-	} else {
-		epsilon(loop, end);
-		epsilon(loop, sep.left);
-		epsilon(sep.right, blkStart);
-	}
-	return {
-		left: blkStart,
-		right: end
-	};
-}
-function star(atn, rule, star, handle, sep) {
-	const start = handle.left;
-	const end = handle.right;
-	const entry = newState(atn, rule, star, { type: ATN_STAR_LOOP_ENTRY });
-	defineDecisionState(atn, entry);
-	const loopEnd = newState(atn, rule, star, { type: ATN_LOOP_END });
-	const loop = newState(atn, rule, star, { type: ATN_STAR_LOOP_BACK });
-	entry.loopback = loop;
-	loopEnd.loopback = loop;
-	epsilon(entry, start);
-	epsilon(entry, loopEnd);
-	epsilon(end, loop);
-	if (sep !== void 0) {
-		epsilon(loop, loopEnd);
-		epsilon(loop, sep.left);
-		epsilon(sep.right, start);
-	} else epsilon(loop, entry);
-	atn.decisionMap[buildATNKey(rule, sep ? "RepetitionWithSeparator" : "Repetition", star.idx)] = entry;
-	return {
-		left: entry,
-		right: loopEnd
-	};
-}
-function optional(atn, rule, optional, handle) {
-	const start = handle.left;
-	const end = handle.right;
-	epsilon(start, end);
-	atn.decisionMap[buildATNKey(rule, "Option", optional.idx)] = start;
-	return handle;
-}
-function defineDecisionState(atn, state) {
-	atn.decisionStates.push(state);
-	state.decision = atn.decisionStates.length - 1;
-	return state.decision;
-}
-function makeAlts(atn, rule, start, production, ...alts) {
-	const end = newState(atn, rule, production, {
-		type: ATN_BLOCK_END,
-		start
-	});
-	start.end = end;
-	for (const alt of alts) if (alt !== void 0) {
-		epsilon(start, alt.left);
-		epsilon(alt.right, end);
-	} else epsilon(start, end);
-	const handle = {
-		left: start,
-		right: end
-	};
-	atn.decisionMap[buildATNKey(rule, getProdType(production), production.idx)] = start;
-	return handle;
-}
-function getProdType(production) {
-	if (production instanceof Alternation) return "Alternation";
-	else if (production instanceof Option) return "Option";
-	else if (production instanceof Repetition) return "Repetition";
-	else if (production instanceof RepetitionWithSeparator) return "RepetitionWithSeparator";
-	else if (production instanceof RepetitionMandatory) return "RepetitionMandatory";
-	else if (production instanceof RepetitionMandatoryWithSeparator) return "RepetitionMandatoryWithSeparator";
-	else throw new Error("Invalid production type encountered");
-}
-function makeBlock(atn, alts) {
-	const altsLength = alts.length;
-	for (let i = 0; i < altsLength - 1; i++) {
-		const handle = alts[i];
-		let transition;
-		if (handle.left.transitions.length === 1) transition = handle.left.transitions[0];
-		const isRuleTransition = transition instanceof RuleTransition;
-		const ruleTransition = transition;
-		const next = alts[i + 1].left;
-		if (handle.left.type === ATN_BASIC && handle.right.type === ATN_BASIC && transition !== void 0 && (isRuleTransition && ruleTransition.followState === handle.right || transition.target === handle.right)) {
-			if (isRuleTransition) ruleTransition.followState = next;
-			else transition.target = next;
-			removeState(atn, handle.right);
-		} else epsilon(handle.right, next);
-	}
-	const first = alts[0];
-	const last = alts[altsLength - 1];
-	return {
-		left: first.left,
-		right: last.right
-	};
-}
-function tokenRef(atn, rule, tokenType, production) {
-	const left = newState(atn, rule, production, { type: ATN_BASIC });
-	const right = newState(atn, rule, production, { type: ATN_BASIC });
-	addTransition(left, new AtomTransition(right, tokenType));
-	return {
-		left,
-		right
-	};
-}
-function ruleRef(atn, currentRule, nonTerminal) {
-	const rule = nonTerminal.referencedRule;
-	const start = atn.ruleToStartState.get(rule);
-	const left = newState(atn, currentRule, nonTerminal, { type: ATN_BASIC });
-	const right = newState(atn, currentRule, nonTerminal, { type: ATN_BASIC });
-	addTransition(left, new RuleTransition(start, rule, right));
-	return {
-		left,
-		right
-	};
-}
-function buildRuleHandle(atn, rule, block) {
-	const start = atn.ruleToStartState.get(rule);
-	epsilon(start, block.left);
-	const stop = atn.ruleToStopState.get(rule);
-	epsilon(block.right, stop);
-	return {
-		left: start,
-		right: stop
-	};
-}
-function epsilon(a, b) {
-	addTransition(a, new EpsilonTransition(b));
-}
-function newState(atn, rule, production, partial) {
-	const t = Object.assign({
-		atn,
-		production,
-		epsilonOnlyTransitions: false,
-		rule,
-		transitions: [],
-		nextTokenWithinRule: [],
-		stateNumber: atn.states.length
-	}, partial);
-	atn.states.push(t);
-	return t;
-}
-function addTransition(state, transition) {
-	if (state.transitions.length === 0) state.epsilonOnlyTransitions = transition.isEpsilon();
-	state.transitions.push(transition);
-}
-function removeState(atn, state) {
-	atn.states.splice(atn.states.indexOf(state), 1);
-}
-
-//#endregion
-//#region ../../node_modules/.pnpm/chevrotain-allstar@0.3.1_chevrotain@11.0.3/node_modules/chevrotain-allstar/lib/dfa.js
-/******************************************************************************
-* Copyright 2022 TypeFox GmbH
-* This program and the accompanying materials are made available under the
-* terms of the MIT License, which is available in the project root.
-******************************************************************************/
-const DFA_ERROR = {};
-var ATNConfigSet = class {
-	constructor() {
-		this.map = {};
-		this.configs = [];
-	}
-	get size() {
-		return this.configs.length;
-	}
-	finalize() {
-		this.map = {};
-	}
-	add(config) {
-		const key = getATNConfigKey(config);
-		if (!(key in this.map)) {
-			this.map[key] = this.configs.length;
-			this.configs.push(config);
-		}
-	}
-	get elements() {
-		return this.configs;
-	}
-	get alts() {
-		return map_default(this.configs, (e) => e.alt);
-	}
-	get key() {
-		let value = "";
-		for (const k in this.map) value += k + ":";
-		return value;
-	}
-};
-function getATNConfigKey(config, alt = true) {
-	return `${alt ? `a${config.alt}` : ""}s${config.state.stateNumber}:${config.stack.map((e) => e.stateNumber.toString()).join("_")}`;
-}
-
-//#endregion
-//#region ../../node_modules/.pnpm/chevrotain-allstar@0.3.1_chevrotain@11.0.3/node_modules/chevrotain-allstar/lib/all-star-lookahead.js
-/******************************************************************************
-* Copyright 2022 TypeFox GmbH
-* This program and the accompanying materials are made available under the
-* terms of the MIT License, which is available in the project root.
-******************************************************************************/
-function createDFACache(startState, decision) {
-	const map = {};
-	return (predicateSet) => {
-		const key = predicateSet.toString();
-		let existing = map[key];
-		if (existing !== void 0) return existing;
-		else {
-			existing = {
-				atnStartState: startState,
-				decision,
-				states: {}
-			};
-			map[key] = existing;
-			return existing;
-		}
-	};
-}
-var PredicateSet = class {
-	constructor() {
-		this.predicates = [];
-	}
-	is(index) {
-		return index >= this.predicates.length || this.predicates[index];
-	}
-	set(index, value) {
-		this.predicates[index] = value;
-	}
-	toString() {
-		let value = "";
-		const size = this.predicates.length;
-		for (let i = 0; i < size; i++) value += this.predicates[i] === true ? "1" : "0";
-		return value;
-	}
-};
-const EMPTY_PREDICATES = new PredicateSet();
-var LLStarLookaheadStrategy = class extends LLkLookaheadStrategy {
-	constructor(options) {
-		var _a;
-		super();
-		this.logging = (_a = options === null || options === void 0 ? void 0 : options.logging) !== null && _a !== void 0 ? _a : ((message) => console.log(message));
-	}
-	initialize(options) {
-		this.atn = createATN(options.rules);
-		this.dfas = initATNSimulator(this.atn);
-	}
-	validateAmbiguousAlternationAlternatives() {
-		return [];
-	}
-	validateEmptyOrAlternatives() {
-		return [];
-	}
-	buildLookaheadForAlternation(options) {
-		const { prodOccurrence, rule, hasPredicates, dynamicTokensEnabled } = options;
-		const dfas = this.dfas;
-		const logging = this.logging;
-		const key = buildATNKey(rule, "Alternation", prodOccurrence);
-		const decisionIndex = this.atn.decisionMap[key].decision;
-		const partialAlts = map_default(getLookaheadPaths({
-			maxLookahead: 1,
-			occurrence: prodOccurrence,
-			prodType: "Alternation",
-			rule
-		}), (currAlt) => map_default(currAlt, (path) => path[0]));
-		if (isLL1Sequence(partialAlts, false) && !dynamicTokensEnabled) {
-			const choiceToAlt = reduce_default(partialAlts, (result, currAlt, idx) => {
-				forEach_default(currAlt, (currTokType) => {
-					if (currTokType) {
-						result[currTokType.tokenTypeIdx] = idx;
-						forEach_default(currTokType.categoryMatches, (currExtendingType) => {
-							result[currExtendingType] = idx;
-						});
-					}
-				});
-				return result;
-			}, {});
-			if (hasPredicates) return function(orAlts) {
-				var _a;
-				const prediction = choiceToAlt[this.LA(1).tokenTypeIdx];
-				if (orAlts !== void 0 && prediction !== void 0) {
-					const gate = (_a = orAlts[prediction]) === null || _a === void 0 ? void 0 : _a.GATE;
-					if (gate !== void 0 && gate.call(this) === false) return;
-				}
-				return prediction;
-			};
-			else return function() {
-				return choiceToAlt[this.LA(1).tokenTypeIdx];
-			};
-		} else if (hasPredicates) return function(orAlts) {
-			const predicates = new PredicateSet();
-			const length = orAlts === void 0 ? 0 : orAlts.length;
-			for (let i = 0; i < length; i++) {
-				const gate = orAlts === null || orAlts === void 0 ? void 0 : orAlts[i].GATE;
-				predicates.set(i, gate === void 0 || gate.call(this));
-			}
-			const result = adaptivePredict.call(this, dfas, decisionIndex, predicates, logging);
-			return typeof result === "number" ? result : void 0;
-		};
-		else return function() {
-			const result = adaptivePredict.call(this, dfas, decisionIndex, EMPTY_PREDICATES, logging);
-			return typeof result === "number" ? result : void 0;
-		};
-	}
-	buildLookaheadForOptional(options) {
-		const { prodOccurrence, rule, prodType, dynamicTokensEnabled } = options;
-		const dfas = this.dfas;
-		const logging = this.logging;
-		const key = buildATNKey(rule, prodType, prodOccurrence);
-		const decisionIndex = this.atn.decisionMap[key].decision;
-		const alts = map_default(getLookaheadPaths({
-			maxLookahead: 1,
-			occurrence: prodOccurrence,
-			prodType,
-			rule
-		}), (e) => {
-			return map_default(e, (g) => g[0]);
-		});
-		if (isLL1Sequence(alts) && alts[0][0] && !dynamicTokensEnabled) {
-			const alt = alts[0];
-			const singleTokensTypes = flatten_default(alt);
-			if (singleTokensTypes.length === 1 && isEmpty_default(singleTokensTypes[0].categoryMatches)) {
-				const expectedTokenUniqueKey = singleTokensTypes[0].tokenTypeIdx;
-				return function() {
-					return this.LA(1).tokenTypeIdx === expectedTokenUniqueKey;
-				};
-			} else {
-				const choiceToAlt = reduce_default(singleTokensTypes, (result, currTokType) => {
-					if (currTokType !== void 0) {
-						result[currTokType.tokenTypeIdx] = true;
-						forEach_default(currTokType.categoryMatches, (currExtendingType) => {
-							result[currExtendingType] = true;
-						});
-					}
-					return result;
-				}, {});
-				return function() {
-					return choiceToAlt[this.LA(1).tokenTypeIdx] === true;
-				};
-			}
-		}
-		return function() {
-			const result = adaptivePredict.call(this, dfas, decisionIndex, EMPTY_PREDICATES, logging);
-			return typeof result === "object" ? false : result === 0;
-		};
-	}
-};
-function isLL1Sequence(sequences, allowEmpty = true) {
-	const fullSet = /* @__PURE__ */ new Set();
-	for (const alt of sequences) {
-		const altSet = /* @__PURE__ */ new Set();
-		for (const tokType of alt) {
-			if (tokType === void 0) if (allowEmpty) break;
-			else return false;
-			const indices = [tokType.tokenTypeIdx].concat(tokType.categoryMatches);
-			for (const index of indices) if (fullSet.has(index)) {
-				if (!altSet.has(index)) return false;
-			} else {
-				fullSet.add(index);
-				altSet.add(index);
-			}
-		}
-	}
-	return true;
-}
-function initATNSimulator(atn) {
-	const decisionLength = atn.decisionStates.length;
-	const decisionToDFA = Array(decisionLength);
-	for (let i = 0; i < decisionLength; i++) decisionToDFA[i] = createDFACache(atn.decisionStates[i], i);
-	return decisionToDFA;
-}
-function adaptivePredict(dfaCaches, decision, predicateSet, logging) {
-	const dfa = dfaCaches[decision](predicateSet);
-	let start = dfa.start;
-	if (start === void 0) {
-		start = addDFAState(dfa, newDFAState(computeStartState(dfa.atnStartState)));
-		dfa.start = start;
-	}
-	return performLookahead.apply(this, [
-		dfa,
-		start,
-		predicateSet,
-		logging
-	]);
-}
-function performLookahead(dfa, s0, predicateSet, logging) {
-	let previousD = s0;
-	let i = 1;
-	const path = [];
-	let t = this.LA(i++);
-	while (true) {
-		let d = getExistingTargetState(previousD, t);
-		if (d === void 0) d = computeLookaheadTarget.apply(this, [
-			dfa,
-			previousD,
-			t,
-			i,
-			predicateSet,
-			logging
-		]);
-		if (d === DFA_ERROR) return buildAdaptivePredictError(path, previousD, t);
-		if (d.isAcceptState === true) return d.prediction;
-		previousD = d;
-		path.push(t);
-		t = this.LA(i++);
-	}
-}
-function computeLookaheadTarget(dfa, previousD, token, lookahead, predicateSet, logging) {
-	const reach = computeReachSet(previousD.configs, token, predicateSet);
-	if (reach.size === 0) {
-		addDFAEdge(dfa, previousD, token, DFA_ERROR);
-		return DFA_ERROR;
-	}
-	let newState = newDFAState(reach);
-	const predictedAlt = getUniqueAlt(reach, predicateSet);
-	if (predictedAlt !== void 0) {
-		newState.isAcceptState = true;
-		newState.prediction = predictedAlt;
-		newState.configs.uniqueAlt = predictedAlt;
-	} else if (hasConflictTerminatingPrediction(reach)) {
-		const prediction = min_default(reach.alts);
-		newState.isAcceptState = true;
-		newState.prediction = prediction;
-		newState.configs.uniqueAlt = prediction;
-		reportLookaheadAmbiguity.apply(this, [
-			dfa,
-			lookahead,
-			reach.alts,
-			logging
-		]);
-	}
-	newState = addDFAEdge(dfa, previousD, token, newState);
-	return newState;
-}
-function reportLookaheadAmbiguity(dfa, lookahead, ambiguityIndices, logging) {
-	const prefixPath = [];
-	for (let i = 1; i <= lookahead; i++) prefixPath.push(this.LA(i).tokenType);
-	const atnState = dfa.atnStartState;
-	const topLevelRule = atnState.rule;
-	const production = atnState.production;
-	logging(buildAmbiguityError({
-		topLevelRule,
-		ambiguityIndices,
-		production,
-		prefixPath
-	}));
-}
-function buildAmbiguityError(options) {
-	const pathMsg = map_default(options.prefixPath, (currtok) => tokenLabel(currtok)).join(", ");
-	const occurrence = options.production.idx === 0 ? "" : options.production.idx;
-	let currMessage = `Ambiguous Alternatives Detected: <${options.ambiguityIndices.join(", ")}> in <${getProductionDslName(options.production)}${occurrence}> inside <${options.topLevelRule.name}> Rule,\n<${pathMsg}> may appears as a prefix path in all these alternatives.\n`;
-	currMessage = currMessage + "See: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#AMBIGUOUS_ALTERNATIVES\nFor Further details.";
-	return currMessage;
-}
-function getProductionDslName(prod) {
-	if (prod instanceof NonTerminal) return "SUBRULE";
-	else if (prod instanceof Option) return "OPTION";
-	else if (prod instanceof Alternation) return "OR";
-	else if (prod instanceof RepetitionMandatory) return "AT_LEAST_ONE";
-	else if (prod instanceof RepetitionMandatoryWithSeparator) return "AT_LEAST_ONE_SEP";
-	else if (prod instanceof RepetitionWithSeparator) return "MANY_SEP";
-	else if (prod instanceof Repetition) return "MANY";
-	else if (prod instanceof Terminal) return "CONSUME";
-	else throw Error("non exhaustive match");
-}
-function buildAdaptivePredictError(path, previous, current) {
-	return {
-		actualToken: current,
-		possibleTokenTypes: uniqBy_default(flatMap_default(previous.configs.elements, (e) => e.state.transitions).filter((e) => e instanceof AtomTransition).map((e) => e.tokenType), (e) => e.tokenTypeIdx),
-		tokenPath: path
-	};
-}
-function getExistingTargetState(state, token) {
-	return state.edges[token.tokenTypeIdx];
-}
-function computeReachSet(configs, token, predicateSet) {
-	const intermediate = new ATNConfigSet();
-	const skippedStopStates = [];
-	for (const c of configs.elements) {
-		if (predicateSet.is(c.alt) === false) continue;
-		if (c.state.type === ATN_RULE_STOP) {
-			skippedStopStates.push(c);
-			continue;
-		}
-		const transitionLength = c.state.transitions.length;
-		for (let i = 0; i < transitionLength; i++) {
-			const transition = c.state.transitions[i];
-			const target = getReachableTarget(transition, token);
-			if (target !== void 0) intermediate.add({
-				state: target,
-				alt: c.alt,
-				stack: c.stack
-			});
-		}
-	}
-	let reach;
-	if (skippedStopStates.length === 0 && intermediate.size === 1) reach = intermediate;
-	if (reach === void 0) {
-		reach = new ATNConfigSet();
-		for (const c of intermediate.elements) closure(c, reach);
-	}
-	if (skippedStopStates.length > 0 && !hasConfigInRuleStopState(reach)) for (const c of skippedStopStates) reach.add(c);
-	return reach;
-}
-function getReachableTarget(transition, token) {
-	if (transition instanceof AtomTransition && tokenMatcher(token, transition.tokenType)) return transition.target;
-}
-function getUniqueAlt(configs, predicateSet) {
-	let alt;
-	for (const c of configs.elements) if (predicateSet.is(c.alt) === true) {
-		if (alt === void 0) alt = c.alt;
-		else if (alt !== c.alt) return;
-	}
-	return alt;
-}
-function newDFAState(closure) {
-	return {
-		configs: closure,
-		edges: {},
-		isAcceptState: false,
-		prediction: -1
-	};
-}
-function addDFAEdge(dfa, from, token, to) {
-	to = addDFAState(dfa, to);
-	from.edges[token.tokenTypeIdx] = to;
-	return to;
-}
-function addDFAState(dfa, state) {
-	if (state === DFA_ERROR) return state;
-	const mapKey = state.configs.key;
-	const existing = dfa.states[mapKey];
-	if (existing !== void 0) return existing;
-	state.configs.finalize();
-	dfa.states[mapKey] = state;
-	return state;
-}
-function computeStartState(atnState) {
-	const configs = new ATNConfigSet();
-	const numberOfTransitions = atnState.transitions.length;
-	for (let i = 0; i < numberOfTransitions; i++) closure({
-		state: atnState.transitions[i].target,
-		alt: i,
-		stack: []
-	}, configs);
-	return configs;
-}
-function closure(config, configs) {
-	const p = config.state;
-	if (p.type === ATN_RULE_STOP) {
-		if (config.stack.length > 0) {
-			const atnStack = [...config.stack];
-			closure({
-				state: atnStack.pop(),
-				alt: config.alt,
-				stack: atnStack
-			}, configs);
-		} else configs.add(config);
-		return;
-	}
-	if (!p.epsilonOnlyTransitions) configs.add(config);
-	const transitionLength = p.transitions.length;
-	for (let i = 0; i < transitionLength; i++) {
-		const transition = p.transitions[i];
-		const c = getEpsilonTarget(config, transition);
-		if (c !== void 0) closure(c, configs);
-	}
-}
-function getEpsilonTarget(config, transition) {
-	if (transition instanceof EpsilonTransition) return {
-		state: transition.target,
-		alt: config.alt,
-		stack: config.stack
-	};
-	else if (transition instanceof RuleTransition) {
-		const stack = [...config.stack, transition.followState];
-		return {
-			state: transition.target,
-			alt: config.alt,
-			stack
-		};
-	}
-}
-function hasConfigInRuleStopState(configs) {
-	for (const c of configs.elements) if (c.state.type === ATN_RULE_STOP) return true;
-	return false;
-}
-function allConfigsInRuleStopStates(configs) {
-	for (const c of configs.elements) if (c.state.type !== ATN_RULE_STOP) return false;
-	return true;
-}
-function hasConflictTerminatingPrediction(configs) {
-	if (allConfigsInRuleStopStates(configs)) return true;
-	const altSets = getConflictingAltSets(configs.elements);
-	return hasConflictingAltSet(altSets) && !hasStateAssociatedWithOneAlt(altSets);
-}
-function getConflictingAltSets(configs) {
-	const configToAlts = /* @__PURE__ */ new Map();
-	for (const c of configs) {
-		const key = getATNConfigKey(c, false);
-		let alts = configToAlts.get(key);
-		if (alts === void 0) {
-			alts = {};
-			configToAlts.set(key, alts);
-		}
-		alts[c.alt] = true;
-	}
-	return configToAlts;
-}
-function hasConflictingAltSet(altSets) {
-	for (const value of Array.from(altSets.values())) if (Object.keys(value).length > 1) return true;
-	return false;
-}
-function hasStateAssociatedWithOneAlt(altSets) {
-	for (const value of Array.from(altSets.values())) if (Object.keys(value).length === 1) return true;
-	return false;
-}
-
-//#endregion
-export { LLStarLookaheadStrategy as t };
+import{i as e,l as t,r as n,u as r}from"./chevrotain.mjs";import{C as i,E as a,L as o,N as s,P as c,_ as l,c as u,d,f,h as p,l as m,o as h,p as g,q as _,u as v,x as y,z as b}from"./@chevrotain/cst-dts-gen.mjs";function x(e,t,n){return`${e.name}_${t}_${n}`}var S=class{constructor(e){this.target=e}isEpsilon(){return!1}},C=class extends S{constructor(e,t){super(e),this.tokenType=t}},w=class extends S{constructor(e){super(e)}isEpsilon(){return!0}},T=class extends S{constructor(e,t,n){super(e),this.rule=t,this.followState=n}isEpsilon(){return!0}};function ee(e){let t={decisionMap:{},decisionStates:[],ruleToStartState:new Map,ruleToStopState:new Map,states:[]};te(t,e);let n=e.length;for(let r=0;r<n;r++){let n=e[r],i=k(t,n,n);i!==void 0&&ce(t,n,i)}return t}function te(e,t){let n=t.length;for(let r=0;r<n;r++){let n=t[r],i=R(e,n,void 0,{type:2}),a=R(e,n,void 0,{type:7});i.stop=a,e.ruleToStartState.set(n,i),e.ruleToStopState.set(n,a)}}function E(e,t,n){return n instanceof p?I(e,t,n.terminalType,n):n instanceof u?se(e,t,n):n instanceof h?ie(e,t,n):n instanceof m?ae(e,t,n):n instanceof v?D(e,t,n):n instanceof g?O(e,t,n):n instanceof d?ne(e,t,n):n instanceof f?re(e,t,n):k(e,t,n)}function D(e,t,n){let r=R(e,t,n,{type:5});return M(e,r),j(e,t,n,N(e,t,r,n,k(e,t,n)))}function O(e,t,n){let r=R(e,t,n,{type:5});return M(e,r),j(e,t,n,N(e,t,r,n,k(e,t,n)),I(e,t,n.separator,n))}function ne(e,t,n){let r=R(e,t,n,{type:4});return M(e,r),A(e,t,n,N(e,t,r,n,k(e,t,n)))}function re(e,t,n){let r=R(e,t,n,{type:4});return M(e,r),A(e,t,n,N(e,t,r,n,k(e,t,n)),I(e,t,n.separator,n))}function ie(e,t,n){let r=R(e,t,n,{type:1});return M(e,r),N(e,t,r,n,...c(n.definition,n=>E(e,t,n)))}function ae(e,t,n){let r=R(e,t,n,{type:1});return M(e,r),oe(e,t,n,N(e,t,r,n,k(e,t,n)))}function k(e,t,n){let r=o(c(n.definition,n=>E(e,t,n)),e=>e!==void 0);return r.length===1?r[0]:r.length===0?void 0:F(e,r)}function A(e,t,n,r,i){let a=r.left,o=r.right,s=R(e,t,n,{type:11});M(e,s);let c=R(e,t,n,{type:12});return a.loopback=s,c.loopback=s,e.decisionMap[x(t,i?`RepetitionMandatoryWithSeparator`:`RepetitionMandatory`,n.idx)]=s,L(o,s),i===void 0?(L(s,a),L(s,c)):(L(s,c),L(s,i.left),L(i.right,a)),{left:a,right:c}}function j(e,t,n,r,i){let a=r.left,o=r.right,s=R(e,t,n,{type:10});M(e,s);let c=R(e,t,n,{type:12}),l=R(e,t,n,{type:9});return s.loopback=l,c.loopback=l,L(s,a),L(s,c),L(o,l),i===void 0?L(l,s):(L(l,c),L(l,i.left),L(i.right,a)),e.decisionMap[x(t,i?`RepetitionWithSeparator`:`Repetition`,n.idx)]=s,{left:s,right:c}}function oe(e,t,n,r){let i=r.left,a=r.right;return L(i,a),e.decisionMap[x(t,`Option`,n.idx)]=i,r}function M(e,t){return e.decisionStates.push(t),t.decision=e.decisionStates.length-1,t.decision}function N(e,t,n,r,...i){let a=R(e,t,r,{type:8,start:n});n.end=a;for(let e of i)e===void 0?L(n,a):(L(n,e.left),L(e.right,a));let o={left:n,right:a};return e.decisionMap[x(t,P(r),r.idx)]=n,o}function P(e){if(e instanceof h)return`Alternation`;if(e instanceof m)return`Option`;if(e instanceof v)return`Repetition`;if(e instanceof g)return`RepetitionWithSeparator`;if(e instanceof d)return`RepetitionMandatory`;if(e instanceof f)return`RepetitionMandatoryWithSeparator`;throw Error(`Invalid production type encountered`)}function F(e,t){let n=t.length;for(let r=0;r<n-1;r++){let n=t[r],i;n.left.transitions.length===1&&(i=n.left.transitions[0]);let a=i instanceof T,o=i,s=t[r+1].left;n.left.type===1&&n.right.type===1&&i!==void 0&&(a&&o.followState===n.right||i.target===n.right)?(a?o.followState=s:i.target=s,B(e,n.right)):L(n.right,s)}let r=t[0],i=t[n-1];return{left:r.left,right:i.right}}function I(e,t,n,r){let i=R(e,t,r,{type:1}),a=R(e,t,r,{type:1});return z(i,new C(a,n)),{left:i,right:a}}function se(e,t,n){let r=n.referencedRule,i=e.ruleToStartState.get(r),a=R(e,t,n,{type:1}),o=R(e,t,n,{type:1});return z(a,new T(i,r,o)),{left:a,right:o}}function ce(e,t,n){let r=e.ruleToStartState.get(t);L(r,n.left);let i=e.ruleToStopState.get(t);return L(n.right,i),{left:r,right:i}}function L(e,t){z(e,new w(t))}function R(e,t,n,r){let i=Object.assign({atn:e,production:n,epsilonOnlyTransitions:!1,rule:t,transitions:[],nextTokenWithinRule:[],stateNumber:e.states.length},r);return e.states.push(i),i}function z(e,t){e.transitions.length===0&&(e.epsilonOnlyTransitions=t.isEpsilon()),e.transitions.push(t)}function B(e,t){e.states.splice(e.states.indexOf(t),1)}const V={};var H=class{constructor(){this.map={},this.configs=[]}get size(){return this.configs.length}finalize(){this.map={}}add(e){let t=U(e);t in this.map||(this.map[t]=this.configs.length,this.configs.push(e))}get elements(){return this.configs}get alts(){return c(this.configs,e=>e.alt)}get key(){let e=``;for(let t in this.map)e+=t+`:`;return e}};function U(e,t=!0){return`${t?`a${e.alt}`:``}s${e.state.stateNumber}:${e.stack.map(e=>e.stateNumber.toString()).join(`_`)}`}function W(e,t){let n={};return r=>{let i=r.toString(),a=n[i];return a===void 0?(a={atnStartState:e,decision:t,states:{}},n[i]=a,a):a}}var G=class{constructor(){this.predicates=[]}is(e){return e>=this.predicates.length||this.predicates[e]}set(e,t){this.predicates[e]=t}toString(){let e=``,t=this.predicates.length;for(let n=0;n<t;n++)e+=this.predicates[n]===!0?`1`:`0`;return e}};const K=new G;var le=class extends n{constructor(e){super(),this.logging=e?.logging??(e=>console.log(e))}initialize(e){this.atn=ee(e.rules),this.dfas=J(this.atn)}validateAmbiguousAlternationAlternatives(){return[]}validateEmptyOrAlternatives(){return[]}buildLookaheadForAlternation(t){let{prodOccurrence:n,rule:r,hasPredicates:i,dynamicTokensEnabled:a}=t,o=this.dfas,s=this.logging,l=x(r,`Alternation`,n),u=this.atn.decisionMap[l].decision,d=c(e({maxLookahead:1,occurrence:n,prodType:`Alternation`,rule:r}),e=>c(e,e=>e[0]));if(q(d,!1)&&!a){let e=y(d,(e,t,n)=>(b(t,t=>{t&&(e[t.tokenTypeIdx]=n,b(t.categoryMatches,t=>{e[t]=n}))}),e),{});return i?function(t){let n=e[this.LA(1).tokenTypeIdx];if(t!==void 0&&n!==void 0){let e=t[n]?.GATE;if(e!==void 0&&e.call(this)===!1)return}return n}:function(){return e[this.LA(1).tokenTypeIdx]}}else if(i)return function(e){let t=new G,n=e===void 0?0:e.length;for(let r=0;r<n;r++){let n=e?.[r].GATE;t.set(r,n===void 0||n.call(this))}let r=Y.call(this,o,u,t,s);return typeof r==`number`?r:void 0};else return function(){let e=Y.call(this,o,u,K,s);return typeof e==`number`?e:void 0}}buildLookaheadForOptional(t){let{prodOccurrence:n,rule:r,prodType:i,dynamicTokensEnabled:o}=t,s=this.dfas,l=this.logging,u=x(r,i,n),d=this.atn.decisionMap[u].decision,f=c(e({maxLookahead:1,occurrence:n,prodType:i,rule:r}),e=>c(e,e=>e[0]));if(q(f)&&f[0][0]&&!o){let e=f[0],t=_(e);if(t.length===1&&a(t[0].categoryMatches)){let e=t[0].tokenTypeIdx;return function(){return this.LA(1).tokenTypeIdx===e}}else{let e=y(t,(e,t)=>(t!==void 0&&(e[t.tokenTypeIdx]=!0,b(t.categoryMatches,t=>{e[t]=!0})),e),{});return function(){return e[this.LA(1).tokenTypeIdx]===!0}}}return function(){let e=Y.call(this,s,d,K,l);return typeof e==`object`?!1:e===0}}};function q(e,t=!0){let n=new Set;for(let r of e){let e=new Set;for(let i of r){if(i===void 0){if(t)break;return!1}let r=[i.tokenTypeIdx].concat(i.categoryMatches);for(let t of r)if(n.has(t)){if(!e.has(t))return!1}else n.add(t),e.add(t)}}return!0}function J(e){let t=e.decisionStates.length,n=Array(t);for(let r=0;r<t;r++)n[r]=W(e.decisionStates[r],r);return n}function Y(e,t,n,r){let i=e[t](n),a=i.start;return a===void 0&&(a=Q(i,X(be(i.atnStartState))),i.start=a),ue.apply(this,[i,a,n,r])}function ue(e,t,n,r){let i=t,a=1,o=[],s=this.LA(a++);for(;;){let t=ge(i,s);if(t===void 0&&(t=de.apply(this,[e,i,s,a,n,r])),t===V)return he(o,i,s);if(t.isAcceptState===!0)return t.prediction;i=t,o.push(s),s=this.LA(a++)}}function de(e,t,n,r,a,o){let s=_e(t.configs,n,a);if(s.size===0)return Z(e,t,n,V),V;let c=X(s),l=ye(s,a);if(l!==void 0)c.isAcceptState=!0,c.prediction=l,c.configs.uniqueAlt=l;else if(we(s)){let t=i(s.alts);c.isAcceptState=!0,c.prediction=t,c.configs.uniqueAlt=t,fe.apply(this,[e,r,s.alts,o])}return c=Z(e,t,n,c),c}function fe(e,t,n,r){let i=[];for(let e=1;e<=t;e++)i.push(this.LA(e).tokenType);let a=e.atnStartState,o=a.rule,s=a.production;r(pe({topLevelRule:o,ambiguityIndices:n,production:s,prefixPath:i}))}function pe(e){let n=c(e.prefixPath,e=>t(e)).join(`, `),r=e.production.idx===0?``:e.production.idx,i=`Ambiguous Alternatives Detected: <${e.ambiguityIndices.join(`, `)}> in <${me(e.production)}${r}> inside <${e.topLevelRule.name}> Rule,\n<${n}> may appears as a prefix path in all these alternatives.\n`;return i+=`See: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#AMBIGUOUS_ALTERNATIVES
+For Further details.`,i}function me(e){if(e instanceof u)return`SUBRULE`;if(e instanceof m)return`OPTION`;if(e instanceof h)return`OR`;if(e instanceof d)return`AT_LEAST_ONE`;if(e instanceof f)return`AT_LEAST_ONE_SEP`;if(e instanceof g)return`MANY_SEP`;if(e instanceof v)return`MANY`;if(e instanceof p)return`CONSUME`;throw Error(`non exhaustive match`)}function he(e,t,n){return{actualToken:n,possibleTokenTypes:l(s(t.configs.elements,e=>e.state.transitions).filter(e=>e instanceof C).map(e=>e.tokenType),e=>e.tokenTypeIdx),tokenPath:e}}function ge(e,t){return e.edges[t.tokenTypeIdx]}function _e(e,t,n){let r=new H,i=[];for(let a of e.elements){if(n.is(a.alt)===!1)continue;if(a.state.type===7){i.push(a);continue}let e=a.state.transitions.length;for(let n=0;n<e;n++){let e=a.state.transitions[n],i=ve(e,t);i!==void 0&&r.add({state:i,alt:a.alt,stack:a.stack})}}let a;if(i.length===0&&r.size===1&&(a=r),a===void 0){a=new H;for(let e of r.elements)$(e,a)}if(i.length>0&&!Se(a))for(let e of i)a.add(e);return a}function ve(e,t){if(e instanceof C&&r(t,e.tokenType))return e.target}function ye(e,t){let n;for(let r of e.elements)if(t.is(r.alt)===!0){if(n===void 0)n=r.alt;else if(n!==r.alt)return}return n}function X(e){return{configs:e,edges:{},isAcceptState:!1,prediction:-1}}function Z(e,t,n,r){return r=Q(e,r),t.edges[n.tokenTypeIdx]=r,r}function Q(e,t){if(t===V)return t;let n=t.configs.key,r=e.states[n];return r===void 0?(t.configs.finalize(),e.states[n]=t,t):r}function be(e){let t=new H,n=e.transitions.length;for(let r=0;r<n;r++)$({state:e.transitions[r].target,alt:r,stack:[]},t);return t}function $(e,t){let n=e.state;if(n.type===7){if(e.stack.length>0){let n=[...e.stack];$({state:n.pop(),alt:e.alt,stack:n},t)}else t.add(e);return}n.epsilonOnlyTransitions||t.add(e);let r=n.transitions.length;for(let i=0;i<r;i++){let r=n.transitions[i],a=xe(e,r);a!==void 0&&$(a,t)}}function xe(e,t){if(t instanceof w)return{state:t.target,alt:e.alt,stack:e.stack};if(t instanceof T){let n=[...e.stack,t.followState];return{state:t.target,alt:e.alt,stack:n}}}function Se(e){for(let t of e.elements)if(t.state.type===7)return!0;return!1}function Ce(e){for(let t of e.elements)if(t.state.type!==7)return!1;return!0}function we(e){if(Ce(e))return!0;let t=Te(e.elements);return Ee(t)&&!De(t)}function Te(e){let t=new Map;for(let n of e){let e=U(n,!1),r=t.get(e);r===void 0&&(r={},t.set(e,r)),r[n.alt]=!0}return t}function Ee(e){for(let t of Array.from(e.values()))if(Object.keys(t).length>1)return!0;return!1}function De(e){for(let t of Array.from(e.values()))if(Object.keys(t).length===1)return!0;return!1}export{le as t};