@plumile/ui 0.1.113 → 0.1.115

package/lib/esm/node_modules/chevrotain-allstar/lib/all-star-lookahead.js

@@ -1,365 +0,0 @@
-import { Alternation as e, NonTerminal as t, Option as n, Repetition as r, RepetitionMandatory as i, RepetitionMandatoryWithSeparator as a, RepetitionWithSeparator as o, Terminal as s } from "../../@chevrotain/gast/lib/src/model.js";
-import { EOF as c, tokenLabel as l, tokenMatcher as u } from "../../chevrotain/lib/src/scan/tokens_public.js";
-import { getLookaheadPaths as d } from "../../chevrotain/lib/src/parse/grammar/lookahead.js";
-import { LLkLookaheadStrategy as f } from "../../chevrotain/lib/src/parse/grammar/llk_lookahead.js";
-import "../../chevrotain/lib/src/api.js";
-import p from "../../lodash-es/map.js";
-import { AtomTransition as m, EpsilonTransition as h, RuleTransition as g, buildATNKey as _, createATN as v } from "./atn.js";
-import { ATNConfigSet as y, DFA_ERROR as b, getATNConfigKey as x } from "./dfa.js";
-import S from "../../lodash-es/min.js";
-import C from "../../lodash-es/flatMap.js";
-import w from "../../lodash-es/uniqBy.js";
-import T from "../../lodash-es/flatten.js";
-import E from "../../lodash-es/forEach.js";
-import D from "../../lodash-es/isEmpty.js";
-import O from "../../lodash-es/reduce.js";
-//#region ../../node_modules/chevrotain-allstar/lib/all-star-lookahead.js
-function k(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 A = 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;
-	}
-}, j = new A(), M = class extends f {
-	constructor(e) {
-		super(), this.logging = e?.logging ?? ((e) => console.log(e)), this.incomplete = e?.incomplete ?? !1;
-	}
-	initialize(e) {
-		this.atn = v(e.rules), this.dfas = P(this.atn);
-	}
-	validateAmbiguousAlternationAlternatives() {
-		return [];
-	}
-	validateEmptyOrAlternatives() {
-		return [];
-	}
-	buildLookaheadForAlternation(e) {
-		let { prodOccurrence: t, rule: n, hasPredicates: r, dynamicTokensEnabled: i } = e, a = this.dfas, o = this.logging, s = this.incomplete, c = _(n, "Alternation", t), l = this.atn.decisionMap[c].decision, u = p(d({
-			maxLookahead: 1,
-			occurrence: t,
-			prodType: "Alternation",
-			rule: n
-		}), (e) => p(e, (e) => e[0]));
-		if (N(u, !1) && !i) {
-			let e = O(u, (e, t, n) => (E(t, (t) => {
-				t && (e[t.tokenTypeIdx] = n, E(t.categoryMatches, (t) => {
-					e[t] = n;
-				}));
-			}), e), {});
-			return r ? function(t) {
-				let n = e[this.LA_FAST(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_FAST(1).tokenTypeIdx];
-			};
-		} else if (r) return function(e) {
-			let t = new A(), 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 = F.call(this, a, l, t, o, s);
-			return typeof r == "number" ? r : void 0;
-		};
-		else return function() {
-			let e = F.call(this, a, l, j, o, s);
-			return typeof e == "number" ? e : void 0;
-		};
-	}
-	buildLookaheadForOptional(e) {
-		let { prodOccurrence: t, rule: n, prodType: r, dynamicTokensEnabled: i } = e, a = this.dfas, o = this.logging, s = this.incomplete, c = _(n, r, t), l = this.atn.decisionMap[c].decision, u = p(d({
-			maxLookahead: 1,
-			occurrence: t,
-			prodType: r,
-			rule: n
-		}), (e) => p(e, (e) => e[0]));
-		if (N(u) && u[0][0] && !i) {
-			let e = u[0], t = T(e);
-			if (t.length === 1 && D(t[0].categoryMatches)) {
-				let e = t[0].tokenTypeIdx;
-				return function() {
-					return this.LA_FAST(1).tokenTypeIdx === e;
-				};
-			} else {
-				let e = O(t, (e, t) => (t !== void 0 && (e[t.tokenTypeIdx] = !0, E(t.categoryMatches, (t) => {
-					e[t] = !0;
-				})), e), {});
-				return function() {
-					return e[this.LA_FAST(1).tokenTypeIdx] === !0;
-				};
-			}
-		}
-		return function() {
-			let e = F.call(this, a, l, j, o, s);
-			return typeof e == "object" ? !1 : e === 0;
-		};
-	}
-};
-function N(e, t = !0) {
-	let n = /* @__PURE__ */ new Set();
-	for (let r of e) {
-		let e = /* @__PURE__ */ 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 P(e) {
-	let t = e.decisionStates.length, n = Array(t);
-	for (let r = 0; r < t; r++) n[r] = k(e.decisionStates[r], r);
-	return n;
-}
-function F(e, t, n, r, i) {
-	let a = e[t](n), o = a.start;
-	return o === void 0 && (o = J(a, K(Y(a.atnStartState))), a.start = o), I.apply(this, [
-		a,
-		o,
-		n,
-		r,
-		i
-	]);
-}
-function I(e, t, n, r, i) {
-	let a = t, o = 1, s = [], l = this.LA_FAST(o++);
-	for (;;) {
-		let t = H(a, l);
-		if (t === void 0 && (t = L.apply(this, [
-			e,
-			a,
-			l,
-			o,
-			n,
-			r
-		])), t === b) return V(s, a, l);
-		if (t.isAcceptState === !0) {
-			if (i === !0 && u(l, c)) {
-				let e = ie(a, n);
-				if (e !== void 0) return e;
-			}
-			return t.prediction;
-		}
-		a = t, s.push(l), l = this.LA(o++);
-	}
-}
-function L(e, t, n, r, i, a) {
-	let o = U(t.configs, n, i);
-	if (o.size === 0) return q(e, t, n, b), b;
-	let s = K(o), c = G(o, i);
-	if (c !== void 0) s.isAcceptState = !0, s.prediction = c, s.configs.uniqueAlt = c;
-	else if (ee(o)) {
-		let t = S(o.alts);
-		s.isAcceptState = !0, s.prediction = t, s.configs.uniqueAlt = t, R.apply(this, [
-			e,
-			r,
-			o.alts,
-			a
-		]);
-	}
-	return s = q(e, t, n, s), s;
-}
-function R(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(z({
-		topLevelRule: o,
-		ambiguityIndices: n,
-		production: s,
-		prefixPath: i
-	}));
-}
-function z(e) {
-	let t = p(e.prefixPath, (e) => l(e)).join(", "), n = e.production.idx === 0 ? "" : e.production.idx, r = `Ambiguous Alternatives Detected: <${e.ambiguityIndices.join(", ")}> in <${B(e.production)}${n}> inside <${e.topLevelRule.name}> Rule,\n<${t}> may appears as a prefix path in all these alternatives.\n`;
-	return r += "See: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#AMBIGUOUS_ALTERNATIVES\nFor Further details.", r;
-}
-function B(c) {
-	if (c instanceof t) return "SUBRULE";
-	if (c instanceof n) return "OPTION";
-	if (c instanceof e) return "OR";
-	if (c instanceof i) return "AT_LEAST_ONE";
-	if (c instanceof a) return "AT_LEAST_ONE_SEP";
-	if (c instanceof o) return "MANY_SEP";
-	if (c instanceof r) return "MANY";
-	if (c instanceof s) return "CONSUME";
-	throw Error("non exhaustive match");
-}
-function V(e, t, n) {
-	return {
-		actualToken: n,
-		possibleTokenTypes: w(C(t.configs.elements, (e) => e.state.transitions).filter((e) => e instanceof m).map((e) => e.tokenType), (e) => e.tokenTypeIdx),
-		tokenPath: e
-	};
-}
-function H(e, t) {
-	return e.edges[t.tokenTypeIdx];
-}
-function U(e, t, n) {
-	let r = new y(), 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 = W(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 y();
-		for (let e of r.elements) X(e, a);
-	}
-	if (i.length > 0 && !Q(a)) for (let e of i) a.add(e);
-	return a;
-}
-function W(e, t) {
-	if (e instanceof m && u(t, e.tokenType)) return e.target;
-}
-function G(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 K(e) {
-	return {
-		configs: e,
-		edges: {},
-		isAcceptState: !1,
-		prediction: -1
-	};
-}
-function q(e, t, n, r) {
-	return r = J(e, r), t.edges[n.tokenTypeIdx] = r, r;
-}
-function J(e, t) {
-	if (t === b) 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 Y(e) {
-	let t = new y(), n = e.transitions.length;
-	for (let r = 0; r < n; r++) X({
-		state: e.transitions[r].target,
-		alt: r,
-		stack: []
-	}, t);
-	return t;
-}
-function X(e, t) {
-	let n = e.state;
-	if (n.type === 7) {
-		if (e.stack.length > 0) {
-			let n = [...e.stack];
-			X({
-				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 = Z(e, r);
-		a !== void 0 && X(a, t);
-	}
-}
-function Z(e, t) {
-	if (t instanceof h) return {
-		state: t.target,
-		alt: e.alt,
-		stack: e.stack
-	};
-	if (t instanceof g) {
-		let n = [...e.stack, t.followState];
-		return {
-			state: t.target,
-			alt: e.alt,
-			stack: n
-		};
-	}
-}
-function Q(e) {
-	for (let t of e.elements) if (t.state.type === 7) return !0;
-	return !1;
-}
-function $(e) {
-	for (let t of e.elements) if (t.state.type !== 7) return !1;
-	return !0;
-}
-function ee(e) {
-	if ($(e)) return !0;
-	let t = te(e.elements);
-	return ne(t) && !re(t);
-}
-function te(e) {
-	let t = /* @__PURE__ */ new Map();
-	for (let n of e) {
-		let e = x(n, !1), r = t.get(e);
-		r === void 0 && (r = {}, t.set(e, r)), r[n.alt] = !0;
-	}
-	return t;
-}
-function ne(e) {
-	for (let t of Array.from(e.values())) if (Object.keys(t).length > 1) return !0;
-	return !1;
-}
-function re(e) {
-	for (let t of Array.from(e.values())) if (Object.keys(t).length === 1) return !0;
-	return !1;
-}
-function ie(e, t) {
-	let n;
-	for (let r of e.configs.elements) if (!(t.is(r.alt) === !1 || r.state.type === 7)) {
-		if (n === void 0) n = r.alt;
-		else if (n !== r.alt) return;
-	}
-	return n;
-}
-//#endregion
-export { M as LLStarLookaheadStrategy };
-
-//# sourceMappingURL=all-star-lookahead.js.map

package/lib/esm/node_modules/chevrotain-allstar/lib/all-star-lookahead.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"all-star-lookahead.js","names":[],"sources":["../../../../../../../node_modules/chevrotain-allstar/lib/all-star-lookahead.js"],"sourcesContent":["/******************************************************************************\n * Copyright 2022 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\nimport { tokenMatcher, tokenLabel, NonTerminal, Alternation, Option, RepetitionMandatory, RepetitionMandatoryWithSeparator, RepetitionWithSeparator, Repetition, Terminal, LLkLookaheadStrategy, getLookaheadPaths, EOF } from \"chevrotain\";\nimport { ATN_RULE_STOP, AtomTransition, buildATNKey, createATN, EpsilonTransition, RuleTransition } from \"./atn.js\";\nimport { ATNConfigSet, DFA_ERROR, getATNConfigKey } from \"./dfa.js\";\nimport min from \"lodash-es/min.js\";\nimport flatMap from \"lodash-es/flatMap.js\";\nimport uniqBy from \"lodash-es/uniqBy.js\";\nimport map from \"lodash-es/map.js\";\nimport flatten from \"lodash-es/flatten.js\";\nimport forEach from \"lodash-es/forEach.js\";\nimport isEmpty from \"lodash-es/isEmpty.js\";\nimport reduce from \"lodash-es/reduce.js\";\nfunction createDFACache(startState, decision) {\n    const map = {};\n    return (predicateSet) => {\n        const key = predicateSet.toString();\n        let existing = map[key];\n        if (existing !== undefined) {\n            return existing;\n        }\n        else {\n            existing = {\n                atnStartState: startState,\n                decision,\n                states: {}\n            };\n            map[key] = existing;\n            return existing;\n        }\n    };\n}\nclass PredicateSet {\n    constructor() {\n        this.predicates = [];\n    }\n    is(index) {\n        return index >= this.predicates.length || this.predicates[index];\n    }\n    set(index, value) {\n        this.predicates[index] = value;\n    }\n    toString() {\n        let value = \"\";\n        const size = this.predicates.length;\n        for (let i = 0; i < size; i++) {\n            value += this.predicates[i] === true ? \"1\" : \"0\";\n        }\n        return value;\n    }\n}\nconst EMPTY_PREDICATES = new PredicateSet();\nexport class LLStarLookaheadStrategy extends LLkLookaheadStrategy {\n    constructor(options) {\n        var _a, _b;\n        super();\n        this.logging = (_a = options === null || options === void 0 ? void 0 : options.logging) !== null && _a !== void 0 ? _a : ((message) => console.log(message));\n        this.incomplete = (_b = options === null || options === void 0 ? void 0 : options.incomplete) !== null && _b !== void 0 ? _b : false;\n    }\n    initialize(options) {\n        this.atn = createATN(options.rules);\n        this.dfas = initATNSimulator(this.atn);\n    }\n    validateAmbiguousAlternationAlternatives() {\n        return [];\n    }\n    validateEmptyOrAlternatives() {\n        return [];\n    }\n    buildLookaheadForAlternation(options) {\n        const { prodOccurrence, rule, hasPredicates, dynamicTokensEnabled } = options;\n        const dfas = this.dfas;\n        const logging = this.logging;\n        const incomplete = this.incomplete;\n        const key = buildATNKey(rule, 'Alternation', prodOccurrence);\n        const decisionState = this.atn.decisionMap[key];\n        const decisionIndex = decisionState.decision;\n        const partialAlts = map(getLookaheadPaths({\n            maxLookahead: 1,\n            occurrence: prodOccurrence,\n            prodType: \"Alternation\",\n            rule: rule\n        }), (currAlt) => map(currAlt, (path) => path[0]));\n        if (isLL1Sequence(partialAlts, false) && !dynamicTokensEnabled) {\n            const choiceToAlt = reduce(partialAlts, (result, currAlt, idx) => {\n                forEach(currAlt, (currTokType) => {\n                    if (currTokType) {\n                        result[currTokType.tokenTypeIdx] = idx;\n                        forEach(currTokType.categoryMatches, (currExtendingType) => {\n                            result[currExtendingType] = idx;\n                        });\n                    }\n                });\n                return result;\n            }, {});\n            if (hasPredicates) {\n                return function (orAlts) {\n                    var _a;\n                    const nextToken = this.LA_FAST(1);\n                    const prediction = choiceToAlt[nextToken.tokenTypeIdx];\n                    if (orAlts !== undefined && prediction !== undefined) {\n                        const gate = (_a = orAlts[prediction]) === null || _a === void 0 ? void 0 : _a.GATE;\n                        if (gate !== undefined && gate.call(this) === false) {\n                            return undefined;\n                        }\n                    }\n                    return prediction;\n                };\n            }\n            else {\n                return function () {\n                    const nextToken = this.LA_FAST(1);\n                    return choiceToAlt[nextToken.tokenTypeIdx];\n                };\n            }\n        }\n        else if (hasPredicates) {\n            return function (orAlts) {\n                const predicates = new PredicateSet();\n                const length = orAlts === undefined ? 0 : orAlts.length;\n                for (let i = 0; i < length; i++) {\n                    const gate = orAlts === null || orAlts === void 0 ? void 0 : orAlts[i].GATE;\n                    predicates.set(i, gate === undefined || gate.call(this));\n                }\n                const result = adaptivePredict.call(this, dfas, decisionIndex, predicates, logging, incomplete);\n                return typeof result === 'number' ? result : undefined;\n            };\n        }\n        else {\n            return function () {\n                const result = adaptivePredict.call(this, dfas, decisionIndex, EMPTY_PREDICATES, logging, incomplete);\n                return typeof result === 'number' ? result : undefined;\n            };\n        }\n    }\n    buildLookaheadForOptional(options) {\n        const { prodOccurrence, rule, prodType, dynamicTokensEnabled } = options;\n        const dfas = this.dfas;\n        const logging = this.logging;\n        const incomplete = this.incomplete;\n        const key = buildATNKey(rule, prodType, prodOccurrence);\n        const decisionState = this.atn.decisionMap[key];\n        const decisionIndex = decisionState.decision;\n        const alts = map(getLookaheadPaths({\n            maxLookahead: 1,\n            occurrence: prodOccurrence,\n            prodType,\n            rule\n        }), (e) => {\n            return map(e, (g) => g[0]);\n        });\n        if (isLL1Sequence(alts) && alts[0][0] && !dynamicTokensEnabled) {\n            const alt = alts[0];\n            const singleTokensTypes = flatten(alt);\n            if (singleTokensTypes.length === 1 &&\n                isEmpty(singleTokensTypes[0].categoryMatches)) {\n                const expectedTokenType = singleTokensTypes[0];\n                const expectedTokenUniqueKey = expectedTokenType.tokenTypeIdx;\n                return function () {\n                    return this.LA_FAST(1).tokenTypeIdx === expectedTokenUniqueKey;\n                };\n            }\n            else {\n                const choiceToAlt = reduce(singleTokensTypes, (result, currTokType) => {\n                    if (currTokType !== undefined) {\n                        result[currTokType.tokenTypeIdx] = true;\n                        forEach(currTokType.categoryMatches, (currExtendingType) => {\n                            result[currExtendingType] = true;\n                        });\n                    }\n                    return result;\n                }, {});\n                return function () {\n                    const nextToken = this.LA_FAST(1);\n                    return choiceToAlt[nextToken.tokenTypeIdx] === true;\n                };\n            }\n        }\n        return function () {\n            const result = adaptivePredict.call(this, dfas, decisionIndex, EMPTY_PREDICATES, logging, incomplete);\n            return typeof result === \"object\" ? false : result === 0;\n        };\n    }\n}\nfunction isLL1Sequence(sequences, allowEmpty = true) {\n    const fullSet = new Set();\n    for (const alt of sequences) {\n        const altSet = new Set();\n        for (const tokType of alt) {\n            if (tokType === undefined) {\n                if (allowEmpty) {\n                    // Epsilon production encountered\n                    break;\n                }\n                else {\n                    return false;\n                }\n            }\n            const indices = [tokType.tokenTypeIdx].concat(tokType.categoryMatches);\n            for (const index of indices) {\n                if (fullSet.has(index)) {\n                    if (!altSet.has(index)) {\n                        return false;\n                    }\n                }\n                else {\n                    fullSet.add(index);\n                    altSet.add(index);\n                }\n            }\n        }\n    }\n    return true;\n}\nfunction initATNSimulator(atn) {\n    const decisionLength = atn.decisionStates.length;\n    const decisionToDFA = Array(decisionLength);\n    for (let i = 0; i < decisionLength; i++) {\n        decisionToDFA[i] = createDFACache(atn.decisionStates[i], i);\n    }\n    return decisionToDFA;\n}\nfunction adaptivePredict(dfaCaches, decision, predicateSet, logging, incomplete) {\n    const dfa = dfaCaches[decision](predicateSet);\n    let start = dfa.start;\n    if (start === undefined) {\n        const closure = computeStartState(dfa.atnStartState);\n        start = addDFAState(dfa, newDFAState(closure));\n        dfa.start = start;\n    }\n    const alt = performLookahead.apply(this, [dfa, start, predicateSet, logging, incomplete]);\n    return alt;\n}\nfunction performLookahead(dfa, s0, predicateSet, logging, incomplete) {\n    let previousD = s0;\n    let i = 1;\n    const path = [];\n    // Using LA_FAST is fine here\n    let t = this.LA_FAST(i++);\n    while (true) {\n        let d = getExistingTargetState(previousD, t);\n        if (d === undefined) {\n            d = computeLookaheadTarget.apply(this, [dfa, previousD, t, i, predicateSet, logging]);\n        }\n        if (d === DFA_ERROR) {\n            return buildAdaptivePredictError(path, previousD, t);\n        }\n        if (d.isAcceptState === true) {\n            if (incomplete === true && tokenMatcher(t, EOF)) {\n                // We run into this case, when we reached the end of the input, but we are in the middle of evaluating a lookahead sequence\n                // The sequence is incomplete, but we can still make an educated guess on which alternative is more likely to be correct\n                const bestGuess = getBestGuess(previousD, predicateSet);\n                if (bestGuess !== undefined) {\n                    return bestGuess;\n                }\n            }\n            return d.prediction;\n        }\n        previousD = d;\n        path.push(t);\n        // We might be reading out of bounds\n        // Therefore, no LA_FAST here\n        t = this.LA(i++);\n    }\n}\nfunction computeLookaheadTarget(dfa, previousD, token, lookahead, predicateSet, logging) {\n    const reach = computeReachSet(previousD.configs, token, predicateSet);\n    if (reach.size === 0) {\n        addDFAEdge(dfa, previousD, token, DFA_ERROR);\n        return DFA_ERROR;\n    }\n    let newState = newDFAState(reach);\n    const predictedAlt = getUniqueAlt(reach, predicateSet);\n    if (predictedAlt !== undefined) {\n        newState.isAcceptState = true;\n        newState.prediction = predictedAlt;\n        newState.configs.uniqueAlt = predictedAlt;\n    }\n    else if (hasConflictTerminatingPrediction(reach)) {\n        const prediction = min(reach.alts);\n        newState.isAcceptState = true;\n        newState.prediction = prediction;\n        newState.configs.uniqueAlt = prediction;\n        reportLookaheadAmbiguity.apply(this, [dfa, lookahead, reach.alts, logging]);\n    }\n    newState = addDFAEdge(dfa, previousD, token, newState);\n    return newState;\n}\nfunction reportLookaheadAmbiguity(dfa, lookahead, ambiguityIndices, logging) {\n    const prefixPath = [];\n    for (let i = 1; i <= lookahead; i++) {\n        prefixPath.push(this.LA(i).tokenType);\n    }\n    const atnState = dfa.atnStartState;\n    const topLevelRule = atnState.rule;\n    const production = atnState.production;\n    const message = buildAmbiguityError({\n        topLevelRule,\n        ambiguityIndices,\n        production,\n        prefixPath\n    });\n    logging(message);\n}\nfunction buildAmbiguityError(options) {\n    const pathMsg = map(options.prefixPath, (currtok) => tokenLabel(currtok)).join(\", \");\n    const occurrence = options.production.idx === 0 ? \"\" : options.production.idx;\n    let currMessage = `Ambiguous Alternatives Detected: <${options.ambiguityIndices.join(\", \")}> in <${getProductionDslName(options.production)}${occurrence}>` +\n        ` inside <${options.topLevelRule.name}> Rule,\\n` +\n        `<${pathMsg}> may appears as a prefix path in all these alternatives.\\n`;\n    currMessage =\n        currMessage +\n            `See: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#AMBIGUOUS_ALTERNATIVES\\n` +\n            `For Further details.`;\n    return currMessage;\n}\nfunction getProductionDslName(prod) {\n    if (prod instanceof NonTerminal) {\n        return \"SUBRULE\";\n    }\n    else if (prod instanceof Option) {\n        return \"OPTION\";\n    }\n    else if (prod instanceof Alternation) {\n        return \"OR\";\n    }\n    else if (prod instanceof RepetitionMandatory) {\n        return \"AT_LEAST_ONE\";\n    }\n    else if (prod instanceof RepetitionMandatoryWithSeparator) {\n        return \"AT_LEAST_ONE_SEP\";\n    }\n    else if (prod instanceof RepetitionWithSeparator) {\n        return \"MANY_SEP\";\n    }\n    else if (prod instanceof Repetition) {\n        return \"MANY\";\n    }\n    else if (prod instanceof Terminal) {\n        return \"CONSUME\";\n    }\n    else {\n        throw Error(\"non exhaustive match\");\n    }\n}\nfunction buildAdaptivePredictError(path, previous, current) {\n    const nextTransitions = flatMap(previous.configs.elements, (e) => e.state.transitions);\n    const nextTokenTypes = uniqBy(nextTransitions\n        .filter((e) => e instanceof AtomTransition)\n        .map((e) => e.tokenType), (e) => e.tokenTypeIdx);\n    return {\n        actualToken: current,\n        possibleTokenTypes: nextTokenTypes,\n        tokenPath: path\n    };\n}\nfunction getExistingTargetState(state, token) {\n    return state.edges[token.tokenTypeIdx];\n}\nfunction computeReachSet(configs, token, predicateSet) {\n    const intermediate = new ATNConfigSet();\n    const skippedStopStates = [];\n    for (const c of configs.elements) {\n        if (predicateSet.is(c.alt) === false) {\n            continue;\n        }\n        if (c.state.type === ATN_RULE_STOP) {\n            skippedStopStates.push(c);\n            continue;\n        }\n        const transitionLength = c.state.transitions.length;\n        for (let i = 0; i < transitionLength; i++) {\n            const transition = c.state.transitions[i];\n            const target = getReachableTarget(transition, token);\n            if (target !== undefined) {\n                intermediate.add({\n                    state: target,\n                    alt: c.alt,\n                    stack: c.stack\n                });\n            }\n        }\n    }\n    let reach;\n    if (skippedStopStates.length === 0 && intermediate.size === 1) {\n        reach = intermediate;\n    }\n    if (reach === undefined) {\n        reach = new ATNConfigSet();\n        for (const c of intermediate.elements) {\n            closure(c, reach);\n        }\n    }\n    if (skippedStopStates.length > 0 && !hasConfigInRuleStopState(reach)) {\n        for (const c of skippedStopStates) {\n            reach.add(c);\n        }\n    }\n    return reach;\n}\nfunction getReachableTarget(transition, token) {\n    if (transition instanceof AtomTransition &&\n        tokenMatcher(token, transition.tokenType)) {\n        return transition.target;\n    }\n    return undefined;\n}\nfunction getUniqueAlt(configs, predicateSet) {\n    let alt;\n    for (const c of configs.elements) {\n        if (predicateSet.is(c.alt) === true) {\n            if (alt === undefined) {\n                alt = c.alt;\n            }\n            else if (alt !== c.alt) {\n                return undefined;\n            }\n        }\n    }\n    return alt;\n}\nfunction newDFAState(closure) {\n    return {\n        configs: closure,\n        edges: {},\n        isAcceptState: false,\n        prediction: -1\n    };\n}\nfunction addDFAEdge(dfa, from, token, to) {\n    to = addDFAState(dfa, to);\n    from.edges[token.tokenTypeIdx] = to;\n    return to;\n}\nfunction addDFAState(dfa, state) {\n    if (state === DFA_ERROR) {\n        return state;\n    }\n    // Repetitions have the same config set\n    // Therefore, storing the key of the config in a map allows us to create a loop in our DFA\n    const mapKey = state.configs.key;\n    const existing = dfa.states[mapKey];\n    if (existing !== undefined) {\n        return existing;\n    }\n    state.configs.finalize();\n    dfa.states[mapKey] = state;\n    return state;\n}\nfunction computeStartState(atnState) {\n    const configs = new ATNConfigSet();\n    const numberOfTransitions = atnState.transitions.length;\n    for (let i = 0; i < numberOfTransitions; i++) {\n        const target = atnState.transitions[i].target;\n        const config = {\n            state: target,\n            alt: i,\n            stack: []\n        };\n        closure(config, configs);\n    }\n    return configs;\n}\nfunction closure(config, configs) {\n    const p = config.state;\n    if (p.type === ATN_RULE_STOP) {\n        if (config.stack.length > 0) {\n            const atnStack = [...config.stack];\n            const followState = atnStack.pop();\n            const followConfig = {\n                state: followState,\n                alt: config.alt,\n                stack: atnStack\n            };\n            closure(followConfig, configs);\n        }\n        else {\n            // Dipping into outer context, simply add the config\n            // This will stop computation once every config is at the rule stop state\n            configs.add(config);\n        }\n        return;\n    }\n    if (!p.epsilonOnlyTransitions) {\n        configs.add(config);\n    }\n    const transitionLength = p.transitions.length;\n    for (let i = 0; i < transitionLength; i++) {\n        const transition = p.transitions[i];\n        const c = getEpsilonTarget(config, transition);\n        if (c !== undefined) {\n            closure(c, configs);\n        }\n    }\n}\nfunction getEpsilonTarget(config, transition) {\n    if (transition instanceof EpsilonTransition) {\n        return {\n            state: transition.target,\n            alt: config.alt,\n            stack: config.stack\n        };\n    }\n    else if (transition instanceof RuleTransition) {\n        const stack = [...config.stack, transition.followState];\n        return {\n            state: transition.target,\n            alt: config.alt,\n            stack\n        };\n    }\n    return undefined;\n}\nfunction hasConfigInRuleStopState(configs) {\n    for (const c of configs.elements) {\n        if (c.state.type === ATN_RULE_STOP) {\n            return true;\n        }\n    }\n    return false;\n}\nfunction allConfigsInRuleStopStates(configs) {\n    for (const c of configs.elements) {\n        if (c.state.type !== ATN_RULE_STOP) {\n            return false;\n        }\n    }\n    return true;\n}\nfunction hasConflictTerminatingPrediction(configs) {\n    if (allConfigsInRuleStopStates(configs)) {\n        return true;\n    }\n    const altSets = getConflictingAltSets(configs.elements);\n    const heuristic = hasConflictingAltSet(altSets) && !hasStateAssociatedWithOneAlt(altSets);\n    return heuristic;\n}\nfunction getConflictingAltSets(configs) {\n    const configToAlts = new Map();\n    for (const c of configs) {\n        const key = getATNConfigKey(c, false);\n        let alts = configToAlts.get(key);\n        if (alts === undefined) {\n            alts = {};\n            configToAlts.set(key, alts);\n        }\n        alts[c.alt] = true;\n    }\n    return configToAlts;\n}\nfunction hasConflictingAltSet(altSets) {\n    for (const value of Array.from(altSets.values())) {\n        if (Object.keys(value).length > 1) {\n            return true;\n        }\n    }\n    return false;\n}\nfunction hasStateAssociatedWithOneAlt(altSets) {\n    for (const value of Array.from(altSets.values())) {\n        if (Object.keys(value).length === 1) {\n            return true;\n        }\n    }\n    return false;\n}\nfunction getBestGuess(state, predicateSet) {\n    let bestAlt = undefined;\n    for (const c of state.configs.elements) {\n        // Ignore invalid and stop states\n        if (predicateSet.is(c.alt) === false || c.state.type === ATN_RULE_STOP) {\n            continue;\n        }\n        if (bestAlt === undefined) {\n            bestAlt = c.alt;\n        }\n        else if (bestAlt !== c.alt) {\n            return undefined;\n        }\n    }\n    return bestAlt;\n}\n//# sourceMappingURL=all-star-lookahead.js.map"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;;;;AAgBA,SAAS,EAAe,GAAY,GAAU;CAC1C,IAAM,IAAM,EAAE;CACd,QAAQ,MAAiB;EACrB,IAAM,IAAM,EAAa,UAAU,EAC/B,IAAW,EAAI;EAWf,OAVA,MAAa,KAAA,KAIb,IAAW;GACP,eAAe;GACf;GACA,QAAQ,EAAE;GACb,EACD,EAAI,KAAO,GACJ,KATA;;;AAanB,IAAM,IAAN,MAAmB;CACf,cAAc;EACV,KAAK,aAAa,EAAE;;CAExB,GAAG,GAAO;EACN,OAAO,KAAS,KAAK,WAAW,UAAU,KAAK,WAAW;;CAE9D,IAAI,GAAO,GAAO;EACd,KAAK,WAAW,KAAS;;CAE7B,WAAW;EACP,IAAI,IAAQ,IACN,IAAO,KAAK,WAAW;EAC7B,KAAK,IAAI,IAAI,GAAG,IAAI,GAAM,KACtB,KAAS,KAAK,WAAW,OAAO,KAAO,MAAM;EAEjD,OAAO;;GAGT,IAAmB,IAAI,GAAc,EAC9B,IAAb,cAA6C,EAAqB;CAC9D,YAAY,GAAS;EAIjB,AAFA,OAAO,EACP,KAAK,UAAgB,GAA0D,aAA4C,MAAY,QAAQ,IAAI,EAAQ,GAC3J,KAAK,aAAmB,GAA0D,cAA6C;;CAEnI,WAAW,GAAS;EAEhB,AADA,KAAK,MAAM,EAAU,EAAQ,MAAM,EACnC,KAAK,OAAO,EAAiB,KAAK,IAAI;;CAE1C,2CAA2C;EACvC,OAAO,EAAE;;CAEb,8BAA8B;EAC1B,OAAO,EAAE;;CAEb,6BAA6B,GAAS;EAClC,IAAM,EAAE,mBAAgB,SAAM,kBAAe,4BAAyB,GAChE,IAAO,KAAK,MACZ,IAAU,KAAK,SACf,IAAa,KAAK,YAClB,IAAM,EAAY,GAAM,eAAe,EAAe,EAEtD,IADgB,KAAK,IAAI,YAAY,GACP,UAC9B,IAAc,EAAI,EAAkB;GACtC,cAAc;GACd,YAAY;GACZ,UAAU;GACJ;GACT,CAAC,GAAG,MAAY,EAAI,IAAU,MAAS,EAAK,GAAG,CAAC;EACjD,IAAI,EAAc,GAAa,GAAM,IAAI,CAAC,GAAsB;GAC5D,IAAM,IAAc,EAAO,IAAc,GAAQ,GAAS,OACtD,EAAQ,IAAU,MAAgB;IAC9B,AAAI,MACA,EAAO,EAAY,gBAAgB,GACnC,EAAQ,EAAY,kBAAkB,MAAsB;KACxD,EAAO,KAAqB;MAC9B;KAER,EACK,IACR,EAAE,CAAC;GAgBF,OAfA,IACO,SAAU,GAAQ;IAGrB,IAAM,IAAa,EADD,KAAK,QAAQ,EACS,CAAC;IACzC,IAAI,MAAW,KAAA,KAAa,MAAe,KAAA,GAAW;KAClD,IAAM,IAAa,EAAO,IAAqD;KAC/E,IAAI,MAAS,KAAA,KAAa,EAAK,KAAK,KAAK,KAAK,IAC1C;;IAGR,OAAO;OAIJ,WAAY;IAEf,OAAO,EADW,KAAK,QAAQ,EACH,CAAC;;SAIpC,IAAI,GACL,OAAO,SAAU,GAAQ;GACrB,IAAM,IAAa,IAAI,GAAc,EAC/B,IAAS,MAAW,KAAA,IAAY,IAAI,EAAO;GACjD,KAAK,IAAI,IAAI,GAAG,IAAI,GAAQ,KAAK;IAC7B,IAAM,IAAO,IAAuD,GAAG;IACvE,EAAW,IAAI,GAAG,MAAS,KAAA,KAAa,EAAK,KAAK,KAAK,CAAC;;GAE5D,IAAM,IAAS,EAAgB,KAAK,MAAM,GAAM,GAAe,GAAY,GAAS,EAAW;GAC/F,OAAO,OAAO,KAAW,WAAW,IAAS,KAAA;;OAIjD,OAAO,WAAY;GACf,IAAM,IAAS,EAAgB,KAAK,MAAM,GAAM,GAAe,GAAkB,GAAS,EAAW;GACrG,OAAO,OAAO,KAAW,WAAW,IAAS,KAAA;;;CAIzD,0BAA0B,GAAS;EAC/B,IAAM,EAAE,mBAAgB,SAAM,aAAU,4BAAyB,GAC3D,IAAO,KAAK,MACZ,IAAU,KAAK,SACf,IAAa,KAAK,YAClB,IAAM,EAAY,GAAM,GAAU,EAAe,EAEjD,IADgB,KAAK,IAAI,YAAY,GACP,UAC9B,IAAO,EAAI,EAAkB;GAC/B,cAAc;GACd,YAAY;GACZ;GACA;GACH,CAAC,GAAG,MACM,EAAI,IAAI,MAAM,EAAE,GAAG,CAC5B;EACF,IAAI,EAAc,EAAK,IAAI,EAAK,GAAG,MAAM,CAAC,GAAsB;GAC5D,IAAM,IAAM,EAAK,IACX,IAAoB,EAAQ,EAAI;GACtC,IAAI,EAAkB,WAAW,KAC7B,EAAQ,EAAkB,GAAG,gBAAgB,EAAE;IAE/C,IAAM,IADoB,EAAkB,GACK;IACjD,OAAO,WAAY;KACf,OAAO,KAAK,QAAQ,EAAE,CAAC,iBAAiB;;UAG3C;IACD,IAAM,IAAc,EAAO,IAAoB,GAAQ,OAC/C,MAAgB,KAAA,MAChB,EAAO,EAAY,gBAAgB,IACnC,EAAQ,EAAY,kBAAkB,MAAsB;KACxD,EAAO,KAAqB;MAC9B,GAEC,IACR,EAAE,CAAC;IACN,OAAO,WAAY;KAEf,OAAO,EADW,KAAK,QAAQ,EACH,CAAC,kBAAkB;;;;EAI3D,OAAO,WAAY;GACf,IAAM,IAAS,EAAgB,KAAK,MAAM,GAAM,GAAe,GAAkB,GAAS,EAAW;GACrG,OAAO,OAAO,KAAW,WAAW,KAAQ,MAAW;;;;AAInE,SAAS,EAAc,GAAW,IAAa,IAAM;CACjD,IAAM,oBAAU,IAAI,KAAK;CACzB,KAAK,IAAM,KAAO,GAAW;EACzB,IAAM,oBAAS,IAAI,KAAK;EACxB,KAAK,IAAM,KAAW,GAAK;GACvB,IAAI,MAAY,KAAA,GACZ;QAAI,GAEA;IAGA,OAAO;;GAGf,IAAM,IAAU,CAAC,EAAQ,aAAa,CAAC,OAAO,EAAQ,gBAAgB;GACtE,KAAK,IAAM,KAAS,GAChB,IAAI,EAAQ,IAAI,EAAM;QACd,CAAC,EAAO,IAAI,EAAM,EAClB,OAAO;UAKX,AADA,EAAQ,IAAI,EAAM,EAClB,EAAO,IAAI,EAAM;;;CAKjC,OAAO;;AAEX,SAAS,EAAiB,GAAK;CAC3B,IAAM,IAAiB,EAAI,eAAe,QACpC,IAAgB,MAAM,EAAe;CAC3C,KAAK,IAAI,IAAI,GAAG,IAAI,GAAgB,KAChC,EAAc,KAAK,EAAe,EAAI,eAAe,IAAI,EAAE;CAE/D,OAAO;;AAEX,SAAS,EAAgB,GAAW,GAAU,GAAc,GAAS,GAAY;CAC7E,IAAM,IAAM,EAAU,GAAU,EAAa,EACzC,IAAQ,EAAI;CAOhB,OANI,MAAU,KAAA,MAEV,IAAQ,EAAY,GAAK,EADT,EAAkB,EAAI,cACM,CAAC,CAAC,EAC9C,EAAI,QAAQ,IAEJ,EAAiB,MAAM,MAAM;EAAC;EAAK;EAAO;EAAc;EAAS;EAAW,CAC9E;;AAEd,SAAS,EAAiB,GAAK,GAAI,GAAc,GAAS,GAAY;CAClE,IAAI,IAAY,GACZ,IAAI,GACF,IAAO,EAAE,EAEX,IAAI,KAAK,QAAQ,IAAI;CACzB,SAAa;EACT,IAAI,IAAI,EAAuB,GAAW,EAAE;EAI5C,IAHI,MAAM,KAAA,MACN,IAAI,EAAuB,MAAM,MAAM;GAAC;GAAK;GAAW;GAAG;GAAG;GAAc;GAAQ,CAAC,GAErF,MAAM,GACN,OAAO,EAA0B,GAAM,GAAW,EAAE;EAExD,IAAI,EAAE,kBAAkB,IAAM;GAC1B,IAAI,MAAe,MAAQ,EAAa,GAAG,EAAI,EAAE;IAG7C,IAAM,IAAY,GAAa,GAAW,EAAa;IACvD,IAAI,MAAc,KAAA,GACd,OAAO;;GAGf,OAAO,EAAE;;EAMb,AAJA,IAAY,GACZ,EAAK,KAAK,EAAE,EAGZ,IAAI,KAAK,GAAG,IAAI;;;AAGxB,SAAS,EAAuB,GAAK,GAAW,GAAO,GAAW,GAAc,GAAS;CACrF,IAAM,IAAQ,EAAgB,EAAU,SAAS,GAAO,EAAa;CACrE,IAAI,EAAM,SAAS,GAEf,OADA,EAAW,GAAK,GAAW,GAAO,EAAU,EACrC;CAEX,IAAI,IAAW,EAAY,EAAM,EAC3B,IAAe,EAAa,GAAO,EAAa;CACtD,IAAI,MAAiB,KAAA,GAGjB,AAFA,EAAS,gBAAgB,IACzB,EAAS,aAAa,GACtB,EAAS,QAAQ,YAAY;MAE5B,IAAI,GAAiC,EAAM,EAAE;EAC9C,IAAM,IAAa,EAAI,EAAM,KAAK;EAIlC,AAHA,EAAS,gBAAgB,IACzB,EAAS,aAAa,GACtB,EAAS,QAAQ,YAAY,GAC7B,EAAyB,MAAM,MAAM;GAAC;GAAK;GAAW,EAAM;GAAM;GAAQ,CAAC;;CAG/E,OADA,IAAW,EAAW,GAAK,GAAW,GAAO,EAAS,EAC/C;;AAEX,SAAS,EAAyB,GAAK,GAAW,GAAkB,GAAS;CACzE,IAAM,IAAa,EAAE;CACrB,KAAK,IAAI,IAAI,GAAG,KAAK,GAAW,KAC5B,EAAW,KAAK,KAAK,GAAG,EAAE,CAAC,UAAU;CAEzC,IAAM,IAAW,EAAI,eACf,IAAe,EAAS,MACxB,IAAa,EAAS;CAO5B,EANgB,EAAoB;EAChC;EACA;EACA;EACA;EACH,CACc,CAAC;;AAEpB,SAAS,EAAoB,GAAS;CAClC,IAAM,IAAU,EAAI,EAAQ,aAAa,MAAY,EAAW,EAAQ,CAAC,CAAC,KAAK,KAAK,EAC9E,IAAa,EAAQ,WAAW,QAAQ,IAAI,KAAK,EAAQ,WAAW,KACtE,IAAc,qCAAqC,EAAQ,iBAAiB,KAAK,KAAK,CAAC,QAAQ,EAAqB,EAAQ,WAAW,GAAG,EAAW,YACzI,EAAQ,aAAa,KAAK,YAClC,EAAQ;CAKhB,OAJA,KAEQ,oHAED;;AAEX,SAAS,EAAqB,GAAM;CAChC,IAAI,aAAgB,GAChB,OAAO;CAEN,IAAI,aAAgB,GACrB,OAAO;CAEN,IAAI,aAAgB,GACrB,OAAO;CAEN,IAAI,aAAgB,GACrB,OAAO;CAEN,IAAI,aAAgB,GACrB,OAAO;CAEN,IAAI,aAAgB,GACrB,OAAO;CAEN,IAAI,aAAgB,GACrB,OAAO;CAEN,IAAI,aAAgB,GACrB,OAAO;CAGP,MAAM,MAAM,uBAAuB;;AAG3C,SAAS,EAA0B,GAAM,GAAU,GAAS;CAKxD,OAAO;EACH,aAAa;EACb,oBALmB,EADC,EAAQ,EAAS,QAAQ,WAAW,MAAM,EAAE,MAAM,YAC7B,CACxC,QAAQ,MAAM,aAAa,EAAe,CAC1C,KAAK,MAAM,EAAE,UAAU,GAAG,MAAM,EAAE,aAGD;EAClC,WAAW;EACd;;AAEL,SAAS,EAAuB,GAAO,GAAO;CAC1C,OAAO,EAAM,MAAM,EAAM;;AAE7B,SAAS,EAAgB,GAAS,GAAO,GAAc;CACnD,IAAM,IAAe,IAAI,GAAc,EACjC,IAAoB,EAAE;CAC5B,KAAK,IAAM,KAAK,EAAQ,UAAU;EAC9B,IAAI,EAAa,GAAG,EAAE,IAAI,KAAK,IAC3B;EAEJ,IAAI,EAAE,MAAM,SAAA,GAAwB;GAChC,EAAkB,KAAK,EAAE;GACzB;;EAEJ,IAAM,IAAmB,EAAE,MAAM,YAAY;EAC7C,KAAK,IAAI,IAAI,GAAG,IAAI,GAAkB,KAAK;GACvC,IAAM,IAAa,EAAE,MAAM,YAAY,IACjC,IAAS,EAAmB,GAAY,EAAM;GACpD,AAAI,MAAW,KAAA,KACX,EAAa,IAAI;IACb,OAAO;IACP,KAAK,EAAE;IACP,OAAO,EAAE;IACZ,CAAC;;;CAId,IAAI;CAIJ,IAHI,EAAkB,WAAW,KAAK,EAAa,SAAS,MACxD,IAAQ,IAER,MAAU,KAAA,GAAW;EACrB,IAAQ,IAAI,GAAc;EAC1B,KAAK,IAAM,KAAK,EAAa,UACzB,EAAQ,GAAG,EAAM;;CAGzB,IAAI,EAAkB,SAAS,KAAK,CAAC,EAAyB,EAAM,EAChE,KAAK,IAAM,KAAK,GACZ,EAAM,IAAI,EAAE;CAGpB,OAAO;;AAEX,SAAS,EAAmB,GAAY,GAAO;CAC3C,IAAI,aAAsB,KACtB,EAAa,GAAO,EAAW,UAAU,EACzC,OAAO,EAAW;;AAI1B,SAAS,EAAa,GAAS,GAAc;CACzC,IAAI;CACJ,KAAK,IAAM,KAAK,EAAQ,UACpB,IAAI,EAAa,GAAG,EAAE,IAAI,KAAK;MACvB,MAAQ,KAAA,GACR,IAAM,EAAE;OAEP,IAAI,MAAQ,EAAE,KACf;;CAIZ,OAAO;;AAEX,SAAS,EAAY,GAAS;CAC1B,OAAO;EACH,SAAS;EACT,OAAO,EAAE;EACT,eAAe;EACf,YAAY;EACf;;AAEL,SAAS,EAAW,GAAK,GAAM,GAAO,GAAI;CAGtC,OAFA,IAAK,EAAY,GAAK,EAAG,EACzB,EAAK,MAAM,EAAM,gBAAgB,GAC1B;;AAEX,SAAS,EAAY,GAAK,GAAO;CAC7B,IAAI,MAAU,GACV,OAAO;CAIX,IAAM,IAAS,EAAM,QAAQ,KACvB,IAAW,EAAI,OAAO;CAM5B,OALI,MAAa,KAAA,KAGjB,EAAM,QAAQ,UAAU,EACxB,EAAI,OAAO,KAAU,GACd,KAJI;;AAMf,SAAS,EAAkB,GAAU;CACjC,IAAM,IAAU,IAAI,GAAc,EAC5B,IAAsB,EAAS,YAAY;CACjD,KAAK,IAAI,IAAI,GAAG,IAAI,GAAqB,KAOrC,EAAQ;EAJJ,OAFW,EAAS,YAAY,GAAG;EAGnC,KAAK;EACL,OAAO,EAAE;EAEC,EAAE,EAAQ;CAE5B,OAAO;;AAEX,SAAS,EAAQ,GAAQ,GAAS;CAC9B,IAAM,IAAI,EAAO;CACjB,IAAI,EAAE,SAAA,GAAwB;EAC1B,IAAI,EAAO,MAAM,SAAS,GAAG;GACzB,IAAM,IAAW,CAAC,GAAG,EAAO,MAAM;GAOlC,EAAQ;IAJJ,OAFgB,EAAS,KAEP;IAClB,KAAK,EAAO;IACZ,OAAO;IAES,EAAE,EAAQ;SAK9B,EAAQ,IAAI,EAAO;EAEvB;;CAEJ,AAAK,EAAE,0BACH,EAAQ,IAAI,EAAO;CAEvB,IAAM,IAAmB,EAAE,YAAY;CACvC,KAAK,IAAI,IAAI,GAAG,IAAI,GAAkB,KAAK;EACvC,IAAM,IAAa,EAAE,YAAY,IAC3B,IAAI,EAAiB,GAAQ,EAAW;EAC9C,AAAI,MAAM,KAAA,KACN,EAAQ,GAAG,EAAQ;;;AAI/B,SAAS,EAAiB,GAAQ,GAAY;CAC1C,IAAI,aAAsB,GACtB,OAAO;EACH,OAAO,EAAW;EAClB,KAAK,EAAO;EACZ,OAAO,EAAO;EACjB;CAEA,IAAI,aAAsB,GAAgB;EAC3C,IAAM,IAAQ,CAAC,GAAG,EAAO,OAAO,EAAW,YAAY;EACvD,OAAO;GACH,OAAO,EAAW;GAClB,KAAK,EAAO;GACZ;GACH;;;AAIT,SAAS,EAAyB,GAAS;CACvC,KAAK,IAAM,KAAK,EAAQ,UACpB,IAAI,EAAE,MAAM,SAAA,GACR,OAAO;CAGf,OAAO;;AAEX,SAAS,EAA2B,GAAS;CACzC,KAAK,IAAM,KAAK,EAAQ,UACpB,IAAI,EAAE,MAAM,SAAA,GACR,OAAO;CAGf,OAAO;;AAEX,SAAS,GAAiC,GAAS;CAC/C,IAAI,EAA2B,EAAQ,EACnC,OAAO;CAEX,IAAM,IAAU,GAAsB,EAAQ,SAAS;CAEvD,OADkB,GAAqB,EAAQ,IAAI,CAAC,GAA6B,EAAQ;;AAG7F,SAAS,GAAsB,GAAS;CACpC,IAAM,oBAAe,IAAI,KAAK;CAC9B,KAAK,IAAM,KAAK,GAAS;EACrB,IAAM,IAAM,EAAgB,GAAG,GAAM,EACjC,IAAO,EAAa,IAAI,EAAI;EAKhC,AAJI,MAAS,KAAA,MACT,IAAO,EAAE,EACT,EAAa,IAAI,GAAK,EAAK,GAE/B,EAAK,EAAE,OAAO;;CAElB,OAAO;;AAEX,SAAS,GAAqB,GAAS;CACnC,KAAK,IAAM,KAAS,MAAM,KAAK,EAAQ,QAAQ,CAAC,EAC5C,IAAI,OAAO,KAAK,EAAM,CAAC,SAAS,GAC5B,OAAO;CAGf,OAAO;;AAEX,SAAS,GAA6B,GAAS;CAC3C,KAAK,IAAM,KAAS,MAAM,KAAK,EAAQ,QAAQ,CAAC,EAC5C,IAAI,OAAO,KAAK,EAAM,CAAC,WAAW,GAC9B,OAAO;CAGf,OAAO;;AAEX,SAAS,GAAa,GAAO,GAAc;CACvC,IAAI;CACJ,KAAK,IAAM,KAAK,EAAM,QAAQ,UAEtB,QAAa,GAAG,EAAE,IAAI,KAAK,MAAS,EAAE,MAAM,SAAA,IAGhD;MAAI,MAAY,KAAA,GACZ,IAAU,EAAE;OAEX,IAAI,MAAY,EAAE,KACnB;;CAGR,OAAO"}

package/lib/esm/node_modules/chevrotain-allstar/lib/atn.js

@@ -1,197 +0,0 @@
-import { Alternation as e, NonTerminal as t, Option as n, Repetition as r, RepetitionMandatory as i, RepetitionMandatoryWithSeparator as a, RepetitionWithSeparator as o, Terminal as s } from "../../@chevrotain/gast/lib/src/model.js";
-import "../../chevrotain/lib/src/api.js";
-import c from "../../lodash-es/map.js";
-import l from "../../lodash-es/filter.js";
-//#region ../../node_modules/chevrotain-allstar/lib/atn.js
-function u(e, t, n) {
-	return `${e.name}_${t}_${n}`;
-}
-var d = class {
-	constructor(e) {
-		this.target = e;
-	}
-	isEpsilon() {
-		return !1;
-	}
-}, f = class extends d {
-	constructor(e, t) {
-		super(e), this.tokenType = t;
-	}
-}, p = class extends d {
-	constructor(e) {
-		super(e);
-	}
-	isEpsilon() {
-		return !0;
-	}
-}, m = class extends d {
-	constructor(e, t, n) {
-		super(e), this.rule = t, this.followState = n;
-	}
-	isEpsilon() {
-		return !0;
-	}
-};
-function h(e) {
-	let t = {
-		decisionMap: {},
-		decisionStates: [],
-		ruleToStartState: /* @__PURE__ */ new Map(),
-		ruleToStopState: /* @__PURE__ */ new Map(),
-		states: []
-	};
-	g(t, e);
-	let n = e.length;
-	for (let r = 0; r < n; r++) {
-		let n = e[r], i = w(t, n, n);
-		i !== void 0 && P(t, n, i);
-	}
-	return t;
-}
-function g(e, t) {
-	let n = t.length;
-	for (let r = 0; r < n; r++) {
-		let n = t[r], i = I(e, n, void 0, { type: 2 }), a = I(e, n, void 0, { type: 7 });
-		i.stop = a, e.ruleToStartState.set(n, i), e.ruleToStopState.set(n, a);
-	}
-}
-function _(c, l, u) {
-	return u instanceof s ? M(c, l, u.terminalType, u) : u instanceof t ? N(c, l, u) : u instanceof e ? S(c, l, u) : u instanceof n ? C(c, l, u) : u instanceof r ? v(c, l, u) : u instanceof o ? y(c, l, u) : u instanceof i ? b(c, l, u) : u instanceof a ? x(c, l, u) : w(c, l, u);
-}
-function v(e, t, n) {
-	let r = I(e, t, n, { type: 5 });
-	return O(e, r), E(e, t, n, k(e, t, r, n, w(e, t, n)));
-}
-function y(e, t, n) {
-	let r = I(e, t, n, { type: 5 });
-	return O(e, r), E(e, t, n, k(e, t, r, n, w(e, t, n)), M(e, t, n.separator, n));
-}
-function b(e, t, n) {
-	let r = I(e, t, n, { type: 4 });
-	return O(e, r), T(e, t, n, k(e, t, r, n, w(e, t, n)));
-}
-function x(e, t, n) {
-	let r = I(e, t, n, { type: 4 });
-	return O(e, r), T(e, t, n, k(e, t, r, n, w(e, t, n)), M(e, t, n.separator, n));
-}
-function S(e, t, n) {
-	let r = I(e, t, n, { type: 1 });
-	return O(e, r), k(e, t, r, n, ...c(n.definition, (n) => _(e, t, n)));
-}
-function C(e, t, n) {
-	let r = I(e, t, n, { type: 1 });
-	return O(e, r), D(e, t, n, k(e, t, r, n, w(e, t, n)));
-}
-function w(e, t, n) {
-	let r = l(c(n.definition, (n) => _(e, t, n)), (e) => e !== void 0);
-	return r.length === 1 ? r[0] : r.length === 0 ? void 0 : j(e, r);
-}
-function T(e, t, n, r, i) {
-	let a = r.left, o = r.right, s = I(e, t, n, { type: 11 });
-	O(e, s);
-	let c = I(e, t, n, { type: 12 });
-	return a.loopback = s, c.loopback = s, e.decisionMap[u(t, i ? "RepetitionMandatoryWithSeparator" : "RepetitionMandatory", n.idx)] = s, F(o, s), i === void 0 ? (F(s, a), F(s, c)) : (F(s, c), F(s, i.left), F(i.right, a)), {
-		left: a,
-		right: c
-	};
-}
-function E(e, t, n, r, i) {
-	let a = r.left, o = r.right, s = I(e, t, n, { type: 10 });
-	O(e, s);
-	let c = I(e, t, n, { type: 12 }), l = I(e, t, n, { type: 9 });
-	return s.loopback = l, c.loopback = l, F(s, a), F(s, c), F(o, l), i === void 0 ? F(l, s) : (F(l, c), F(l, i.left), F(i.right, a)), e.decisionMap[u(t, i ? "RepetitionWithSeparator" : "Repetition", n.idx)] = s, {
-		left: s,
-		right: c
-	};
-}
-function D(e, t, n, r) {
-	let i = r.left, a = r.right;
-	return F(i, a), e.decisionMap[u(t, "Option", n.idx)] = i, r;
-}
-function O(e, t) {
-	return e.decisionStates.push(t), t.decision = e.decisionStates.length - 1, t.decision;
-}
-function k(e, t, n, r, ...i) {
-	let a = I(e, t, r, {
-		type: 8,
-		start: n
-	});
-	n.end = a;
-	for (let e of i) e === void 0 ? F(n, a) : (F(n, e.left), F(e.right, a));
-	let o = {
-		left: n,
-		right: a
-	};
-	return e.decisionMap[u(t, A(r), r.idx)] = n, o;
-}
-function A(t) {
-	if (t instanceof e) return "Alternation";
-	if (t instanceof n) return "Option";
-	if (t instanceof r) return "Repetition";
-	if (t instanceof o) return "RepetitionWithSeparator";
-	if (t instanceof i) return "RepetitionMandatory";
-	if (t instanceof a) return "RepetitionMandatoryWithSeparator";
-	throw Error("Invalid production type encountered");
-}
-function j(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 m, 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, R(e, n.right)) : F(n.right, s);
-	}
-	let r = t[0], i = t[n - 1];
-	return {
-		left: r.left,
-		right: i.right
-	};
-}
-function M(e, t, n, r) {
-	let i = I(e, t, r, { type: 1 }), a = I(e, t, r, { type: 1 });
-	return L(i, new f(a, n)), {
-		left: i,
-		right: a
-	};
-}
-function N(e, t, n) {
-	let r = n.referencedRule, i = e.ruleToStartState.get(r), a = I(e, t, n, { type: 1 }), o = I(e, t, n, { type: 1 });
-	return L(a, new m(i, r, o)), {
-		left: a,
-		right: o
-	};
-}
-function P(e, t, n) {
-	let r = e.ruleToStartState.get(t);
-	F(r, n.left);
-	let i = e.ruleToStopState.get(t);
-	return F(n.right, i), {
-		left: r,
-		right: i
-	};
-}
-function F(e, t) {
-	L(e, new p(t));
-}
-function I(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 L(e, t) {
-	e.transitions.length === 0 && (e.epsilonOnlyTransitions = t.isEpsilon()), e.transitions.push(t);
-}
-function R(e, t) {
-	e.states.splice(e.states.indexOf(t), 1);
-}
-//#endregion
-export { f as AtomTransition, p as EpsilonTransition, m as RuleTransition, u as buildATNKey, h as createATN };
-
-//# sourceMappingURL=atn.js.map

package/lib/esm/node_modules/chevrotain-allstar/lib/atn.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"atn.js","names":[],"sources":["../../../../../../../node_modules/chevrotain-allstar/lib/atn.js"],"sourcesContent":["/******************************************************************************\n * Copyright 2022 TypeFox GmbH\n * This program and the accompanying materials are made available under the\n * terms of the MIT License, which is available in the project root.\n ******************************************************************************/\nimport map from \"lodash-es/map.js\";\nimport filter from \"lodash-es/filter.js\";\nimport { Alternation, NonTerminal, Option, RepetitionMandatory, Repetition, Terminal, RepetitionWithSeparator, RepetitionMandatoryWithSeparator } from \"chevrotain\";\nexport function buildATNKey(rule, type, occurrence) {\n    return `${rule.name}_${type}_${occurrence}`;\n}\nexport const ATN_INVALID_TYPE = 0;\nexport const ATN_BASIC = 1;\nexport const ATN_RULE_START = 2;\nexport const ATN_PLUS_BLOCK_START = 4;\nexport const ATN_STAR_BLOCK_START = 5;\n// Currently unused as the ATN is not used for lexing\nexport const ATN_TOKEN_START = 6;\nexport const ATN_RULE_STOP = 7;\nexport const ATN_BLOCK_END = 8;\nexport const ATN_STAR_LOOP_BACK = 9;\nexport const ATN_STAR_LOOP_ENTRY = 10;\nexport const ATN_PLUS_LOOP_BACK = 11;\nexport const ATN_LOOP_END = 12;\nexport class AbstractTransition {\n    constructor(target) {\n        this.target = target;\n    }\n    isEpsilon() {\n        return false;\n    }\n}\nexport class AtomTransition extends AbstractTransition {\n    constructor(target, tokenType) {\n        super(target);\n        this.tokenType = tokenType;\n    }\n}\nexport class EpsilonTransition extends AbstractTransition {\n    constructor(target) {\n        super(target);\n    }\n    isEpsilon() {\n        return true;\n    }\n}\nexport class RuleTransition extends AbstractTransition {\n    constructor(ruleStart, rule, followState) {\n        super(ruleStart);\n        this.rule = rule;\n        this.followState = followState;\n    }\n    isEpsilon() {\n        return true;\n    }\n}\nexport function createATN(rules) {\n    const atn = {\n        decisionMap: {},\n        decisionStates: [],\n        ruleToStartState: new Map(),\n        ruleToStopState: new Map(),\n        states: []\n    };\n    createRuleStartAndStopATNStates(atn, rules);\n    const ruleLength = rules.length;\n    for (let i = 0; i < ruleLength; i++) {\n        const rule = rules[i];\n        const ruleBlock = block(atn, rule, rule);\n        if (ruleBlock === undefined) {\n            continue;\n        }\n        buildRuleHandle(atn, rule, ruleBlock);\n    }\n    return atn;\n}\nfunction createRuleStartAndStopATNStates(atn, rules) {\n    const ruleLength = rules.length;\n    for (let i = 0; i < ruleLength; i++) {\n        const rule = rules[i];\n        const start = newState(atn, rule, undefined, {\n            type: ATN_RULE_START\n        });\n        const stop = newState(atn, rule, undefined, {\n            type: ATN_RULE_STOP\n        });\n        start.stop = stop;\n        atn.ruleToStartState.set(rule, start);\n        atn.ruleToStopState.set(rule, stop);\n    }\n}\nfunction atom(atn, rule, production) {\n    if (production instanceof Terminal) {\n        return tokenRef(atn, rule, production.terminalType, production);\n    }\n    else if (production instanceof NonTerminal) {\n        return ruleRef(atn, rule, production);\n    }\n    else if (production instanceof Alternation) {\n        return alternation(atn, rule, production);\n    }\n    else if (production instanceof Option) {\n        return option(atn, rule, production);\n    }\n    else if (production instanceof Repetition) {\n        return repetition(atn, rule, production);\n    }\n    else if (production instanceof RepetitionWithSeparator) {\n        return repetitionSep(atn, rule, production);\n    }\n    else if (production instanceof RepetitionMandatory) {\n        return repetitionMandatory(atn, rule, production);\n    }\n    else if (production instanceof RepetitionMandatoryWithSeparator) {\n        return repetitionMandatorySep(atn, rule, production);\n    }\n    else {\n        return block(atn, rule, production);\n    }\n}\nfunction repetition(atn, rule, repetition) {\n    const starState = newState(atn, rule, repetition, {\n        type: ATN_STAR_BLOCK_START\n    });\n    defineDecisionState(atn, starState);\n    const handle = makeAlts(atn, rule, starState, repetition, block(atn, rule, repetition));\n    return star(atn, rule, repetition, handle);\n}\nfunction repetitionSep(atn, rule, repetition) {\n    const starState = newState(atn, rule, repetition, {\n        type: ATN_STAR_BLOCK_START\n    });\n    defineDecisionState(atn, starState);\n    const handle = makeAlts(atn, rule, starState, repetition, block(atn, rule, repetition));\n    const sep = tokenRef(atn, rule, repetition.separator, repetition);\n    return star(atn, rule, repetition, handle, sep);\n}\nfunction repetitionMandatory(atn, rule, repetition) {\n    const plusState = newState(atn, rule, repetition, {\n        type: ATN_PLUS_BLOCK_START\n    });\n    defineDecisionState(atn, plusState);\n    const handle = makeAlts(atn, rule, plusState, repetition, block(atn, rule, repetition));\n    return plus(atn, rule, repetition, handle);\n}\nfunction repetitionMandatorySep(atn, rule, repetition) {\n    const plusState = newState(atn, rule, repetition, {\n        type: ATN_PLUS_BLOCK_START\n    });\n    defineDecisionState(atn, plusState);\n    const handle = makeAlts(atn, rule, plusState, repetition, block(atn, rule, repetition));\n    const sep = tokenRef(atn, rule, repetition.separator, repetition);\n    return plus(atn, rule, repetition, handle, sep);\n}\nfunction alternation(atn, rule, alternation) {\n    const start = newState(atn, rule, alternation, {\n        type: ATN_BASIC\n    });\n    defineDecisionState(atn, start);\n    const alts = map(alternation.definition, (e) => atom(atn, rule, e));\n    const handle = makeAlts(atn, rule, start, alternation, ...alts);\n    return handle;\n}\nfunction option(atn, rule, option) {\n    const start = newState(atn, rule, option, {\n        type: ATN_BASIC\n    });\n    defineDecisionState(atn, start);\n    const handle = makeAlts(atn, rule, start, option, block(atn, rule, option));\n    return optional(atn, rule, option, handle);\n}\nfunction block(atn, rule, block) {\n    const handles = filter(map(block.definition, (e) => atom(atn, rule, e)), (e) => e !== undefined);\n    if (handles.length === 1) {\n        return handles[0];\n    }\n    else if (handles.length === 0) {\n        return undefined;\n    }\n    else {\n        return makeBlock(atn, handles);\n    }\n}\nfunction plus(atn, rule, plus, handle, sep) {\n    const blkStart = handle.left;\n    const blkEnd = handle.right;\n    const loop = newState(atn, rule, plus, {\n        type: ATN_PLUS_LOOP_BACK\n    });\n    defineDecisionState(atn, loop);\n    const end = newState(atn, rule, plus, {\n        type: ATN_LOOP_END\n    });\n    blkStart.loopback = loop;\n    end.loopback = loop;\n    atn.decisionMap[buildATNKey(rule, sep ? 'RepetitionMandatoryWithSeparator' : 'RepetitionMandatory', plus.idx)] = loop;\n    epsilon(blkEnd, loop); // block can see loop back\n    // Depending on whether we have a separator we put the exit transition at index 1 or 0\n    // This influences the chosen option in the lookahead DFA\n    if (sep === undefined) {\n        epsilon(loop, blkStart); // loop back to start\n        epsilon(loop, end); // exit\n    }\n    else {\n        epsilon(loop, end); // exit\n        // loop back to start with separator\n        epsilon(loop, sep.left);\n        epsilon(sep.right, blkStart);\n    }\n    return {\n        left: blkStart,\n        right: end\n    };\n}\nfunction star(atn, rule, star, handle, sep) {\n    const start = handle.left;\n    const end = handle.right;\n    const entry = newState(atn, rule, star, {\n        type: ATN_STAR_LOOP_ENTRY\n    });\n    defineDecisionState(atn, entry);\n    const loopEnd = newState(atn, rule, star, {\n        type: ATN_LOOP_END\n    });\n    const loop = newState(atn, rule, star, {\n        type: ATN_STAR_LOOP_BACK\n    });\n    entry.loopback = loop;\n    loopEnd.loopback = loop;\n    epsilon(entry, start); // loop enter edge (alt 2)\n    epsilon(entry, loopEnd); // bypass loop edge (alt 1)\n    epsilon(end, loop); // block end hits loop back\n    if (sep !== undefined) {\n        epsilon(loop, loopEnd); // end loop\n        // loop back to start of handle using separator\n        epsilon(loop, sep.left);\n        epsilon(sep.right, start);\n    }\n    else {\n        epsilon(loop, entry); // loop back to entry/exit decision\n    }\n    atn.decisionMap[buildATNKey(rule, sep ? 'RepetitionWithSeparator' : 'Repetition', star.idx)] = entry;\n    return {\n        left: entry,\n        right: loopEnd\n    };\n}\nfunction optional(atn, rule, optional, handle) {\n    const start = handle.left;\n    const end = handle.right;\n    epsilon(start, end);\n    atn.decisionMap[buildATNKey(rule, 'Option', optional.idx)] = start;\n    return handle;\n}\nfunction defineDecisionState(atn, state) {\n    atn.decisionStates.push(state);\n    state.decision = atn.decisionStates.length - 1;\n    return state.decision;\n}\nfunction makeAlts(atn, rule, start, production, ...alts) {\n    const end = newState(atn, rule, production, {\n        type: ATN_BLOCK_END,\n        start\n    });\n    start.end = end;\n    for (const alt of alts) {\n        if (alt !== undefined) {\n            // hook alts up to decision block\n            epsilon(start, alt.left);\n            epsilon(alt.right, end);\n        }\n        else {\n            epsilon(start, end);\n        }\n    }\n    const handle = {\n        left: start,\n        right: end\n    };\n    atn.decisionMap[buildATNKey(rule, getProdType(production), production.idx)] = start;\n    return handle;\n}\nfunction getProdType(production) {\n    if (production instanceof Alternation) {\n        return 'Alternation';\n    }\n    else if (production instanceof Option) {\n        return 'Option';\n    }\n    else if (production instanceof Repetition) {\n        return 'Repetition';\n    }\n    else if (production instanceof RepetitionWithSeparator) {\n        return 'RepetitionWithSeparator';\n    }\n    else if (production instanceof RepetitionMandatory) {\n        return 'RepetitionMandatory';\n    }\n    else if (production instanceof RepetitionMandatoryWithSeparator) {\n        return 'RepetitionMandatoryWithSeparator';\n    }\n    else {\n        throw new Error('Invalid production type encountered');\n    }\n}\nfunction makeBlock(atn, alts) {\n    const altsLength = alts.length;\n    for (let i = 0; i < altsLength - 1; i++) {\n        const handle = alts[i];\n        let transition;\n        if (handle.left.transitions.length === 1) {\n            transition = handle.left.transitions[0];\n        }\n        const isRuleTransition = transition instanceof RuleTransition;\n        const ruleTransition = transition;\n        const next = alts[i + 1].left;\n        if (handle.left.type === ATN_BASIC &&\n            handle.right.type === ATN_BASIC &&\n            transition !== undefined &&\n            ((isRuleTransition && ruleTransition.followState === handle.right) ||\n                transition.target === handle.right)) {\n            // we can avoid epsilon edge to next element\n            if (isRuleTransition) {\n                ruleTransition.followState = next;\n            }\n            else {\n                transition.target = next;\n            }\n            removeState(atn, handle.right); // we skipped over this state\n        }\n        else {\n            // need epsilon if previous block's right end node is complex\n            epsilon(handle.right, next);\n        }\n    }\n    const first = alts[0];\n    const last = alts[altsLength - 1];\n    return {\n        left: first.left,\n        right: last.right\n    };\n}\nfunction tokenRef(atn, rule, tokenType, production) {\n    const left = newState(atn, rule, production, {\n        type: ATN_BASIC\n    });\n    const right = newState(atn, rule, production, {\n        type: ATN_BASIC\n    });\n    addTransition(left, new AtomTransition(right, tokenType));\n    return {\n        left,\n        right\n    };\n}\nfunction ruleRef(atn, currentRule, nonTerminal) {\n    const rule = nonTerminal.referencedRule;\n    const start = atn.ruleToStartState.get(rule);\n    const left = newState(atn, currentRule, nonTerminal, {\n        type: ATN_BASIC\n    });\n    const right = newState(atn, currentRule, nonTerminal, {\n        type: ATN_BASIC\n    });\n    const call = new RuleTransition(start, rule, right);\n    addTransition(left, call);\n    return {\n        left,\n        right\n    };\n}\nfunction buildRuleHandle(atn, rule, block) {\n    const start = atn.ruleToStartState.get(rule);\n    epsilon(start, block.left);\n    const stop = atn.ruleToStopState.get(rule);\n    epsilon(block.right, stop);\n    const handle = {\n        left: start,\n        right: stop\n    };\n    return handle;\n}\nfunction epsilon(a, b) {\n    const transition = new EpsilonTransition(b);\n    addTransition(a, transition);\n}\nfunction newState(atn, rule, production, partial) {\n    const t = Object.assign({ atn,\n        production, epsilonOnlyTransitions: false, rule, transitions: [], nextTokenWithinRule: [], stateNumber: atn.states.length }, partial);\n    atn.states.push(t);\n    return t;\n}\nfunction addTransition(state, transition) {\n    // A single ATN state can only contain epsilon transitions or non-epsilon transitions\n    // Because they are never mixed, only setting the property for the first transition is fine\n    if (state.transitions.length === 0) {\n        state.epsilonOnlyTransitions = transition.isEpsilon();\n    }\n    state.transitions.push(transition);\n}\nfunction removeState(atn, state) {\n    atn.states.splice(atn.states.indexOf(state), 1);\n}\n//# sourceMappingURL=atn.js.map"],"x_google_ignoreList":[0],"mappings":";;;;;AAQA,SAAgB,EAAY,GAAM,GAAM,GAAY;CAChD,OAAO,GAAG,EAAK,KAAK,GAAG,EAAK,GAAG;;AAenC,IAAa,IAAb,MAAgC;CAC5B,YAAY,GAAQ;EAChB,KAAK,SAAS;;CAElB,YAAY;EACR,OAAO;;GAGF,IAAb,cAAoC,EAAmB;CACnD,YAAY,GAAQ,GAAW;EAE3B,AADA,MAAM,EAAO,EACb,KAAK,YAAY;;GAGZ,IAAb,cAAuC,EAAmB;CACtD,YAAY,GAAQ;EAChB,MAAM,EAAO;;CAEjB,YAAY;EACR,OAAO;;GAGF,IAAb,cAAoC,EAAmB;CACnD,YAAY,GAAW,GAAM,GAAa;EAGtC,AAFA,MAAM,EAAU,EAChB,KAAK,OAAO,GACZ,KAAK,cAAc;;CAEvB,YAAY;EACR,OAAO;;;AAGf,SAAgB,EAAU,GAAO;CAC7B,IAAM,IAAM;EACR,aAAa,EAAE;EACf,gBAAgB,EAAE;EAClB,kCAAkB,IAAI,KAAK;EAC3B,iCAAiB,IAAI,KAAK;EAC1B,QAAQ,EAAE;EACb;CACD,EAAgC,GAAK,EAAM;CAC3C,IAAM,IAAa,EAAM;CACzB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAY,KAAK;EACjC,IAAM,IAAO,EAAM,IACb,IAAY,EAAM,GAAK,GAAM,EAAK;EACpC,MAAc,KAAA,KAGlB,EAAgB,GAAK,GAAM,EAAU;;CAEzC,OAAO;;AAEX,SAAS,EAAgC,GAAK,GAAO;CACjD,IAAM,IAAa,EAAM;CACzB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAY,KAAK;EACjC,IAAM,IAAO,EAAM,IACb,IAAQ,EAAS,GAAK,GAAM,KAAA,GAAW,EACzC,MAAA,GACH,CAAC,EACI,IAAO,EAAS,GAAK,GAAM,KAAA,GAAW,EACxC,MAAA,GACH,CAAC;EAGF,AAFA,EAAM,OAAO,GACb,EAAI,iBAAiB,IAAI,GAAM,EAAM,EACrC,EAAI,gBAAgB,IAAI,GAAM,EAAK;;;AAG3C,SAAS,EAAK,GAAK,GAAM,GAAY;CA0B7B,OAzBA,aAAsB,IACf,EAAS,GAAK,GAAM,EAAW,cAAc,EAAW,GAE1D,aAAsB,IACpB,EAAQ,GAAK,GAAM,EAAW,GAEhC,aAAsB,IACpB,EAAY,GAAK,GAAM,EAAW,GAEpC,aAAsB,IACpB,EAAO,GAAK,GAAM,EAAW,GAE/B,aAAsB,IACpB,EAAW,GAAK,GAAM,EAAW,GAEnC,aAAsB,IACpB,EAAc,GAAK,GAAM,EAAW,GAEtC,aAAsB,IACpB,EAAoB,GAAK,GAAM,EAAW,GAE5C,aAAsB,IACpB,EAAuB,GAAK,GAAM,EAAW,GAG7C,EAAM,GAAK,GAAM,EAAW;;AAG3C,SAAS,EAAW,GAAK,GAAM,GAAY;CACvC,IAAM,IAAY,EAAS,GAAK,GAAM,GAAY,EAC9C,MAAA,GACH,CAAC;CAGF,OAFA,EAAoB,GAAK,EAAU,EAE5B,EAAK,GAAK,GAAM,GADR,EAAS,GAAK,GAAM,GAAW,GAAY,EAAM,GAAK,GAAM,EAAW,CAC7C,CAAC;;AAE9C,SAAS,EAAc,GAAK,GAAM,GAAY;CAC1C,IAAM,IAAY,EAAS,GAAK,GAAM,GAAY,EAC9C,MAAA,GACH,CAAC;CAIF,OAHA,EAAoB,GAAK,EAAU,EAG5B,EAAK,GAAK,GAAM,GAFR,EAAS,GAAK,GAAM,GAAW,GAAY,EAAM,GAAK,GAAM,EAAW,CAE7C,EAD7B,EAAS,GAAK,GAAM,EAAW,WAAW,EACR,CAAC;;AAEnD,SAAS,EAAoB,GAAK,GAAM,GAAY;CAChD,IAAM,IAAY,EAAS,GAAK,GAAM,GAAY,EAC9C,MAAA,GACH,CAAC;CAGF,OAFA,EAAoB,GAAK,EAAU,EAE5B,EAAK,GAAK,GAAM,GADR,EAAS,GAAK,GAAM,GAAW,GAAY,EAAM,GAAK,GAAM,EAAW,CAC7C,CAAC;;AAE9C,SAAS,EAAuB,GAAK,GAAM,GAAY;CACnD,IAAM,IAAY,EAAS,GAAK,GAAM,GAAY,EAC9C,MAAA,GACH,CAAC;CAIF,OAHA,EAAoB,GAAK,EAAU,EAG5B,EAAK,GAAK,GAAM,GAFR,EAAS,GAAK,GAAM,GAAW,GAAY,EAAM,GAAK,GAAM,EAAW,CAE7C,EAD7B,EAAS,GAAK,GAAM,EAAW,WAAW,EACR,CAAC;;AAEnD,SAAS,EAAY,GAAK,GAAM,GAAa;CACzC,IAAM,IAAQ,EAAS,GAAK,GAAM,GAAa,EAC3C,MAAA,GACH,CAAC;CAIF,OAHA,EAAoB,GAAK,EAAM,EAEhB,EAAS,GAAK,GAAM,GAAO,GAAa,GAD1C,EAAI,EAAY,aAAa,MAAM,EAAK,GAAK,GAAM,EAAE,CACJ,CACjD;;AAEjB,SAAS,EAAO,GAAK,GAAM,GAAQ;CAC/B,IAAM,IAAQ,EAAS,GAAK,GAAM,GAAQ,EACtC,MAAA,GACH,CAAC;CAGF,OAFA,EAAoB,GAAK,EAAM,EAExB,EAAS,GAAK,GAAM,GADZ,EAAS,GAAK,GAAM,GAAO,GAAQ,EAAM,GAAK,GAAM,EAAO,CACjC,CAAC;;AAE9C,SAAS,EAAM,GAAK,GAAM,GAAO;CAC7B,IAAM,IAAU,EAAO,EAAI,EAAM,aAAa,MAAM,EAAK,GAAK,GAAM,EAAE,CAAC,GAAG,MAAM,MAAM,KAAA,EAAU;CAQ5F,OAPA,EAAQ,WAAW,IACZ,EAAQ,KAEV,EAAQ,WAAW,IACxB,SAGO,EAAU,GAAK,EAAQ;;AAGtC,SAAS,EAAK,GAAK,GAAM,GAAM,GAAQ,GAAK;CACxC,IAAM,IAAW,EAAO,MAClB,IAAS,EAAO,OAChB,IAAO,EAAS,GAAK,GAAM,GAAM,EACnC,MAAA,IACH,CAAC;CACF,EAAoB,GAAK,EAAK;CAC9B,IAAM,IAAM,EAAS,GAAK,GAAM,GAAM,EAClC,MAAA,IACH,CAAC;CAiBF,OAhBA,EAAS,WAAW,GACpB,EAAI,WAAW,GACf,EAAI,YAAY,EAAY,GAAM,IAAM,qCAAqC,uBAAuB,EAAK,IAAI,IAAI,GACjH,EAAQ,GAAQ,EAAK,EAGjB,MAAQ,KAAA,KACR,EAAQ,GAAM,EAAS,EACvB,EAAQ,GAAM,EAAI,KAGlB,EAAQ,GAAM,EAAI,EAElB,EAAQ,GAAM,EAAI,KAAK,EACvB,EAAQ,EAAI,OAAO,EAAS,GAEzB;EACH,MAAM;EACN,OAAO;EACV;;AAEL,SAAS,EAAK,GAAK,GAAM,GAAM,GAAQ,GAAK;CACxC,IAAM,IAAQ,EAAO,MACf,IAAM,EAAO,OACb,IAAQ,EAAS,GAAK,GAAM,GAAM,EACpC,MAAA,IACH,CAAC;CACF,EAAoB,GAAK,EAAM;CAC/B,IAAM,IAAU,EAAS,GAAK,GAAM,GAAM,EACtC,MAAA,IACH,CAAC,EACI,IAAO,EAAS,GAAK,GAAM,GAAM,EACnC,MAAA,GACH,CAAC;CAgBF,OAfA,EAAM,WAAW,GACjB,EAAQ,WAAW,GACnB,EAAQ,GAAO,EAAM,EACrB,EAAQ,GAAO,EAAQ,EACvB,EAAQ,GAAK,EAAK,EACd,MAAQ,KAAA,IAOR,EAAQ,GAAM,EAAM,IANpB,EAAQ,GAAM,EAAQ,EAEtB,EAAQ,GAAM,EAAI,KAAK,EACvB,EAAQ,EAAI,OAAO,EAAM,GAK7B,EAAI,YAAY,EAAY,GAAM,IAAM,4BAA4B,cAAc,EAAK,IAAI,IAAI,GACxF;EACH,MAAM;EACN,OAAO;EACV;;AAEL,SAAS,EAAS,GAAK,GAAM,GAAU,GAAQ;CAC3C,IAAM,IAAQ,EAAO,MACf,IAAM,EAAO;CAGnB,OAFA,EAAQ,GAAO,EAAI,EACnB,EAAI,YAAY,EAAY,GAAM,UAAU,EAAS,IAAI,IAAI,GACtD;;AAEX,SAAS,EAAoB,GAAK,GAAO;CAGrC,OAFA,EAAI,eAAe,KAAK,EAAM,EAC9B,EAAM,WAAW,EAAI,eAAe,SAAS,GACtC,EAAM;;AAEjB,SAAS,EAAS,GAAK,GAAM,GAAO,GAAY,GAAG,GAAM;CACrD,IAAM,IAAM,EAAS,GAAK,GAAM,GAAY;EACxC,MAAA;EACA;EACH,CAAC;CACF,EAAM,MAAM;CACZ,KAAK,IAAM,KAAO,GACd,AAAI,MAAQ,KAAA,IAMR,EAAQ,GAAO,EAAI,IAJnB,EAAQ,GAAO,EAAI,KAAK,EACxB,EAAQ,EAAI,OAAO,EAAI;CAM/B,IAAM,IAAS;EACX,MAAM;EACN,OAAO;EACV;CAED,OADA,EAAI,YAAY,EAAY,GAAM,EAAY,EAAW,EAAE,EAAW,IAAI,IAAI,GACvE;;AAEX,SAAS,EAAY,GAAY;CAC7B,IAAI,aAAsB,GACtB,OAAO;CAEN,IAAI,aAAsB,GAC3B,OAAO;CAEN,IAAI,aAAsB,GAC3B,OAAO;CAEN,IAAI,aAAsB,GAC3B,OAAO;CAEN,IAAI,aAAsB,GAC3B,OAAO;CAEN,IAAI,aAAsB,GAC3B,OAAO;CAGP,MAAU,MAAM,sCAAsC;;AAG9D,SAAS,EAAU,GAAK,GAAM;CAC1B,IAAM,IAAa,EAAK;CACxB,KAAK,IAAI,IAAI,GAAG,IAAI,IAAa,GAAG,KAAK;EACrC,IAAM,IAAS,EAAK,IAChB;EACJ,AAAI,EAAO,KAAK,YAAY,WAAW,MACnC,IAAa,EAAO,KAAK,YAAY;EAEzC,IAAM,IAAmB,aAAsB,GACzC,IAAiB,GACjB,IAAO,EAAK,IAAI,GAAG;EACzB,AAAI,EAAO,KAAK,SAAA,KACZ,EAAO,MAAM,SAAA,KACb,MAAe,KAAA,MACb,KAAoB,EAAe,gBAAgB,EAAO,SACxD,EAAW,WAAW,EAAO,UAE7B,IACA,EAAe,cAAc,IAG7B,EAAW,SAAS,GAExB,EAAY,GAAK,EAAO,MAAM,IAI9B,EAAQ,EAAO,OAAO,EAAK;;CAGnC,IAAM,IAAQ,EAAK,IACb,IAAO,EAAK,IAAa;CAC/B,OAAO;EACH,MAAM,EAAM;EACZ,OAAO,EAAK;EACf;;AAEL,SAAS,EAAS,GAAK,GAAM,GAAW,GAAY;CAChD,IAAM,IAAO,EAAS,GAAK,GAAM,GAAY,EACzC,MAAA,GACH,CAAC,EACI,IAAQ,EAAS,GAAK,GAAM,GAAY,EAC1C,MAAA,GACH,CAAC;CAEF,OADA,EAAc,GAAM,IAAI,EAAe,GAAO,EAAU,CAAC,EAClD;EACH;EACA;EACH;;AAEL,SAAS,EAAQ,GAAK,GAAa,GAAa;CAC5C,IAAM,IAAO,EAAY,gBACnB,IAAQ,EAAI,iBAAiB,IAAI,EAAK,EACtC,IAAO,EAAS,GAAK,GAAa,GAAa,EACjD,MAAA,GACH,CAAC,EACI,IAAQ,EAAS,GAAK,GAAa,GAAa,EAClD,MAAA,GACH,CAAC;CAGF,OADA,EAAc,GAAM,IADH,EAAe,GAAO,GAAM,EACrB,CAAC,EAClB;EACH;EACA;EACH;;AAEL,SAAS,EAAgB,GAAK,GAAM,GAAO;CACvC,IAAM,IAAQ,EAAI,iBAAiB,IAAI,EAAK;CAC5C,EAAQ,GAAO,EAAM,KAAK;CAC1B,IAAM,IAAO,EAAI,gBAAgB,IAAI,EAAK;CAM1C,OALA,EAAQ,EAAM,OAAO,EAAK,EAKnB;EAHH,MAAM;EACN,OAAO;EAEE;;AAEjB,SAAS,EAAQ,GAAG,GAAG;CAEnB,EAAc,GAAG,IADM,EAAkB,EACd,CAAC;;AAEhC,SAAS,EAAS,GAAK,GAAM,GAAY,GAAS;CAC9C,IAAM,IAAI,OAAO,OAAO;EAAE;EACtB;EAAY,wBAAwB;EAAO;EAAM,aAAa,EAAE;EAAE,qBAAqB,EAAE;EAAE,aAAa,EAAI,OAAO;EAAQ,EAAE,EAAQ;CAEzI,OADA,EAAI,OAAO,KAAK,EAAE,EACX;;AAEX,SAAS,EAAc,GAAO,GAAY;CAMtC,AAHI,EAAM,YAAY,WAAW,MAC7B,EAAM,yBAAyB,EAAW,WAAW,GAEzD,EAAM,YAAY,KAAK,EAAW;;AAEtC,SAAS,EAAY,GAAK,GAAO;CAC7B,EAAI,OAAO,OAAO,EAAI,OAAO,QAAQ,EAAM,EAAE,EAAE"}