@rsconcept/domain 1.7.0 → 1.7.1

package/src/rslang/parser/syntax-errors/incomplete-operands.ts

@@ -0,0 +1,184 @@
+/**
+ * Incomplete operators and bracket argument lists (`P1[S1, ]`).
+ *
+ * Tuple enums `(α,β,)` intentionally stay `unknownSyntax` — not `expectedArgument`.
+ */
+
+import type { AstNode } from '../../../parsing';
+import { RSErrorCode, type RSErrorDescription } from '../../error';
+import { Boolean, Expr_enum_min2, Logic_binary, Logic_predicates, Logic_unary, Setexpr_binary } from '../parser.terms';
+import { TokenID } from '../token';
+
+import {
+  findAncestor,
+  findMatchingCloseBracket,
+  getErrorOperandNode,
+  isFilterNode,
+  isFunctionNode,
+  isPredicateNode,
+  subtreeHasError
+} from './ast-utils';
+import type { ErrorClassifier } from './context';
+import { errorAt, hasOnlyClosingSuffix, isTextToken, sliceText } from './error-builders';
+
+export const classifyIncompleteOperands: ErrorClassifier = (node, expression) =>
+  detectIncompleteUnaryOperand(node, expression) ??
+  detectIncompleteBinaryOperand(node, expression) ??
+  detectIncompleteBooleanOperand(node, expression);
+
+export const classifyIncompleteArgument: ErrorClassifier = (node, expression) =>
+  detectIncompleteArgument(node, expression);
+
+function detectIncompleteUnaryOperand(node: AstNode, expression: string): RSErrorDescription | null {
+  const unaryNode = findAncestor(node, target => target.typeID === Logic_unary);
+  if (unaryNode === null) {
+    return null;
+  }
+
+  const operandChild = unaryNode.children[unaryNode.children.length - 1];
+  if (operandChild?.typeID !== TokenID.ERROR || node !== operandChild) {
+    return null;
+  }
+
+  if (expression.slice(unaryNode.to).trim().length > 0) {
+    return null;
+  }
+
+  const operatorChild = unaryNode.children[0];
+  if (operatorChild === undefined || operatorChild === operandChild) {
+    return null;
+  }
+
+  if (!isTextToken(operatorChild, expression, '¬')) {
+    return null;
+  }
+
+  return errorAt(operandChild, RSErrorCode.expectedUnaryOperand);
+}
+
+function detectIncompleteBinaryOperand(node: AstNode, expression: string): RSErrorDescription | null {
+  const binaryNode = findAncestor(
+    node,
+    target => target.typeID === Logic_binary || target.typeID === Logic_predicates || target.typeID === Setexpr_binary
+  );
+  if (binaryNode === null) {
+    return null;
+  }
+
+  const operandChild = binaryNode.children[binaryNode.children.length - 1];
+  if (operandChild?.typeID !== TokenID.ERROR || node !== operandChild) {
+    return null;
+  }
+
+  if (expression.slice(binaryNode.to).trim().length > 0) {
+    return null;
+  }
+
+  if (binaryNode.children.length < 2) {
+    return null;
+  }
+
+  const leftChild = binaryNode.children[0];
+  if (leftChild.typeID === TokenID.ERROR || subtreeHasError(leftChild)) {
+    return null;
+  }
+
+  return errorAt(operandChild, RSErrorCode.expectedRightOperand);
+}
+
+function detectIncompleteBooleanOperand(node: AstNode, expression: string): RSErrorDescription | null {
+  const booleanNode = findAncestor(node, target => target.typeID === Boolean);
+  if (booleanNode === null) {
+    return null;
+  }
+
+  const operandChild = findTrailingErrorOperand(booleanNode, expression);
+  if (operandChild === null || node !== operandChild) {
+    return null;
+  }
+
+  if (!hasOnlyClosingSuffix(expression, booleanNode.to)) {
+    return null;
+  }
+
+  return errorAt(operandChild, RSErrorCode.expectedRightOperand);
+}
+
+function detectIncompleteArgument(node: AstNode, expression: string): RSErrorDescription | null {
+  const enumNode = findAncestor(node, target => target.typeID === Expr_enum_min2);
+  if (enumNode === null || !isLegitimateArgumentEnum(enumNode, expression)) {
+    return null;
+  }
+
+  const errorChild = findEnumArgumentError(enumNode, expression);
+  if (errorChild === null || node !== errorChild || !hasOnlyClosingSuffix(expression, enumNode.to)) {
+    return null;
+  }
+
+  return errorAt(errorChild, RSErrorCode.expectedArgument);
+}
+
+function findTrailingErrorOperand(container: AstNode, expression: string): AstNode | null {
+  for (let index = container.children.length - 1; index >= 0; index--) {
+    const child = container.children[index];
+    if (isOperandStructuralToken(child, expression)) {
+      continue;
+    }
+    return getErrorOperandNode(child);
+  }
+  return null;
+}
+
+function findEnumArgumentError(enumNode: AstNode, expression: string): AstNode | null {
+  for (const child of enumNode.children) {
+    if (isTextToken(child, expression, ',')) {
+      continue;
+    }
+    const errorNode = getErrorOperandNode(child);
+    if (errorNode !== null) {
+      return errorNode;
+    }
+  }
+  return null;
+}
+
+function isOperandStructuralToken(node: AstNode, expression: string): boolean {
+  const text = sliceText(node, expression);
+  return text === '(' || text === ')' || text === 'ℬ';
+}
+
+function isLegitimateArgumentEnum(enumNode: AstNode, expression: string): boolean {
+  return findCallHostForBracketEnum(enumNode, expression) !== null;
+}
+
+function findCallHostForBracketEnum(enumNode: AstNode, expression: string): AstNode | null {
+  let current: AstNode | null = enumNode.parent;
+  while (current !== null) {
+    for (const child of current.children) {
+      if (!isFunctionNode(child) && !isPredicateNode(child) && !isFilterNode(child)) {
+        continue;
+      }
+      if (isEnumInCallBrackets(enumNode, child, expression)) {
+        return child;
+      }
+    }
+    current = current.parent;
+  }
+  return null;
+}
+
+function isEnumInCallBrackets(enumNode: AstNode, nameNode: AstNode, expression: string): boolean {
+  const rest = expression.slice(nameNode.to);
+  const match = /^\s*\[/.exec(rest);
+  if (match === null) {
+    return false;
+  }
+
+  const openPos = nameNode.to + match.index + match[0].indexOf('[');
+  const closePos = findMatchingCloseBracket(expression, openPos);
+  if (closePos < 0) {
+    return false;
+  }
+
+  return enumNode.from > openPos && enumNode.from < closePos;
+}

package/src/rslang/parser/syntax-errors/index.ts

@@ -0,0 +1,102 @@
+/**
+ * Syntax error extraction — public entry point.
+ *
+ * Expects the **hybrid** AST produced by `normalizeAST` (see `parser/README.md`).
+ * See {@link ./README.md} for pipeline, classifier order, and how to add codes.
+ *
+ * @module rslang/parser/syntax-errors
+ */
+
+import { type AstNode, visitAstDFS } from '../../../parsing';
+import { annotateError } from '../../ast-annotations';
+import { type ErrorReporter, type RSErrorDescription } from '../../error';
+import { type TypeClass } from '../../semantic/typification';
+import { TokenID } from '../token';
+
+import { classifyFallbackError, classifyParseError } from './classify';
+import { deduplicateErrors, extractBracketErrors, extractForbiddenCharacterErrors } from './expression-errors';
+import { isIncompleteGeneratorBodyCode } from './incomplete-formal';
+
+/** When set, refines incomplete formal headers (`[α∈…]`, quantifiers). */
+export interface SyntaxErrorOptions {
+  expected?: TypeClass;
+}
+
+/**
+ * Walks a parsed expression AST and reports syntax errors.
+ *
+ * @param ast - Root AST from `buildTree(parser.parse(expression))`
+ * @param expression - Original source text (positions must match the AST)
+ * @param reporter - Called once per deduplicated error
+ * @param annotateErrors - When true, also calls `annotateError` on the triggering node
+ * @param options - Optional typification hint for incomplete formal expressions
+ */
+export function extractSyntaxErrors(
+  ast: AstNode,
+  expression: string,
+  reporter: ErrorReporter,
+  annotateErrors: boolean = false,
+  options?: SyntaxErrorOptions
+) {
+  const forbiddenErrors = extractForbiddenCharacterErrors(expression);
+  if (forbiddenErrors.length > 0) {
+    for (const error of forbiddenErrors) {
+      reporter(error);
+      if (annotateErrors) {
+        annotateError(ast, error.code, error.params);
+      }
+    }
+    return;
+  }
+
+  const collected: RSErrorDescription[] = [];
+  const annotationTargets = new Map<RSErrorDescription, AstNode>();
+  const collect = (error: RSErrorDescription, target?: AstNode) => {
+    collected.push(error);
+    if (target !== undefined) {
+      annotationTargets.set(error, target);
+    }
+  };
+
+  const bracketError = extractBracketErrors(expression);
+  const hasBracketErrors = bracketError !== null;
+  visitAstDFS(ast, node => extractInternal(node, expression, collect, hasBracketErrors, options));
+
+  const hasIncompleteGenerator = collected.some(error => isIncompleteGeneratorBodyCode(error.code));
+  if (bracketError !== null && !hasIncompleteGenerator) {
+    collect(bracketError, ast);
+  }
+
+  for (const error of deduplicateErrors(collected)) {
+    reporter(error);
+    if (annotateErrors) {
+      const target = annotationTargets.get(error);
+      if (target !== undefined) {
+        annotateError(target, error.code, error.params);
+      }
+    }
+  }
+}
+
+function extractInternal(
+  node: AstNode,
+  expression: string,
+  collect: (error: RSErrorDescription, target: AstNode) => void,
+  hasBracketErrors: boolean,
+  options?: SyntaxErrorOptions
+) {
+  if (node.typeID !== TokenID.ERROR) {
+    return;
+  }
+
+  const classified = classifyParseError(node, expression, { hasBracketErrors, expected: options?.expected });
+  if (classified !== null) {
+    collect(classified, node);
+    return;
+  }
+
+  const fallback = classifyFallbackError(node, hasBracketErrors);
+  if (fallback !== null) {
+    collect(fallback.error, fallback.target);
+  }
+}

package/src/rslang/parser/syntax-errors/trailing-slot.ts

@@ -0,0 +1,45 @@
+/**
+ * Reusable pattern: container header is valid, last child is `ERROR`, input ends here.
+ *
+ * @see incomplete-formal.ts — function declarations, quantifiers
+ */
+
+import type { AstNode } from '../../../parsing';
+import { type RSErrorCode, type RSErrorDescription } from '../../error';
+import { TokenID } from '../token';
+
+import { errorAt } from './error-builders';
+
+export function detectTrailingErrorSlot(
+  node: AstNode,
+  expression: string,
+  container: AstNode | null,
+  options: {
+    headerValid?: (container: AstNode) => boolean;
+    code: RSErrorCode | ((container: AstNode, bodyChild: AstNode) => RSErrorCode | null);
+  }
+): RSErrorDescription | null {
+  if (container === null) {
+    return null;
+  }
+
+  const bodyChild = container.children[container.children.length - 1];
+  if (bodyChild?.typeID !== TokenID.ERROR || node !== bodyChild) {
+    return null;
+  }
+
+  if (expression.slice(container.to).trim().length > 0) {
+    return null;
+  }
+
+  if (options.headerValid !== undefined && !options.headerValid(container)) {
+    return null;
+  }
+
+  const code = typeof options.code === 'function' ? options.code(container, bodyChild) : options.code;
+  if (code === null) {
+    return null;
+  }
+
+  return errorAt(bodyChild, code);
+}

package/dist/rslang/parser/syntax-errors.d.ts

@@ -1,14 +0,0 @@
-import { t as AstNode } from "../../ast-C8sIpKdL.js";
-import { g as TypeClass } from "../../typification-Dk-fisgO.js";
-import { t as ErrorReporter } from "../../error-CLnXbkly.js";
-
-//#region src/rslang/parser/syntax-errors.d.ts
-/** Options for syntax error extraction. */
-interface SyntaxErrorOptions {
-  expected?: TypeClass;
-}
-/** Extracts syntax errors from an AST. */
-declare function extractSyntaxErrors(ast: AstNode, expression: string, reporter: ErrorReporter, annotateErrors?: boolean, options?: SyntaxErrorOptions): void;
-//#endregion
-export { SyntaxErrorOptions, extractSyntaxErrors };
-//# sourceMappingURL=syntax-errors.d.ts.map

package/dist/rslang/parser/syntax-errors.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"syntax-errors.js","names":["TypeClassEnum"],"sources":["../../../src/rslang/parser/syntax-errors.ts"],"sourcesContent":["/**\n * Module: Syntactic errors reporting.\n */\n\nimport { type AstNode, visitAstDFS } from '../../parsing';\nimport { annotateError } from '../ast-annotations';\nimport { type ErrorReporter, RSErrorCode, type RSErrorDescription } from '../error';\nimport { type TypeClass, TypeClass as TypeClassEnum } from '../semantic/typification';\n\nimport {\n  Arguments,\n  Declarative,\n  Filter,\n  Function,\n  Function_decl,\n  Imp_blocks,\n  Imperative,\n  Logic_quantor,\n  Predicate,\n  Recursion,\n  Setexpr,\n  Variable,\n  Variable_pack\n} from './parser.terms';\nimport { TokenID } from './token';\n\n/** Options for syntax error extraction. */\nexport interface SyntaxErrorOptions {\n  expected?: TypeClass;\n}\n\n/** Extracts syntax errors from an AST. */\nexport function extractSyntaxErrors(\n  ast: AstNode,\n  expression: string,\n  reporter: ErrorReporter,\n  annotateErrors: boolean = false,\n  options?: SyntaxErrorOptions\n) {\n  const forbiddenErrors = extractForbiddenCharacterErrors(expression);\n  if (forbiddenErrors.length > 0) {\n    for (const error of forbiddenErrors) {\n      reporter(error);\n      if (annotateErrors) {\n        annotateError(ast, error.code, error.params);\n      }\n    }\n    return;\n  }\n\n  const collected: RSErrorDescription[] = [];\n  const annotationTargets = new Map<RSErrorDescription, AstNode>();\n  const collect = (error: RSErrorDescription, target?: AstNode) => {\n    collected.push(error);\n    if (target !== undefined) {\n      annotationTargets.set(error, target);\n    }\n  };\n\n  const bracketError = extractBracketErrors(expression);\n  const hasBracketErrors = bracketError !== null;\n  visitAstDFS(ast, node => extractInternal(node, expression, collect, hasBracketErrors, options));\n\n  const hasIncompleteGenerator = collected.some(error => isIncompleteGeneratorBodyCode(error.code));\n  if (bracketError !== null && !hasIncompleteGenerator) {\n    collect(bracketError, ast);\n  }\n\n  for (const error of deduplicateErrors(collected)) {\n    reporter(error);\n    if (annotateErrors) {\n      const target = annotationTargets.get(error);\n      if (target !== undefined) {\n        annotateError(target, error.code, error.params);\n      }\n    }\n  }\n}\n\n// ====== Internals =========\nfunction extractInternal(\n  node: AstNode,\n  expression: string,\n  collect: (error: RSErrorDescription, target: AstNode) => void,\n  ignoreUnknownErrors: boolean,\n  options?: SyntaxErrorOptions\n) {\n  if (node.typeID !== TokenID.ERROR) {\n    return;\n  }\n\n  function emit(target: AstNode, code: RSErrorCode, params?: readonly string[]) {\n    collect({ code: code, from: target.from, to: target.to, params }, target);\n  }\n\n  const classified = classifyParseError(node, expression, options);\n  if (classified !== null) {\n    collect(classified, node);\n    return;\n  }\n\n  const parent = node.parent;\n  if (parent === null) {\n    if (!ignoreUnknownErrors) {\n      return emit(node, RSErrorCode.unknownSyntax);\n    }\n    return;\n  }\n\n  if (parent.typeID === Variable) {\n    return emit(parent, RSErrorCode.expectedLocal);\n  }\n\n  if (!ignoreUnknownErrors) {\n    emit(node.from === node.to ? parent : node, RSErrorCode.unknownSyntax);\n  }\n}\n\nfunction classifyParseError(\n  node: AstNode,\n  expression: string,\n  options?: SyntaxErrorOptions\n): RSErrorDescription | null {\n  const incompleteFunctionDecl = detectIncompleteFunctionDecl(node, expression, options?.expected);\n  if (incompleteFunctionDecl !== null) {\n    return incompleteFunctionDecl;\n  }\n\n  const incompleteQuantifier = detectIncompleteQuantifier(node, expression);\n  if (incompleteQuantifier !== null) {\n    return incompleteQuantifier;\n  }\n\n  const incompleteGenerator = detectIncompleteGenerator(node, expression);\n  if (incompleteGenerator !== null) {\n    return incompleteGenerator;\n  }\n\n  const filterParen = detectFilterParenMismatch(node, expression);\n  if (filterParen !== null) {\n    return filterParen;\n  }\n\n  return detectGlobalFuncWithoutArgs(node, expression);\n}\n\nfunction detectIncompleteFunctionDecl(\n  node: AstNode,\n  expression: string,\n  expected?: TypeClass\n): RSErrorDescription | null {\n  const funcDecl = findAncestor(node, isFunctionDeclNode);\n  if (funcDecl === null) {\n    return null;\n  }\n\n  const bodyChild = funcDecl.children[funcDecl.children.length - 1];\n  if (bodyChild?.typeID !== TokenID.ERROR || node !== bodyChild) {\n    return null;\n  }\n\n  const argsNode = funcDecl.children.find(child => child.typeID === Arguments || child.typeID === TokenID.NT_ARGUMENTS);\n  if (argsNode === undefined || subtreeHasError(argsNode)) {\n    return null;\n  }\n\n  if (expression.slice(funcDecl.to).trim().length > 0) {\n    return null;\n  }\n\n  return {\n    code: incompleteFormalExpressionCode(expected),\n    from: bodyChild.from,\n    to: bodyChild.to\n  };\n}\n\nfunction incompleteFormalExpressionCode(expected?: TypeClass): RSErrorCode {\n  switch (expected) {\n    case TypeClassEnum.function:\n      return RSErrorCode.expectedExpressionBody;\n    case TypeClassEnum.predicate:\n    case TypeClassEnum.logic:\n      return RSErrorCode.expectedLogicBody;\n    default:\n      return RSErrorCode.expectedFunctionBody;\n  }\n}\n\nfunction detectIncompleteQuantifier(node: AstNode, expression: string): RSErrorDescription | null {\n  const quantNode = findAncestor(node, isQuantifierNode);\n  if (quantNode === null) {\n    return null;\n  }\n\n  const bodyChild = quantNode.children[quantNode.children.length - 1];\n  if (bodyChild?.typeID !== TokenID.ERROR || node !== bodyChild) {\n    return null;\n  }\n\n  const headerChildren = quantNode.children.slice(0, -1);\n  if (headerChildren.length < 3) {\n    return null;\n  }\n\n  const varPack = headerChildren.find(child => child.typeID === Variable_pack || child.typeID === TokenID.NT_ENUM_DECL);\n  if (varPack === undefined || subtreeHasError(varPack)) {\n    return null;\n  }\n\n  const domainChild = headerChildren[headerChildren.length - 1];\n  if (domainChild === varPack || subtreeHasError(domainChild)) {\n    return null;\n  }\n\n  if (expression.slice(quantNode.to).trim().length > 0) {\n    return null;\n  }\n\n  return {\n    code: RSErrorCode.expectedQuantifierBody,\n    from: bodyChild.from,\n    to: bodyChild.to\n  };\n}\n\nfunction detectIncompleteGenerator(node: AstNode, expression: string): RSErrorDescription | null {\n  return (\n    detectIncompleteDeclarative(node, expression) ??\n    detectIncompleteImperative(node, expression) ??\n    detectIncompleteRecursion(node, expression)\n  );\n}\n\nfunction detectIncompleteDeclarative(node: AstNode, expression: string): RSErrorDescription | null {\n  const generatorNode = findAncestor(\n    node,\n    target => target.typeID === Declarative || target.typeID === TokenID.NT_DECLARATIVE_EXPR\n  );\n  return detectIncompleteGeneratorBody(node, expression, generatorNode, RSErrorCode.expectedDeclarativeBody, slot =>\n    isIncompleteDeclarativeBody(slot)\n  );\n}\n\nfunction detectIncompleteImperative(node: AstNode, expression: string): RSErrorDescription | null {\n  const generatorNode = findAncestor(\n    node,\n    target => target.typeID === Imperative || target.typeID === TokenID.NT_IMPERATIVE_EXPR\n  );\n  return detectIncompleteGeneratorBody(node, expression, generatorNode, RSErrorCode.expectedImperativeBody, slot =>\n    isIncompleteImperativeBody(slot, expression)\n  );\n}\n\nfunction detectIncompleteRecursion(node: AstNode, expression: string): RSErrorDescription | null {\n  const generatorNode = findAncestor(node, target => target.typeID === Recursion);\n  return detectIncompleteGeneratorBody(node, expression, generatorNode, RSErrorCode.expectedRecursiveBody, slot =>\n    isIncompleteRecursionBody(slot)\n  );\n}\n\ninterface GeneratorBodySlot {\n  nodes: AstNode[];\n  headerEndIndex: number;\n}\n\nfunction detectIncompleteGeneratorBody(\n  node: AstNode,\n  expression: string,\n  generatorNode: AstNode | null,\n  code: RSErrorCode,\n  isIncomplete: (slot: GeneratorBodySlot) => boolean\n): RSErrorDescription | null {\n  if (generatorNode === null) {\n    return null;\n  }\n\n  if (expression.slice(generatorNode.to).trim().length > 0) {\n    return null;\n  }\n\n  const slot = getGeneratorBodySlot(generatorNode, expression);\n  if (slot === null || !isIncomplete(slot)) {\n    return null;\n  }\n\n  if (!generatorHeaderIsValid(generatorNode, expression, slot.headerEndIndex)) {\n    return null;\n  }\n\n  if (!isErrorInBodySlot(node, slot, generatorNode)) {\n    return null;\n  }\n\n  return incompleteGeneratorError(code, node);\n}\n\nfunction getGeneratorBodySlot(generatorNode: AstNode, expression: string): GeneratorBodySlot | null {\n  if (generatorNode.typeID === Declarative || generatorNode.typeID === TokenID.NT_DECLARATIVE_EXPR) {\n    return getDeclarativeBodySlot(generatorNode, expression);\n  }\n  if (generatorNode.typeID === Imperative || generatorNode.typeID === TokenID.NT_IMPERATIVE_EXPR) {\n    return getImperativeBodySlot(generatorNode, expression);\n  }\n  if (generatorNode.typeID === Recursion) {\n    return getRecursionBodySlot(generatorNode, expression);\n  }\n  return null;\n}\n\nfunction getDeclarativeBodySlot(declNode: AstNode, expression: string): GeneratorBodySlot | null {\n  const pipeIndex = declNode.children.findIndex(child => isPipeToken(child, expression));\n  if (pipeIndex >= 0) {\n    return {\n      nodes: contentChildren(declNode, expression, pipeIndex + 1),\n      headerEndIndex: pipeIndex + 1\n    };\n  }\n\n  const domainNode = findDeclarativeDomain(declNode, expression);\n  if (domainNode === null) {\n    return null;\n  }\n\n  const domainIndex = declNode.children.indexOf(domainNode);\n  return {\n    nodes: contentChildren(declNode, expression, domainIndex + 1),\n    headerEndIndex: domainIndex + 1\n  };\n}\n\nfunction getImperativeBodySlot(impNode: AstNode, expression: string): GeneratorBodySlot | null {\n  const pipeIndex = impNode.children.findIndex(child => isPipeToken(child, expression));\n  if (pipeIndex >= 0) {\n    return {\n      nodes: contentChildren(impNode, expression, pipeIndex + 1),\n      headerEndIndex: pipeIndex + 1\n    };\n  }\n\n  const tupleNode = findImperativeTuple(impNode);\n  if (tupleNode === null) {\n    return null;\n  }\n\n  const tupleIndex = impNode.children.indexOf(tupleNode);\n  return {\n    nodes: contentChildren(impNode, expression, tupleIndex + 1),\n    headerEndIndex: tupleIndex + 1\n  };\n}\n\nfunction getRecursionBodySlot(recNode: AstNode, expression: string): GeneratorBodySlot | null {\n  const initNode = findRecursionInit(recNode, expression);\n  if (initNode === null) {\n    return null;\n  }\n\n  const initIndex = recNode.children.indexOf(initNode);\n  const afterInit = contentChildren(recNode, expression, initIndex + 1);\n  const lastPipeIndex = findLastPipeIndex(afterInit, expression);\n  if (lastPipeIndex < 0) {\n    return {\n      nodes: afterInit,\n      headerEndIndex: initIndex + 1\n    };\n  }\n\n  return {\n    nodes: afterInit.slice(lastPipeIndex + 1),\n    headerEndIndex: recNode.children.indexOf(afterInit[lastPipeIndex]) + 1\n  };\n}\n\nfunction contentChildren(generatorNode: AstNode, expression: string, fromIndex: number): AstNode[] {\n  return generatorNode.children.slice(fromIndex).filter(child => !isClosingBrace(child, expression));\n}\n\nfunction findDeclarativeDomain(declNode: AstNode, expression: string): AstNode | null {\n  const inIndex = declNode.children.findIndex(child => expression.slice(child.from, child.to) === '∈');\n  if (inIndex < 0) {\n    return null;\n  }\n\n  for (let index = inIndex + 1; index < declNode.children.length; index++) {\n    const child = declNode.children[index];\n    if (isPipeToken(child, expression) || isClosingBrace(child, expression)) {\n      break;\n    }\n    if (child.typeID === Setexpr) {\n      return child;\n    }\n  }\n\n  return null;\n}\n\nfunction findImperativeTuple(impNode: AstNode): AstNode | null {\n  for (const child of impNode.children) {\n    if (child.typeID === Setexpr) {\n      return child;\n    }\n  }\n  return null;\n}\n\nfunction findLastPipeIndex(nodes: AstNode[], expression: string): number {\n  for (let index = nodes.length - 1; index >= 0; index--) {\n    if (isPipeToken(nodes[index], expression)) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nfunction generatorHeaderIsValid(generatorNode: AstNode, expression: string, headerEndIndex: number): boolean {\n  for (let index = 0; index < headerEndIndex; index++) {\n    const child = generatorNode.children[index];\n    if (child.typeID === TokenID.ERROR) {\n      return false;\n    }\n    if (isStructuralGeneratorToken(child, expression)) {\n      continue;\n    }\n    if (subtreeHasError(child)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nfunction isIncompleteDeclarativeBody(slot: GeneratorBodySlot): boolean {\n  return isEmptyOrErrorOnlyBody(slot.nodes);\n}\n\nfunction isIncompleteImperativeBody(slot: GeneratorBodySlot, expression: string): boolean {\n  if (slot.nodes.length === 0) {\n    return true;\n  }\n  if (slot.nodes.length === 1 && slot.nodes[0].typeID === Imp_blocks) {\n    return isImpBlocksIncomplete(slot.nodes[0], expression);\n  }\n  return isEmptyOrErrorOnlyBody(slot.nodes);\n}\n\nfunction isIncompleteRecursionBody(slot: GeneratorBodySlot): boolean {\n  return isEmptyOrErrorOnlyBody(slot.nodes);\n}\n\nfunction isEmptyOrErrorOnlyBody(nodes: AstNode[]): boolean {\n  if (nodes.length === 0) {\n    return true;\n  }\n  if (nodes.length === 1) {\n    return isErrorPlaceholder(nodes[0]);\n  }\n  return false;\n}\n\nfunction isImpBlocksIncomplete(blocksNode: AstNode, expression: string): boolean {\n  if (blocksNode.children.length === 0) {\n    return true;\n  }\n\n  const lastChild = blocksNode.children[blocksNode.children.length - 1];\n  if (lastChild.typeID === TokenID.ERROR) {\n    return true;\n  }\n  if (isSemicolonToken(lastChild, expression)) {\n    return true;\n  }\n  if (lastChild.typeID === Setexpr && isErrorPlaceholder(lastChild)) {\n    return true;\n  }\n\n  return false;\n}\n\nfunction isErrorInBodySlot(errorNode: AstNode, slot: GeneratorBodySlot, generatorNode: AstNode): boolean {\n  if (slot.nodes.length === 0) {\n    const bodyStart = generatorNode.children[slot.headerEndIndex]?.from ?? generatorNode.from;\n    return errorNode.from >= bodyStart;\n  }\n\n  for (const bodyNode of slot.nodes) {\n    if (errorNode === bodyNode || isDescendantOf(bodyNode, errorNode)) {\n      if (isErrorPlaceholder(bodyNode)) {\n        return true;\n      }\n      if (bodyNode.typeID === Imp_blocks && isImpBlocksTailError(bodyNode, errorNode)) {\n        return true;\n      }\n    }\n  }\n\n  return false;\n}\n\nfunction isImpBlocksTailError(blocksNode: AstNode, errorNode: AstNode): boolean {\n  const lastChild = blocksNode.children[blocksNode.children.length - 1];\n  return lastChild.typeID === TokenID.ERROR && (errorNode === lastChild || isDescendantOf(lastChild, errorNode));\n}\n\nfunction isErrorPlaceholder(node: AstNode): boolean {\n  if (node.typeID === TokenID.ERROR) {\n    return true;\n  }\n  if (node.children.length === 0) {\n    return false;\n  }\n  return node.children.every(child => isErrorPlaceholder(child));\n}\n\nfunction isDescendantOf(ancestor: AstNode, node: AstNode): boolean {\n  let current: AstNode | null = node.parent;\n  while (current !== null) {\n    if (current === ancestor) {\n      return true;\n    }\n    current = current.parent;\n  }\n  return false;\n}\n\nfunction findRecursionInit(recursionNode: AstNode, expression: string): AstNode | null {\n  const assignIndex = recursionNode.children.findIndex(child => expression.slice(child.from, child.to) === ':=');\n  if (assignIndex < 0) {\n    return null;\n  }\n\n  for (let index = assignIndex + 1; index < recursionNode.children.length; index++) {\n    const child = recursionNode.children[index];\n    if (child.typeID === TokenID.ERROR) {\n      break;\n    }\n    if (isPipeToken(child, expression) || isClosingBrace(child, expression)) {\n      continue;\n    }\n    return child;\n  }\n\n  return null;\n}\n\nfunction incompleteGeneratorError(code: RSErrorCode, errorNode: AstNode): RSErrorDescription {\n  return {\n    code,\n    from: errorNode.from,\n    to: errorNode.to\n  };\n}\n\nfunction isIncompleteGeneratorBodyCode(code: RSErrorCode): boolean {\n  return (\n    code === RSErrorCode.expectedDeclarativeBody ||\n    code === RSErrorCode.expectedImperativeBody ||\n    code === RSErrorCode.expectedRecursiveBody\n  );\n}\n\nfunction isPipeToken(node: AstNode, expression: string): boolean {\n  return expression.slice(node.from, node.to) === '|';\n}\n\nfunction isSemicolonToken(node: AstNode, expression: string): boolean {\n  return expression.slice(node.from, node.to) === ';';\n}\n\nfunction isClosingBrace(node: AstNode, expression: string): boolean {\n  return node.typeID !== TokenID.ERROR && expression.slice(node.from, node.to) === '}';\n}\n\nfunction isStructuralGeneratorToken(node: AstNode, expression: string): boolean {\n  const text = expression.slice(node.from, node.to);\n  return text === '{' || text === '}' || text === '|' || text === '∈' || text === ':=' || text === ';';\n}\n\nfunction subtreeHasError(node: AstNode): boolean {\n  if (node.typeID === TokenID.ERROR) {\n    return true;\n  }\n  return node.children.some(subtreeHasError);\n}\n\nfunction detectFilterParenMismatch(node: AstNode, expression: string): RSErrorDescription | null {\n  const filterNode = findAncestor(node, isFilterNode) ?? findRelatedNode(node, isFilterNode);\n  if (filterNode === null) {\n    return null;\n  }\n\n  const nextChar = expression[filterNode.to];\n  if (nextChar === '(') {\n    return {\n      code: RSErrorCode.invalidFilterSyntax,\n      from: filterNode.from,\n      to: filterNode.to + 1\n    };\n  }\n  return null;\n}\n\nfunction detectGlobalFuncWithoutArgs(node: AstNode, expression: string): RSErrorDescription | null {\n  const funcNode =\n    findAncestor(node, n => isFunctionNode(n) || isPredicateNode(n)) ??\n    findRelatedNode(node, n => isFunctionNode(n) || isPredicateNode(n));\n  if (funcNode === null) {\n    return null;\n  }\n  return classifyFuncWithoutArgs(funcNode, expression);\n}\n\nfunction findRelatedNode(node: AstNode, predicate: (target: AstNode) => boolean): AstNode | null {\n  let current: AstNode | null = node.parent;\n  while (current !== null) {\n    for (const child of current.children) {\n      if (predicate(child)) {\n        return child;\n      }\n    }\n    current = current.parent;\n  }\n  return null;\n}\n\nfunction classifyFuncWithoutArgs(funcNode: AstNode, expression: string): RSErrorDescription | null {\n  const name = expression.slice(funcNode.from, funcNode.to);\n  const rest = expression.slice(funcNode.to);\n\n  const withoutArgs: RSErrorDescription = {\n    code: RSErrorCode.globalFuncWithoutArgs,\n    from: funcNode.from,\n    to: funcNode.to,\n    params: [name]\n  };\n\n  // Function with nothing (or only whitespace) after it is genuinely called without arguments.\n  if (/^\\s*$/.test(rest)) {\n    return withoutArgs;\n  }\n\n  // Anything other than a bracketed argument form (e.g. parentheses or braces) is malformed call\n  // syntax: defer to the bracket/syntax error handling instead of reporting a missing-arguments error.\n  const openBracket = /^\\s*\\[/.exec(rest);\n  if (openBracket === null) {\n    return null;\n  }\n\n  const closeIdx = findMatchingCloseBracket(rest, openBracket[0].length - 1);\n  if (closeIdx >= 0) {\n    const inner = rest.slice(openBracket[0].length, closeIdx).trim();\n    if (inner.length === 0) {\n      return withoutArgs;\n    }\n  }\n\n  return null;\n}\n\nfunction findAncestor(node: AstNode, predicate: (node: AstNode) => boolean): AstNode | null {\n  let current: AstNode | null = node;\n  while (current !== null) {\n    if (predicate(current)) {\n      return current;\n    }\n    current = current.parent;\n  }\n  return null;\n}\n\nfunction isFunctionDeclNode(node: AstNode): boolean {\n  return node.typeID === Function_decl || node.typeID === TokenID.NT_FUNC_DEFINITION;\n}\n\nfunction isQuantifierNode(node: AstNode): boolean {\n  return node.typeID === Logic_quantor;\n}\n\nfunction isFunctionNode(node: AstNode): boolean {\n  return node.typeID === Function || node.typeID === TokenID.ID_FUNCTION;\n}\n\nfunction isPredicateNode(node: AstNode): boolean {\n  return node.typeID === Predicate || node.typeID === TokenID.ID_PREDICATE;\n}\n\nfunction isFilterNode(node: AstNode): boolean {\n  return node.typeID === Filter || node.typeID === TokenID.FILTER;\n}\n\nfunction findMatchingCloseBracket(expression: string, openPos: number): number {\n  const open = expression[openPos];\n  if (open !== '[') {\n    return -1;\n  }\n\n  let depth = 0;\n  for (let index = openPos; index < expression.length; index++) {\n    const symbol = expression[index];\n    if (symbol === '[') {\n      depth++;\n    } else if (symbol === ']') {\n      depth--;\n      if (depth === 0) {\n        return index;\n      }\n    }\n  }\n  return -1;\n}\n\nfunction deduplicateErrors(errors: RSErrorDescription[]): RSErrorDescription[] {\n  const result: RSErrorDescription[] = [];\n\n  for (const error of errors) {\n    const duplicate = result.some(\n      existing => existing.code === error.code && existing.from === error.from && existing.to === error.to\n    );\n    if (duplicate) {\n      continue;\n    }\n\n    if (error.code !== RSErrorCode.unknownSyntax) {\n      for (let index = result.length - 1; index >= 0; index--) {\n        if (result[index].code === RSErrorCode.unknownSyntax && rangesOverlap(error, result[index])) {\n          result.splice(index, 1);\n        }\n      }\n    }\n\n    result.push(error);\n  }\n\n  const specific = result.filter(error => error.code !== RSErrorCode.unknownSyntax);\n  return result.filter(\n    error => error.code !== RSErrorCode.unknownSyntax || !specific.some(item => rangesOverlap(error, item))\n  );\n}\n\nfunction rangesOverlap(a: RSErrorDescription, b: RSErrorDescription): boolean {\n  return a.from < b.to && b.from < a.to;\n}\n\ntype OpenBracket = '(' | '[' | '{';\ntype CloseBracket = ')' | ']' | '}';\n\ninterface BracketFrame {\n  bracket: OpenBracket;\n  index: number;\n}\n\nconst ALLOWED_EXPRESSION_CHARS = buildAllowedExpressionChars();\n\nfunction buildAllowedExpressionChars(): Set<string> {\n  const chars = new Set<string>();\n  for (const chunk of [\n    '0123456789',\n    'abcdefghijklmnopqrstuvwxyz',\n    'ABCDEFGHIJKLMNOPQRSTUVWXYZ',\n    '_',\n    '∅¬∀∃⇔⇒∨&ℬ+-*∪\\\\∆∩×∈∉⊆⊄⊂<>≥≤≠=,:;|[]{}()'\n  ]) {\n    for (const symbol of chunk) {\n      chars.add(symbol);\n    }\n  }\n  for (let codePoint = 0x03b1; codePoint <= 0x03c9; codePoint++) {\n    chars.add(String.fromCodePoint(codePoint));\n  }\n  return chars;\n}\n\nfunction isAllowedExpressionChar(symbol: string): boolean {\n  return /\\s/u.test(symbol) || ALLOWED_EXPRESSION_CHARS.has(symbol);\n}\n\nfunction extractForbiddenCharacterErrors(expression: string): RSErrorDescription[] {\n  const errors: RSErrorDescription[] = [];\n  let pos = 0;\n\n  while (pos < expression.length) {\n    const symbol = expression[pos];\n    if (isAllowedExpressionChar(symbol)) {\n      pos++;\n      continue;\n    }\n\n    const start = pos;\n    while (pos < expression.length && !isAllowedExpressionChar(expression[pos])) {\n      pos++;\n    }\n\n    errors.push({\n      code: RSErrorCode.forbiddenCharacter,\n      from: start,\n      to: pos,\n      params: [expression.slice(start, pos)]\n    });\n  }\n\n  return errors;\n}\n\nfunction extractBracketErrors(expression: string): RSErrorDescription | null {\n  const stack: BracketFrame[] = [];\n\n  for (let pos = 0; pos < expression.length; pos++) {\n    const symbol = expression[pos];\n    if (isOpenBracket(symbol)) {\n      if (isDoubleParenthesis(expression, pos)) {\n        return {\n          code: RSErrorCode.doubleParenthesis,\n          from: pos,\n          to: pos + 2\n        };\n      }\n      stack.push({ bracket: symbol, index: pos });\n      continue;\n    }\n    if (!isCloseBracket(symbol)) {\n      continue;\n    }\n\n    const expectedOpen = closeToOpen(symbol);\n    const top = stack[stack.length - 1];\n    if (top === undefined) {\n      return {\n        code: RSErrorCode.missingOpenBracket,\n        from: pos,\n        to: pos + 1,\n        params: [symbol]\n      };\n    }\n\n    if (top.bracket !== expectedOpen) {\n      return {\n        code: RSErrorCode.bracketMismatch,\n        from: pos,\n        to: pos + 1,\n        params: [openToClose(top.bracket), symbol]\n      };\n    }\n\n    stack.pop();\n  }\n\n  if (stack.length > 0) {\n    const unclosed = stack[0];\n    return {\n      code: RSErrorCode.missingCloseBracket,\n      from: unclosed.index,\n      to: unclosed.index + 1,\n      params: [unclosed.bracket]\n    };\n  }\n\n  return null;\n}\n\nfunction isOpenBracket(symbol: string): symbol is OpenBracket {\n  return symbol === '(' || symbol === '[' || symbol === '{';\n}\n\nfunction isCloseBracket(symbol: string): symbol is CloseBracket {\n  return symbol === ')' || symbol === ']' || symbol === '}';\n}\n\nfunction openToClose(symbol: OpenBracket): CloseBracket {\n  switch (symbol) {\n    case '(':\n      return ')';\n    case '[':\n      return ']';\n    case '{':\n      return '}';\n  }\n}\n\nfunction closeToOpen(symbol: CloseBracket): OpenBracket {\n  switch (symbol) {\n    case ')':\n      return '(';\n    case ']':\n      return '[';\n    case '}':\n      return '{';\n  }\n}\n\nfunction isDoubleParenthesis(expression: string, pos: number): boolean {\n  const isOpenDoubleParenthesis = expression[pos] === '(' && expression[pos + 1] === '(';\n  if (!isOpenDoubleParenthesis) {\n    return false;\n  }\n\n  const outerClose = findMatchingCloseParen(expression, pos);\n  const innerClose = findMatchingCloseParen(expression, pos + 1);\n  if (outerClose < 0 || innerClose < 0) {\n    return false;\n  }\n\n  return outerClose === innerClose + 1;\n}\n\nfunction findMatchingCloseParen(expression: string, openPos: number): number {\n  if (expression[openPos] !== '(') {\n    return -1;\n  }\n\n  const stack: OpenBracket[] = [];\n  for (let index = openPos; index < expression.length; index++) {\n    const symbol = expression[index];\n    if (isOpenBracket(symbol)) {\n      stack.push(symbol);\n      continue;\n    }\n    if (!isCloseBracket(symbol)) {\n      continue;\n    }\n    const top = stack.pop();\n    if (top === undefined || top !== closeToOpen(symbol)) {\n      return -1;\n    }\n    if (stack.length === 0) {\n      return index;\n    }\n  }\n\n  return -1;\n}\n"],"mappings":";;;;;;;;;;;;AAgCA,SAAgB,oBACd,KACA,YACA,UACA,iBAA0B,OAC1B,SACA;CACA,MAAM,kBAAkB,gCAAgC,UAAU;CAClE,IAAI,gBAAgB,SAAS,GAAG;EAC9B,KAAK,MAAM,SAAS,iBAAiB;GACnC,SAAS,KAAK;GACd,IAAI,gBACF,cAAc,KAAK,MAAM,MAAM,MAAM,MAAM;EAE/C;EACA;CACF;CAEA,MAAM,YAAkC,CAAC;CACzC,MAAM,oCAAoB,IAAI,IAAiC;CAC/D,MAAM,WAAW,OAA2B,WAAqB;EAC/D,UAAU,KAAK,KAAK;EACpB,IAAI,WAAW,QACb,kBAAkB,IAAI,OAAO,MAAM;CAEvC;CAEA,MAAM,eAAe,qBAAqB,UAAU;CACpD,MAAM,mBAAmB,iBAAiB;CAC1C,YAAY,MAAK,SAAQ,gBAAgB,MAAM,YAAY,SAAS,kBAAkB,OAAO,CAAC;CAE9F,MAAM,yBAAyB,UAAU,MAAK,UAAS,8BAA8B,MAAM,IAAI,CAAC;CAChG,IAAI,iBAAiB,QAAQ,CAAC,wBAC5B,QAAQ,cAAc,GAAG;CAG3B,KAAK,MAAM,SAAS,kBAAkB,SAAS,GAAG;EAChD,SAAS,KAAK;EACd,IAAI,gBAAgB;GAClB,MAAM,SAAS,kBAAkB,IAAI,KAAK;GAC1C,IAAI,WAAW,QACb,cAAc,QAAQ,MAAM,MAAM,MAAM,MAAM;EAElD;CACF;AACF;AAGA,SAAS,gBACP,MACA,YACA,SACA,qBACA,SACA;CACA,IAAI,KAAK,WAAW,QAAQ,OAC1B;CAGF,SAAS,KAAK,QAAiB,MAAmB,QAA4B;EAC5E,QAAQ;GAAQ;GAAM,MAAM,OAAO;GAAM,IAAI,OAAO;GAAI;EAAO,GAAG,MAAM;CAC1E;CAEA,MAAM,aAAa,mBAAmB,MAAM,YAAY,OAAO;CAC/D,IAAI,eAAe,MAAM;EACvB,QAAQ,YAAY,IAAI;EACxB;CACF;CAEA,MAAM,SAAS,KAAK;CACpB,IAAI,WAAW,MAAM;EACnB,IAAI,CAAC,qBACH,OAAO,KAAK,MAAM,YAAY,aAAa;EAE7C;CACF;CAEA,IAAI,OAAO,WAAA,GACT,OAAO,KAAK,QAAQ,YAAY,aAAa;CAG/C,IAAI,CAAC,qBACH,KAAK,KAAK,SAAS,KAAK,KAAK,SAAS,MAAM,YAAY,aAAa;AAEzE;AAEA,SAAS,mBACP,MACA,YACA,SAC2B;CAC3B,MAAM,yBAAyB,6BAA6B,MAAM,YAAY,SAAS,QAAQ;CAC/F,IAAI,2BAA2B,MAC7B,OAAO;CAGT,MAAM,uBAAuB,2BAA2B,MAAM,UAAU;CACxE,IAAI,yBAAyB,MAC3B,OAAO;CAGT,MAAM,sBAAsB,0BAA0B,MAAM,UAAU;CACtE,IAAI,wBAAwB,MAC1B,OAAO;CAGT,MAAM,cAAc,0BAA0B,MAAM,UAAU;CAC9D,IAAI,gBAAgB,MAClB,OAAO;CAGT,OAAO,4BAA4B,MAAM,UAAU;AACrD;AAEA,SAAS,6BACP,MACA,YACA,UAC2B;CAC3B,MAAM,WAAW,aAAa,MAAM,kBAAkB;CACtD,IAAI,aAAa,MACf,OAAO;CAGT,MAAM,YAAY,SAAS,SAAS,SAAS,SAAS,SAAS;CAC/D,IAAI,WAAW,WAAW,QAAQ,SAAS,SAAS,WAClD,OAAO;CAGT,MAAM,WAAW,SAAS,SAAS,MAAK,UAAS,MAAM,WAAA,MAAwB,MAAM,WAAW,QAAQ,YAAY;CACpH,IAAI,aAAa,UAAa,gBAAgB,QAAQ,GACpD,OAAO;CAGT,IAAI,WAAW,MAAM,SAAS,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,SAAS,GAChD,OAAO;CAGT,OAAO;EACL,MAAM,+BAA+B,QAAQ;EAC7C,MAAM,UAAU;EAChB,IAAI,UAAU;CAChB;AACF;AAEA,SAAS,+BAA+B,UAAmC;CACzE,QAAQ,UAAR;EACE,KAAKA,UAAc,UACjB,OAAO,YAAY;EACrB,KAAKA,UAAc;EACnB,KAAKA,UAAc,OACjB,OAAO,YAAY;EACrB,SACE,OAAO,YAAY;CACvB;AACF;AAEA,SAAS,2BAA2B,MAAe,YAA+C;CAChG,MAAM,YAAY,aAAa,MAAM,gBAAgB;CACrD,IAAI,cAAc,MAChB,OAAO;CAGT,MAAM,YAAY,UAAU,SAAS,UAAU,SAAS,SAAS;CACjE,IAAI,WAAW,WAAW,QAAQ,SAAS,SAAS,WAClD,OAAO;CAGT,MAAM,iBAAiB,UAAU,SAAS,MAAM,GAAG,EAAE;CACrD,IAAI,eAAe,SAAS,GAC1B,OAAO;CAGT,MAAM,UAAU,eAAe,MAAK,UAAS,MAAM,WAAA,MAA4B,MAAM,WAAW,QAAQ,YAAY;CACpH,IAAI,YAAY,UAAa,gBAAgB,OAAO,GAClD,OAAO;CAGT,MAAM,cAAc,eAAe,eAAe,SAAS;CAC3D,IAAI,gBAAgB,WAAW,gBAAgB,WAAW,GACxD,OAAO;CAGT,IAAI,WAAW,MAAM,UAAU,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,SAAS,GACjD,OAAO;CAGT,OAAO;EACL,MAAM,YAAY;EAClB,MAAM,UAAU;EAChB,IAAI,UAAU;CAChB;AACF;AAEA,SAAS,0BAA0B,MAAe,YAA+C;CAC/F,OACE,4BAA4B,MAAM,UAAU,KAC5C,2BAA2B,MAAM,UAAU,KAC3C,0BAA0B,MAAM,UAAU;AAE9C;AAEA,SAAS,4BAA4B,MAAe,YAA+C;CAKjG,OAAO,8BAA8B,MAAM,YAJrB,aACpB,OACA,WAAU,OAAO,WAAA,MAA0B,OAAO,WAAW,QAAQ,mBAEhB,GAAe,YAAY,0BAAyB,SACzG,4BAA4B,IAAI,CAClC;AACF;AAEA,SAAS,2BAA2B,MAAe,YAA+C;CAKhG,OAAO,8BAA8B,MAAM,YAJrB,aACpB,OACA,WAAU,OAAO,WAAA,MAAyB,OAAO,WAAW,QAAQ,kBAEf,GAAe,YAAY,yBAAwB,SACxG,2BAA2B,MAAM,UAAU,CAC7C;AACF;AAEA,SAAS,0BAA0B,MAAe,YAA+C;CAE/F,OAAO,8BAA8B,MAAM,YADrB,aAAa,OAAM,WAAU,OAAO,WAAA,EACH,GAAe,YAAY,wBAAuB,SACvG,0BAA0B,IAAI,CAChC;AACF;AAOA,SAAS,8BACP,MACA,YACA,eACA,MACA,cAC2B;CAC3B,IAAI,kBAAkB,MACpB,OAAO;CAGT,IAAI,WAAW,MAAM,cAAc,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,SAAS,GACrD,OAAO;CAGT,MAAM,OAAO,qBAAqB,eAAe,UAAU;CAC3D,IAAI,SAAS,QAAQ,CAAC,aAAa,IAAI,GACrC,OAAO;CAGT,IAAI,CAAC,uBAAuB,eAAe,YAAY,KAAK,cAAc,GACxE,OAAO;CAGT,IAAI,CAAC,kBAAkB,MAAM,MAAM,aAAa,GAC9C,OAAO;CAGT,OAAO,yBAAyB,MAAM,IAAI;AAC5C;AAEA,SAAS,qBAAqB,eAAwB,YAA8C;CAClG,IAAI,cAAc,WAAA,MAA0B,cAAc,WAAW,QAAQ,qBAC3E,OAAO,uBAAuB,eAAe,UAAU;CAEzD,IAAI,cAAc,WAAA,MAAyB,cAAc,WAAW,QAAQ,oBAC1E,OAAO,sBAAsB,eAAe,UAAU;CAExD,IAAI,cAAc,WAAA,IAChB,OAAO,qBAAqB,eAAe,UAAU;CAEvD,OAAO;AACT;AAEA,SAAS,uBAAuB,UAAmB,YAA8C;CAC/F,MAAM,YAAY,SAAS,SAAS,WAAU,UAAS,YAAY,OAAO,UAAU,CAAC;CACrF,IAAI,aAAa,GACf,OAAO;EACL,OAAO,gBAAgB,UAAU,YAAY,YAAY,CAAC;EAC1D,gBAAgB,YAAY;CAC9B;CAGF,MAAM,aAAa,sBAAsB,UAAU,UAAU;CAC7D,IAAI,eAAe,MACjB,OAAO;CAGT,MAAM,cAAc,SAAS,SAAS,QAAQ,UAAU;CACxD,OAAO;EACL,OAAO,gBAAgB,UAAU,YAAY,cAAc,CAAC;EAC5D,gBAAgB,cAAc;CAChC;AACF;AAEA,SAAS,sBAAsB,SAAkB,YAA8C;CAC7F,MAAM,YAAY,QAAQ,SAAS,WAAU,UAAS,YAAY,OAAO,UAAU,CAAC;CACpF,IAAI,aAAa,GACf,OAAO;EACL,OAAO,gBAAgB,SAAS,YAAY,YAAY,CAAC;EACzD,gBAAgB,YAAY;CAC9B;CAGF,MAAM,YAAY,oBAAoB,OAAO;CAC7C,IAAI,cAAc,MAChB,OAAO;CAGT,MAAM,aAAa,QAAQ,SAAS,QAAQ,SAAS;CACrD,OAAO;EACL,OAAO,gBAAgB,SAAS,YAAY,aAAa,CAAC;EAC1D,gBAAgB,aAAa;CAC/B;AACF;AAEA,SAAS,qBAAqB,SAAkB,YAA8C;CAC5F,MAAM,WAAW,kBAAkB,SAAS,UAAU;CACtD,IAAI,aAAa,MACf,OAAO;CAGT,MAAM,YAAY,QAAQ,SAAS,QAAQ,QAAQ;CACnD,MAAM,YAAY,gBAAgB,SAAS,YAAY,YAAY,CAAC;CACpE,MAAM,gBAAgB,kBAAkB,WAAW,UAAU;CAC7D,IAAI,gBAAgB,GAClB,OAAO;EACL,OAAO;EACP,gBAAgB,YAAY;CAC9B;CAGF,OAAO;EACL,OAAO,UAAU,MAAM,gBAAgB,CAAC;EACxC,gBAAgB,QAAQ,SAAS,QAAQ,UAAU,cAAc,IAAI;CACvE;AACF;AAEA,SAAS,gBAAgB,eAAwB,YAAoB,WAA8B;CACjG,OAAO,cAAc,SAAS,MAAM,SAAS,CAAC,CAAC,QAAO,UAAS,CAAC,eAAe,OAAO,UAAU,CAAC;AACnG;AAEA,SAAS,sBAAsB,UAAmB,YAAoC;CACpF,MAAM,UAAU,SAAS,SAAS,WAAU,UAAS,WAAW,MAAM,MAAM,MAAM,MAAM,EAAE,MAAM,GAAG;CACnG,IAAI,UAAU,GACZ,OAAO;CAGT,KAAK,IAAI,QAAQ,UAAU,GAAG,QAAQ,SAAS,SAAS,QAAQ,SAAS;EACvE,MAAM,QAAQ,SAAS,SAAS;EAChC,IAAI,YAAY,OAAO,UAAU,KAAK,eAAe,OAAO,UAAU,GACpE;EAEF,IAAI,MAAM,WAAA,IACR,OAAO;CAEX;CAEA,OAAO;AACT;AAEA,SAAS,oBAAoB,SAAkC;CAC7D,KAAK,MAAM,SAAS,QAAQ,UAC1B,IAAI,MAAM,WAAA,IACR,OAAO;CAGX,OAAO;AACT;AAEA,SAAS,kBAAkB,OAAkB,YAA4B;CACvE,KAAK,IAAI,QAAQ,MAAM,SAAS,GAAG,SAAS,GAAG,SAC7C,IAAI,YAAY,MAAM,QAAQ,UAAU,GACtC,OAAO;CAGX,OAAO;AACT;AAEA,SAAS,uBAAuB,eAAwB,YAAoB,gBAAiC;CAC3G,KAAK,IAAI,QAAQ,GAAG,QAAQ,gBAAgB,SAAS;EACnD,MAAM,QAAQ,cAAc,SAAS;EACrC,IAAI,MAAM,WAAW,QAAQ,OAC3B,OAAO;EAET,IAAI,2BAA2B,OAAO,UAAU,GAC9C;EAEF,IAAI,gBAAgB,KAAK,GACvB,OAAO;CAEX;CACA,OAAO;AACT;AAEA,SAAS,4BAA4B,MAAkC;CACrE,OAAO,uBAAuB,KAAK,KAAK;AAC1C;AAEA,SAAS,2BAA2B,MAAyB,YAA6B;CACxF,IAAI,KAAK,MAAM,WAAW,GACxB,OAAO;CAET,IAAI,KAAK,MAAM,WAAW,KAAK,KAAK,MAAM,EAAE,CAAC,WAAA,IAC3C,OAAO,sBAAsB,KAAK,MAAM,IAAI,UAAU;CAExD,OAAO,uBAAuB,KAAK,KAAK;AAC1C;AAEA,SAAS,0BAA0B,MAAkC;CACnE,OAAO,uBAAuB,KAAK,KAAK;AAC1C;AAEA,SAAS,uBAAuB,OAA2B;CACzD,IAAI,MAAM,WAAW,GACnB,OAAO;CAET,IAAI,MAAM,WAAW,GACnB,OAAO,mBAAmB,MAAM,EAAE;CAEpC,OAAO;AACT;AAEA,SAAS,sBAAsB,YAAqB,YAA6B;CAC/E,IAAI,WAAW,SAAS,WAAW,GACjC,OAAO;CAGT,MAAM,YAAY,WAAW,SAAS,WAAW,SAAS,SAAS;CACnE,IAAI,UAAU,WAAW,QAAQ,OAC/B,OAAO;CAET,IAAI,iBAAiB,WAAW,UAAU,GACxC,OAAO;CAET,IAAI,UAAU,WAAA,MAAsB,mBAAmB,SAAS,GAC9D,OAAO;CAGT,OAAO;AACT;AAEA,SAAS,kBAAkB,WAAoB,MAAyB,eAAiC;CACvG,IAAI,KAAK,MAAM,WAAW,GAAG;EAC3B,MAAM,YAAY,cAAc,SAAS,KAAK,eAAe,EAAE,QAAQ,cAAc;EACrF,OAAO,UAAU,QAAQ;CAC3B;CAEA,KAAK,MAAM,YAAY,KAAK,OAC1B,IAAI,cAAc,YAAY,eAAe,UAAU,SAAS,GAAG;EACjE,IAAI,mBAAmB,QAAQ,GAC7B,OAAO;EAET,IAAI,SAAS,WAAA,MAAyB,qBAAqB,UAAU,SAAS,GAC5E,OAAO;CAEX;CAGF,OAAO;AACT;AAEA,SAAS,qBAAqB,YAAqB,WAA6B;CAC9E,MAAM,YAAY,WAAW,SAAS,WAAW,SAAS,SAAS;CACnE,OAAO,UAAU,WAAW,QAAQ,UAAU,cAAc,aAAa,eAAe,WAAW,SAAS;AAC9G;AAEA,SAAS,mBAAmB,MAAwB;CAClD,IAAI,KAAK,WAAW,QAAQ,OAC1B,OAAO;CAET,IAAI,KAAK,SAAS,WAAW,GAC3B,OAAO;CAET,OAAO,KAAK,SAAS,OAAM,UAAS,mBAAmB,KAAK,CAAC;AAC/D;AAEA,SAAS,eAAe,UAAmB,MAAwB;CACjE,IAAI,UAA0B,KAAK;CACnC,OAAO,YAAY,MAAM;EACvB,IAAI,YAAY,UACd,OAAO;EAET,UAAU,QAAQ;CACpB;CACA,OAAO;AACT;AAEA,SAAS,kBAAkB,eAAwB,YAAoC;CACrF,MAAM,cAAc,cAAc,SAAS,WAAU,UAAS,WAAW,MAAM,MAAM,MAAM,MAAM,EAAE,MAAM,IAAI;CAC7G,IAAI,cAAc,GAChB,OAAO;CAGT,KAAK,IAAI,QAAQ,cAAc,GAAG,QAAQ,cAAc,SAAS,QAAQ,SAAS;EAChF,MAAM,QAAQ,cAAc,SAAS;EACrC,IAAI,MAAM,WAAW,QAAQ,OAC3B;EAEF,IAAI,YAAY,OAAO,UAAU,KAAK,eAAe,OAAO,UAAU,GACpE;EAEF,OAAO;CACT;CAEA,OAAO;AACT;AAEA,SAAS,yBAAyB,MAAmB,WAAwC;CAC3F,OAAO;EACL;EACA,MAAM,UAAU;EAChB,IAAI,UAAU;CAChB;AACF;AAEA,SAAS,8BAA8B,MAA4B;CACjE,OACE,SAAS,YAAY,2BACrB,SAAS,YAAY,0BACrB,SAAS,YAAY;AAEzB;AAEA,SAAS,YAAY,MAAe,YAA6B;CAC/D,OAAO,WAAW,MAAM,KAAK,MAAM,KAAK,EAAE,MAAM;AAClD;AAEA,SAAS,iBAAiB,MAAe,YAA6B;CACpE,OAAO,WAAW,MAAM,KAAK,MAAM,KAAK,EAAE,MAAM;AAClD;AAEA,SAAS,eAAe,MAAe,YAA6B;CAClE,OAAO,KAAK,WAAW,QAAQ,SAAS,WAAW,MAAM,KAAK,MAAM,KAAK,EAAE,MAAM;AACnF;AAEA,SAAS,2BAA2B,MAAe,YAA6B;CAC9E,MAAM,OAAO,WAAW,MAAM,KAAK,MAAM,KAAK,EAAE;CAChD,OAAO,SAAS,OAAO,SAAS,OAAO,SAAS,OAAO,SAAS,OAAO,SAAS,QAAQ,SAAS;AACnG;AAEA,SAAS,gBAAgB,MAAwB;CAC/C,IAAI,KAAK,WAAW,QAAQ,OAC1B,OAAO;CAET,OAAO,KAAK,SAAS,KAAK,eAAe;AAC3C;AAEA,SAAS,0BAA0B,MAAe,YAA+C;CAC/F,MAAM,aAAa,aAAa,MAAM,YAAY,KAAK,gBAAgB,MAAM,YAAY;CACzF,IAAI,eAAe,MACjB,OAAO;CAIT,IADiB,WAAW,WAAW,QACtB,KACf,OAAO;EACL,MAAM,YAAY;EAClB,MAAM,WAAW;EACjB,IAAI,WAAW,KAAK;CACtB;CAEF,OAAO;AACT;AAEA,SAAS,4BAA4B,MAAe,YAA+C;CACjG,MAAM,WACJ,aAAa,OAAM,MAAK,eAAe,CAAC,KAAK,gBAAgB,CAAC,CAAC,KAC/D,gBAAgB,OAAM,MAAK,eAAe,CAAC,KAAK,gBAAgB,CAAC,CAAC;CACpE,IAAI,aAAa,MACf,OAAO;CAET,OAAO,wBAAwB,UAAU,UAAU;AACrD;AAEA,SAAS,gBAAgB,MAAe,WAAyD;CAC/F,IAAI,UAA0B,KAAK;CACnC,OAAO,YAAY,MAAM;EACvB,KAAK,MAAM,SAAS,QAAQ,UAC1B,IAAI,UAAU,KAAK,GACjB,OAAO;EAGX,UAAU,QAAQ;CACpB;CACA,OAAO;AACT;AAEA,SAAS,wBAAwB,UAAmB,YAA+C;CACjG,MAAM,OAAO,WAAW,MAAM,SAAS,MAAM,SAAS,EAAE;CACxD,MAAM,OAAO,WAAW,MAAM,SAAS,EAAE;CAEzC,MAAM,cAAkC;EACtC,MAAM,YAAY;EAClB,MAAM,SAAS;EACf,IAAI,SAAS;EACb,QAAQ,CAAC,IAAI;CACf;CAGA,IAAI,QAAQ,KAAK,IAAI,GACnB,OAAO;CAKT,MAAM,cAAc,SAAS,KAAK,IAAI;CACtC,IAAI,gBAAgB,MAClB,OAAO;CAGT,MAAM,WAAW,yBAAyB,MAAM,YAAY,EAAE,CAAC,SAAS,CAAC;CACzE,IAAI,YAAY,GAEd;MADc,KAAK,MAAM,YAAY,EAAE,CAAC,QAAQ,QAAQ,CAAC,CAAC,KACtD,CAAA,CAAM,WAAW,GACnB,OAAO;CACT;CAGF,OAAO;AACT;AAEA,SAAS,aAAa,MAAe,WAAuD;CAC1F,IAAI,UAA0B;CAC9B,OAAO,YAAY,MAAM;EACvB,IAAI,UAAU,OAAO,GACnB,OAAO;EAET,UAAU,QAAQ;CACpB;CACA,OAAO;AACT;AAEA,SAAS,mBAAmB,MAAwB;CAClD,OAAO,KAAK,WAAA,MAA4B,KAAK,WAAW,QAAQ;AAClE;AAEA,SAAS,iBAAiB,MAAwB;CAChD,OAAO,KAAK,WAAA;AACd;AAEA,SAAS,eAAe,MAAwB;CAC9C,OAAO,KAAK,WAAA,MAAuB,KAAK,WAAW,QAAQ;AAC7D;AAEA,SAAS,gBAAgB,MAAwB;CAC/C,OAAO,KAAK,WAAA,MAAwB,KAAK,WAAW,QAAQ;AAC9D;AAEA,SAAS,aAAa,MAAwB;CAC5C,OAAO,KAAK,WAAA,MAAqB,KAAK,WAAW,QAAQ;AAC3D;AAEA,SAAS,yBAAyB,YAAoB,SAAyB;CAE7E,IADa,WAAW,aACX,KACX,OAAO;CAGT,IAAI,QAAQ;CACZ,KAAK,IAAI,QAAQ,SAAS,QAAQ,WAAW,QAAQ,SAAS;EAC5D,MAAM,SAAS,WAAW;EAC1B,IAAI,WAAW,KACb;OACK,IAAI,WAAW,KAAK;GACzB;GACA,IAAI,UAAU,GACZ,OAAO;EAEX;CACF;CACA,OAAO;AACT;AAEA,SAAS,kBAAkB,QAAoD;CAC7E,MAAM,SAA+B,CAAC;CAEtC,KAAK,MAAM,SAAS,QAAQ;EAI1B,IAHkB,OAAO,MACvB,aAAY,SAAS,SAAS,MAAM,QAAQ,SAAS,SAAS,MAAM,QAAQ,SAAS,OAAO,MAAM,EAEhG,GACF;EAGF,IAAI,MAAM,SAAS,YAAY,eAC7B;QAAK,IAAI,QAAQ,OAAO,SAAS,GAAG,SAAS,GAAG,SAC9C,IAAI,OAAO,MAAM,CAAC,SAAS,YAAY,iBAAiB,cAAc,OAAO,OAAO,MAAM,GACxF,OAAO,OAAO,OAAO,CAAC;EAE1B;EAGF,OAAO,KAAK,KAAK;CACnB;CAEA,MAAM,WAAW,OAAO,QAAO,UAAS,MAAM,SAAS,YAAY,aAAa;CAChF,OAAO,OAAO,QACZ,UAAS,MAAM,SAAS,YAAY,iBAAiB,CAAC,SAAS,MAAK,SAAQ,cAAc,OAAO,IAAI,CAAC,CACxG;AACF;AAEA,SAAS,cAAc,GAAuB,GAAgC;CAC5E,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE;AACrC;AAUA,MAAM,2BAA2B,4BAA4B;AAE7D,SAAS,8BAA2C;CAClD,MAAM,wBAAQ,IAAI,IAAY;CAC9B,KAAK,MAAM,SAAS;EAClB;EACA;EACA;EACA;EACA;CACF,GACE,KAAK,MAAM,UAAU,OACnB,MAAM,IAAI,MAAM;CAGpB,KAAK,IAAI,YAAY,KAAQ,aAAa,KAAQ,aAChD,MAAM,IAAI,OAAO,cAAc,SAAS,CAAC;CAE3C,OAAO;AACT;AAEA,SAAS,wBAAwB,QAAyB;CACxD,OAAO,MAAM,KAAK,MAAM,KAAK,yBAAyB,IAAI,MAAM;AAClE;AAEA,SAAS,gCAAgC,YAA0C;CACjF,MAAM,SAA+B,CAAC;CACtC,IAAI,MAAM;CAEV,OAAO,MAAM,WAAW,QAAQ;EAC9B,MAAM,SAAS,WAAW;EAC1B,IAAI,wBAAwB,MAAM,GAAG;GACnC;GACA;EACF;EAEA,MAAM,QAAQ;EACd,OAAO,MAAM,WAAW,UAAU,CAAC,wBAAwB,WAAW,IAAI,GACxE;EAGF,OAAO,KAAK;GACV,MAAM,YAAY;GAClB,MAAM;GACN,IAAI;GACJ,QAAQ,CAAC,WAAW,MAAM,OAAO,GAAG,CAAC;EACvC,CAAC;CACH;CAEA,OAAO;AACT;AAEA,SAAS,qBAAqB,YAA+C;CAC3E,MAAM,QAAwB,CAAC;CAE/B,KAAK,IAAI,MAAM,GAAG,MAAM,WAAW,QAAQ,OAAO;EAChD,MAAM,SAAS,WAAW;EAC1B,IAAI,cAAc,MAAM,GAAG;GACzB,IAAI,oBAAoB,YAAY,GAAG,GACrC,OAAO;IACL,MAAM,YAAY;IAClB,MAAM;IACN,IAAI,MAAM;GACZ;GAEF,MAAM,KAAK;IAAE,SAAS;IAAQ,OAAO;GAAI,CAAC;GAC1C;EACF;EACA,IAAI,CAAC,eAAe,MAAM,GACxB;EAGF,MAAM,eAAe,YAAY,MAAM;EACvC,MAAM,MAAM,MAAM,MAAM,SAAS;EACjC,IAAI,QAAQ,QACV,OAAO;GACL,MAAM,YAAY;GAClB,MAAM;GACN,IAAI,MAAM;GACV,QAAQ,CAAC,MAAM;EACjB;EAGF,IAAI,IAAI,YAAY,cAClB,OAAO;GACL,MAAM,YAAY;GAClB,MAAM;GACN,IAAI,MAAM;GACV,QAAQ,CAAC,YAAY,IAAI,OAAO,GAAG,MAAM;EAC3C;EAGF,MAAM,IAAI;CACZ;CAEA,IAAI,MAAM,SAAS,GAAG;EACpB,MAAM,WAAW,MAAM;EACvB,OAAO;GACL,MAAM,YAAY;GAClB,MAAM,SAAS;GACf,IAAI,SAAS,QAAQ;GACrB,QAAQ,CAAC,SAAS,OAAO;EAC3B;CACF;CAEA,OAAO;AACT;AAEA,SAAS,cAAc,QAAuC;CAC5D,OAAO,WAAW,OAAO,WAAW,OAAO,WAAW;AACxD;AAEA,SAAS,eAAe,QAAwC;CAC9D,OAAO,WAAW,OAAO,WAAW,OAAO,WAAW;AACxD;AAEA,SAAS,YAAY,QAAmC;CACtD,QAAQ,QAAR;EACE,KAAK,KACH,OAAO;EACT,KAAK,KACH,OAAO;EACT,KAAK,KACH,OAAO;CACX;AACF;AAEA,SAAS,YAAY,QAAmC;CACtD,QAAQ,QAAR;EACE,KAAK,KACH,OAAO;EACT,KAAK,KACH,OAAO;EACT,KAAK,KACH,OAAO;CACX;AACF;AAEA,SAAS,oBAAoB,YAAoB,KAAsB;CAErE,IAAI,EAD4B,WAAW,SAAS,OAAO,WAAW,MAAM,OAAO,MAEjF,OAAO;CAGT,MAAM,aAAa,uBAAuB,YAAY,GAAG;CACzD,MAAM,aAAa,uBAAuB,YAAY,MAAM,CAAC;CAC7D,IAAI,aAAa,KAAK,aAAa,GACjC,OAAO;CAGT,OAAO,eAAe,aAAa;AACrC;AAEA,SAAS,uBAAuB,YAAoB,SAAyB;CAC3E,IAAI,WAAW,aAAa,KAC1B,OAAO;CAGT,MAAM,QAAuB,CAAC;CAC9B,KAAK,IAAI,QAAQ,SAAS,QAAQ,WAAW,QAAQ,SAAS;EAC5D,MAAM,SAAS,WAAW;EAC1B,IAAI,cAAc,MAAM,GAAG;GACzB,MAAM,KAAK,MAAM;GACjB;EACF;EACA,IAAI,CAAC,eAAe,MAAM,GACxB;EAEF,MAAM,MAAM,MAAM,IAAI;EACtB,IAAI,QAAQ,UAAa,QAAQ,YAAY,MAAM,GACjD,OAAO;EAET,IAAI,MAAM,WAAW,GACnB,OAAO;CAEX;CAEA,OAAO;AACT"}