@rsconcept/domain 1.0.0

package/dist/rslang/parser/expression-generator.js

@@ -0,0 +1,451 @@
+// src/parsing/ast.ts
+var TOKEN_ERROR = 0;
+function getNodeText(node) {
+  if (node.data.dataType === "string" && typeof node.data.value === "string") {
+    return node.data.value;
+  }
+  return `NO DATA NODE: ${node.typeID}`;
+}
+function getNodeIndices(node) {
+  if (node.data.dataType === "string[]" && Array.isArray(node.data.value)) {
+    return node.data.value.map((s) => parseInt(s, 10)).filter((n) => !isNaN(n));
+  }
+  return [];
+}
+
+// src/rslang/parser/token.ts
+var TokenID = {
+  // Global, local IDs and literals
+  ERROR: TOKEN_ERROR,
+  ID_LOCAL: 258,
+  ID_GLOBAL: 259,
+  ID_FUNCTION: 260,
+  ID_PREDICATE: 261,
+  ID_RADICAL: 262,
+  LIT_INTEGER: 263,
+  LIT_WHOLE_NUMBERS: 264,
+  LIT_EMPTYSET: 265,
+  // Arithmetic
+  PLUS: 266,
+  MINUS: 267,
+  MULTIPLY: 268,
+  // Integer predicate symbols
+  GREATER: 269,
+  LESSER: 270,
+  GREATER_OR_EQ: 271,
+  LESSER_OR_EQ: 272,
+  // Equality comparison
+  EQUAL: 273,
+  NOTEQUAL: 274,
+  // Logic predicate symbols
+  QUANTOR_UNIVERSAL: 275,
+  QUANTOR_EXISTS: 276,
+  LOGIC_NOT: 277,
+  LOGIC_EQUIVALENT: 278,
+  LOGIC_IMPLICATION: 279,
+  LOGIC_OR: 280,
+  LOGIC_AND: 281,
+  // Set theory predicate symbols
+  SET_IN: 282,
+  SET_NOT_IN: 283,
+  SUBSET: 284,
+  SUBSET_OR_EQ: 285,
+  NOT_SUBSET: 286,
+  // Set theory operators
+  DECART: 287,
+  SET_UNION: 288,
+  SET_INTERSECTION: 289,
+  SET_MINUS: 290,
+  SET_SYMMETRIC_MINUS: 291,
+  BOOLEAN: 292,
+  // Structure operations
+  BIGPR: 293,
+  SMALLPR: 294,
+  FILTER: 295,
+  CARD: 296,
+  BOOL: 297,
+  DEBOOL: 298,
+  REDUCE: 299,
+  // Term constructions prefixes
+  DECLARATIVE: 300,
+  RECURSIVE: 301,
+  IMPERATIVE: 302,
+  ITERATE: 303,
+  ASSIGN: 304,
+  // Punctuation
+  PUNCTUATION_DEFINE: 305,
+  PUNCTUATION_STRUCT: 306,
+  PUNCTUATION_PL: 307,
+  PUNCTUATION_PR: 308,
+  PUNCTUATION_CL: 309,
+  PUNCTUATION_CR: 310,
+  PUNCTUATION_SL: 311,
+  PUNCTUATION_SR: 312,
+  PUNCTUATION_BAR: 313,
+  PUNCTUATION_COMMA: 314,
+  PUNCTUATION_SEMICOLON: 315,
+  // ======= Non-terminal tokens =========
+  NT_ENUM_DECL: 316,
+  NT_TUPLE: 317,
+  NT_ENUMERATION: 318,
+  NT_TUPLE_DECL: 319,
+  NT_ARG_DECL: 320,
+  NT_FUNC_DEFINITION: 321,
+  NT_ARGUMENTS: 322,
+  NT_FUNC_CALL: 323,
+  NT_DECLARATIVE_EXPR: 324,
+  NT_IMPERATIVE_EXPR: 325,
+  NT_RECURSIVE_FULL: 326,
+  NT_RECURSIVE_SHORT: 327,
+  // ======= Helper tokens ========
+  INTERRUPT: 328,
+  END: 329
+};
+
+// src/rslang/parser/expression-generator.ts
+function generateExpressionFromAst(ast, options = {}) {
+  return new ExpressionGenerator(options).run(ast);
+}
+var ExpressionGenerator = class {
+  options;
+  freeLocals = /* @__PURE__ */ new Map();
+  radicals = /* @__PURE__ */ new Map();
+  scopes = [];
+  localCounter = 0;
+  radicalCounter = 0;
+  constructor(options) {
+    this.options = options;
+  }
+  /** Run generator. Requires that the AST has no syntax errors. */
+  run(ast) {
+    if (ast.hasError) {
+      throw new Error("Cannot generate expression: AST has error");
+    }
+    return this.visit(ast, { localDeclaration: false });
+  }
+  visit(node, context) {
+    const shouldScope = this.shouldStartScope(node.typeID);
+    if (shouldScope) {
+      this.startScope();
+    }
+    const result = this.renderNode(node, context);
+    if (shouldScope) {
+      this.endScope();
+    }
+    return result;
+  }
+  renderNode(node, context) {
+    switch (node.typeID) {
+      case TokenID.ID_LOCAL: {
+        const alias = getNodeText(node);
+        return this.options.normalize ? context.localDeclaration ? this.declareLocal(alias) : this.resolveLocal(alias) : alias;
+      }
+      case TokenID.ID_GLOBAL:
+      case TokenID.ID_FUNCTION:
+      case TokenID.ID_PREDICATE:
+        return getNodeText(node);
+      case TokenID.ID_RADICAL: {
+        const alias = getNodeText(node);
+        return this.options.normalize ? this.resolveRadical(alias) : alias;
+      }
+      case TokenID.LIT_INTEGER:
+        return String(node.data.value);
+      case TokenID.LIT_WHOLE_NUMBERS:
+        return "Z";
+      case TokenID.LIT_EMPTYSET:
+        return "\u2205";
+      case TokenID.BIGPR:
+        return `Pr${this.formatIndices(node)}(${this.visitChild(node, 0, context)})`;
+      case TokenID.SMALLPR:
+        return `pr${this.formatIndices(node)}(${this.visitChild(node, 0, context)})`;
+      case TokenID.FILTER: {
+        const args = node.children.slice(0, -1).map((child) => this.visit(child, context)).join(", ");
+        const body = this.visitChild(node, node.children.length - 1, context);
+        return `Fi${this.formatIndices(node)}[${args}](${body})`;
+      }
+      case TokenID.CARD:
+        return `card(${this.visitChild(node, 0, context)})`;
+      case TokenID.BOOL:
+        return `bool(${this.visitChild(node, 0, context)})`;
+      case TokenID.DEBOOL:
+        return `debool(${this.visitChild(node, 0, context)})`;
+      case TokenID.REDUCE:
+        return `red(${this.visitChild(node, 0, context)})`;
+      case TokenID.BOOLEAN:
+        return this.renderBoolean(node, context);
+      case TokenID.NT_FUNC_CALL: {
+        const callee = this.visitChild(node, 0, context);
+        const args = node.children.slice(1).map((child) => this.visit(child, context)).join(", ");
+        return `${callee}[${args}]`;
+      }
+      case TokenID.NT_TUPLE:
+        return `(${node.children.map((child) => this.visit(child, context)).join(", ")})`;
+      case TokenID.NT_ENUMERATION:
+        return `{${node.children.map((child) => this.visit(child, context)).join(", ")}}`;
+      case TokenID.NT_ARGUMENTS:
+      case TokenID.NT_ENUM_DECL:
+        return node.children.map((child, index) => this.visit(child, this.childContext(node.typeID, index, context))).join(", ");
+      case TokenID.NT_TUPLE_DECL:
+        return `(${node.children.map((child, index) => this.visit(child, this.childContext(node.typeID, index, context))).join(", ")})`;
+      case TokenID.NT_ARG_DECL:
+        return `${this.visitChild(node, 0, this.childContext(node.typeID, 0, context))}\u2208${this.visitChild(node, 1, context)}`;
+      case TokenID.QUANTOR_UNIVERSAL:
+        return this.renderQuantifier("\u2200", node, context);
+      case TokenID.QUANTOR_EXISTS:
+        return this.renderQuantifier("\u2203", node, context);
+      case TokenID.NT_DECLARATIVE_EXPR:
+        return `D{${this.visitChild(node, 0, this.childContext(node.typeID, 0, context))}\u2208${this.visitChild(node, 1, context)} | ${this.visitChild(node, 2, context)}}`;
+      case TokenID.NT_FUNC_DEFINITION:
+        return `[${this.visitChild(node, 0, this.childContext(node.typeID, 0, context))}] ${this.visitChild(node, 1, context)}`;
+      case TokenID.ITERATE:
+        return `${this.visitChild(node, 0, this.childContext(node.typeID, 0, context))}:\u2208${this.visitChild(node, 1, context)}`;
+      case TokenID.ASSIGN:
+        return `${this.visitChild(node, 0, this.childContext(node.typeID, 0, context))}:=${this.visitChild(node, 1, context)}`;
+      case TokenID.NT_IMPERATIVE_EXPR: {
+        const statements = node.children.slice(1).map((child, index) => this.visit(child, this.childContext(node.typeID, index + 1, context)));
+        const target = this.visitChild(node, 0, context);
+        return `I{${target} | ${statements.join("; ")}}`;
+      }
+      case TokenID.NT_RECURSIVE_SHORT:
+        return `R{${this.visitChild(node, 0, this.childContext(node.typeID, 0, context))}:=${this.visitChild(node, 1, context)} | ${this.visitChild(node, 2, context)}}`;
+      case TokenID.NT_RECURSIVE_FULL:
+        return `R{${this.visitChild(node, 0, this.childContext(node.typeID, 0, context))}:=${this.visitChild(node, 1, context)} | ${this.visitChild(node, 2, context)} | ${this.visitChild(node, 3, context)}}`;
+      case TokenID.PLUS:
+        return this.renderInfix("+", node, context);
+      case TokenID.MINUS:
+        return this.renderInfix("-", node, context);
+      case TokenID.MULTIPLY:
+        return this.renderInfix("*", node, context);
+      case TokenID.GREATER:
+        return this.renderInfix(">", node, context);
+      case TokenID.LESSER:
+        return this.renderInfix("<", node, context);
+      case TokenID.GREATER_OR_EQ:
+        return this.renderInfix("\u2265", node, context);
+      case TokenID.LESSER_OR_EQ:
+        return this.renderInfix("\u2264", node, context);
+      case TokenID.EQUAL:
+        return this.renderInfix("=", node, context);
+      case TokenID.NOTEQUAL:
+        return this.renderInfix("\u2260", node, context);
+      case TokenID.LOGIC_AND:
+        return this.renderInfix("&", node, context);
+      case TokenID.LOGIC_OR:
+        return this.renderInfix("\u2228", node, context);
+      case TokenID.LOGIC_IMPLICATION:
+        return this.renderInfix("\u21D2", node, context);
+      case TokenID.LOGIC_EQUIVALENT:
+        return this.renderInfix("\u21D4", node, context);
+      case TokenID.SET_IN:
+        return this.renderInfix("\u2208", node, context);
+      case TokenID.SET_NOT_IN:
+        return this.renderInfix("\u2209", node, context);
+      case TokenID.SUBSET:
+        return this.renderInfix("\u2282", node, context);
+      case TokenID.SUBSET_OR_EQ:
+        return this.renderInfix("\u2286", node, context);
+      case TokenID.NOT_SUBSET:
+        return this.renderInfix("\u2284", node, context);
+      case TokenID.DECART:
+        return this.renderInfix("\xD7", node, context);
+      case TokenID.SET_UNION:
+        return this.renderInfix("\u222A", node, context);
+      case TokenID.SET_INTERSECTION:
+        return this.renderInfix("\u2229", node, context);
+      case TokenID.SET_MINUS:
+        return this.renderInfix("\\", node, context);
+      case TokenID.SET_SYMMETRIC_MINUS:
+        return this.renderInfix("\u2206", node, context);
+      case TokenID.LOGIC_NOT:
+        return `\xAC${this.wrapIfNeeded(this.visitChild(node, 0, context), node.children[0])}`;
+      default:
+        return node.children.map((child) => this.visit(child, context)).join("");
+    }
+  }
+  visitChild(node, index, context) {
+    const child = node.children[index];
+    if (!child) {
+      return "";
+    }
+    return this.visit(child, this.childContext(node.typeID, index, context));
+  }
+  renderQuantifier(symbol, node, context) {
+    const declaration = this.visitChild(node, 0, this.childContext(node.typeID, 0, context));
+    const domain = this.visitChild(node, 1, context);
+    const bodyNode = node.children[2];
+    const bodyText = this.visitChild(node, 2, context);
+    const body = bodyNode && this.shouldWrapQuantifierBody(bodyNode) ? `(${bodyText})` : bodyText;
+    return `${symbol}${declaration}\u2208${domain} ${body}`;
+  }
+  shouldWrapQuantifierBody(node) {
+    const quantifierPrecedence = this.getPrecedence(TokenID.QUANTOR_UNIVERSAL);
+    const bodyPrecedence = this.getPrecedence(node.typeID);
+    if (quantifierPrecedence === null || bodyPrecedence === null) {
+      return false;
+    }
+    return bodyPrecedence < quantifierPrecedence;
+  }
+  renderInfix(symbol, node, context) {
+    if (this.isLogicBinary(node.typeID)) {
+      const parts2 = node.children.map((child, index) => {
+        const text = this.visit(child, context);
+        return this.needParen(node, child, index) ? `(${text})` : text;
+      });
+      return parts2.join(` ${symbol} `);
+    }
+    const parts = node.children.map((child) => this.wrapIfNeeded(this.visit(child, context), child));
+    return parts.join(symbol);
+  }
+  needParen(parent, child, childIndex) {
+    if (this.isAtomic(child.typeID)) {
+      return false;
+    }
+    const parentPrecedence = this.getPrecedence(parent.typeID);
+    const childPrecedence = this.getPrecedence(child.typeID);
+    if (parentPrecedence === null || childPrecedence === null) {
+      return true;
+    }
+    if (childPrecedence > parentPrecedence) {
+      return false;
+    }
+    if (childPrecedence < parentPrecedence) {
+      return true;
+    }
+    if (this.isAssociative(parent.typeID) && child.typeID === parent.typeID) {
+      return false;
+    }
+    if (this.isLeftAssociative(parent.typeID)) {
+      return childIndex > 0;
+    }
+    return true;
+  }
+  getPrecedence(typeID) {
+    switch (typeID) {
+      case TokenID.LOGIC_EQUIVALENT:
+        return 1;
+      case TokenID.LOGIC_IMPLICATION:
+        return 2;
+      case TokenID.LOGIC_OR:
+        return 3;
+      case TokenID.LOGIC_AND:
+        return 4;
+      case TokenID.QUANTOR_UNIVERSAL:
+      case TokenID.QUANTOR_EXISTS:
+        return 5;
+      case TokenID.EQUAL:
+      case TokenID.NOTEQUAL:
+      case TokenID.GREATER:
+      case TokenID.LESSER:
+      case TokenID.GREATER_OR_EQ:
+      case TokenID.LESSER_OR_EQ:
+      case TokenID.SET_IN:
+      case TokenID.SET_NOT_IN:
+      case TokenID.SUBSET:
+      case TokenID.SUBSET_OR_EQ:
+      case TokenID.NOT_SUBSET:
+        return 6;
+      case TokenID.PLUS:
+      case TokenID.MINUS:
+      case TokenID.SET_UNION:
+      case TokenID.SET_SYMMETRIC_MINUS:
+        return 7;
+      case TokenID.MULTIPLY:
+      case TokenID.DECART:
+      case TokenID.SET_INTERSECTION:
+      case TokenID.SET_MINUS:
+        return 8;
+      default:
+        return null;
+    }
+  }
+  isAssociative(typeID) {
+    return typeID === TokenID.PLUS || typeID === TokenID.MULTIPLY || typeID === TokenID.LOGIC_AND || typeID === TokenID.LOGIC_OR || typeID === TokenID.LOGIC_EQUIVALENT || typeID === TokenID.SET_UNION || typeID === TokenID.SET_INTERSECTION || typeID === TokenID.DECART;
+  }
+  isLeftAssociative(typeID) {
+    return typeID === TokenID.LOGIC_IMPLICATION || typeID === TokenID.MINUS || typeID === TokenID.SET_MINUS || typeID === TokenID.SET_SYMMETRIC_MINUS;
+  }
+  renderBoolean(node, context) {
+    let current = node;
+    let depth = 0;
+    while (current.typeID === TokenID.BOOLEAN && current.children.length === 1) {
+      depth += 1;
+      current = current.children[0];
+    }
+    return `${"\u212C".repeat(depth)}(${this.visit(current, context)})`;
+  }
+  wrapIfNeeded(text, node) {
+    if (this.isAtomic(node.typeID)) {
+      return text;
+    }
+    return `(${text})`;
+  }
+  isAtomic(typeID) {
+    return typeID === TokenID.ID_LOCAL || typeID === TokenID.ID_GLOBAL || typeID === TokenID.ID_FUNCTION || typeID === TokenID.ID_PREDICATE || typeID === TokenID.ID_RADICAL || typeID === TokenID.LIT_INTEGER || typeID === TokenID.LIT_WHOLE_NUMBERS || typeID === TokenID.LIT_EMPTYSET || typeID === TokenID.NT_FUNC_CALL || typeID === TokenID.NT_TUPLE || typeID === TokenID.NT_ENUMERATION || typeID === TokenID.BIGPR || typeID === TokenID.SMALLPR || typeID === TokenID.FILTER || typeID === TokenID.REDUCE || typeID === TokenID.BOOL || typeID === TokenID.DEBOOL || typeID === TokenID.CARD || typeID === TokenID.BOOLEAN;
+  }
+  isLogicBinary(typeID) {
+    return typeID === TokenID.LOGIC_AND || typeID === TokenID.LOGIC_OR || typeID === TokenID.LOGIC_IMPLICATION || typeID === TokenID.LOGIC_EQUIVALENT;
+  }
+  formatIndices(node) {
+    return getNodeIndices(node).join(",");
+  }
+  shouldStartScope(typeID) {
+    return typeID === TokenID.QUANTOR_UNIVERSAL || typeID === TokenID.QUANTOR_EXISTS || typeID === TokenID.NT_DECLARATIVE_EXPR || typeID === TokenID.NT_FUNC_DEFINITION || typeID === TokenID.NT_IMPERATIVE_EXPR || typeID === TokenID.NT_RECURSIVE_SHORT || typeID === TokenID.NT_RECURSIVE_FULL;
+  }
+  childContext(typeID, index, parent) {
+    if (!this.options.normalize) {
+      return parent;
+    }
+    const isDeclaration = (typeID === TokenID.QUANTOR_UNIVERSAL || typeID === TokenID.QUANTOR_EXISTS || typeID === TokenID.NT_DECLARATIVE_EXPR || typeID === TokenID.ITERATE || typeID === TokenID.ASSIGN || typeID === TokenID.NT_RECURSIVE_SHORT || typeID === TokenID.NT_RECURSIVE_FULL) && index === 0 || typeID === TokenID.NT_FUNC_DEFINITION && index === 0 || typeID === TokenID.NT_ARG_DECL && index === 0 || typeID === TokenID.NT_TUPLE_DECL || typeID === TokenID.NT_ENUM_DECL;
+    return { localDeclaration: isDeclaration };
+  }
+  declareLocal(alias) {
+    const scope = this.currentScope();
+    const local = this.nextLocal();
+    scope.set(alias, local);
+    return local;
+  }
+  resolveLocal(alias) {
+    for (let index = this.scopes.length - 1; index >= 0; index -= 1) {
+      const local2 = this.scopes[index].get(alias);
+      if (local2) {
+        return local2;
+      }
+    }
+    let local = this.freeLocals.get(alias);
+    if (!local) {
+      local = this.nextLocal();
+      this.freeLocals.set(alias, local);
+    }
+    return local;
+  }
+  resolveRadical(alias) {
+    let radical = this.radicals.get(alias);
+    if (!radical) {
+      this.radicalCounter += 1;
+      radical = `R${this.radicalCounter}`;
+      this.radicals.set(alias, radical);
+    }
+    return radical;
+  }
+  startScope() {
+    this.scopes.push(/* @__PURE__ */ new Map());
+  }
+  endScope() {
+    this.scopes.pop();
+  }
+  currentScope() {
+    const scope = this.scopes.at(-1);
+    if (!scope) {
+      throw new Error("Attempted to declare local outside of scope");
+    }
+    return scope;
+  }
+  nextLocal() {
+    this.localCounter += 1;
+    return `a${this.localCounter}`;
+  }
+};
+export {
+  generateExpressionFromAst
+};
+//# sourceMappingURL=expression-generator.js.map

package/dist/rslang/parser/expression-generator.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/parsing/ast.ts","../../../src/rslang/parser/token.ts","../../../src/rslang/parser/expression-generator.ts"],"sourcesContent":["import { type TreeCursor } from './lezer-tree';\n\nexport const TOKEN_ERROR = 0;\n\n/** Represents AST node data. */\ninterface AstNodeData extends Record<string, unknown> {\n  dataType: string;\n  value: unknown;\n}\n\n/** Represents AST structured node base. */\nexport interface AstNodeBase {\n  typeID: number;\n  data: AstNodeData;\n  annotation?: Record<string, unknown>;\n}\n\n/** Represents AST structured node. */\nexport interface AstNode extends Record<string, unknown>, AstNodeBase {\n  uid: number;\n  from: number;\n  to: number;\n  hasError: boolean;\n  parenthesis?: boolean;\n  parent: AstNode | null;\n  children: AstNode[];\n}\n\n/** Represents AST node. */\nexport interface FlatAstNode extends Record<string, unknown>, AstNodeBase {\n  uid: number;\n  parent: number | null;\n  from: number;\n  to: number;\n}\n\n/** Represents Syntax tree flat representation. */\nexport type FlatAST = FlatAstNode[];\n\n/** Builds AST tree from a given tree cursor, generating unique uids for each node. */\nexport function buildTree(cursor: TreeCursor): AstNode {\n  let nextUid = 1;\n  function genUid() {\n    return nextUid++;\n  }\n  return buildTreeInternal(cursor, null, genUid);\n}\n\n/** Flattens AST tree to a array form. */\nexport function flattenAst(node: AstNode, parent: number | null = null, out: FlatAST = []): FlatAST {\n  out.push({\n    uid: node.uid,\n    parent: parent,\n    typeID: node.typeID,\n    from: node.from,\n    to: node.to,\n    data: node.data,\n    annotation: node.annotation\n  });\n  for (const child of node.children) {\n    flattenAst(child, node.uid, out);\n  }\n  return out;\n}\n\n/** Visits AST tree in depth-first order. */\nexport function visitAstDFS(node: AstNode, callback: (node: AstNode) => void) {\n  for (const child of node.children) {\n    visitAstDFS(child, callback);\n  }\n  callback(node);\n}\n\n/** Finds and returns the AstNode with the given ui. */\nexport function findByUid(root: AstNode, uid: number): AstNode | null {\n  let found: AstNode | null = null;\n  visitAstDFS(root, node => {\n    if (node.uid === uid && !found) {\n      found = node;\n    }\n  });\n  return found;\n}\n\n/** Prints AST tree. */\nexport function printAst(node: AstNode, printNode: (node: AstNode) => string): string {\n  let children: string = '';\n  for (const child of node.children) {\n    children += `${printAst(child, printNode)}`;\n  }\n  return `[${printNode(node)}${children}]`;\n}\n\n/** Extracts node text. */\nexport function getNodeText(node: AstNode): string {\n  if (node.data.dataType === 'string' && typeof node.data.value === 'string') {\n    return node.data.value;\n  }\n  return `NO DATA NODE: ${node.typeID}`;\n}\n\n/** Extracts node indices. */\nexport function getNodeIndices(node: AstNode): number[] {\n  if (node.data.dataType === 'string[]' && Array.isArray(node.data.value)) {\n    return (node.data.value as string[]).map(s => parseInt(s, 10)).filter(n => !isNaN(n));\n  }\n  return [];\n}\n\n// ======== Internals ========\nfunction buildTreeInternal(cursor: TreeCursor, parent: AstNode | null = null, genUid: () => number): AstNode {\n  const node = cursor.node;\n\n  const result: AstNode = {\n    uid: genUid(),\n    typeID: node.type.isError ? 0 : node.type.id,\n    from: node.from,\n    to: node.to,\n    hasError: node.type.isError,\n    data: node.type.isError ? { dataType: 'null', value: null } : { dataType: 'string', value: node.type.name },\n    parent,\n    children: []\n  };\n\n  if (cursor.firstChild()) {\n    do {\n      const child = buildTreeInternal(cursor, result, genUid);\n      if (child.hasError) {\n        result.hasError = true;\n      }\n      result.children.push(child);\n    } while (cursor.nextSibling());\n    cursor.parent();\n  }\n  return result;\n}\n","import { TOKEN_ERROR } from '../../parsing';\n\n/** Represents RSLang token types. */\nexport const TokenID = {\n  // Global, local IDs and literals\n  ERROR: TOKEN_ERROR,\n\n  ID_LOCAL: 258,\n  ID_GLOBAL: 259,\n  ID_FUNCTION: 260,\n  ID_PREDICATE: 261,\n  ID_RADICAL: 262,\n  LIT_INTEGER: 263,\n  LIT_WHOLE_NUMBERS: 264,\n  LIT_EMPTYSET: 265,\n\n  // Arithmetic\n  PLUS: 266,\n  MINUS: 267,\n  MULTIPLY: 268,\n\n  // Integer predicate symbols\n  GREATER: 269,\n  LESSER: 270,\n  GREATER_OR_EQ: 271,\n  LESSER_OR_EQ: 272,\n\n  // Equality comparison\n  EQUAL: 273,\n  NOTEQUAL: 274,\n\n  // Logic predicate symbols\n  QUANTOR_UNIVERSAL: 275,\n  QUANTOR_EXISTS: 276,\n  LOGIC_NOT: 277,\n  LOGIC_EQUIVALENT: 278,\n  LOGIC_IMPLICATION: 279,\n  LOGIC_OR: 280,\n  LOGIC_AND: 281,\n\n  // Set theory predicate symbols\n  SET_IN: 282,\n  SET_NOT_IN: 283,\n  SUBSET: 284,\n  SUBSET_OR_EQ: 285,\n  NOT_SUBSET: 286,\n\n  // Set theory operators\n  DECART: 287,\n  SET_UNION: 288,\n  SET_INTERSECTION: 289,\n  SET_MINUS: 290,\n  SET_SYMMETRIC_MINUS: 291,\n  BOOLEAN: 292,\n\n  // Structure operations\n  BIGPR: 293,\n  SMALLPR: 294,\n  FILTER: 295,\n  CARD: 296,\n  BOOL: 297,\n  DEBOOL: 298,\n  REDUCE: 299,\n\n  // Term constructions prefixes\n  DECLARATIVE: 300,\n  RECURSIVE: 301,\n  IMPERATIVE: 302,\n\n  ITERATE: 303,\n  ASSIGN: 304,\n\n  // Punctuation\n  PUNCTUATION_DEFINE: 305,\n  PUNCTUATION_STRUCT: 306,\n  PUNCTUATION_PL: 307,\n  PUNCTUATION_PR: 308,\n  PUNCTUATION_CL: 309,\n  PUNCTUATION_CR: 310,\n  PUNCTUATION_SL: 311,\n  PUNCTUATION_SR: 312,\n  PUNCTUATION_BAR: 313,\n  PUNCTUATION_COMMA: 314,\n  PUNCTUATION_SEMICOLON: 315,\n\n  // ======= Non-terminal tokens =========\n  NT_ENUM_DECL: 316,\n  NT_TUPLE: 317,\n  NT_ENUMERATION: 318,\n  NT_TUPLE_DECL: 319,\n  NT_ARG_DECL: 320,\n\n  NT_FUNC_DEFINITION: 321,\n  NT_ARGUMENTS: 322,\n  NT_FUNC_CALL: 323,\n\n  NT_DECLARATIVE_EXPR: 324,\n  NT_IMPERATIVE_EXPR: 325,\n  NT_RECURSIVE_FULL: 326,\n  NT_RECURSIVE_SHORT: 327,\n\n  // ======= Helper tokens ========\n  INTERRUPT: 328,\n  END: 329\n} as const;\nexport type TokenID = (typeof TokenID)[keyof typeof TokenID];\n","import { type AstNode, getNodeIndices, getNodeText } from '../../parsing';\n\nimport { TokenID } from './token';\n\ninterface ExpressionGeneratorOptions {\n  normalize?: boolean;\n}\n\n/** Generates Math-syntax RS expression from AST, with optional identifier normalization. */\nexport function generateExpressionFromAst(ast: AstNode, options: ExpressionGeneratorOptions = {}): string {\n  return new ExpressionGenerator(options).run(ast);\n}\n\ninterface VisitContext {\n  localDeclaration: boolean;\n}\n\ntype ScopeFrame = Map<string, string>;\n\n/** Generates Math-syntax RS expression from AST, with optional identifier normalization. */\nclass ExpressionGenerator {\n  private readonly options: ExpressionGeneratorOptions;\n  private readonly freeLocals = new Map<string, string>();\n  private readonly radicals = new Map<string, string>();\n  private readonly scopes: ScopeFrame[] = [];\n  private localCounter = 0;\n  private radicalCounter = 0;\n\n  constructor(options: ExpressionGeneratorOptions) {\n    this.options = options;\n  }\n\n  /** Run generator. Requires that the AST has no syntax errors. */\n  run(ast: AstNode): string {\n    if (ast.hasError) {\n      throw new Error('Cannot generate expression: AST has error');\n    }\n    return this.visit(ast, { localDeclaration: false });\n  }\n\n  private visit(node: AstNode, context: VisitContext): string {\n    const shouldScope = this.shouldStartScope(node.typeID);\n    if (shouldScope) {\n      this.startScope();\n    }\n\n    const result = this.renderNode(node, context);\n\n    if (shouldScope) {\n      this.endScope();\n    }\n    return result;\n  }\n\n  private renderNode(node: AstNode, context: VisitContext): string {\n    switch (node.typeID) {\n      case TokenID.ID_LOCAL: {\n        const alias = getNodeText(node);\n        return this.options.normalize\n          ? context.localDeclaration\n            ? this.declareLocal(alias)\n            : this.resolveLocal(alias)\n          : alias;\n      }\n      case TokenID.ID_GLOBAL:\n      case TokenID.ID_FUNCTION:\n      case TokenID.ID_PREDICATE:\n        return getNodeText(node);\n      case TokenID.ID_RADICAL: {\n        const alias = getNodeText(node);\n        return this.options.normalize ? this.resolveRadical(alias) : alias;\n      }\n      case TokenID.LIT_INTEGER:\n        return String(node.data.value);\n      case TokenID.LIT_WHOLE_NUMBERS:\n        return 'Z';\n      case TokenID.LIT_EMPTYSET:\n        return '∅';\n\n      case TokenID.BIGPR:\n        return `Pr${this.formatIndices(node)}(${this.visitChild(node, 0, context)})`;\n      case TokenID.SMALLPR:\n        return `pr${this.formatIndices(node)}(${this.visitChild(node, 0, context)})`;\n      case TokenID.FILTER: {\n        const args = node.children\n          .slice(0, -1)\n          .map(child => this.visit(child, context))\n          .join(', ');\n        const body = this.visitChild(node, node.children.length - 1, context);\n        return `Fi${this.formatIndices(node)}[${args}](${body})`;\n      }\n      case TokenID.CARD:\n        return `card(${this.visitChild(node, 0, context)})`;\n      case TokenID.BOOL:\n        return `bool(${this.visitChild(node, 0, context)})`;\n      case TokenID.DEBOOL:\n        return `debool(${this.visitChild(node, 0, context)})`;\n      case TokenID.REDUCE:\n        return `red(${this.visitChild(node, 0, context)})`;\n      case TokenID.BOOLEAN:\n        return this.renderBoolean(node, context);\n\n      case TokenID.NT_FUNC_CALL: {\n        const callee = this.visitChild(node, 0, context);\n        const args = node.children\n          .slice(1)\n          .map(child => this.visit(child, context))\n          .join(', ');\n        return `${callee}[${args}]`;\n      }\n      case TokenID.NT_TUPLE:\n        return `(${node.children.map(child => this.visit(child, context)).join(', ')})`;\n      case TokenID.NT_ENUMERATION:\n        return `{${node.children.map(child => this.visit(child, context)).join(', ')}}`;\n      case TokenID.NT_ARGUMENTS:\n      case TokenID.NT_ENUM_DECL:\n        return node.children\n          .map((child, index) => this.visit(child, this.childContext(node.typeID, index, context)))\n          .join(', ');\n      case TokenID.NT_TUPLE_DECL:\n        return `(${node.children.map((child, index) => this.visit(child, this.childContext(node.typeID, index, context))).join(', ')})`;\n      case TokenID.NT_ARG_DECL:\n        return `${this.visitChild(node, 0, this.childContext(node.typeID, 0, context))}∈${this.visitChild(node, 1, context)}`;\n      case TokenID.QUANTOR_UNIVERSAL:\n        return this.renderQuantifier('∀', node, context);\n      case TokenID.QUANTOR_EXISTS:\n        return this.renderQuantifier('∃', node, context);\n      case TokenID.NT_DECLARATIVE_EXPR:\n        return `D{${this.visitChild(node, 0, this.childContext(node.typeID, 0, context))}∈${this.visitChild(node, 1, context)} | ${this.visitChild(node, 2, context)}}`;\n      case TokenID.NT_FUNC_DEFINITION:\n        return `[${this.visitChild(node, 0, this.childContext(node.typeID, 0, context))}] ${this.visitChild(node, 1, context)}`;\n      case TokenID.ITERATE:\n        return `${this.visitChild(node, 0, this.childContext(node.typeID, 0, context))}:∈${this.visitChild(node, 1, context)}`;\n      case TokenID.ASSIGN:\n        return `${this.visitChild(node, 0, this.childContext(node.typeID, 0, context))}:=${this.visitChild(node, 1, context)}`;\n      case TokenID.NT_IMPERATIVE_EXPR: {\n        const statements = node.children\n          .slice(1)\n          .map((child, index) => this.visit(child, this.childContext(node.typeID, index + 1, context)));\n        const target = this.visitChild(node, 0, context);\n        return `I{${target} | ${statements.join('; ')}}`;\n      }\n      case TokenID.NT_RECURSIVE_SHORT:\n        return `R{${this.visitChild(node, 0, this.childContext(node.typeID, 0, context))}:=${this.visitChild(node, 1, context)} | ${this.visitChild(node, 2, context)}}`;\n      case TokenID.NT_RECURSIVE_FULL:\n        return `R{${this.visitChild(node, 0, this.childContext(node.typeID, 0, context))}:=${this.visitChild(node, 1, context)} | ${this.visitChild(node, 2, context)} | ${this.visitChild(node, 3, context)}}`;\n\n      case TokenID.PLUS:\n        return this.renderInfix('+', node, context);\n      case TokenID.MINUS:\n        return this.renderInfix('-', node, context);\n      case TokenID.MULTIPLY:\n        return this.renderInfix('*', node, context);\n      case TokenID.GREATER:\n        return this.renderInfix('>', node, context);\n      case TokenID.LESSER:\n        return this.renderInfix('<', node, context);\n      case TokenID.GREATER_OR_EQ:\n        return this.renderInfix('≥', node, context);\n      case TokenID.LESSER_OR_EQ:\n        return this.renderInfix('≤', node, context);\n      case TokenID.EQUAL:\n        return this.renderInfix('=', node, context);\n      case TokenID.NOTEQUAL:\n        return this.renderInfix('≠', node, context);\n      case TokenID.LOGIC_AND:\n        return this.renderInfix('&', node, context);\n      case TokenID.LOGIC_OR:\n        return this.renderInfix('∨', node, context);\n      case TokenID.LOGIC_IMPLICATION:\n        return this.renderInfix('⇒', node, context);\n      case TokenID.LOGIC_EQUIVALENT:\n        return this.renderInfix('⇔', node, context);\n      case TokenID.SET_IN:\n        return this.renderInfix('∈', node, context);\n      case TokenID.SET_NOT_IN:\n        return this.renderInfix('∉', node, context);\n      case TokenID.SUBSET:\n        return this.renderInfix('⊂', node, context);\n      case TokenID.SUBSET_OR_EQ:\n        return this.renderInfix('⊆', node, context);\n      case TokenID.NOT_SUBSET:\n        return this.renderInfix('⊄', node, context);\n      case TokenID.DECART:\n        return this.renderInfix('×', node, context);\n      case TokenID.SET_UNION:\n        return this.renderInfix('∪', node, context);\n      case TokenID.SET_INTERSECTION:\n        return this.renderInfix('∩', node, context);\n      case TokenID.SET_MINUS:\n        return this.renderInfix('\\\\', node, context);\n      case TokenID.SET_SYMMETRIC_MINUS:\n        return this.renderInfix('∆', node, context);\n      case TokenID.LOGIC_NOT:\n        return `¬${this.wrapIfNeeded(this.visitChild(node, 0, context), node.children[0])}`;\n      default:\n        return node.children.map(child => this.visit(child, context)).join('');\n    }\n  }\n\n  private visitChild(node: AstNode, index: number, context: VisitContext): string {\n    const child = node.children[index];\n    if (!child) {\n      return '';\n    }\n    return this.visit(child, this.childContext(node.typeID, index, context));\n  }\n\n  private renderQuantifier(symbol: string, node: AstNode, context: VisitContext): string {\n    const declaration = this.visitChild(node, 0, this.childContext(node.typeID, 0, context));\n    const domain = this.visitChild(node, 1, context);\n    const bodyNode = node.children[2];\n    const bodyText = this.visitChild(node, 2, context);\n    const body = bodyNode && this.shouldWrapQuantifierBody(bodyNode) ? `(${bodyText})` : bodyText;\n    return `${symbol}${declaration}∈${domain} ${body}`;\n  }\n\n  private shouldWrapQuantifierBody(node: AstNode): boolean {\n    const quantifierPrecedence = this.getPrecedence(TokenID.QUANTOR_UNIVERSAL);\n    const bodyPrecedence = this.getPrecedence(node.typeID);\n    if (quantifierPrecedence === null || bodyPrecedence === null) {\n      return false;\n    }\n    return bodyPrecedence < quantifierPrecedence;\n  }\n\n  private renderInfix(symbol: string, node: AstNode, context: VisitContext): string {\n    if (this.isLogicBinary(node.typeID)) {\n      const parts = node.children.map((child, index) => {\n        const text = this.visit(child, context);\n        return this.needParen(node, child, index) ? `(${text})` : text;\n      });\n      return parts.join(` ${symbol} `);\n    }\n    const parts = node.children.map(child => this.wrapIfNeeded(this.visit(child, context), child));\n    return parts.join(symbol);\n  }\n\n  private needParen(parent: AstNode, child: AstNode, childIndex: number): boolean {\n    if (this.isAtomic(child.typeID)) {\n      return false;\n    }\n    const parentPrecedence = this.getPrecedence(parent.typeID);\n    const childPrecedence = this.getPrecedence(child.typeID);\n    if (parentPrecedence === null || childPrecedence === null) {\n      return true;\n    }\n    if (childPrecedence > parentPrecedence) {\n      return false;\n    }\n    if (childPrecedence < parentPrecedence) {\n      return true;\n    }\n    if (this.isAssociative(parent.typeID) && child.typeID === parent.typeID) {\n      return false;\n    }\n    if (this.isLeftAssociative(parent.typeID)) {\n      return childIndex > 0;\n    }\n    return true;\n  }\n\n  private getPrecedence(typeID: number): number | null {\n    switch (typeID) {\n      case TokenID.LOGIC_EQUIVALENT:\n        return 1;\n      case TokenID.LOGIC_IMPLICATION:\n        return 2;\n      case TokenID.LOGIC_OR:\n        return 3;\n      case TokenID.LOGIC_AND:\n        return 4;\n      case TokenID.QUANTOR_UNIVERSAL:\n      case TokenID.QUANTOR_EXISTS:\n        return 5;\n      case TokenID.EQUAL:\n      case TokenID.NOTEQUAL:\n      case TokenID.GREATER:\n      case TokenID.LESSER:\n      case TokenID.GREATER_OR_EQ:\n      case TokenID.LESSER_OR_EQ:\n      case TokenID.SET_IN:\n      case TokenID.SET_NOT_IN:\n      case TokenID.SUBSET:\n      case TokenID.SUBSET_OR_EQ:\n      case TokenID.NOT_SUBSET:\n        return 6;\n      case TokenID.PLUS:\n      case TokenID.MINUS:\n      case TokenID.SET_UNION:\n      case TokenID.SET_SYMMETRIC_MINUS:\n        return 7;\n      case TokenID.MULTIPLY:\n      case TokenID.DECART:\n      case TokenID.SET_INTERSECTION:\n      case TokenID.SET_MINUS:\n        return 8;\n      default:\n        return null;\n    }\n  }\n\n  private isAssociative(typeID: number): boolean {\n    return (\n      typeID === TokenID.PLUS ||\n      typeID === TokenID.MULTIPLY ||\n      typeID === TokenID.LOGIC_AND ||\n      typeID === TokenID.LOGIC_OR ||\n      typeID === TokenID.LOGIC_EQUIVALENT ||\n      typeID === TokenID.SET_UNION ||\n      typeID === TokenID.SET_INTERSECTION ||\n      typeID === TokenID.DECART\n    );\n  }\n\n  private isLeftAssociative(typeID: number): boolean {\n    return (\n      typeID === TokenID.LOGIC_IMPLICATION ||\n      typeID === TokenID.MINUS ||\n      typeID === TokenID.SET_MINUS ||\n      typeID === TokenID.SET_SYMMETRIC_MINUS\n    );\n  }\n\n  private renderBoolean(node: AstNode, context: VisitContext): string {\n    let current: AstNode = node;\n    let depth = 0;\n    while (current.typeID === TokenID.BOOLEAN && current.children.length === 1) {\n      depth += 1;\n      current = current.children[0];\n    }\n    return `${'ℬ'.repeat(depth)}(${this.visit(current, context)})`;\n  }\n\n  private wrapIfNeeded(text: string, node: AstNode): string {\n    if (this.isAtomic(node.typeID)) {\n      return text;\n    }\n    return `(${text})`;\n  }\n\n  private isAtomic(typeID: number): boolean {\n    return (\n      typeID === TokenID.ID_LOCAL ||\n      typeID === TokenID.ID_GLOBAL ||\n      typeID === TokenID.ID_FUNCTION ||\n      typeID === TokenID.ID_PREDICATE ||\n      typeID === TokenID.ID_RADICAL ||\n      typeID === TokenID.LIT_INTEGER ||\n      typeID === TokenID.LIT_WHOLE_NUMBERS ||\n      typeID === TokenID.LIT_EMPTYSET ||\n      typeID === TokenID.NT_FUNC_CALL ||\n      typeID === TokenID.NT_TUPLE ||\n      typeID === TokenID.NT_ENUMERATION ||\n      typeID === TokenID.BIGPR ||\n      typeID === TokenID.SMALLPR ||\n      typeID === TokenID.FILTER ||\n      typeID === TokenID.REDUCE ||\n      typeID === TokenID.BOOL ||\n      typeID === TokenID.DEBOOL ||\n      typeID === TokenID.CARD ||\n      typeID === TokenID.BOOLEAN\n    );\n  }\n\n  private isLogicBinary(typeID: number): boolean {\n    return (\n      typeID === TokenID.LOGIC_AND ||\n      typeID === TokenID.LOGIC_OR ||\n      typeID === TokenID.LOGIC_IMPLICATION ||\n      typeID === TokenID.LOGIC_EQUIVALENT\n    );\n  }\n\n  private formatIndices(node: AstNode): string {\n    return getNodeIndices(node).join(',');\n  }\n\n  private shouldStartScope(typeID: number): boolean {\n    return (\n      typeID === TokenID.QUANTOR_UNIVERSAL ||\n      typeID === TokenID.QUANTOR_EXISTS ||\n      typeID === TokenID.NT_DECLARATIVE_EXPR ||\n      typeID === TokenID.NT_FUNC_DEFINITION ||\n      typeID === TokenID.NT_IMPERATIVE_EXPR ||\n      typeID === TokenID.NT_RECURSIVE_SHORT ||\n      typeID === TokenID.NT_RECURSIVE_FULL\n    );\n  }\n\n  private childContext(typeID: number, index: number, parent: VisitContext): VisitContext {\n    if (!this.options.normalize) {\n      return parent;\n    }\n\n    const isDeclaration =\n      ((typeID === TokenID.QUANTOR_UNIVERSAL ||\n        typeID === TokenID.QUANTOR_EXISTS ||\n        typeID === TokenID.NT_DECLARATIVE_EXPR ||\n        typeID === TokenID.ITERATE ||\n        typeID === TokenID.ASSIGN ||\n        typeID === TokenID.NT_RECURSIVE_SHORT ||\n        typeID === TokenID.NT_RECURSIVE_FULL) &&\n        index === 0) ||\n      (typeID === TokenID.NT_FUNC_DEFINITION && index === 0) ||\n      (typeID === TokenID.NT_ARG_DECL && index === 0) ||\n      typeID === TokenID.NT_TUPLE_DECL ||\n      typeID === TokenID.NT_ENUM_DECL;\n\n    return { localDeclaration: isDeclaration };\n  }\n\n  private declareLocal(alias: string): string {\n    const scope = this.currentScope();\n    const local = this.nextLocal();\n    scope.set(alias, local);\n    return local;\n  }\n\n  private resolveLocal(alias: string): string {\n    for (let index = this.scopes.length - 1; index >= 0; index -= 1) {\n      const local = this.scopes[index].get(alias);\n      if (local) {\n        return local;\n      }\n    }\n\n    let local = this.freeLocals.get(alias);\n    if (!local) {\n      local = this.nextLocal();\n      this.freeLocals.set(alias, local);\n    }\n    return local;\n  }\n\n  private resolveRadical(alias: string): string {\n    let radical = this.radicals.get(alias);\n    if (!radical) {\n      this.radicalCounter += 1;\n      radical = `R${this.radicalCounter}`;\n      this.radicals.set(alias, radical);\n    }\n    return radical;\n  }\n\n  private startScope(): void {\n    this.scopes.push(new Map());\n  }\n\n  private endScope(): void {\n    this.scopes.pop();\n  }\n\n  private currentScope(): ScopeFrame {\n    const scope = this.scopes.at(-1);\n    if (!scope) {\n      throw new Error('Attempted to declare local outside of scope');\n    }\n    return scope;\n  }\n\n  private nextLocal(): string {\n    this.localCounter += 1;\n    return `a${this.localCounter}`;\n  }\n}\n"],"mappings":";AAEO,IAAM,cAAc;AA4FpB,SAAS,YAAY,MAAuB;AACjD,MAAI,KAAK,KAAK,aAAa,YAAY,OAAO,KAAK,KAAK,UAAU,UAAU;AAC1E,WAAO,KAAK,KAAK;AAAA,EACnB;AACA,SAAO,iBAAiB,KAAK,MAAM;AACrC;AAGO,SAAS,eAAe,MAAyB;AACtD,MAAI,KAAK,KAAK,aAAa,cAAc,MAAM,QAAQ,KAAK,KAAK,KAAK,GAAG;AACvE,WAAQ,KAAK,KAAK,MAAmB,IAAI,OAAK,SAAS,GAAG,EAAE,CAAC,EAAE,OAAO,OAAK,CAAC,MAAM,CAAC,CAAC;AAAA,EACtF;AACA,SAAO,CAAC;AACV;;;ACxGO,IAAM,UAAU;AAAA;AAAA,EAErB,OAAO;AAAA,EAEP,UAAU;AAAA,EACV,WAAW;AAAA,EACX,aAAa;AAAA,EACb,cAAc;AAAA,EACd,YAAY;AAAA,EACZ,aAAa;AAAA,EACb,mBAAmB;AAAA,EACnB,cAAc;AAAA;AAAA,EAGd,MAAM;AAAA,EACN,OAAO;AAAA,EACP,UAAU;AAAA;AAAA,EAGV,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,eAAe;AAAA,EACf,cAAc;AAAA;AAAA,EAGd,OAAO;AAAA,EACP,UAAU;AAAA;AAAA,EAGV,mBAAmB;AAAA,EACnB,gBAAgB;AAAA,EAChB,WAAW;AAAA,EACX,kBAAkB;AAAA,EAClB,mBAAmB;AAAA,EACnB,UAAU;AAAA,EACV,WAAW;AAAA;AAAA,EAGX,QAAQ;AAAA,EACR,YAAY;AAAA,EACZ,QAAQ;AAAA,EACR,cAAc;AAAA,EACd,YAAY;AAAA;AAAA,EAGZ,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,kBAAkB;AAAA,EAClB,WAAW;AAAA,EACX,qBAAqB;AAAA,EACrB,SAAS;AAAA;AAAA,EAGT,OAAO;AAAA,EACP,SAAS;AAAA,EACT,QAAQ;AAAA,EACR,MAAM;AAAA,EACN,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,QAAQ;AAAA;AAAA,EAGR,aAAa;AAAA,EACb,WAAW;AAAA,EACX,YAAY;AAAA,EAEZ,SAAS;AAAA,EACT,QAAQ;AAAA;AAAA,EAGR,oBAAoB;AAAA,EACpB,oBAAoB;AAAA,EACpB,gBAAgB;AAAA,EAChB,gBAAgB;AAAA,EAChB,gBAAgB;AAAA,EAChB,gBAAgB;AAAA,EAChB,gBAAgB;AAAA,EAChB,gBAAgB;AAAA,EAChB,iBAAiB;AAAA,EACjB,mBAAmB;AAAA,EACnB,uBAAuB;AAAA;AAAA,EAGvB,cAAc;AAAA,EACd,UAAU;AAAA,EACV,gBAAgB;AAAA,EAChB,eAAe;AAAA,EACf,aAAa;AAAA,EAEb,oBAAoB;AAAA,EACpB,cAAc;AAAA,EACd,cAAc;AAAA,EAEd,qBAAqB;AAAA,EACrB,oBAAoB;AAAA,EACpB,mBAAmB;AAAA,EACnB,oBAAoB;AAAA;AAAA,EAGpB,WAAW;AAAA,EACX,KAAK;AACP;;;AC/FO,SAAS,0BAA0B,KAAc,UAAsC,CAAC,GAAW;AACxG,SAAO,IAAI,oBAAoB,OAAO,EAAE,IAAI,GAAG;AACjD;AASA,IAAM,sBAAN,MAA0B;AAAA,EACP;AAAA,EACA,aAAa,oBAAI,IAAoB;AAAA,EACrC,WAAW,oBAAI,IAAoB;AAAA,EACnC,SAAuB,CAAC;AAAA,EACjC,eAAe;AAAA,EACf,iBAAiB;AAAA,EAEzB,YAAY,SAAqC;AAC/C,SAAK,UAAU;AAAA,EACjB;AAAA;AAAA,EAGA,IAAI,KAAsB;AACxB,QAAI,IAAI,UAAU;AAChB,YAAM,IAAI,MAAM,2CAA2C;AAAA,IAC7D;AACA,WAAO,KAAK,MAAM,KAAK,EAAE,kBAAkB,MAAM,CAAC;AAAA,EACpD;AAAA,EAEQ,MAAM,MAAe,SAA+B;AAC1D,UAAM,cAAc,KAAK,iBAAiB,KAAK,MAAM;AACrD,QAAI,aAAa;AACf,WAAK,WAAW;AAAA,IAClB;AAEA,UAAM,SAAS,KAAK,WAAW,MAAM,OAAO;AAE5C,QAAI,aAAa;AACf,WAAK,SAAS;AAAA,IAChB;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,WAAW,MAAe,SAA+B;AAC/D,YAAQ,KAAK,QAAQ;AAAA,MACnB,KAAK,QAAQ,UAAU;AACrB,cAAM,QAAQ,YAAY,IAAI;AAC9B,eAAO,KAAK,QAAQ,YAChB,QAAQ,mBACN,KAAK,aAAa,KAAK,IACvB,KAAK,aAAa,KAAK,IACzB;AAAA,MACN;AAAA,MACA,KAAK,QAAQ;AAAA,MACb,KAAK,QAAQ;AAAA,MACb,KAAK,QAAQ;AACX,eAAO,YAAY,IAAI;AAAA,MACzB,KAAK,QAAQ,YAAY;AACvB,cAAM,QAAQ,YAAY,IAAI;AAC9B,eAAO,KAAK,QAAQ,YAAY,KAAK,eAAe,KAAK,IAAI;AAAA,MAC/D;AAAA,MACA,KAAK,QAAQ;AACX,eAAO,OAAO,KAAK,KAAK,KAAK;AAAA,MAC/B,KAAK,QAAQ;AACX,eAAO;AAAA,MACT,KAAK,QAAQ;AACX,eAAO;AAAA,MAET,KAAK,QAAQ;AACX,eAAO,KAAK,KAAK,cAAc,IAAI,CAAC,IAAI,KAAK,WAAW,MAAM,GAAG,OAAO,CAAC;AAAA,MAC3E,KAAK,QAAQ;AACX,eAAO,KAAK,KAAK,cAAc,IAAI,CAAC,IAAI,KAAK,WAAW,MAAM,GAAG,OAAO,CAAC;AAAA,MAC3E,KAAK,QAAQ,QAAQ;AACnB,cAAM,OAAO,KAAK,SACf,MAAM,GAAG,EAAE,EACX,IAAI,WAAS,KAAK,MAAM,OAAO,OAAO,CAAC,EACvC,KAAK,IAAI;AACZ,cAAM,OAAO,KAAK,WAAW,MAAM,KAAK,SAAS,SAAS,GAAG,OAAO;AACpE,eAAO,KAAK,KAAK,cAAc,IAAI,CAAC,IAAI,IAAI,KAAK,IAAI;AAAA,MACvD;AAAA,MACA,KAAK,QAAQ;AACX,eAAO,QAAQ,KAAK,WAAW,MAAM,GAAG,OAAO,CAAC;AAAA,MAClD,KAAK,QAAQ;AACX,eAAO,QAAQ,KAAK,WAAW,MAAM,GAAG,OAAO,CAAC;AAAA,MAClD,KAAK,QAAQ;AACX,eAAO,UAAU,KAAK,WAAW,MAAM,GAAG,OAAO,CAAC;AAAA,MACpD,KAAK,QAAQ;AACX,eAAO,OAAO,KAAK,WAAW,MAAM,GAAG,OAAO,CAAC;AAAA,MACjD,KAAK,QAAQ;AACX,eAAO,KAAK,cAAc,MAAM,OAAO;AAAA,MAEzC,KAAK,QAAQ,cAAc;AACzB,cAAM,SAAS,KAAK,WAAW,MAAM,GAAG,OAAO;AAC/C,cAAM,OAAO,KAAK,SACf,MAAM,CAAC,EACP,IAAI,WAAS,KAAK,MAAM,OAAO,OAAO,CAAC,EACvC,KAAK,IAAI;AACZ,eAAO,GAAG,MAAM,IAAI,IAAI;AAAA,MAC1B;AAAA,MACA,KAAK,QAAQ;AACX,eAAO,IAAI,KAAK,SAAS,IAAI,WAAS,KAAK,MAAM,OAAO,OAAO,CAAC,EAAE,KAAK,IAAI,CAAC;AAAA,MAC9E,KAAK,QAAQ;AACX,eAAO,IAAI,KAAK,SAAS,IAAI,WAAS,KAAK,MAAM,OAAO,OAAO,CAAC,EAAE,KAAK,IAAI,CAAC;AAAA,MAC9E,KAAK,QAAQ;AAAA,MACb,KAAK,QAAQ;AACX,eAAO,KAAK,SACT,IAAI,CAAC,OAAO,UAAU,KAAK,MAAM,OAAO,KAAK,aAAa,KAAK,QAAQ,OAAO,OAAO,CAAC,CAAC,EACvF,KAAK,IAAI;AAAA,MACd,KAAK,QAAQ;AACX,eAAO,IAAI,KAAK,SAAS,IAAI,CAAC,OAAO,UAAU,KAAK,MAAM,OAAO,KAAK,aAAa,KAAK,QAAQ,OAAO,OAAO,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC;AAAA,MAC9H,KAAK,QAAQ;AACX,eAAO,GAAG,KAAK,WAAW,MAAM,GAAG,KAAK,aAAa,KAAK,QAAQ,GAAG,OAAO,CAAC,CAAC,SAAI,KAAK,WAAW,MAAM,GAAG,OAAO,CAAC;AAAA,MACrH,KAAK,QAAQ;AACX,eAAO,KAAK,iBAAiB,UAAK,MAAM,OAAO;AAAA,MACjD,KAAK,QAAQ;AACX,eAAO,KAAK,iBAAiB,UAAK,MAAM,OAAO;AAAA,MACjD,KAAK,QAAQ;AACX,eAAO,KAAK,KAAK,WAAW,MAAM,GAAG,KAAK,aAAa,KAAK,QAAQ,GAAG,OAAO,CAAC,CAAC,SAAI,KAAK,WAAW,MAAM,GAAG,OAAO,CAAC,MAAM,KAAK,WAAW,MAAM,GAAG,OAAO,CAAC;AAAA,MAC9J,KAAK,QAAQ;AACX,eAAO,IAAI,KAAK,WAAW,MAAM,GAAG,KAAK,aAAa,KAAK,QAAQ,GAAG,OAAO,CAAC,CAAC,KAAK,KAAK,WAAW,MAAM,GAAG,OAAO,CAAC;AAAA,MACvH,KAAK,QAAQ;AACX,eAAO,GAAG,KAAK,WAAW,MAAM,GAAG,KAAK,aAAa,KAAK,QAAQ,GAAG,OAAO,CAAC,CAAC,UAAK,KAAK,WAAW,MAAM,GAAG,OAAO,CAAC;AAAA,MACtH,KAAK,QAAQ;AACX,eAAO,GAAG,KAAK,WAAW,MAAM,GAAG,KAAK,aAAa,KAAK,QAAQ,GAAG,OAAO,CAAC,CAAC,KAAK,KAAK,WAAW,MAAM,GAAG,OAAO,CAAC;AAAA,MACtH,KAAK,QAAQ,oBAAoB;AAC/B,cAAM,aAAa,KAAK,SACrB,MAAM,CAAC,EACP,IAAI,CAAC,OAAO,UAAU,KAAK,MAAM,OAAO,KAAK,aAAa,KAAK,QAAQ,QAAQ,GAAG,OAAO,CAAC,CAAC;AAC9F,cAAM,SAAS,KAAK,WAAW,MAAM,GAAG,OAAO;AAC/C,eAAO,KAAK,MAAM,MAAM,WAAW,KAAK,IAAI,CAAC;AAAA,MAC/C;AAAA,MACA,KAAK,QAAQ;AACX,eAAO,KAAK,KAAK,WAAW,MAAM,GAAG,KAAK,aAAa,KAAK,QAAQ,GAAG,OAAO,CAAC,CAAC,KAAK,KAAK,WAAW,MAAM,GAAG,OAAO,CAAC,MAAM,KAAK,WAAW,MAAM,GAAG,OAAO,CAAC;AAAA,MAC/J,KAAK,QAAQ;AACX,eAAO,KAAK,KAAK,WAAW,MAAM,GAAG,KAAK,aAAa,KAAK,QAAQ,GAAG,OAAO,CAAC,CAAC,KAAK,KAAK,WAAW,MAAM,GAAG,OAAO,CAAC,MAAM,KAAK,WAAW,MAAM,GAAG,OAAO,CAAC,MAAM,KAAK,WAAW,MAAM,GAAG,OAAO,CAAC;AAAA,MAEtM,KAAK,QAAQ;AACX,eAAO,KAAK,YAAY,KAAK,MAAM,OAAO;AAAA,MAC5C,KAAK,QAAQ;AACX,eAAO,KAAK,YAAY,KAAK,MAAM,OAAO;AAAA,MAC5C,KAAK,QAAQ;AACX,eAAO,KAAK,YAAY,KAAK,MAAM,OAAO;AAAA,MAC5C,KAAK,QAAQ;AACX,eAAO,KAAK,YAAY,KAAK,MAAM,OAAO;AAAA,MAC5C,KAAK,QAAQ;AACX,eAAO,KAAK,YAAY,KAAK,MAAM,OAAO;AAAA,MAC5C,KAAK,QAAQ;AACX,eAAO,KAAK,YAAY,UAAK,MAAM,OAAO;AAAA,MAC5C,KAAK,QAAQ;AACX,eAAO,KAAK,YAAY,UAAK,MAAM,OAAO;AAAA,MAC5C,KAAK,QAAQ;AACX,eAAO,KAAK,YAAY,KAAK,MAAM,OAAO;AAAA,MAC5C,KAAK,QAAQ;AACX,eAAO,KAAK,YAAY,UAAK,MAAM,OAAO;AAAA,MAC5C,KAAK,QAAQ;AACX,eAAO,KAAK,YAAY,KAAK,MAAM,OAAO;AAAA,MAC5C,KAAK,QAAQ;AACX,eAAO,KAAK,YAAY,UAAK,MAAM,OAAO;AAAA,MAC5C,KAAK,QAAQ;AACX,eAAO,KAAK,YAAY,UAAK,MAAM,OAAO;AAAA,MAC5C,KAAK,QAAQ;AACX,eAAO,KAAK,YAAY,UAAK,MAAM,OAAO;AAAA,MAC5C,KAAK,QAAQ;AACX,eAAO,KAAK,YAAY,UAAK,MAAM,OAAO;AAAA,MAC5C,KAAK,QAAQ;AACX,eAAO,KAAK,YAAY,UAAK,MAAM,OAAO;AAAA,MAC5C,KAAK,QAAQ;AACX,eAAO,KAAK,YAAY,UAAK,MAAM,OAAO;AAAA,MAC5C,KAAK,QAAQ;AACX,eAAO,KAAK,YAAY,UAAK,MAAM,OAAO;AAAA,MAC5C,KAAK,QAAQ;AACX,eAAO,KAAK,YAAY,UAAK,MAAM,OAAO;AAAA,MAC5C,KAAK,QAAQ;AACX,eAAO,KAAK,YAAY,QAAK,MAAM,OAAO;AAAA,MAC5C,KAAK,QAAQ;AACX,eAAO,KAAK,YAAY,UAAK,MAAM,OAAO;AAAA,MAC5C,KAAK,QAAQ;AACX,eAAO,KAAK,YAAY,UAAK,MAAM,OAAO;AAAA,MAC5C,KAAK,QAAQ;AACX,eAAO,KAAK,YAAY,MAAM,MAAM,OAAO;AAAA,MAC7C,KAAK,QAAQ;AACX,eAAO,KAAK,YAAY,UAAK,MAAM,OAAO;AAAA,MAC5C,KAAK,QAAQ;AACX,eAAO,OAAI,KAAK,aAAa,KAAK,WAAW,MAAM,GAAG,OAAO,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC;AAAA,MACnF;AACE,eAAO,KAAK,SAAS,IAAI,WAAS,KAAK,MAAM,OAAO,OAAO,CAAC,EAAE,KAAK,EAAE;AAAA,IACzE;AAAA,EACF;AAAA,EAEQ,WAAW,MAAe,OAAe,SAA+B;AAC9E,UAAM,QAAQ,KAAK,SAAS,KAAK;AACjC,QAAI,CAAC,OAAO;AACV,aAAO;AAAA,IACT;AACA,WAAO,KAAK,MAAM,OAAO,KAAK,aAAa,KAAK,QAAQ,OAAO,OAAO,CAAC;AAAA,EACzE;AAAA,EAEQ,iBAAiB,QAAgB,MAAe,SAA+B;AACrF,UAAM,cAAc,KAAK,WAAW,MAAM,GAAG,KAAK,aAAa,KAAK,QAAQ,GAAG,OAAO,CAAC;AACvF,UAAM,SAAS,KAAK,WAAW,MAAM,GAAG,OAAO;AAC/C,UAAM,WAAW,KAAK,SAAS,CAAC;AAChC,UAAM,WAAW,KAAK,WAAW,MAAM,GAAG,OAAO;AACjD,UAAM,OAAO,YAAY,KAAK,yBAAyB,QAAQ,IAAI,IAAI,QAAQ,MAAM;AACrF,WAAO,GAAG,MAAM,GAAG,WAAW,SAAI,MAAM,IAAI,IAAI;AAAA,EAClD;AAAA,EAEQ,yBAAyB,MAAwB;AACvD,UAAM,uBAAuB,KAAK,cAAc,QAAQ,iBAAiB;AACzE,UAAM,iBAAiB,KAAK,cAAc,KAAK,MAAM;AACrD,QAAI,yBAAyB,QAAQ,mBAAmB,MAAM;AAC5D,aAAO;AAAA,IACT;AACA,WAAO,iBAAiB;AAAA,EAC1B;AAAA,EAEQ,YAAY,QAAgB,MAAe,SAA+B;AAChF,QAAI,KAAK,cAAc,KAAK,MAAM,GAAG;AACnC,YAAMA,SAAQ,KAAK,SAAS,IAAI,CAAC,OAAO,UAAU;AAChD,cAAM,OAAO,KAAK,MAAM,OAAO,OAAO;AACtC,eAAO,KAAK,UAAU,MAAM,OAAO,KAAK,IAAI,IAAI,IAAI,MAAM;AAAA,MAC5D,CAAC;AACD,aAAOA,OAAM,KAAK,IAAI,MAAM,GAAG;AAAA,IACjC;AACA,UAAM,QAAQ,KAAK,SAAS,IAAI,WAAS,KAAK,aAAa,KAAK,MAAM,OAAO,OAAO,GAAG,KAAK,CAAC;AAC7F,WAAO,MAAM,KAAK,MAAM;AAAA,EAC1B;AAAA,EAEQ,UAAU,QAAiB,OAAgB,YAA6B;AAC9E,QAAI,KAAK,SAAS,MAAM,MAAM,GAAG;AAC/B,aAAO;AAAA,IACT;AACA,UAAM,mBAAmB,KAAK,cAAc,OAAO,MAAM;AACzD,UAAM,kBAAkB,KAAK,cAAc,MAAM,MAAM;AACvD,QAAI,qBAAqB,QAAQ,oBAAoB,MAAM;AACzD,aAAO;AAAA,IACT;AACA,QAAI,kBAAkB,kBAAkB;AACtC,aAAO;AAAA,IACT;AACA,QAAI,kBAAkB,kBAAkB;AACtC,aAAO;AAAA,IACT;AACA,QAAI,KAAK,cAAc,OAAO,MAAM,KAAK,MAAM,WAAW,OAAO,QAAQ;AACvE,aAAO;AAAA,IACT;AACA,QAAI,KAAK,kBAAkB,OAAO,MAAM,GAAG;AACzC,aAAO,aAAa;AAAA,IACtB;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,cAAc,QAA+B;AACnD,YAAQ,QAAQ;AAAA,MACd,KAAK,QAAQ;AACX,eAAO;AAAA,MACT,KAAK,QAAQ;AACX,eAAO;AAAA,MACT,KAAK,QAAQ;AACX,eAAO;AAAA,MACT,KAAK,QAAQ;AACX,eAAO;AAAA,MACT,KAAK,QAAQ;AAAA,MACb,KAAK,QAAQ;AACX,eAAO;AAAA,MACT,KAAK,QAAQ;AAAA,MACb,KAAK,QAAQ;AAAA,MACb,KAAK,QAAQ;AAAA,MACb,KAAK,QAAQ;AAAA,MACb,KAAK,QAAQ;AAAA,MACb,KAAK,QAAQ;AAAA,MACb,KAAK,QAAQ;AAAA,MACb,KAAK,QAAQ;AAAA,MACb,KAAK,QAAQ;AAAA,MACb,KAAK,QAAQ;AAAA,MACb,KAAK,QAAQ;AACX,eAAO;AAAA,MACT,KAAK,QAAQ;AAAA,MACb,KAAK,QAAQ;AAAA,MACb,KAAK,QAAQ;AAAA,MACb,KAAK,QAAQ;AACX,eAAO;AAAA,MACT,KAAK,QAAQ;AAAA,MACb,KAAK,QAAQ;AAAA,MACb,KAAK,QAAQ;AAAA,MACb,KAAK,QAAQ;AACX,eAAO;AAAA,MACT;AACE,eAAO;AAAA,IACX;AAAA,EACF;AAAA,EAEQ,cAAc,QAAyB;AAC7C,WACE,WAAW,QAAQ,QACnB,WAAW,QAAQ,YACnB,WAAW,QAAQ,aACnB,WAAW,QAAQ,YACnB,WAAW,QAAQ,oBACnB,WAAW,QAAQ,aACnB,WAAW,QAAQ,oBACnB,WAAW,QAAQ;AAAA,EAEvB;AAAA,EAEQ,kBAAkB,QAAyB;AACjD,WACE,WAAW,QAAQ,qBACnB,WAAW,QAAQ,SACnB,WAAW,QAAQ,aACnB,WAAW,QAAQ;AAAA,EAEvB;AAAA,EAEQ,cAAc,MAAe,SAA+B;AAClE,QAAI,UAAmB;AACvB,QAAI,QAAQ;AACZ,WAAO,QAAQ,WAAW,QAAQ,WAAW,QAAQ,SAAS,WAAW,GAAG;AAC1E,eAAS;AACT,gBAAU,QAAQ,SAAS,CAAC;AAAA,IAC9B;AACA,WAAO,GAAG,SAAI,OAAO,KAAK,CAAC,IAAI,KAAK,MAAM,SAAS,OAAO,CAAC;AAAA,EAC7D;AAAA,EAEQ,aAAa,MAAc,MAAuB;AACxD,QAAI,KAAK,SAAS,KAAK,MAAM,GAAG;AAC9B,aAAO;AAAA,IACT;AACA,WAAO,IAAI,IAAI;AAAA,EACjB;AAAA,EAEQ,SAAS,QAAyB;AACxC,WACE,WAAW,QAAQ,YACnB,WAAW,QAAQ,aACnB,WAAW,QAAQ,eACnB,WAAW,QAAQ,gBACnB,WAAW,QAAQ,cACnB,WAAW,QAAQ,eACnB,WAAW,QAAQ,qBACnB,WAAW,QAAQ,gBACnB,WAAW,QAAQ,gBACnB,WAAW,QAAQ,YACnB,WAAW,QAAQ,kBACnB,WAAW,QAAQ,SACnB,WAAW,QAAQ,WACnB,WAAW,QAAQ,UACnB,WAAW,QAAQ,UACnB,WAAW,QAAQ,QACnB,WAAW,QAAQ,UACnB,WAAW,QAAQ,QACnB,WAAW,QAAQ;AAAA,EAEvB;AAAA,EAEQ,cAAc,QAAyB;AAC7C,WACE,WAAW,QAAQ,aACnB,WAAW,QAAQ,YACnB,WAAW,QAAQ,qBACnB,WAAW,QAAQ;AAAA,EAEvB;AAAA,EAEQ,cAAc,MAAuB;AAC3C,WAAO,eAAe,IAAI,EAAE,KAAK,GAAG;AAAA,EACtC;AAAA,EAEQ,iBAAiB,QAAyB;AAChD,WACE,WAAW,QAAQ,qBACnB,WAAW,QAAQ,kBACnB,WAAW,QAAQ,uBACnB,WAAW,QAAQ,sBACnB,WAAW,QAAQ,sBACnB,WAAW,QAAQ,sBACnB,WAAW,QAAQ;AAAA,EAEvB;AAAA,EAEQ,aAAa,QAAgB,OAAe,QAAoC;AACtF,QAAI,CAAC,KAAK,QAAQ,WAAW;AAC3B,aAAO;AAAA,IACT;AAEA,UAAM,iBACF,WAAW,QAAQ,qBACnB,WAAW,QAAQ,kBACnB,WAAW,QAAQ,uBACnB,WAAW,QAAQ,WACnB,WAAW,QAAQ,UACnB,WAAW,QAAQ,sBACnB,WAAW,QAAQ,sBACnB,UAAU,KACX,WAAW,QAAQ,sBAAsB,UAAU,KACnD,WAAW,QAAQ,eAAe,UAAU,KAC7C,WAAW,QAAQ,iBACnB,WAAW,QAAQ;AAErB,WAAO,EAAE,kBAAkB,cAAc;AAAA,EAC3C;AAAA,EAEQ,aAAa,OAAuB;AAC1C,UAAM,QAAQ,KAAK,aAAa;AAChC,UAAM,QAAQ,KAAK,UAAU;AAC7B,UAAM,IAAI,OAAO,KAAK;AACtB,WAAO;AAAA,EACT;AAAA,EAEQ,aAAa,OAAuB;AAC1C,aAAS,QAAQ,KAAK,OAAO,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG;AAC/D,YAAMC,SAAQ,KAAK,OAAO,KAAK,EAAE,IAAI,KAAK;AAC1C,UAAIA,QAAO;AACT,eAAOA;AAAA,MACT;AAAA,IACF;AAEA,QAAI,QAAQ,KAAK,WAAW,IAAI,KAAK;AACrC,QAAI,CAAC,OAAO;AACV,cAAQ,KAAK,UAAU;AACvB,WAAK,WAAW,IAAI,OAAO,KAAK;AAAA,IAClC;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,eAAe,OAAuB;AAC5C,QAAI,UAAU,KAAK,SAAS,IAAI,KAAK;AACrC,QAAI,CAAC,SAAS;AACZ,WAAK,kBAAkB;AACvB,gBAAU,IAAI,KAAK,cAAc;AACjC,WAAK,SAAS,IAAI,OAAO,OAAO;AAAA,IAClC;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,aAAmB;AACzB,SAAK,OAAO,KAAK,oBAAI,IAAI,CAAC;AAAA,EAC5B;AAAA,EAEQ,WAAiB;AACvB,SAAK,OAAO,IAAI;AAAA,EAClB;AAAA,EAEQ,eAA2B;AACjC,UAAM,QAAQ,KAAK,OAAO,GAAG,EAAE;AAC/B,QAAI,CAAC,OAAO;AACV,YAAM,IAAI,MAAM,6CAA6C;AAAA,IAC/D;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,YAAoB;AAC1B,SAAK,gBAAgB;AACrB,WAAO,IAAI,KAAK,YAAY;AAAA,EAC9B;AACF;","names":["parts","local"]}

package/dist/rslang/parser/normalize.d.ts

@@ -0,0 +1,11 @@
+import { AstNode } from '../../parsing/ast.js';
+import '@lezer/common';
+
+/**
+ * Module: Transforming AST to a simple form.
+ */
+
+/** Normalizes AST to a simple form. */
+declare function normalizeAST(ast: AstNode, input: string): void;
+
+export { normalizeAST };