qidian-vue-ui 1.1.50 → 1.1.51

package/dist/node_modules/.pnpm/langium@3.3.1/node_modules/langium/lib/languages/generated/ast.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast.mjs","sources":["../../../../../../../../../../../node_modules/.pnpm/langium@3.3.1/node_modules/langium/lib/languages/generated/ast.js"],"sourcesContent":["/******************************************************************************\n * This file was generated by langium-cli 3.3.0.\n * DO NOT EDIT MANUALLY!\n ******************************************************************************/\nimport { AbstractAstReflection } from '../../syntax-tree.js';\nexport const LangiumGrammarTerminals = {\n    ID: /\\^?[_a-zA-Z][\\w_]*/,\n    STRING: /\"(\\\\.|[^\"\\\\])*\"|'(\\\\.|[^'\\\\])*'/,\n    NUMBER: /NaN|-?((\\d*\\.\\d+|\\d+)([Ee][+-]?\\d+)?|Infinity)/,\n    RegexLiteral: /\\/(?![*+?])(?:[^\\r\\n\\[/\\\\]|\\\\.|\\[(?:[^\\r\\n\\]\\\\]|\\\\.)*\\])+\\/[a-z]*/,\n    WS: /\\s+/,\n    ML_COMMENT: /\\/\\*[\\s\\S]*?\\*\\//,\n    SL_COMMENT: /\\/\\/[^\\n\\r]*/,\n};\nexport const AbstractRule = 'AbstractRule';\nexport function isAbstractRule(item) {\n    return reflection.isInstance(item, AbstractRule);\n}\nexport const AbstractType = 'AbstractType';\nexport function isAbstractType(item) {\n    return reflection.isInstance(item, AbstractType);\n}\nexport const Condition = 'Condition';\nexport function isCondition(item) {\n    return reflection.isInstance(item, Condition);\n}\nexport function isFeatureName(item) {\n    return isPrimitiveType(item) || item === 'current' || item === 'entry' || item === 'extends' || item === 'false' || item === 'fragment' || item === 'grammar' || item === 'hidden' || item === 'import' || item === 'interface' || item === 'returns' || item === 'terminal' || item === 'true' || item === 'type' || item === 'infer' || item === 'infers' || item === 'with' || (typeof item === 'string' && (/\\^?[_a-zA-Z][\\w_]*/.test(item)));\n}\nexport function isPrimitiveType(item) {\n    return item === 'string' || item === 'number' || item === 'boolean' || item === 'Date' || item === 'bigint';\n}\nexport const TypeDefinition = 'TypeDefinition';\nexport function isTypeDefinition(item) {\n    return reflection.isInstance(item, TypeDefinition);\n}\nexport const ValueLiteral = 'ValueLiteral';\nexport function isValueLiteral(item) {\n    return reflection.isInstance(item, ValueLiteral);\n}\nexport const AbstractElement = 'AbstractElement';\nexport function isAbstractElement(item) {\n    return reflection.isInstance(item, AbstractElement);\n}\nexport const ArrayLiteral = 'ArrayLiteral';\nexport function isArrayLiteral(item) {\n    return reflection.isInstance(item, ArrayLiteral);\n}\nexport const ArrayType = 'ArrayType';\nexport function isArrayType(item) {\n    return reflection.isInstance(item, ArrayType);\n}\nexport const BooleanLiteral = 'BooleanLiteral';\nexport function isBooleanLiteral(item) {\n    return reflection.isInstance(item, BooleanLiteral);\n}\nexport const Conjunction = 'Conjunction';\nexport function isConjunction(item) {\n    return reflection.isInstance(item, Conjunction);\n}\nexport const Disjunction = 'Disjunction';\nexport function isDisjunction(item) {\n    return reflection.isInstance(item, Disjunction);\n}\nexport const Grammar = 'Grammar';\nexport function isGrammar(item) {\n    return reflection.isInstance(item, Grammar);\n}\nexport const GrammarImport = 'GrammarImport';\nexport function isGrammarImport(item) {\n    return reflection.isInstance(item, GrammarImport);\n}\nexport const InferredType = 'InferredType';\nexport function isInferredType(item) {\n    return reflection.isInstance(item, InferredType);\n}\nexport const Interface = 'Interface';\nexport function isInterface(item) {\n    return reflection.isInstance(item, Interface);\n}\nexport const NamedArgument = 'NamedArgument';\nexport function isNamedArgument(item) {\n    return reflection.isInstance(item, NamedArgument);\n}\nexport const Negation = 'Negation';\nexport function isNegation(item) {\n    return reflection.isInstance(item, Negation);\n}\nexport const NumberLiteral = 'NumberLiteral';\nexport function isNumberLiteral(item) {\n    return reflection.isInstance(item, NumberLiteral);\n}\nexport const Parameter = 'Parameter';\nexport function isParameter(item) {\n    return reflection.isInstance(item, Parameter);\n}\nexport const ParameterReference = 'ParameterReference';\nexport function isParameterReference(item) {\n    return reflection.isInstance(item, ParameterReference);\n}\nexport const ParserRule = 'ParserRule';\nexport function isParserRule(item) {\n    return reflection.isInstance(item, ParserRule);\n}\nexport const ReferenceType = 'ReferenceType';\nexport function isReferenceType(item) {\n    return reflection.isInstance(item, ReferenceType);\n}\nexport const ReturnType = 'ReturnType';\nexport function isReturnType(item) {\n    return reflection.isInstance(item, ReturnType);\n}\nexport const SimpleType = 'SimpleType';\nexport function isSimpleType(item) {\n    return reflection.isInstance(item, SimpleType);\n}\nexport const StringLiteral = 'StringLiteral';\nexport function isStringLiteral(item) {\n    return reflection.isInstance(item, StringLiteral);\n}\nexport const TerminalRule = 'TerminalRule';\nexport function isTerminalRule(item) {\n    return reflection.isInstance(item, TerminalRule);\n}\nexport const Type = 'Type';\nexport function isType(item) {\n    return reflection.isInstance(item, Type);\n}\nexport const TypeAttribute = 'TypeAttribute';\nexport function isTypeAttribute(item) {\n    return reflection.isInstance(item, TypeAttribute);\n}\nexport const UnionType = 'UnionType';\nexport function isUnionType(item) {\n    return reflection.isInstance(item, UnionType);\n}\nexport const Action = 'Action';\nexport function isAction(item) {\n    return reflection.isInstance(item, Action);\n}\nexport const Alternatives = 'Alternatives';\nexport function isAlternatives(item) {\n    return reflection.isInstance(item, Alternatives);\n}\nexport const Assignment = 'Assignment';\nexport function isAssignment(item) {\n    return reflection.isInstance(item, Assignment);\n}\nexport const CharacterRange = 'CharacterRange';\nexport function isCharacterRange(item) {\n    return reflection.isInstance(item, CharacterRange);\n}\nexport const CrossReference = 'CrossReference';\nexport function isCrossReference(item) {\n    return reflection.isInstance(item, CrossReference);\n}\nexport const EndOfFile = 'EndOfFile';\nexport function isEndOfFile(item) {\n    return reflection.isInstance(item, EndOfFile);\n}\nexport const Group = 'Group';\nexport function isGroup(item) {\n    return reflection.isInstance(item, Group);\n}\nexport const Keyword = 'Keyword';\nexport function isKeyword(item) {\n    return reflection.isInstance(item, Keyword);\n}\nexport const NegatedToken = 'NegatedToken';\nexport function isNegatedToken(item) {\n    return reflection.isInstance(item, NegatedToken);\n}\nexport const RegexToken = 'RegexToken';\nexport function isRegexToken(item) {\n    return reflection.isInstance(item, RegexToken);\n}\nexport const RuleCall = 'RuleCall';\nexport function isRuleCall(item) {\n    return reflection.isInstance(item, RuleCall);\n}\nexport const TerminalAlternatives = 'TerminalAlternatives';\nexport function isTerminalAlternatives(item) {\n    return reflection.isInstance(item, TerminalAlternatives);\n}\nexport const TerminalGroup = 'TerminalGroup';\nexport function isTerminalGroup(item) {\n    return reflection.isInstance(item, TerminalGroup);\n}\nexport const TerminalRuleCall = 'TerminalRuleCall';\nexport function isTerminalRuleCall(item) {\n    return reflection.isInstance(item, TerminalRuleCall);\n}\nexport const UnorderedGroup = 'UnorderedGroup';\nexport function isUnorderedGroup(item) {\n    return reflection.isInstance(item, UnorderedGroup);\n}\nexport const UntilToken = 'UntilToken';\nexport function isUntilToken(item) {\n    return reflection.isInstance(item, UntilToken);\n}\nexport const Wildcard = 'Wildcard';\nexport function isWildcard(item) {\n    return reflection.isInstance(item, Wildcard);\n}\nexport class LangiumGrammarAstReflection extends AbstractAstReflection {\n    getAllTypes() {\n        return [AbstractElement, AbstractRule, AbstractType, Action, Alternatives, ArrayLiteral, ArrayType, Assignment, BooleanLiteral, CharacterRange, Condition, Conjunction, CrossReference, Disjunction, EndOfFile, Grammar, GrammarImport, Group, InferredType, Interface, Keyword, NamedArgument, NegatedToken, Negation, NumberLiteral, Parameter, ParameterReference, ParserRule, ReferenceType, RegexToken, ReturnType, RuleCall, SimpleType, StringLiteral, TerminalAlternatives, TerminalGroup, TerminalRule, TerminalRuleCall, Type, TypeAttribute, TypeDefinition, UnionType, UnorderedGroup, UntilToken, ValueLiteral, Wildcard];\n    }\n    computeIsSubtype(subtype, supertype) {\n        switch (subtype) {\n            case Action:\n            case Alternatives:\n            case Assignment:\n            case CharacterRange:\n            case CrossReference:\n            case EndOfFile:\n            case Group:\n            case Keyword:\n            case NegatedToken:\n            case RegexToken:\n            case RuleCall:\n            case TerminalAlternatives:\n            case TerminalGroup:\n            case TerminalRuleCall:\n            case UnorderedGroup:\n            case UntilToken:\n            case Wildcard: {\n                return this.isSubtype(AbstractElement, supertype);\n            }\n            case ArrayLiteral:\n            case NumberLiteral:\n            case StringLiteral: {\n                return this.isSubtype(ValueLiteral, supertype);\n            }\n            case ArrayType:\n            case ReferenceType:\n            case SimpleType:\n            case UnionType: {\n                return this.isSubtype(TypeDefinition, supertype);\n            }\n            case BooleanLiteral: {\n                return this.isSubtype(Condition, supertype) || this.isSubtype(ValueLiteral, supertype);\n            }\n            case Conjunction:\n            case Disjunction:\n            case Negation:\n            case ParameterReference: {\n                return this.isSubtype(Condition, supertype);\n            }\n            case InferredType:\n            case Interface:\n            case Type: {\n                return this.isSubtype(AbstractType, supertype);\n            }\n            case ParserRule: {\n                return this.isSubtype(AbstractRule, supertype) || this.isSubtype(AbstractType, supertype);\n            }\n            case TerminalRule: {\n                return this.isSubtype(AbstractRule, supertype);\n            }\n            default: {\n                return false;\n            }\n        }\n    }\n    getReferenceType(refInfo) {\n        const referenceId = `${refInfo.container.$type}:${refInfo.property}`;\n        switch (referenceId) {\n            case 'Action:type':\n            case 'CrossReference:type':\n            case 'Interface:superTypes':\n            case 'ParserRule:returnType':\n            case 'SimpleType:typeRef': {\n                return AbstractType;\n            }\n            case 'Grammar:hiddenTokens':\n            case 'ParserRule:hiddenTokens':\n            case 'RuleCall:rule': {\n                return AbstractRule;\n            }\n            case 'Grammar:usedGrammars': {\n                return Grammar;\n            }\n            case 'NamedArgument:parameter':\n            case 'ParameterReference:parameter': {\n                return Parameter;\n            }\n            case 'TerminalRuleCall:rule': {\n                return TerminalRule;\n            }\n            default: {\n                throw new Error(`${referenceId} is not a valid reference id.`);\n            }\n        }\n    }\n    getTypeMetaData(type) {\n        switch (type) {\n            case AbstractElement: {\n                return {\n                    name: AbstractElement,\n                    properties: [\n                        { name: 'cardinality' },\n                        { name: 'lookahead' }\n                    ]\n                };\n            }\n            case ArrayLiteral: {\n                return {\n                    name: ArrayLiteral,\n                    properties: [\n                        { name: 'elements', defaultValue: [] }\n                    ]\n                };\n            }\n            case ArrayType: {\n                return {\n                    name: ArrayType,\n                    properties: [\n                        { name: 'elementType' }\n                    ]\n                };\n            }\n            case BooleanLiteral: {\n                return {\n                    name: BooleanLiteral,\n                    properties: [\n                        { name: 'true', defaultValue: false }\n                    ]\n                };\n            }\n            case Conjunction: {\n                return {\n                    name: Conjunction,\n                    properties: [\n                        { name: 'left' },\n                        { name: 'right' }\n                    ]\n                };\n            }\n            case Disjunction: {\n                return {\n                    name: Disjunction,\n                    properties: [\n                        { name: 'left' },\n                        { name: 'right' }\n                    ]\n                };\n            }\n            case Grammar: {\n                return {\n                    name: Grammar,\n                    properties: [\n                        { name: 'definesHiddenTokens', defaultValue: false },\n                        { name: 'hiddenTokens', defaultValue: [] },\n                        { name: 'imports', defaultValue: [] },\n                        { name: 'interfaces', defaultValue: [] },\n                        { name: 'isDeclared', defaultValue: false },\n                        { name: 'name' },\n                        { name: 'rules', defaultValue: [] },\n                        { name: 'types', defaultValue: [] },\n                        { name: 'usedGrammars', defaultValue: [] }\n                    ]\n                };\n            }\n            case GrammarImport: {\n                return {\n                    name: GrammarImport,\n                    properties: [\n                        { name: 'path' }\n                    ]\n                };\n            }\n            case InferredType: {\n                return {\n                    name: InferredType,\n                    properties: [\n                        { name: 'name' }\n                    ]\n                };\n            }\n            case Interface: {\n                return {\n                    name: Interface,\n                    properties: [\n                        { name: 'attributes', defaultValue: [] },\n                        { name: 'name' },\n                        { name: 'superTypes', defaultValue: [] }\n                    ]\n                };\n            }\n            case NamedArgument: {\n                return {\n                    name: NamedArgument,\n                    properties: [\n                        { name: 'calledByName', defaultValue: false },\n                        { name: 'parameter' },\n                        { name: 'value' }\n                    ]\n                };\n            }\n            case Negation: {\n                return {\n                    name: Negation,\n                    properties: [\n                        { name: 'value' }\n                    ]\n                };\n            }\n            case NumberLiteral: {\n                return {\n                    name: NumberLiteral,\n                    properties: [\n                        { name: 'value' }\n                    ]\n                };\n            }\n            case Parameter: {\n                return {\n                    name: Parameter,\n                    properties: [\n                        { name: 'name' }\n                    ]\n                };\n            }\n            case ParameterReference: {\n                return {\n                    name: ParameterReference,\n                    properties: [\n                        { name: 'parameter' }\n                    ]\n                };\n            }\n            case ParserRule: {\n                return {\n                    name: ParserRule,\n                    properties: [\n                        { name: 'dataType' },\n                        { name: 'definesHiddenTokens', defaultValue: false },\n                        { name: 'definition' },\n                        { name: 'entry', defaultValue: false },\n                        { name: 'fragment', defaultValue: false },\n                        { name: 'hiddenTokens', defaultValue: [] },\n                        { name: 'inferredType' },\n                        { name: 'name' },\n                        { name: 'parameters', defaultValue: [] },\n                        { name: 'returnType' },\n                        { name: 'wildcard', defaultValue: false }\n                    ]\n                };\n            }\n            case ReferenceType: {\n                return {\n                    name: ReferenceType,\n                    properties: [\n                        { name: 'referenceType' }\n                    ]\n                };\n            }\n            case ReturnType: {\n                return {\n                    name: ReturnType,\n                    properties: [\n                        { name: 'name' }\n                    ]\n                };\n            }\n            case SimpleType: {\n                return {\n                    name: SimpleType,\n                    properties: [\n                        { name: 'primitiveType' },\n                        { name: 'stringType' },\n                        { name: 'typeRef' }\n                    ]\n                };\n            }\n            case StringLiteral: {\n                return {\n                    name: StringLiteral,\n                    properties: [\n                        { name: 'value' }\n                    ]\n                };\n            }\n            case TerminalRule: {\n                return {\n                    name: TerminalRule,\n                    properties: [\n                        { name: 'definition' },\n                        { name: 'fragment', defaultValue: false },\n                        { name: 'hidden', defaultValue: false },\n                        { name: 'name' },\n                        { name: 'type' }\n                    ]\n                };\n            }\n            case Type: {\n                return {\n                    name: Type,\n                    properties: [\n                        { name: 'name' },\n                        { name: 'type' }\n                    ]\n                };\n            }\n            case TypeAttribute: {\n                return {\n                    name: TypeAttribute,\n                    properties: [\n                        { name: 'defaultValue' },\n                        { name: 'isOptional', defaultValue: false },\n                        { name: 'name' },\n                        { name: 'type' }\n                    ]\n                };\n            }\n            case UnionType: {\n                return {\n                    name: UnionType,\n                    properties: [\n                        { name: 'types', defaultValue: [] }\n                    ]\n                };\n            }\n            case Action: {\n                return {\n                    name: Action,\n                    properties: [\n                        { name: 'cardinality' },\n                        { name: 'feature' },\n                        { name: 'inferredType' },\n                        { name: 'lookahead' },\n                        { name: 'operator' },\n                        { name: 'type' }\n                    ]\n                };\n            }\n            case Alternatives: {\n                return {\n                    name: Alternatives,\n                    properties: [\n                        { name: 'cardinality' },\n                        { name: 'elements', defaultValue: [] },\n                        { name: 'lookahead' }\n                    ]\n                };\n            }\n            case Assignment: {\n                return {\n                    name: Assignment,\n                    properties: [\n                        { name: 'cardinality' },\n                        { name: 'feature' },\n                        { name: 'lookahead' },\n                        { name: 'operator' },\n                        { name: 'terminal' }\n                    ]\n                };\n            }\n            case CharacterRange: {\n                return {\n                    name: CharacterRange,\n                    properties: [\n                        { name: 'cardinality' },\n                        { name: 'left' },\n                        { name: 'lookahead' },\n                        { name: 'right' }\n                    ]\n                };\n            }\n            case CrossReference: {\n                return {\n                    name: CrossReference,\n                    properties: [\n                        { name: 'cardinality' },\n                        { name: 'deprecatedSyntax', defaultValue: false },\n                        { name: 'lookahead' },\n                        { name: 'terminal' },\n                        { name: 'type' }\n                    ]\n                };\n            }\n            case EndOfFile: {\n                return {\n                    name: EndOfFile,\n                    properties: [\n                        { name: 'cardinality' },\n                        { name: 'lookahead' }\n                    ]\n                };\n            }\n            case Group: {\n                return {\n                    name: Group,\n                    properties: [\n                        { name: 'cardinality' },\n                        { name: 'elements', defaultValue: [] },\n                        { name: 'guardCondition' },\n                        { name: 'lookahead' }\n                    ]\n                };\n            }\n            case Keyword: {\n                return {\n                    name: Keyword,\n                    properties: [\n                        { name: 'cardinality' },\n                        { name: 'lookahead' },\n                        { name: 'value' }\n                    ]\n                };\n            }\n            case NegatedToken: {\n                return {\n                    name: NegatedToken,\n                    properties: [\n                        { name: 'cardinality' },\n                        { name: 'lookahead' },\n                        { name: 'terminal' }\n                    ]\n                };\n            }\n            case RegexToken: {\n                return {\n                    name: RegexToken,\n                    properties: [\n                        { name: 'cardinality' },\n                        { name: 'lookahead' },\n                        { name: 'regex' }\n                    ]\n                };\n            }\n            case RuleCall: {\n                return {\n                    name: RuleCall,\n                    properties: [\n                        { name: 'arguments', defaultValue: [] },\n                        { name: 'cardinality' },\n                        { name: 'lookahead' },\n                        { name: 'rule' }\n                    ]\n                };\n            }\n            case TerminalAlternatives: {\n                return {\n                    name: TerminalAlternatives,\n                    properties: [\n                        { name: 'cardinality' },\n                        { name: 'elements', defaultValue: [] },\n                        { name: 'lookahead' }\n                    ]\n                };\n            }\n            case TerminalGroup: {\n                return {\n                    name: TerminalGroup,\n                    properties: [\n                        { name: 'cardinality' },\n                        { name: 'elements', defaultValue: [] },\n                        { name: 'lookahead' }\n                    ]\n                };\n            }\n            case TerminalRuleCall: {\n                return {\n                    name: TerminalRuleCall,\n                    properties: [\n                        { name: 'cardinality' },\n                        { name: 'lookahead' },\n                        { name: 'rule' }\n                    ]\n                };\n            }\n            case UnorderedGroup: {\n                return {\n                    name: UnorderedGroup,\n                    properties: [\n                        { name: 'cardinality' },\n                        { name: 'elements', defaultValue: [] },\n                        { name: 'lookahead' }\n                    ]\n                };\n            }\n            case UntilToken: {\n                return {\n                    name: UntilToken,\n                    properties: [\n                        { name: 'cardinality' },\n                        { name: 'lookahead' },\n                        { name: 'terminal' }\n                    ]\n                };\n            }\n            case Wildcard: {\n                return {\n                    name: Wildcard,\n                    properties: [\n                        { name: 'cardinality' },\n                        { name: 'lookahead' }\n                    ]\n                };\n            }\n            default: {\n                return {\n                    name: type,\n                    properties: []\n                };\n            }\n        }\n    }\n}\nexport const reflection = new LangiumGrammarAstReflection();\n//# sourceMappingURL=ast.js.map"],"names":[],"mappings":";AAcY,MAAC,eAAe;AAIhB,MAAC,eAAe;AAIhB,MAAC,YAAY;AAUb,MAAC,iBAAiB;AAIlB,MAAC,eAAe;AAIhB,MAAC,kBAAkB;AACxB,SAAS,kBAAkB,MAAM;AACpC,SAAO,WAAW,WAAW,MAAM,eAAe;AACtD;AACY,MAAC,eAAe;AAIhB,MAAC,YAAY;AAIb,MAAC,iBAAiB;AACvB,SAAS,iBAAiB,MAAM;AACnC,SAAO,WAAW,WAAW,MAAM,cAAc;AACrD;AACY,MAAC,cAAc;AACpB,SAAS,cAAc,MAAM;AAChC,SAAO,WAAW,WAAW,MAAM,WAAW;AAClD;AACY,MAAC,cAAc;AACpB,SAAS,cAAc,MAAM;AAChC,SAAO,WAAW,WAAW,MAAM,WAAW;AAClD;AACY,MAAC,UAAU;AAIX,MAAC,gBAAgB;AAIjB,MAAC,eAAe;AACrB,SAAS,eAAe,MAAM;AACjC,SAAO,WAAW,WAAW,MAAM,YAAY;AACnD;AACY,MAAC,YAAY;AAClB,SAAS,YAAY,MAAM;AAC9B,SAAO,WAAW,WAAW,MAAM,SAAS;AAChD;AACY,MAAC,gBAAgB;AAIjB,MAAC,WAAW;AACjB,SAAS,WAAW,MAAM;AAC7B,SAAO,WAAW,WAAW,MAAM,QAAQ;AAC/C;AACY,MAAC,gBAAgB;AAIjB,MAAC,YAAY;AAIb,MAAC,qBAAqB;AAC3B,SAAS,qBAAqB,MAAM;AACvC,SAAO,WAAW,WAAW,MAAM,kBAAkB;AACzD;AACY,MAAC,aAAa;AACnB,SAAS,aAAa,MAAM;AAC/B,SAAO,WAAW,WAAW,MAAM,UAAU;AACjD;AACY,MAAC,gBAAgB;AAIjB,MAAC,aAAa;AACnB,SAAS,aAAa,MAAM;AAC/B,SAAO,WAAW,WAAW,MAAM,UAAU;AACjD;AACY,MAAC,aAAa;AACnB,SAAS,aAAa,MAAM;AAC/B,SAAO,WAAW,WAAW,MAAM,UAAU;AACjD;AACY,MAAC,gBAAgB;AAIjB,MAAC,eAAe;AACrB,SAAS,eAAe,MAAM;AACjC,SAAO,WAAW,WAAW,MAAM,YAAY;AACnD;AACY,MAAC,OAAO;AACb,SAAS,OAAO,MAAM;AACzB,SAAO,WAAW,WAAW,MAAM,IAAI;AAC3C;AACY,MAAC,gBAAgB;AAIjB,MAAC,YAAY;AAIb,MAAC,SAAS;AACf,SAAS,SAAS,MAAM;AAC3B,SAAO,WAAW,WAAW,MAAM,MAAM;AAC7C;AACY,MAAC,eAAe;AACrB,SAAS,eAAe,MAAM;AACjC,SAAO,WAAW,WAAW,MAAM,YAAY;AACnD;AACY,MAAC,aAAa;AACnB,SAAS,aAAa,MAAM;AAC/B,SAAO,WAAW,WAAW,MAAM,UAAU;AACjD;AACY,MAAC,iBAAiB;AACvB,SAAS,iBAAiB,MAAM;AACnC,SAAO,WAAW,WAAW,MAAM,cAAc;AACrD;AACY,MAAC,iBAAiB;AACvB,SAAS,iBAAiB,MAAM;AACnC,SAAO,WAAW,WAAW,MAAM,cAAc;AACrD;AACY,MAAC,YAAY;AAClB,SAAS,YAAY,MAAM;AAC9B,SAAO,WAAW,WAAW,MAAM,SAAS;AAChD;AACY,MAAC,QAAQ;AACd,SAAS,QAAQ,MAAM;AAC1B,SAAO,WAAW,WAAW,MAAM,KAAK;AAC5C;AACY,MAAC,UAAU;AAChB,SAAS,UAAU,MAAM;AAC5B,SAAO,WAAW,WAAW,MAAM,OAAO;AAC9C;AACY,MAAC,eAAe;AACrB,SAAS,eAAe,MAAM;AACjC,SAAO,WAAW,WAAW,MAAM,YAAY;AACnD;AACY,MAAC,aAAa;AACnB,SAAS,aAAa,MAAM;AAC/B,SAAO,WAAW,WAAW,MAAM,UAAU;AACjD;AACY,MAAC,WAAW;AACjB,SAAS,WAAW,MAAM;AAC7B,SAAO,WAAW,WAAW,MAAM,QAAQ;AAC/C;AACY,MAAC,uBAAuB;AAC7B,SAAS,uBAAuB,MAAM;AACzC,SAAO,WAAW,WAAW,MAAM,oBAAoB;AAC3D;AACY,MAAC,gBAAgB;AACtB,SAAS,gBAAgB,MAAM;AAClC,SAAO,WAAW,WAAW,MAAM,aAAa;AACpD;AACY,MAAC,mBAAmB;AACzB,SAAS,mBAAmB,MAAM;AACrC,SAAO,WAAW,WAAW,MAAM,gBAAgB;AACvD;AACY,MAAC,iBAAiB;AACvB,SAAS,iBAAiB,MAAM;AACnC,SAAO,WAAW,WAAW,MAAM,cAAc;AACrD;AACY,MAAC,aAAa;AACnB,SAAS,aAAa,MAAM;AAC/B,SAAO,WAAW,WAAW,MAAM,UAAU;AACjD;AACY,MAAC,WAAW;AACjB,SAAS,WAAW,MAAM;AAC7B,SAAO,WAAW,WAAW,MAAM,QAAQ;AAC/C;AACO,MAAM,oCAAoC,sBAAsB;AAAA,EACnE,cAAc;AACV,WAAO,CAAC,iBAAiB,cAAc,cAAc,QAAQ,cAAc,cAAc,WAAW,YAAY,gBAAgB,gBAAgB,WAAW,aAAa,gBAAgB,aAAa,WAAW,SAAS,eAAe,OAAO,cAAc,WAAW,SAAS,eAAe,cAAc,UAAU,eAAe,WAAW,oBAAoB,YAAY,eAAe,YAAY,YAAY,UAAU,YAAY,eAAe,sBAAsB,eAAe,cAAc,kBAAkB,MAAM,eAAe,gBAAgB,WAAW,gBAAgB,YAAY,cAAc,QAAQ;AAAA,EACzmB;AAAA,EACA,iBAAiB,SAAS,WAAW;AACjC,YAAQ,SAAO;AAAA,MACX,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK,UAAU;AACX,eAAO,KAAK,UAAU,iBAAiB,SAAS;AAAA,MACpD;AAAA,MACA,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK,eAAe;AAChB,eAAO,KAAK,UAAU,cAAc,SAAS;AAAA,MACjD;AAAA,MACA,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK,WAAW;AACZ,eAAO,KAAK,UAAU,gBAAgB,SAAS;AAAA,MACnD;AAAA,MACA,KAAK,gBAAgB;AACjB,eAAO,KAAK,UAAU,WAAW,SAAS,KAAK,KAAK,UAAU,cAAc,SAAS;AAAA,MACzF;AAAA,MACA,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK,oBAAoB;AACrB,eAAO,KAAK,UAAU,WAAW,SAAS;AAAA,MAC9C;AAAA,MACA,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK,MAAM;AACP,eAAO,KAAK,UAAU,cAAc,SAAS;AAAA,MACjD;AAAA,MACA,KAAK,YAAY;AACb,eAAO,KAAK,UAAU,cAAc,SAAS,KAAK,KAAK,UAAU,cAAc,SAAS;AAAA,MAC5F;AAAA,MACA,KAAK,cAAc;AACf,eAAO,KAAK,UAAU,cAAc,SAAS;AAAA,MACjD;AAAA,MACA,SAAS;AACL,eAAO;AAAA,MACX;AAAA,IACZ;AAAA,EACI;AAAA,EACA,iBAAiB,SAAS;AACtB,UAAM,cAAc,GAAG,QAAQ,UAAU,KAAK,IAAI,QAAQ,QAAQ;AAClE,YAAQ,aAAW;AAAA,MACf,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK,sBAAsB;AACvB,eAAO;AAAA,MACX;AAAA,MACA,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK,iBAAiB;AAClB,eAAO;AAAA,MACX;AAAA,MACA,KAAK,wBAAwB;AACzB,eAAO;AAAA,MACX;AAAA,MACA,KAAK;AAAA,MACL,KAAK,gCAAgC;AACjC,eAAO;AAAA,MACX;AAAA,MACA,KAAK,yBAAyB;AAC1B,eAAO;AAAA,MACX;AAAA,MACA,SAAS;AACL,cAAM,IAAI,MAAM,GAAG,WAAW,+BAA+B;AAAA,MACjE;AAAA,IACZ;AAAA,EACI;AAAA,EACA,gBAAgB,MAAM;AAClB,YAAQ,MAAI;AAAA,MACR,KAAK,iBAAiB;AAClB,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,cAAa;AAAA,YACrB,EAAE,MAAM,YAAW;AAAA,UAC3C;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,cAAc;AACf,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,YAAY,cAAc,CAAA,EAAE;AAAA,UAC5D;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,WAAW;AACZ,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,cAAa;AAAA,UAC7C;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,gBAAgB;AACjB,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,QAAQ,cAAc,MAAK;AAAA,UAC3D;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,aAAa;AACd,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,OAAM;AAAA,YACd,EAAE,MAAM,QAAO;AAAA,UACvC;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,aAAa;AACd,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,OAAM;AAAA,YACd,EAAE,MAAM,QAAO;AAAA,UACvC;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,SAAS;AACV,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,uBAAuB,cAAc,MAAK;AAAA,YAClD,EAAE,MAAM,gBAAgB,cAAc,GAAE;AAAA,YACxC,EAAE,MAAM,WAAW,cAAc,GAAE;AAAA,YACnC,EAAE,MAAM,cAAc,cAAc,GAAE;AAAA,YACtC,EAAE,MAAM,cAAc,cAAc,MAAK;AAAA,YACzC,EAAE,MAAM,OAAM;AAAA,YACd,EAAE,MAAM,SAAS,cAAc,GAAE;AAAA,YACjC,EAAE,MAAM,SAAS,cAAc,GAAE;AAAA,YACjC,EAAE,MAAM,gBAAgB,cAAc,CAAA,EAAE;AAAA,UAChE;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,eAAe;AAChB,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,OAAM;AAAA,UACtC;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,cAAc;AACf,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,OAAM;AAAA,UACtC;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,WAAW;AACZ,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,cAAc,cAAc,GAAE;AAAA,YACtC,EAAE,MAAM,OAAM;AAAA,YACd,EAAE,MAAM,cAAc,cAAc,CAAA,EAAE;AAAA,UAC9D;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,eAAe;AAChB,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,gBAAgB,cAAc,MAAK;AAAA,YAC3C,EAAE,MAAM,YAAW;AAAA,YACnB,EAAE,MAAM,QAAO;AAAA,UACvC;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,UAAU;AACX,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,QAAO;AAAA,UACvC;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,eAAe;AAChB,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,QAAO;AAAA,UACvC;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,WAAW;AACZ,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,OAAM;AAAA,UACtC;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,oBAAoB;AACrB,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,YAAW;AAAA,UAC3C;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,YAAY;AACb,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,WAAU;AAAA,YAClB,EAAE,MAAM,uBAAuB,cAAc,MAAK;AAAA,YAClD,EAAE,MAAM,aAAY;AAAA,YACpB,EAAE,MAAM,SAAS,cAAc,MAAK;AAAA,YACpC,EAAE,MAAM,YAAY,cAAc,MAAK;AAAA,YACvC,EAAE,MAAM,gBAAgB,cAAc,GAAE;AAAA,YACxC,EAAE,MAAM,eAAc;AAAA,YACtB,EAAE,MAAM,OAAM;AAAA,YACd,EAAE,MAAM,cAAc,cAAc,GAAE;AAAA,YACtC,EAAE,MAAM,aAAY;AAAA,YACpB,EAAE,MAAM,YAAY,cAAc,MAAK;AAAA,UAC/D;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,eAAe;AAChB,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,gBAAe;AAAA,UAC/C;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,YAAY;AACb,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,OAAM;AAAA,UACtC;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,YAAY;AACb,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,gBAAe;AAAA,YACvB,EAAE,MAAM,aAAY;AAAA,YACpB,EAAE,MAAM,UAAS;AAAA,UACzC;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,eAAe;AAChB,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,QAAO;AAAA,UACvC;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,cAAc;AACf,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,aAAY;AAAA,YACpB,EAAE,MAAM,YAAY,cAAc,MAAK;AAAA,YACvC,EAAE,MAAM,UAAU,cAAc,MAAK;AAAA,YACrC,EAAE,MAAM,OAAM;AAAA,YACd,EAAE,MAAM,OAAM;AAAA,UACtC;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,MAAM;AACP,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,OAAM;AAAA,YACd,EAAE,MAAM,OAAM;AAAA,UACtC;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,eAAe;AAChB,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,eAAc;AAAA,YACtB,EAAE,MAAM,cAAc,cAAc,MAAK;AAAA,YACzC,EAAE,MAAM,OAAM;AAAA,YACd,EAAE,MAAM,OAAM;AAAA,UACtC;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,WAAW;AACZ,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,SAAS,cAAc,CAAA,EAAE;AAAA,UACzD;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,QAAQ;AACT,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,cAAa;AAAA,YACrB,EAAE,MAAM,UAAS;AAAA,YACjB,EAAE,MAAM,eAAc;AAAA,YACtB,EAAE,MAAM,YAAW;AAAA,YACnB,EAAE,MAAM,WAAU;AAAA,YAClB,EAAE,MAAM,OAAM;AAAA,UACtC;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,cAAc;AACf,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,cAAa;AAAA,YACrB,EAAE,MAAM,YAAY,cAAc,GAAE;AAAA,YACpC,EAAE,MAAM,YAAW;AAAA,UAC3C;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,YAAY;AACb,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,cAAa;AAAA,YACrB,EAAE,MAAM,UAAS;AAAA,YACjB,EAAE,MAAM,YAAW;AAAA,YACnB,EAAE,MAAM,WAAU;AAAA,YAClB,EAAE,MAAM,WAAU;AAAA,UAC1C;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,gBAAgB;AACjB,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,cAAa;AAAA,YACrB,EAAE,MAAM,OAAM;AAAA,YACd,EAAE,MAAM,YAAW;AAAA,YACnB,EAAE,MAAM,QAAO;AAAA,UACvC;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,gBAAgB;AACjB,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,cAAa;AAAA,YACrB,EAAE,MAAM,oBAAoB,cAAc,MAAK;AAAA,YAC/C,EAAE,MAAM,YAAW;AAAA,YACnB,EAAE,MAAM,WAAU;AAAA,YAClB,EAAE,MAAM,OAAM;AAAA,UACtC;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,WAAW;AACZ,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,cAAa;AAAA,YACrB,EAAE,MAAM,YAAW;AAAA,UAC3C;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,OAAO;AACR,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,cAAa;AAAA,YACrB,EAAE,MAAM,YAAY,cAAc,GAAE;AAAA,YACpC,EAAE,MAAM,iBAAgB;AAAA,YACxB,EAAE,MAAM,YAAW;AAAA,UAC3C;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,SAAS;AACV,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,cAAa;AAAA,YACrB,EAAE,MAAM,YAAW;AAAA,YACnB,EAAE,MAAM,QAAO;AAAA,UACvC;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,cAAc;AACf,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,cAAa;AAAA,YACrB,EAAE,MAAM,YAAW;AAAA,YACnB,EAAE,MAAM,WAAU;AAAA,UAC1C;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,YAAY;AACb,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,cAAa;AAAA,YACrB,EAAE,MAAM,YAAW;AAAA,YACnB,EAAE,MAAM,QAAO;AAAA,UACvC;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,UAAU;AACX,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,aAAa,cAAc,GAAE;AAAA,YACrC,EAAE,MAAM,cAAa;AAAA,YACrB,EAAE,MAAM,YAAW;AAAA,YACnB,EAAE,MAAM,OAAM;AAAA,UACtC;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,sBAAsB;AACvB,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,cAAa;AAAA,YACrB,EAAE,MAAM,YAAY,cAAc,GAAE;AAAA,YACpC,EAAE,MAAM,YAAW;AAAA,UAC3C;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,eAAe;AAChB,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,cAAa;AAAA,YACrB,EAAE,MAAM,YAAY,cAAc,GAAE;AAAA,YACpC,EAAE,MAAM,YAAW;AAAA,UAC3C;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,kBAAkB;AACnB,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,cAAa;AAAA,YACrB,EAAE,MAAM,YAAW;AAAA,YACnB,EAAE,MAAM,OAAM;AAAA,UACtC;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,gBAAgB;AACjB,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,cAAa;AAAA,YACrB,EAAE,MAAM,YAAY,cAAc,GAAE;AAAA,YACpC,EAAE,MAAM,YAAW;AAAA,UAC3C;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,YAAY;AACb,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,cAAa;AAAA,YACrB,EAAE,MAAM,YAAW;AAAA,YACnB,EAAE,MAAM,WAAU;AAAA,UAC1C;AAAA,QACA;AAAA,MACY;AAAA,MACA,KAAK,UAAU;AACX,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY;AAAA,YACR,EAAE,MAAM,cAAa;AAAA,YACrB,EAAE,MAAM,YAAW;AAAA,UAC3C;AAAA,QACA;AAAA,MACY;AAAA,MACA,SAAS;AACL,eAAO;AAAA,UACH,MAAM;AAAA,UACN,YAAY,CAAA;AAAA,QAChC;AAAA,MACY;AAAA,IACZ;AAAA,EACI;AACJ;AACY,MAAC,aAAa,IAAI,4BAA2B;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/langium@3.3.1/node_modules/langium/lib/languages/grammar-config.mjs

@@ -0,0 +1,21 @@
+import { DefaultNameRegexp } from "../utils/cst-utils.mjs";
+import { isCommentTerminal, terminalRegex } from "../utils/grammar-utils.mjs";
+import { isMultilineComment } from "../utils/regexp-utils.mjs";
+import { isTerminalRule } from "./generated/ast.mjs";
+function createGrammarConfig(services) {
+  const rules = [];
+  const grammar = services.Grammar;
+  for (const rule of grammar.rules) {
+    if (isTerminalRule(rule) && isCommentTerminal(rule) && isMultilineComment(terminalRegex(rule))) {
+      rules.push(rule.name);
+    }
+  }
+  return {
+    multilineCommentRules: rules,
+    nameRegexp: DefaultNameRegexp
+  };
+}
+export {
+  createGrammarConfig
+};
+//# sourceMappingURL=grammar-config.mjs.map

package/dist/node_modules/.pnpm/langium@3.3.1/node_modules/langium/lib/languages/grammar-config.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"grammar-config.mjs","sources":["../../../../../../../../../../node_modules/.pnpm/langium@3.3.1/node_modules/langium/lib/languages/grammar-config.js"],"sourcesContent":["/******************************************************************************\n * Copyright 2021 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 { DefaultNameRegexp } from '../utils/cst-utils.js';\nimport { isCommentTerminal, terminalRegex } from '../utils/grammar-utils.js';\nimport { isMultilineComment } from '../utils/regexp-utils.js';\nimport { isTerminalRule } from './generated/ast.js';\n/**\n * Create the default grammar configuration (used by `createDefaultModule`). This can be overridden in a\n * language-specific module.\n */\nexport function createGrammarConfig(services) {\n    const rules = [];\n    const grammar = services.Grammar;\n    for (const rule of grammar.rules) {\n        if (isTerminalRule(rule) && isCommentTerminal(rule) && isMultilineComment(terminalRegex(rule))) {\n            rules.push(rule.name);\n        }\n    }\n    return {\n        multilineCommentRules: rules,\n        nameRegexp: DefaultNameRegexp\n    };\n}\n//# sourceMappingURL=grammar-config.js.map"],"names":[],"mappings":";;;;AAaO,SAAS,oBAAoB,UAAU;AAC1C,QAAM,QAAQ,CAAA;AACd,QAAM,UAAU,SAAS;AACzB,aAAW,QAAQ,QAAQ,OAAO;AAC9B,QAAI,eAAe,IAAI,KAAK,kBAAkB,IAAI,KAAK,mBAAmB,cAAc,IAAI,CAAC,GAAG;AAC5F,YAAM,KAAK,KAAK,IAAI;AAAA,IACxB;AAAA,EACJ;AACA,SAAO;AAAA,IACH,uBAAuB;AAAA,IACvB,YAAY;AAAA,EACpB;AACA;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/langium@3.3.1/node_modules/langium/lib/parser/async-parser.mjs

@@ -0,0 +1,12 @@
+class DefaultAsyncParser {
+  constructor(services) {
+    this.syncParser = services.parser.LangiumParser;
+  }
+  parse(text, _cancelToken) {
+    return Promise.resolve(this.syncParser.parse(text));
+  }
+}
+export {
+  DefaultAsyncParser
+};
+//# sourceMappingURL=async-parser.mjs.map

package/dist/node_modules/.pnpm/langium@3.3.1/node_modules/langium/lib/parser/async-parser.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"async-parser.mjs","sources":["../../../../../../../../../../node_modules/.pnpm/langium@3.3.1/node_modules/langium/lib/parser/async-parser.js"],"sourcesContent":["/******************************************************************************\n * Copyright 2023 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 { Deferred, OperationCancelled } from '../utils/promise-utils.js';\nimport { Emitter } from '../utils/event.js';\n/**\n * Default implementation of the async parser which simply wraps the sync parser in a promise.\n *\n * @remarks\n * A real implementation would create worker threads or web workers to offload the parsing work.\n */\nexport class DefaultAsyncParser {\n    constructor(services) {\n        this.syncParser = services.parser.LangiumParser;\n    }\n    parse(text, _cancelToken) {\n        return Promise.resolve(this.syncParser.parse(text));\n    }\n}\nexport class AbstractThreadedAsyncParser {\n    constructor(services) {\n        /**\n         * The thread count determines how many threads are used to parse files in parallel.\n         * The default value is 8. Decreasing this value increases startup performance, but decreases parallel parsing performance.\n         */\n        this.threadCount = 8;\n        /**\n         * The termination delay determines how long the parser waits for a thread to finish after a cancellation request.\n         * The default value is 200(ms).\n         */\n        this.terminationDelay = 200;\n        this.workerPool = [];\n        this.queue = [];\n        this.hydrator = services.serializer.Hydrator;\n    }\n    initializeWorkers() {\n        while (this.workerPool.length < this.threadCount) {\n            const worker = this.createWorker();\n            worker.onReady(() => {\n                if (this.queue.length > 0) {\n                    const deferred = this.queue.shift();\n                    if (deferred) {\n                        worker.lock();\n                        deferred.resolve(worker);\n                    }\n                }\n            });\n            this.workerPool.push(worker);\n        }\n    }\n    async parse(text, cancelToken) {\n        const worker = await this.acquireParserWorker(cancelToken);\n        const deferred = new Deferred();\n        let timeout;\n        // If the cancellation token is requested, we wait for a certain time before terminating the worker.\n        // Since the cancellation token lives longer than the parsing process, we need to dispose the event listener.\n        // Otherwise, we might accidentally terminate the worker after the parsing process has finished.\n        const cancellation = cancelToken.onCancellationRequested(() => {\n            timeout = setTimeout(() => {\n                this.terminateWorker(worker);\n            }, this.terminationDelay);\n        });\n        worker.parse(text).then(result => {\n            const hydrated = this.hydrator.hydrate(result);\n            deferred.resolve(hydrated);\n        }).catch(err => {\n            deferred.reject(err);\n        }).finally(() => {\n            cancellation.dispose();\n            clearTimeout(timeout);\n        });\n        return deferred.promise;\n    }\n    terminateWorker(worker) {\n        worker.terminate();\n        const index = this.workerPool.indexOf(worker);\n        if (index >= 0) {\n            this.workerPool.splice(index, 1);\n        }\n    }\n    async acquireParserWorker(cancelToken) {\n        this.initializeWorkers();\n        for (const worker of this.workerPool) {\n            if (worker.ready) {\n                worker.lock();\n                return worker;\n            }\n        }\n        const deferred = new Deferred();\n        cancelToken.onCancellationRequested(() => {\n            const index = this.queue.indexOf(deferred);\n            if (index >= 0) {\n                this.queue.splice(index, 1);\n            }\n            deferred.reject(OperationCancelled);\n        });\n        this.queue.push(deferred);\n        return deferred.promise;\n    }\n}\nexport class ParserWorker {\n    get ready() {\n        return this._ready;\n    }\n    get onReady() {\n        return this.onReadyEmitter.event;\n    }\n    constructor(sendMessage, onMessage, onError, terminate) {\n        this.onReadyEmitter = new Emitter();\n        this.deferred = new Deferred();\n        this._ready = true;\n        this._parsing = false;\n        this.sendMessage = sendMessage;\n        this._terminate = terminate;\n        onMessage(result => {\n            const parseResult = result;\n            this.deferred.resolve(parseResult);\n            this.unlock();\n        });\n        onError(error => {\n            this.deferred.reject(error);\n            this.unlock();\n        });\n    }\n    terminate() {\n        this.deferred.reject(OperationCancelled);\n        this._terminate();\n    }\n    lock() {\n        this._ready = false;\n    }\n    unlock() {\n        this._parsing = false;\n        this._ready = true;\n        this.onReadyEmitter.fire();\n    }\n    parse(text) {\n        if (this._parsing) {\n            throw new Error('Parser worker is busy');\n        }\n        this._parsing = true;\n        this.deferred = new Deferred();\n        this.sendMessage(text);\n        return this.deferred.promise;\n    }\n}\n//# sourceMappingURL=async-parser.js.map"],"names":[],"mappings":"AAaO,MAAM,mBAAmB;AAAA,EAC5B,YAAY,UAAU;AAClB,SAAK,aAAa,SAAS,OAAO;AAAA,EACtC;AAAA,EACA,MAAM,MAAM,cAAc;AACtB,WAAO,QAAQ,QAAQ,KAAK,WAAW,MAAM,IAAI,CAAC;AAAA,EACtD;AACJ;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/langium@3.3.1/node_modules/langium/lib/parser/completion-parser-builder.mjs

@@ -0,0 +1,14 @@
+import { LangiumCompletionParser } from "./langium-parser.mjs";
+import { createParser } from "./parser-builder-base.mjs";
+function createCompletionParser(services) {
+  const grammar = services.Grammar;
+  const lexer = services.parser.Lexer;
+  const parser = new LangiumCompletionParser(services);
+  createParser(grammar, parser, lexer.definition);
+  parser.finalize();
+  return parser;
+}
+export {
+  createCompletionParser
+};
+//# sourceMappingURL=completion-parser-builder.mjs.map

package/dist/node_modules/.pnpm/langium@3.3.1/node_modules/langium/lib/parser/completion-parser-builder.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"completion-parser-builder.mjs","sources":["../../../../../../../../../../node_modules/.pnpm/langium@3.3.1/node_modules/langium/lib/parser/completion-parser-builder.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 { LangiumCompletionParser } from './langium-parser.js';\nimport { createParser } from './parser-builder-base.js';\nexport function createCompletionParser(services) {\n    const grammar = services.Grammar;\n    const lexer = services.parser.Lexer;\n    const parser = new LangiumCompletionParser(services);\n    createParser(grammar, parser, lexer.definition);\n    parser.finalize();\n    return parser;\n}\n//# sourceMappingURL=completion-parser-builder.js.map"],"names":[],"mappings":";;AAOO,SAAS,uBAAuB,UAAU;AAC7C,QAAM,UAAU,SAAS;AACzB,QAAM,QAAQ,SAAS,OAAO;AAC9B,QAAM,SAAS,IAAI,wBAAwB,QAAQ;AACnD,eAAa,SAAS,QAAQ,MAAM,UAAU;AAC9C,SAAO,SAAQ;AACf,SAAO;AACX;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/langium@3.3.1/node_modules/langium/lib/parser/cst-node-builder.mjs

@@ -0,0 +1,234 @@
+import { Position } from "../../../../../vscode-languageserver-types@3.17.5/node_modules/vscode-languageserver-types/lib/esm/main.mjs";
+import { tokenToRange } from "../utils/cst-utils.mjs";
+class CstNodeBuilder {
+  constructor() {
+    this.nodeStack = [];
+  }
+  get current() {
+    var _a;
+    return (_a = this.nodeStack[this.nodeStack.length - 1]) !== null && _a !== void 0 ? _a : this.rootNode;
+  }
+  buildRootNode(input) {
+    this.rootNode = new RootCstNodeImpl(input);
+    this.rootNode.root = this.rootNode;
+    this.nodeStack = [this.rootNode];
+    return this.rootNode;
+  }
+  buildCompositeNode(feature) {
+    const compositeNode = new CompositeCstNodeImpl();
+    compositeNode.grammarSource = feature;
+    compositeNode.root = this.rootNode;
+    this.current.content.push(compositeNode);
+    this.nodeStack.push(compositeNode);
+    return compositeNode;
+  }
+  buildLeafNode(token, feature) {
+    const leafNode = new LeafCstNodeImpl(token.startOffset, token.image.length, tokenToRange(token), token.tokenType, !feature);
+    leafNode.grammarSource = feature;
+    leafNode.root = this.rootNode;
+    this.current.content.push(leafNode);
+    return leafNode;
+  }
+  removeNode(node) {
+    const parent = node.container;
+    if (parent) {
+      const index = parent.content.indexOf(node);
+      if (index >= 0) {
+        parent.content.splice(index, 1);
+      }
+    }
+  }
+  addHiddenNodes(tokens) {
+    const nodes = [];
+    for (const token of tokens) {
+      const leafNode = new LeafCstNodeImpl(token.startOffset, token.image.length, tokenToRange(token), token.tokenType, true);
+      leafNode.root = this.rootNode;
+      nodes.push(leafNode);
+    }
+    let current = this.current;
+    let added = false;
+    if (current.content.length > 0) {
+      current.content.push(...nodes);
+      return;
+    }
+    while (current.container) {
+      const index = current.container.content.indexOf(current);
+      if (index > 0) {
+        current.container.content.splice(index, 0, ...nodes);
+        added = true;
+        break;
+      }
+      current = current.container;
+    }
+    if (!added) {
+      this.rootNode.content.unshift(...nodes);
+    }
+  }
+  construct(item) {
+    const current = this.current;
+    if (typeof item.$type === "string") {
+      this.current.astNode = item;
+    }
+    item.$cstNode = current;
+    const node = this.nodeStack.pop();
+    if ((node === null || node === void 0 ? void 0 : node.content.length) === 0) {
+      this.removeNode(node);
+    }
+  }
+}
+class AbstractCstNode {
+  /** @deprecated use `container` instead. */
+  get parent() {
+    return this.container;
+  }
+  /** @deprecated use `grammarSource` instead. */
+  get feature() {
+    return this.grammarSource;
+  }
+  get hidden() {
+    return false;
+  }
+  get astNode() {
+    var _a, _b;
+    const node = typeof ((_a = this._astNode) === null || _a === void 0 ? void 0 : _a.$type) === "string" ? this._astNode : (_b = this.container) === null || _b === void 0 ? void 0 : _b.astNode;
+    if (!node) {
+      throw new Error("This node has no associated AST element");
+    }
+    return node;
+  }
+  set astNode(value) {
+    this._astNode = value;
+  }
+  /** @deprecated use `astNode` instead. */
+  get element() {
+    return this.astNode;
+  }
+  get text() {
+    return this.root.fullText.substring(this.offset, this.end);
+  }
+}
+class LeafCstNodeImpl extends AbstractCstNode {
+  get offset() {
+    return this._offset;
+  }
+  get length() {
+    return this._length;
+  }
+  get end() {
+    return this._offset + this._length;
+  }
+  get hidden() {
+    return this._hidden;
+  }
+  get tokenType() {
+    return this._tokenType;
+  }
+  get range() {
+    return this._range;
+  }
+  constructor(offset, length, range, tokenType, hidden = false) {
+    super();
+    this._hidden = hidden;
+    this._offset = offset;
+    this._tokenType = tokenType;
+    this._length = length;
+    this._range = range;
+  }
+}
+class CompositeCstNodeImpl extends AbstractCstNode {
+  constructor() {
+    super(...arguments);
+    this.content = new CstNodeContainer(this);
+  }
+  /** @deprecated use `content` instead. */
+  get children() {
+    return this.content;
+  }
+  get offset() {
+    var _a, _b;
+    return (_b = (_a = this.firstNonHiddenNode) === null || _a === void 0 ? void 0 : _a.offset) !== null && _b !== void 0 ? _b : 0;
+  }
+  get length() {
+    return this.end - this.offset;
+  }
+  get end() {
+    var _a, _b;
+    return (_b = (_a = this.lastNonHiddenNode) === null || _a === void 0 ? void 0 : _a.end) !== null && _b !== void 0 ? _b : 0;
+  }
+  get range() {
+    const firstNode = this.firstNonHiddenNode;
+    const lastNode = this.lastNonHiddenNode;
+    if (firstNode && lastNode) {
+      if (this._rangeCache === void 0) {
+        const { range: firstRange } = firstNode;
+        const { range: lastRange } = lastNode;
+        this._rangeCache = { start: firstRange.start, end: lastRange.end.line < firstRange.start.line ? firstRange.start : lastRange.end };
+      }
+      return this._rangeCache;
+    } else {
+      return { start: Position.create(0, 0), end: Position.create(0, 0) };
+    }
+  }
+  get firstNonHiddenNode() {
+    for (const child of this.content) {
+      if (!child.hidden) {
+        return child;
+      }
+    }
+    return this.content[0];
+  }
+  get lastNonHiddenNode() {
+    for (let i = this.content.length - 1; i >= 0; i--) {
+      const child = this.content[i];
+      if (!child.hidden) {
+        return child;
+      }
+    }
+    return this.content[this.content.length - 1];
+  }
+}
+class CstNodeContainer extends Array {
+  constructor(parent) {
+    super();
+    this.parent = parent;
+    Object.setPrototypeOf(this, CstNodeContainer.prototype);
+  }
+  push(...items) {
+    this.addParents(items);
+    return super.push(...items);
+  }
+  unshift(...items) {
+    this.addParents(items);
+    return super.unshift(...items);
+  }
+  splice(start, count, ...items) {
+    this.addParents(items);
+    return super.splice(start, count, ...items);
+  }
+  addParents(items) {
+    for (const item of items) {
+      item.container = this.parent;
+    }
+  }
+}
+class RootCstNodeImpl extends CompositeCstNodeImpl {
+  get text() {
+    return this._text.substring(this.offset, this.end);
+  }
+  get fullText() {
+    return this._text;
+  }
+  constructor(input) {
+    super();
+    this._text = "";
+    this._text = input !== null && input !== void 0 ? input : "";
+  }
+}
+export {
+  AbstractCstNode,
+  CompositeCstNodeImpl,
+  CstNodeBuilder,
+  LeafCstNodeImpl,
+  RootCstNodeImpl
+};
+//# sourceMappingURL=cst-node-builder.mjs.map

package/dist/node_modules/.pnpm/langium@3.3.1/node_modules/langium/lib/parser/cst-node-builder.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"cst-node-builder.mjs","sources":["../../../../../../../../../../node_modules/.pnpm/langium@3.3.1/node_modules/langium/lib/parser/cst-node-builder.js"],"sourcesContent":["/******************************************************************************\n * Copyright 2021 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 { Position } from 'vscode-languageserver-types';\nimport { tokenToRange } from '../utils/cst-utils.js';\nexport class CstNodeBuilder {\n    constructor() {\n        this.nodeStack = [];\n    }\n    get current() {\n        var _a;\n        return (_a = this.nodeStack[this.nodeStack.length - 1]) !== null && _a !== void 0 ? _a : this.rootNode;\n    }\n    buildRootNode(input) {\n        this.rootNode = new RootCstNodeImpl(input);\n        this.rootNode.root = this.rootNode;\n        this.nodeStack = [this.rootNode];\n        return this.rootNode;\n    }\n    buildCompositeNode(feature) {\n        const compositeNode = new CompositeCstNodeImpl();\n        compositeNode.grammarSource = feature;\n        compositeNode.root = this.rootNode;\n        this.current.content.push(compositeNode);\n        this.nodeStack.push(compositeNode);\n        return compositeNode;\n    }\n    buildLeafNode(token, feature) {\n        const leafNode = new LeafCstNodeImpl(token.startOffset, token.image.length, tokenToRange(token), token.tokenType, !feature);\n        leafNode.grammarSource = feature;\n        leafNode.root = this.rootNode;\n        this.current.content.push(leafNode);\n        return leafNode;\n    }\n    removeNode(node) {\n        const parent = node.container;\n        if (parent) {\n            const index = parent.content.indexOf(node);\n            if (index >= 0) {\n                parent.content.splice(index, 1);\n            }\n        }\n    }\n    addHiddenNodes(tokens) {\n        const nodes = [];\n        for (const token of tokens) {\n            const leafNode = new LeafCstNodeImpl(token.startOffset, token.image.length, tokenToRange(token), token.tokenType, true);\n            leafNode.root = this.rootNode;\n            nodes.push(leafNode);\n        }\n        let current = this.current;\n        let added = false;\n        // If we are within a composite node, we add the hidden nodes to the content\n        if (current.content.length > 0) {\n            current.content.push(...nodes);\n            return;\n        }\n        // Otherwise we are at a newly created node\n        // Instead of adding the hidden nodes here, we search for the first parent node with content\n        while (current.container) {\n            const index = current.container.content.indexOf(current);\n            if (index > 0) {\n                // Add the hidden nodes before the current node\n                current.container.content.splice(index, 0, ...nodes);\n                added = true;\n                break;\n            }\n            current = current.container;\n        }\n        // If we arrive at the root node, we add the hidden nodes at the beginning\n        // This is the case if the hidden nodes are the first nodes in the tree\n        if (!added) {\n            this.rootNode.content.unshift(...nodes);\n        }\n    }\n    construct(item) {\n        const current = this.current;\n        // The specified item could be a datatype ($type is symbol) or a fragment ($type is undefined)\n        // Only if the $type is a string, we actually assign the element\n        if (typeof item.$type === 'string') {\n            this.current.astNode = item;\n        }\n        item.$cstNode = current;\n        const node = this.nodeStack.pop();\n        // Empty composite nodes are not valid\n        // Simply remove the node from the tree\n        if ((node === null || node === void 0 ? void 0 : node.content.length) === 0) {\n            this.removeNode(node);\n        }\n    }\n}\nexport class AbstractCstNode {\n    /** @deprecated use `container` instead. */\n    get parent() {\n        return this.container;\n    }\n    /** @deprecated use `grammarSource` instead. */\n    get feature() {\n        return this.grammarSource;\n    }\n    get hidden() {\n        return false;\n    }\n    get astNode() {\n        var _a, _b;\n        const node = typeof ((_a = this._astNode) === null || _a === void 0 ? void 0 : _a.$type) === 'string' ? this._astNode : (_b = this.container) === null || _b === void 0 ? void 0 : _b.astNode;\n        if (!node) {\n            throw new Error('This node has no associated AST element');\n        }\n        return node;\n    }\n    set astNode(value) {\n        this._astNode = value;\n    }\n    /** @deprecated use `astNode` instead. */\n    get element() {\n        return this.astNode;\n    }\n    get text() {\n        return this.root.fullText.substring(this.offset, this.end);\n    }\n}\nexport class LeafCstNodeImpl extends AbstractCstNode {\n    get offset() {\n        return this._offset;\n    }\n    get length() {\n        return this._length;\n    }\n    get end() {\n        return this._offset + this._length;\n    }\n    get hidden() {\n        return this._hidden;\n    }\n    get tokenType() {\n        return this._tokenType;\n    }\n    get range() {\n        return this._range;\n    }\n    constructor(offset, length, range, tokenType, hidden = false) {\n        super();\n        this._hidden = hidden;\n        this._offset = offset;\n        this._tokenType = tokenType;\n        this._length = length;\n        this._range = range;\n    }\n}\nexport class CompositeCstNodeImpl extends AbstractCstNode {\n    constructor() {\n        super(...arguments);\n        this.content = new CstNodeContainer(this);\n    }\n    /** @deprecated use `content` instead. */\n    get children() {\n        return this.content;\n    }\n    get offset() {\n        var _a, _b;\n        return (_b = (_a = this.firstNonHiddenNode) === null || _a === void 0 ? void 0 : _a.offset) !== null && _b !== void 0 ? _b : 0;\n    }\n    get length() {\n        return this.end - this.offset;\n    }\n    get end() {\n        var _a, _b;\n        return (_b = (_a = this.lastNonHiddenNode) === null || _a === void 0 ? void 0 : _a.end) !== null && _b !== void 0 ? _b : 0;\n    }\n    get range() {\n        const firstNode = this.firstNonHiddenNode;\n        const lastNode = this.lastNonHiddenNode;\n        if (firstNode && lastNode) {\n            if (this._rangeCache === undefined) {\n                const { range: firstRange } = firstNode;\n                const { range: lastRange } = lastNode;\n                this._rangeCache = { start: firstRange.start, end: lastRange.end.line < firstRange.start.line ? firstRange.start : lastRange.end };\n            }\n            return this._rangeCache;\n        }\n        else {\n            return { start: Position.create(0, 0), end: Position.create(0, 0) };\n        }\n    }\n    get firstNonHiddenNode() {\n        for (const child of this.content) {\n            if (!child.hidden) {\n                return child;\n            }\n        }\n        return this.content[0];\n    }\n    get lastNonHiddenNode() {\n        for (let i = this.content.length - 1; i >= 0; i--) {\n            const child = this.content[i];\n            if (!child.hidden) {\n                return child;\n            }\n        }\n        return this.content[this.content.length - 1];\n    }\n}\nclass CstNodeContainer extends Array {\n    constructor(parent) {\n        super();\n        this.parent = parent;\n        Object.setPrototypeOf(this, CstNodeContainer.prototype);\n    }\n    push(...items) {\n        this.addParents(items);\n        return super.push(...items);\n    }\n    unshift(...items) {\n        this.addParents(items);\n        return super.unshift(...items);\n    }\n    splice(start, count, ...items) {\n        this.addParents(items);\n        return super.splice(start, count, ...items);\n    }\n    addParents(items) {\n        for (const item of items) {\n            item.container = this.parent;\n        }\n    }\n}\nexport class RootCstNodeImpl extends CompositeCstNodeImpl {\n    get text() {\n        return this._text.substring(this.offset, this.end);\n    }\n    get fullText() {\n        return this._text;\n    }\n    constructor(input) {\n        super();\n        this._text = '';\n        this._text = input !== null && input !== void 0 ? input : '';\n    }\n}\n//# sourceMappingURL=cst-node-builder.js.map"],"names":[],"mappings":";;AAOO,MAAM,eAAe;AAAA,EACxB,cAAc;AACV,SAAK,YAAY,CAAA;AAAA,EACrB;AAAA,EACA,IAAI,UAAU;AACV,QAAI;AACJ,YAAQ,KAAK,KAAK,UAAU,KAAK,UAAU,SAAS,CAAC,OAAO,QAAQ,OAAO,SAAS,KAAK,KAAK;AAAA,EAClG;AAAA,EACA,cAAc,OAAO;AACjB,SAAK,WAAW,IAAI,gBAAgB,KAAK;AACzC,SAAK,SAAS,OAAO,KAAK;AAC1B,SAAK,YAAY,CAAC,KAAK,QAAQ;AAC/B,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,mBAAmB,SAAS;AACxB,UAAM,gBAAgB,IAAI,qBAAoB;AAC9C,kBAAc,gBAAgB;AAC9B,kBAAc,OAAO,KAAK;AAC1B,SAAK,QAAQ,QAAQ,KAAK,aAAa;AACvC,SAAK,UAAU,KAAK,aAAa;AACjC,WAAO;AAAA,EACX;AAAA,EACA,cAAc,OAAO,SAAS;AAC1B,UAAM,WAAW,IAAI,gBAAgB,MAAM,aAAa,MAAM,MAAM,QAAQ,aAAa,KAAK,GAAG,MAAM,WAAW,CAAC,OAAO;AAC1H,aAAS,gBAAgB;AACzB,aAAS,OAAO,KAAK;AACrB,SAAK,QAAQ,QAAQ,KAAK,QAAQ;AAClC,WAAO;AAAA,EACX;AAAA,EACA,WAAW,MAAM;AACb,UAAM,SAAS,KAAK;AACpB,QAAI,QAAQ;AACR,YAAM,QAAQ,OAAO,QAAQ,QAAQ,IAAI;AACzC,UAAI,SAAS,GAAG;AACZ,eAAO,QAAQ,OAAO,OAAO,CAAC;AAAA,MAClC;AAAA,IACJ;AAAA,EACJ;AAAA,EACA,eAAe,QAAQ;AACnB,UAAM,QAAQ,CAAA;AACd,eAAW,SAAS,QAAQ;AACxB,YAAM,WAAW,IAAI,gBAAgB,MAAM,aAAa,MAAM,MAAM,QAAQ,aAAa,KAAK,GAAG,MAAM,WAAW,IAAI;AACtH,eAAS,OAAO,KAAK;AACrB,YAAM,KAAK,QAAQ;AAAA,IACvB;AACA,QAAI,UAAU,KAAK;AACnB,QAAI,QAAQ;AAEZ,QAAI,QAAQ,QAAQ,SAAS,GAAG;AAC5B,cAAQ,QAAQ,KAAK,GAAG,KAAK;AAC7B;AAAA,IACJ;AAGA,WAAO,QAAQ,WAAW;AACtB,YAAM,QAAQ,QAAQ,UAAU,QAAQ,QAAQ,OAAO;AACvD,UAAI,QAAQ,GAAG;AAEX,gBAAQ,UAAU,QAAQ,OAAO,OAAO,GAAG,GAAG,KAAK;AACnD,gBAAQ;AACR;AAAA,MACJ;AACA,gBAAU,QAAQ;AAAA,IACtB;AAGA,QAAI,CAAC,OAAO;AACR,WAAK,SAAS,QAAQ,QAAQ,GAAG,KAAK;AAAA,IAC1C;AAAA,EACJ;AAAA,EACA,UAAU,MAAM;AACZ,UAAM,UAAU,KAAK;AAGrB,QAAI,OAAO,KAAK,UAAU,UAAU;AAChC,WAAK,QAAQ,UAAU;AAAA,IAC3B;AACA,SAAK,WAAW;AAChB,UAAM,OAAO,KAAK,UAAU,IAAG;AAG/B,SAAK,SAAS,QAAQ,SAAS,SAAS,SAAS,KAAK,QAAQ,YAAY,GAAG;AACzE,WAAK,WAAW,IAAI;AAAA,IACxB;AAAA,EACJ;AACJ;AACO,MAAM,gBAAgB;AAAA;AAAA,EAEzB,IAAI,SAAS;AACT,WAAO,KAAK;AAAA,EAChB;AAAA;AAAA,EAEA,IAAI,UAAU;AACV,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,IAAI,SAAS;AACT,WAAO;AAAA,EACX;AAAA,EACA,IAAI,UAAU;AACV,QAAI,IAAI;AACR,UAAM,OAAO,SAAS,KAAK,KAAK,cAAc,QAAQ,OAAO,SAAS,SAAS,GAAG,WAAW,WAAW,KAAK,YAAY,KAAK,KAAK,eAAe,QAAQ,OAAO,SAAS,SAAS,GAAG;AACtL,QAAI,CAAC,MAAM;AACP,YAAM,IAAI,MAAM,yCAAyC;AAAA,IAC7D;AACA,WAAO;AAAA,EACX;AAAA,EACA,IAAI,QAAQ,OAAO;AACf,SAAK,WAAW;AAAA,EACpB;AAAA;AAAA,EAEA,IAAI,UAAU;AACV,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,IAAI,OAAO;AACP,WAAO,KAAK,KAAK,SAAS,UAAU,KAAK,QAAQ,KAAK,GAAG;AAAA,EAC7D;AACJ;AACO,MAAM,wBAAwB,gBAAgB;AAAA,EACjD,IAAI,SAAS;AACT,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,IAAI,SAAS;AACT,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,IAAI,MAAM;AACN,WAAO,KAAK,UAAU,KAAK;AAAA,EAC/B;AAAA,EACA,IAAI,SAAS;AACT,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,IAAI,YAAY;AACZ,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,IAAI,QAAQ;AACR,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,YAAY,QAAQ,QAAQ,OAAO,WAAW,SAAS,OAAO;AAC1D,UAAK;AACL,SAAK,UAAU;AACf,SAAK,UAAU;AACf,SAAK,aAAa;AAClB,SAAK,UAAU;AACf,SAAK,SAAS;AAAA,EAClB;AACJ;AACO,MAAM,6BAA6B,gBAAgB;AAAA,EACtD,cAAc;AACV,UAAM,GAAG,SAAS;AAClB,SAAK,UAAU,IAAI,iBAAiB,IAAI;AAAA,EAC5C;AAAA;AAAA,EAEA,IAAI,WAAW;AACX,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,IAAI,SAAS;AACT,QAAI,IAAI;AACR,YAAQ,MAAM,KAAK,KAAK,wBAAwB,QAAQ,OAAO,SAAS,SAAS,GAAG,YAAY,QAAQ,OAAO,SAAS,KAAK;AAAA,EACjI;AAAA,EACA,IAAI,SAAS;AACT,WAAO,KAAK,MAAM,KAAK;AAAA,EAC3B;AAAA,EACA,IAAI,MAAM;AACN,QAAI,IAAI;AACR,YAAQ,MAAM,KAAK,KAAK,uBAAuB,QAAQ,OAAO,SAAS,SAAS,GAAG,SAAS,QAAQ,OAAO,SAAS,KAAK;AAAA,EAC7H;AAAA,EACA,IAAI,QAAQ;AACR,UAAM,YAAY,KAAK;AACvB,UAAM,WAAW,KAAK;AACtB,QAAI,aAAa,UAAU;AACvB,UAAI,KAAK,gBAAgB,QAAW;AAChC,cAAM,EAAE,OAAO,WAAU,IAAK;AAC9B,cAAM,EAAE,OAAO,UAAS,IAAK;AAC7B,aAAK,cAAc,EAAE,OAAO,WAAW,OAAO,KAAK,UAAU,IAAI,OAAO,WAAW,MAAM,OAAO,WAAW,QAAQ,UAAU,IAAG;AAAA,MACpI;AACA,aAAO,KAAK;AAAA,IAChB,OACK;AACD,aAAO,EAAE,OAAO,SAAS,OAAO,GAAG,CAAC,GAAG,KAAK,SAAS,OAAO,GAAG,CAAC,EAAC;AAAA,IACrE;AAAA,EACJ;AAAA,EACA,IAAI,qBAAqB;AACrB,eAAW,SAAS,KAAK,SAAS;AAC9B,UAAI,CAAC,MAAM,QAAQ;AACf,eAAO;AAAA,MACX;AAAA,IACJ;AACA,WAAO,KAAK,QAAQ,CAAC;AAAA,EACzB;AAAA,EACA,IAAI,oBAAoB;AACpB,aAAS,IAAI,KAAK,QAAQ,SAAS,GAAG,KAAK,GAAG,KAAK;AAC/C,YAAM,QAAQ,KAAK,QAAQ,CAAC;AAC5B,UAAI,CAAC,MAAM,QAAQ;AACf,eAAO;AAAA,MACX;AAAA,IACJ;AACA,WAAO,KAAK,QAAQ,KAAK,QAAQ,SAAS,CAAC;AAAA,EAC/C;AACJ;AACA,MAAM,yBAAyB,MAAM;AAAA,EACjC,YAAY,QAAQ;AAChB,UAAK;AACL,SAAK,SAAS;AACd,WAAO,eAAe,MAAM,iBAAiB,SAAS;AAAA,EAC1D;AAAA,EACA,QAAQ,OAAO;AACX,SAAK,WAAW,KAAK;AACrB,WAAO,MAAM,KAAK,GAAG,KAAK;AAAA,EAC9B;AAAA,EACA,WAAW,OAAO;AACd,SAAK,WAAW,KAAK;AACrB,WAAO,MAAM,QAAQ,GAAG,KAAK;AAAA,EACjC;AAAA,EACA,OAAO,OAAO,UAAU,OAAO;AAC3B,SAAK,WAAW,KAAK;AACrB,WAAO,MAAM,OAAO,OAAO,OAAO,GAAG,KAAK;AAAA,EAC9C;AAAA,EACA,WAAW,OAAO;AACd,eAAW,QAAQ,OAAO;AACtB,WAAK,YAAY,KAAK;AAAA,IAC1B;AAAA,EACJ;AACJ;AACO,MAAM,wBAAwB,qBAAqB;AAAA,EACtD,IAAI,OAAO;AACP,WAAO,KAAK,MAAM,UAAU,KAAK,QAAQ,KAAK,GAAG;AAAA,EACrD;AAAA,EACA,IAAI,WAAW;AACX,WAAO,KAAK;AAAA,EAChB;AAAA,EACA,YAAY,OAAO;AACf,UAAK;AACL,SAAK,QAAQ;AACb,SAAK,QAAQ,UAAU,QAAQ,UAAU,SAAS,QAAQ;AAAA,EAC9D;AACJ;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/langium@3.3.1/node_modules/langium/lib/parser/langium-parser-builder.mjs

@@ -0,0 +1,18 @@
+import { LangiumParser } from "./langium-parser.mjs";
+import { createParser } from "./parser-builder-base.mjs";
+function createLangiumParser(services) {
+  const parser = prepareLangiumParser(services);
+  parser.finalize();
+  return parser;
+}
+function prepareLangiumParser(services) {
+  const grammar = services.Grammar;
+  const lexer = services.parser.Lexer;
+  const parser = new LangiumParser(services);
+  return createParser(grammar, parser, lexer.definition);
+}
+export {
+  createLangiumParser,
+  prepareLangiumParser
+};
+//# sourceMappingURL=langium-parser-builder.mjs.map

package/dist/node_modules/.pnpm/langium@3.3.1/node_modules/langium/lib/parser/langium-parser-builder.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"langium-parser-builder.mjs","sources":["../../../../../../../../../../node_modules/.pnpm/langium@3.3.1/node_modules/langium/lib/parser/langium-parser-builder.js"],"sourcesContent":["/******************************************************************************\n * Copyright 2021 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 { LangiumParser } from './langium-parser.js';\nimport { createParser } from './parser-builder-base.js';\n/**\n * Create and finalize a Langium parser. The parser rules are derived from the grammar, which is\n * available at `services.Grammar`.\n */\nexport function createLangiumParser(services) {\n    const parser = prepareLangiumParser(services);\n    parser.finalize();\n    return parser;\n}\n/**\n * Create a Langium parser without finalizing it. This is used to extract more detailed error\n * information when the parser is initially validated.\n */\nexport function prepareLangiumParser(services) {\n    const grammar = services.Grammar;\n    const lexer = services.parser.Lexer;\n    const parser = new LangiumParser(services);\n    return createParser(grammar, parser, lexer.definition);\n}\n//# sourceMappingURL=langium-parser-builder.js.map"],"names":[],"mappings":";;AAWO,SAAS,oBAAoB,UAAU;AAC1C,QAAM,SAAS,qBAAqB,QAAQ;AAC5C,SAAO,SAAQ;AACf,SAAO;AACX;AAKO,SAAS,qBAAqB,UAAU;AAC3C,QAAM,UAAU,SAAS;AACzB,QAAM,QAAQ,SAAS,OAAO;AAC9B,QAAM,SAAS,IAAI,cAAc,QAAQ;AACzC,SAAO,aAAa,SAAS,QAAQ,MAAM,UAAU;AACzD;","x_google_ignoreList":[0]}