@rsconcept/domain 1.7.1 → 1.7.3

package/dist/cctext/language-api.d.ts

@@ -30,6 +30,8 @@ declare function parseEntityReference(text: string): EntityReference;
 declare function parseSyntacticReference(text: string): SyntacticReference;
 /** Extracts a validated reference from string representation. */
 declare function parseReference(text: string): IReference | null;
+/** Apply alias mapping to entity references in terminological text. */
+declare function applyEntityReferenceMapping(text: string, mapping: Record<string, string>): string;
 /** Extracts unique entity aliases referenced by text. */
 declare function extractEntities(text: string): string[];
 /** Resolves text references using nominal terms and optional manually edited forms. */
@@ -37,5 +39,5 @@ declare function resolveTextReferences(text: string, context: TermContext): stri
 /** Transforms {@link IReference} to string representation. */
 declare function referenceToString(ref: IReference): string;
 //#endregion
-export { Lexeme, extractEntities, generateNominalLexeme, parseEntityReference, parseGrammemes, parseReference, parseSyntacticReference, referenceToString, resolveTextReferences, wordFormEquals };
+export { Lexeme, applyEntityReferenceMapping, extractEntities, generateNominalLexeme, parseEntityReference, parseGrammemes, parseReference, parseSyntacticReference, referenceToString, resolveTextReferences, wordFormEquals };
 //# sourceMappingURL=language-api.d.ts.map

package/dist/cctext/language-api.js

@@ -71,6 +71,24 @@ function parseReference(text) {
 		}
 	};
 }
+/** Apply alias mapping to entity references in terminological text. */
+function applyEntityReferenceMapping(text, mapping) {
+	if (text === "" || Object.keys(mapping).length === 0) return text;
+	let posInput = 0;
+	let output = "";
+	for (const segment of text.matchAll(ENTITY_REFERENCE_PATTERN)) {
+		const entity = segment[1];
+		const start = segment.index ?? 0;
+		if (entity in mapping) {
+			output += text.substring(posInput, start + 2);
+			output += mapping[entity];
+			output += text.substring(start + 2 + entity.length, start + segment[0].length);
+			posInput = start + segment[0].length;
+		}
+	}
+	output += text.substring(posInput);
+	return output;
+}
 /** Extracts unique entity aliases referenced by text. */
 function extractEntities(text) {
 	const result = [];
@@ -177,6 +195,6 @@ function findSyntacticMaster(offset, index, references) {
 	}
 }
 //#endregion
-export { extractEntities, generateNominalLexeme, parseEntityReference, parseGrammemes, parseReference, parseSyntacticReference, referenceToString, resolveTextReferences, wordFormEquals };
+export { applyEntityReferenceMapping, extractEntities, generateNominalLexeme, parseEntityReference, parseGrammemes, parseReference, parseSyntacticReference, referenceToString, resolveTextReferences, wordFormEquals };
 
 //# sourceMappingURL=language-api.js.map

package/dist/cctext/language-api.js.map

@@ -1 +1 @@
-{"version":3,"file":"language-api.js","names":[],"sources":["../../src/cctext/language-api.ts"],"sourcesContent":["/**\n * Module: Natural language model API.\n */\n\nimport {\n  Case,\n  type EntityReference,\n  Grammeme,\n  type IReference,\n  Plurality,\n  ReferenceType,\n  type SyntacticReference,\n  type TermContext,\n  type TermContextItem,\n  type WordForm\n} from './language';\n\ninterface Position {\n  from: number;\n  to: number;\n}\n\ninterface ResolvedReference {\n  ref: IReference;\n  resolved: string;\n  posInput: Position;\n}\n\nconst REFERENCE_PATTERN = /@{[^{}]*?}/g;\nconst ENTITY_REFERENCE_PATTERN = /@{([^0-9\\-][^}|{]*?)\\|([^}|{]*?)}/g;\n\n/** Represents generated lexeme forms. */\nexport interface Lexeme {\n  items: { text: string; grams: string }[];\n}\n\n/** Equality comparator for {@link WordForm}. Compares a set of Grammemes attached to wordforms. */\nexport function wordFormEquals(left: WordForm, right: WordForm): boolean {\n  if (left.grams.length !== right.grams.length) {\n    return false;\n  }\n  for (let index = 0; index < left.grams.length; ++index) {\n    if (left.grams[index] !== right.grams[index]) {\n      return false;\n    }\n  }\n  return true;\n}\n\n/** Transforms {@link Grammeme} enumeration to {@link Grammeme}. */\nexport function parseGrammemes(termForm: string): Grammeme[] {\n  const result: Grammeme[] = [];\n  for (const chunk of termForm.split(',')) {\n    const gram = chunk.trim();\n    if (gram !== '') {\n      result.push(gram as Grammeme);\n    }\n  }\n  return result.sort(grammemeCompare);\n}\n\n/** Generates all supported noun forms using nominal text for every form. */\nexport function generateNominalLexeme(data: { text: string }): Lexeme {\n  return {\n    items: Plurality.flatMap(plurality =>\n      Case.map(gramCase => ({\n        text: data.text,\n        grams: `${plurality},${gramCase}`\n      }))\n    )\n  };\n}\n\n/**\n * Extracts {@link EntityReference} from string representation.\n *\n * @param text - Reference text in a valid pattern. Must fit format '\\@\\{GLOBAL_ID|GRAMMEMES\\}'\n */\nexport function parseEntityReference(text: string): EntityReference {\n  const ref = parseReference(text);\n  if (ref?.type !== ReferenceType.ENTITY) {\n    throw new Error(`Invalid entity reference: ${text}`);\n  }\n  return ref.data as EntityReference;\n}\n\n/**\n * Extracts {@link SyntacticReference} from string representation.\n *\n * @param text - Reference text in a valid pattern. Must fit format '\\@\\{OFFSET|NOMINAL_FORM\\}'\n */\nexport function parseSyntacticReference(text: string): SyntacticReference {\n  const ref = parseReference(text);\n  if (ref?.type !== ReferenceType.SYNTACTIC) {\n    throw new Error(`Invalid syntactic reference: ${text}`);\n  }\n  return ref.data as SyntacticReference;\n}\n\n/** Extracts a validated reference from string representation. */\nexport function parseReference(text: string): IReference | null {\n  if (text.length < 4 || !text.startsWith('@{') || !text.endsWith('}')) {\n    return null;\n  }\n\n  const blocks = text\n    .slice(2, text.length - 1)\n    .split('|')\n    .map(block => block.trim());\n  if (blocks.length !== 2 || blocks[0] === '' || blocks[0].startsWith('0')) {\n    return null;\n  }\n\n  if (blocks[0].startsWith('-') || /^[1-9]/.test(blocks[0])) {\n    const offset = Number(blocks[0]);\n    if (!Number.isInteger(offset) || offset === 0 || blocks[1] === '') {\n      return null;\n    }\n    return {\n      type: ReferenceType.SYNTACTIC,\n      data: { offset, nominal: blocks[1] }\n    };\n  }\n\n  return {\n    type: ReferenceType.ENTITY,\n    data: { entity: blocks[0], tags: parseGrammemes(blocks[1].replaceAll(' ', '')) }\n  };\n}\n\n/** Extracts unique entity aliases referenced by text. */\nexport function extractEntities(text: string): string[] {\n  const result: string[] = [];\n  for (const segment of text.matchAll(ENTITY_REFERENCE_PATTERN)) {\n    const entity = segment[1].trim();\n    if (!result.includes(entity)) {\n      result.push(entity);\n    }\n  }\n  return result;\n}\n\n/** Resolves text references using nominal terms and optional manually edited forms. */\nexport function resolveTextReferences(text: string, context: TermContext): string {\n  const references = parseReferences(text);\n  if (references.length === 0) {\n    return text;\n  }\n\n  for (const ref of references) {\n    if (ref.ref.type === ReferenceType.ENTITY) {\n      ref.resolved = resolveEntity(ref.ref.data as EntityReference, context);\n    }\n  }\n  references.forEach((ref, index) => {\n    if (ref.ref.type === ReferenceType.SYNTACTIC) {\n      ref.resolved = resolveSyntactic(ref.ref.data as SyntacticReference, index, references);\n    }\n  });\n\n  let posInput = 0;\n  let output = '';\n  for (const ref of references) {\n    output += text.substring(posInput, ref.posInput.from);\n    output += ref.resolved;\n    posInput = ref.posInput.to;\n  }\n  output += text.substring(posInput);\n  return output;\n}\n\n/** Transforms {@link IReference} to string representation. */\nexport function referenceToString(ref: IReference): string {\n  switch (ref.type) {\n    case ReferenceType.ENTITY: {\n      const entity = ref.data as EntityReference;\n      return `@{${entity.entity}|${entity.tags.join(',')}}`;\n    }\n    case ReferenceType.SYNTACTIC: {\n      const syntactic = ref.data as SyntacticReference;\n      return `@{${syntactic.offset}|${syntactic.nominal}}`;\n    }\n  }\n}\n\n// ===== Internals =======\n\n/** Compares {@link Grammeme} based on Grammeme enum and alpha order for strings. */\nfunction grammemeCompare(left: Grammeme, right: Grammeme): number {\n  const indexLeft = Object.values(Grammeme).findIndex(gram => gram === left);\n  const indexRight = Object.values(Grammeme).findIndex(gram => gram === right);\n  if (indexLeft === -1 && indexRight === -1) {\n    return left.localeCompare(right);\n  } else if (indexLeft === -1 && indexRight !== -1) {\n    return 1;\n  } else if (indexLeft !== -1 && indexRight === -1) {\n    return -1;\n  } else {\n    return indexLeft - indexRight;\n  }\n}\n\nfunction parseReferences(text: string): ResolvedReference[] {\n  const result: ResolvedReference[] = [];\n  for (const segment of text.matchAll(REFERENCE_PATTERN)) {\n    const ref = parseReference(segment[0]);\n    if (ref) {\n      result.push({\n        ref,\n        resolved: '',\n        posInput: { from: segment.index ?? 0, to: (segment.index ?? 0) + segment[0].length }\n      });\n    }\n  }\n  return result;\n}\n\nfunction resolveEntity(ref: EntityReference, context: TermContext): string {\n  const entity = context[ref.entity];\n  if (!entity) {\n    return `!Неизвестная сущность: ${ref.entity}!`;\n  }\n\n  const resolved = getEntityForm(entity, ref.tags);\n  return resolved === '' ? `!Отсутствует термин: ${ref.entity}!` : resolved;\n}\n\nfunction getEntityForm(entity: TermContextItem, grams: Grammeme[]): string {\n  if (grams.length === 0) {\n    return entity.nominal;\n  }\n\n  const manual = entity.forms?.find(form => matchGrams(grams, form.grams));\n  return manual?.text ?? entity.nominal;\n}\n\nfunction matchGrams(query: Grammeme[], candidate: Grammeme[]): boolean {\n  for (const gram of candidate) {\n    if (!query.includes(gram)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nfunction resolveSyntactic(ref: SyntacticReference, index: number, references: ResolvedReference[]): string {\n  const master = findSyntacticMaster(ref.offset, index, references);\n  if (!master) {\n    return `!Некорректное смещение: ${ref.offset}!`;\n  }\n  return ref.nominal;\n}\n\nfunction findSyntacticMaster(\n  offset: number,\n  index: number,\n  references: ResolvedReference[]\n): ResolvedReference | undefined {\n  if (offset > 0) {\n    let position = index + 1;\n    let left = offset;\n    while (position < references.length) {\n      if (references[position].ref.type === ReferenceType.ENTITY) {\n        if (left === 1) {\n          return references[position];\n        }\n        left -= 1;\n      }\n      position += 1;\n    }\n  } else {\n    let position = index - 1;\n    let left = offset;\n    while (position >= 0) {\n      if (references[position].ref.type === ReferenceType.ENTITY) {\n        if (left === -1) {\n          return references[position];\n        }\n        left += 1;\n      }\n      position -= 1;\n    }\n  }\n  return undefined;\n}\n"],"mappings":";;;;;AA4BA,MAAM,oBAAoB;AAC1B,MAAM,2BAA2B;;AAQjC,SAAgB,eAAe,MAAgB,OAA0B;CACvE,IAAI,KAAK,MAAM,WAAW,MAAM,MAAM,QACpC,OAAO;CAET,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,MAAM,QAAQ,EAAE,OAC/C,IAAI,KAAK,MAAM,WAAW,MAAM,MAAM,QACpC,OAAO;CAGX,OAAO;AACT;;AAGA,SAAgB,eAAe,UAA8B;CAC3D,MAAM,SAAqB,CAAC;CAC5B,KAAK,MAAM,SAAS,SAAS,MAAM,GAAG,GAAG;EACvC,MAAM,OAAO,MAAM,KAAK;EACxB,IAAI,SAAS,IACX,OAAO,KAAK,IAAgB;CAEhC;CACA,OAAO,OAAO,KAAK,eAAe;AACpC;;AAGA,SAAgB,sBAAsB,MAAgC;CACpE,OAAO,EACL,OAAO,UAAU,SAAQ,cACvB,KAAK,KAAI,cAAa;EACpB,MAAM,KAAK;EACX,OAAO,GAAG,UAAU,GAAG;CACzB,EAAE,CACJ,EACF;AACF;;;;;;AAOA,SAAgB,qBAAqB,MAA+B;CAClE,MAAM,MAAM,eAAe,IAAI;CAC/B,IAAI,KAAK,SAAS,cAAc,QAC9B,MAAM,IAAI,MAAM,6BAA6B,MAAM;CAErD,OAAO,IAAI;AACb;;;;;;AAOA,SAAgB,wBAAwB,MAAkC;CACxE,MAAM,MAAM,eAAe,IAAI;CAC/B,IAAI,KAAK,SAAS,cAAc,WAC9B,MAAM,IAAI,MAAM,gCAAgC,MAAM;CAExD,OAAO,IAAI;AACb;;AAGA,SAAgB,eAAe,MAAiC;CAC9D,IAAI,KAAK,SAAS,KAAK,CAAC,KAAK,WAAW,IAAI,KAAK,CAAC,KAAK,SAAS,GAAG,GACjE,OAAO;CAGT,MAAM,SAAS,KACZ,MAAM,GAAG,KAAK,SAAS,CAAC,CAAC,CACzB,MAAM,GAAG,CAAC,CACV,KAAI,UAAS,MAAM,KAAK,CAAC;CAC5B,IAAI,OAAO,WAAW,KAAK,OAAO,OAAO,MAAM,OAAO,EAAE,CAAC,WAAW,GAAG,GACrE,OAAO;CAGT,IAAI,OAAO,EAAE,CAAC,WAAW,GAAG,KAAK,SAAS,KAAK,OAAO,EAAE,GAAG;EACzD,MAAM,SAAS,OAAO,OAAO,EAAE;EAC/B,IAAI,CAAC,OAAO,UAAU,MAAM,KAAK,WAAW,KAAK,OAAO,OAAO,IAC7D,OAAO;EAET,OAAO;GACL,MAAM,cAAc;GACpB,MAAM;IAAE;IAAQ,SAAS,OAAO;GAAG;EACrC;CACF;CAEA,OAAO;EACL,MAAM,cAAc;EACpB,MAAM;GAAE,QAAQ,OAAO;GAAI,MAAM,eAAe,OAAO,EAAE,CAAC,WAAW,KAAK,EAAE,CAAC;EAAE;CACjF;AACF;;AAGA,SAAgB,gBAAgB,MAAwB;CACtD,MAAM,SAAmB,CAAC;CAC1B,KAAK,MAAM,WAAW,KAAK,SAAS,wBAAwB,GAAG;EAC7D,MAAM,SAAS,QAAQ,EAAE,CAAC,KAAK;EAC/B,IAAI,CAAC,OAAO,SAAS,MAAM,GACzB,OAAO,KAAK,MAAM;CAEtB;CACA,OAAO;AACT;;AAGA,SAAgB,sBAAsB,MAAc,SAA8B;CAChF,MAAM,aAAa,gBAAgB,IAAI;CACvC,IAAI,WAAW,WAAW,GACxB,OAAO;CAGT,KAAK,MAAM,OAAO,YAChB,IAAI,IAAI,IAAI,SAAS,cAAc,QACjC,IAAI,WAAW,cAAc,IAAI,IAAI,MAAyB,OAAO;CAGzE,WAAW,SAAS,KAAK,UAAU;EACjC,IAAI,IAAI,IAAI,SAAS,cAAc,WACjC,IAAI,WAAW,iBAAiB,IAAI,IAAI,MAA4B,OAAO,UAAU;CAEzF,CAAC;CAED,IAAI,WAAW;CACf,IAAI,SAAS;CACb,KAAK,MAAM,OAAO,YAAY;EAC5B,UAAU,KAAK,UAAU,UAAU,IAAI,SAAS,IAAI;EACpD,UAAU,IAAI;EACd,WAAW,IAAI,SAAS;CAC1B;CACA,UAAU,KAAK,UAAU,QAAQ;CACjC,OAAO;AACT;;AAGA,SAAgB,kBAAkB,KAAyB;CACzD,QAAQ,IAAI,MAAZ;EACE,KAAK,cAAc,QAAQ;GACzB,MAAM,SAAS,IAAI;GACnB,OAAO,KAAK,OAAO,OAAO,GAAG,OAAO,KAAK,KAAK,GAAG,EAAE;EACrD;EACA,KAAK,cAAc,WAAW;GAC5B,MAAM,YAAY,IAAI;GACtB,OAAO,KAAK,UAAU,OAAO,GAAG,UAAU,QAAQ;EACpD;CACF;AACF;;AAKA,SAAS,gBAAgB,MAAgB,OAAyB;CAChE,MAAM,YAAY,OAAO,OAAO,QAAQ,CAAC,CAAC,WAAU,SAAQ,SAAS,IAAI;CACzE,MAAM,aAAa,OAAO,OAAO,QAAQ,CAAC,CAAC,WAAU,SAAQ,SAAS,KAAK;CAC3E,IAAI,cAAc,MAAM,eAAe,IACrC,OAAO,KAAK,cAAc,KAAK;MAC1B,IAAI,cAAc,MAAM,eAAe,IAC5C,OAAO;MACF,IAAI,cAAc,MAAM,eAAe,IAC5C,OAAO;MAEP,OAAO,YAAY;AAEvB;AAEA,SAAS,gBAAgB,MAAmC;CAC1D,MAAM,SAA8B,CAAC;CACrC,KAAK,MAAM,WAAW,KAAK,SAAS,iBAAiB,GAAG;EACtD,MAAM,MAAM,eAAe,QAAQ,EAAE;EACrC,IAAI,KACF,OAAO,KAAK;GACV;GACA,UAAU;GACV,UAAU;IAAE,MAAM,QAAQ,SAAS;IAAG,KAAK,QAAQ,SAAS,KAAK,QAAQ,EAAE,CAAC;GAAO;EACrF,CAAC;CAEL;CACA,OAAO;AACT;AAEA,SAAS,cAAc,KAAsB,SAA8B;CACzE,MAAM,SAAS,QAAQ,IAAI;CAC3B,IAAI,CAAC,QACH,OAAO,0BAA0B,IAAI,OAAO;CAG9C,MAAM,WAAW,cAAc,QAAQ,IAAI,IAAI;CAC/C,OAAO,aAAa,KAAK,wBAAwB,IAAI,OAAO,KAAK;AACnE;AAEA,SAAS,cAAc,QAAyB,OAA2B;CACzE,IAAI,MAAM,WAAW,GACnB,OAAO,OAAO;CAIhB,QADe,OAAO,OAAO,MAAK,SAAQ,WAAW,OAAO,KAAK,KAAK,CAAC,EAChE,EAAQ,QAAQ,OAAO;AAChC;AAEA,SAAS,WAAW,OAAmB,WAAgC;CACrE,KAAK,MAAM,QAAQ,WACjB,IAAI,CAAC,MAAM,SAAS,IAAI,GACtB,OAAO;CAGX,OAAO;AACT;AAEA,SAAS,iBAAiB,KAAyB,OAAe,YAAyC;CAEzG,IAAI,CADW,oBAAoB,IAAI,QAAQ,OAAO,UACjD,GACH,OAAO,2BAA2B,IAAI,OAAO;CAE/C,OAAO,IAAI;AACb;AAEA,SAAS,oBACP,QACA,OACA,YAC+B;CAC/B,IAAI,SAAS,GAAG;EACd,IAAI,WAAW,QAAQ;EACvB,IAAI,OAAO;EACX,OAAO,WAAW,WAAW,QAAQ;GACnC,IAAI,WAAW,SAAS,CAAC,IAAI,SAAS,cAAc,QAAQ;IAC1D,IAAI,SAAS,GACX,OAAO,WAAW;IAEpB,QAAQ;GACV;GACA,YAAY;EACd;CACF,OAAO;EACL,IAAI,WAAW,QAAQ;EACvB,IAAI,OAAO;EACX,OAAO,YAAY,GAAG;GACpB,IAAI,WAAW,SAAS,CAAC,IAAI,SAAS,cAAc,QAAQ;IAC1D,IAAI,SAAS,IACX,OAAO,WAAW;IAEpB,QAAQ;GACV;GACA,YAAY;EACd;CACF;AAEF"}
+{"version":3,"file":"language-api.js","names":[],"sources":["../../src/cctext/language-api.ts"],"sourcesContent":["/**\n * Module: Natural language model API.\n */\n\nimport {\n  Case,\n  type EntityReference,\n  Grammeme,\n  type IReference,\n  Plurality,\n  ReferenceType,\n  type SyntacticReference,\n  type TermContext,\n  type TermContextItem,\n  type WordForm\n} from './language';\n\ninterface Position {\n  from: number;\n  to: number;\n}\n\ninterface ResolvedReference {\n  ref: IReference;\n  resolved: string;\n  posInput: Position;\n}\n\nconst REFERENCE_PATTERN = /@{[^{}]*?}/g;\nconst ENTITY_REFERENCE_PATTERN = /@{([^0-9\\-][^}|{]*?)\\|([^}|{]*?)}/g;\n\n/** Represents generated lexeme forms. */\nexport interface Lexeme {\n  items: { text: string; grams: string }[];\n}\n\n/** Equality comparator for {@link WordForm}. Compares a set of Grammemes attached to wordforms. */\nexport function wordFormEquals(left: WordForm, right: WordForm): boolean {\n  if (left.grams.length !== right.grams.length) {\n    return false;\n  }\n  for (let index = 0; index < left.grams.length; ++index) {\n    if (left.grams[index] !== right.grams[index]) {\n      return false;\n    }\n  }\n  return true;\n}\n\n/** Transforms {@link Grammeme} enumeration to {@link Grammeme}. */\nexport function parseGrammemes(termForm: string): Grammeme[] {\n  const result: Grammeme[] = [];\n  for (const chunk of termForm.split(',')) {\n    const gram = chunk.trim();\n    if (gram !== '') {\n      result.push(gram as Grammeme);\n    }\n  }\n  return result.sort(grammemeCompare);\n}\n\n/** Generates all supported noun forms using nominal text for every form. */\nexport function generateNominalLexeme(data: { text: string }): Lexeme {\n  return {\n    items: Plurality.flatMap(plurality =>\n      Case.map(gramCase => ({\n        text: data.text,\n        grams: `${plurality},${gramCase}`\n      }))\n    )\n  };\n}\n\n/**\n * Extracts {@link EntityReference} from string representation.\n *\n * @param text - Reference text in a valid pattern. Must fit format '\\@\\{GLOBAL_ID|GRAMMEMES\\}'\n */\nexport function parseEntityReference(text: string): EntityReference {\n  const ref = parseReference(text);\n  if (ref?.type !== ReferenceType.ENTITY) {\n    throw new Error(`Invalid entity reference: ${text}`);\n  }\n  return ref.data as EntityReference;\n}\n\n/**\n * Extracts {@link SyntacticReference} from string representation.\n *\n * @param text - Reference text in a valid pattern. Must fit format '\\@\\{OFFSET|NOMINAL_FORM\\}'\n */\nexport function parseSyntacticReference(text: string): SyntacticReference {\n  const ref = parseReference(text);\n  if (ref?.type !== ReferenceType.SYNTACTIC) {\n    throw new Error(`Invalid syntactic reference: ${text}`);\n  }\n  return ref.data as SyntacticReference;\n}\n\n/** Extracts a validated reference from string representation. */\nexport function parseReference(text: string): IReference | null {\n  if (text.length < 4 || !text.startsWith('@{') || !text.endsWith('}')) {\n    return null;\n  }\n\n  const blocks = text\n    .slice(2, text.length - 1)\n    .split('|')\n    .map(block => block.trim());\n  if (blocks.length !== 2 || blocks[0] === '' || blocks[0].startsWith('0')) {\n    return null;\n  }\n\n  if (blocks[0].startsWith('-') || /^[1-9]/.test(blocks[0])) {\n    const offset = Number(blocks[0]);\n    if (!Number.isInteger(offset) || offset === 0 || blocks[1] === '') {\n      return null;\n    }\n    return {\n      type: ReferenceType.SYNTACTIC,\n      data: { offset, nominal: blocks[1] }\n    };\n  }\n\n  return {\n    type: ReferenceType.ENTITY,\n    data: { entity: blocks[0], tags: parseGrammemes(blocks[1].replaceAll(' ', '')) }\n  };\n}\n\n/** Apply alias mapping to entity references in terminological text. */\nexport function applyEntityReferenceMapping(text: string, mapping: Record<string, string>): string {\n  if (text === '' || Object.keys(mapping).length === 0) {\n    return text;\n  }\n\n  let posInput = 0;\n  let output = '';\n  for (const segment of text.matchAll(ENTITY_REFERENCE_PATTERN)) {\n    const entity = segment[1];\n    const start = segment.index ?? 0;\n    if (entity in mapping) {\n      output += text.substring(posInput, start + 2);\n      output += mapping[entity];\n      output += text.substring(start + 2 + entity.length, start + segment[0].length);\n      posInput = start + segment[0].length;\n    }\n  }\n  output += text.substring(posInput);\n  return output;\n}\n\n/** Extracts unique entity aliases referenced by text. */\nexport function extractEntities(text: string): string[] {\n  const result: string[] = [];\n  for (const segment of text.matchAll(ENTITY_REFERENCE_PATTERN)) {\n    const entity = segment[1].trim();\n    if (!result.includes(entity)) {\n      result.push(entity);\n    }\n  }\n  return result;\n}\n\n/** Resolves text references using nominal terms and optional manually edited forms. */\nexport function resolveTextReferences(text: string, context: TermContext): string {\n  const references = parseReferences(text);\n  if (references.length === 0) {\n    return text;\n  }\n\n  for (const ref of references) {\n    if (ref.ref.type === ReferenceType.ENTITY) {\n      ref.resolved = resolveEntity(ref.ref.data as EntityReference, context);\n    }\n  }\n  references.forEach((ref, index) => {\n    if (ref.ref.type === ReferenceType.SYNTACTIC) {\n      ref.resolved = resolveSyntactic(ref.ref.data as SyntacticReference, index, references);\n    }\n  });\n\n  let posInput = 0;\n  let output = '';\n  for (const ref of references) {\n    output += text.substring(posInput, ref.posInput.from);\n    output += ref.resolved;\n    posInput = ref.posInput.to;\n  }\n  output += text.substring(posInput);\n  return output;\n}\n\n/** Transforms {@link IReference} to string representation. */\nexport function referenceToString(ref: IReference): string {\n  switch (ref.type) {\n    case ReferenceType.ENTITY: {\n      const entity = ref.data as EntityReference;\n      return `@{${entity.entity}|${entity.tags.join(',')}}`;\n    }\n    case ReferenceType.SYNTACTIC: {\n      const syntactic = ref.data as SyntacticReference;\n      return `@{${syntactic.offset}|${syntactic.nominal}}`;\n    }\n  }\n}\n\n// ===== Internals =======\n\n/** Compares {@link Grammeme} based on Grammeme enum and alpha order for strings. */\nfunction grammemeCompare(left: Grammeme, right: Grammeme): number {\n  const indexLeft = Object.values(Grammeme).findIndex(gram => gram === left);\n  const indexRight = Object.values(Grammeme).findIndex(gram => gram === right);\n  if (indexLeft === -1 && indexRight === -1) {\n    return left.localeCompare(right);\n  } else if (indexLeft === -1 && indexRight !== -1) {\n    return 1;\n  } else if (indexLeft !== -1 && indexRight === -1) {\n    return -1;\n  } else {\n    return indexLeft - indexRight;\n  }\n}\n\nfunction parseReferences(text: string): ResolvedReference[] {\n  const result: ResolvedReference[] = [];\n  for (const segment of text.matchAll(REFERENCE_PATTERN)) {\n    const ref = parseReference(segment[0]);\n    if (ref) {\n      result.push({\n        ref,\n        resolved: '',\n        posInput: { from: segment.index ?? 0, to: (segment.index ?? 0) + segment[0].length }\n      });\n    }\n  }\n  return result;\n}\n\nfunction resolveEntity(ref: EntityReference, context: TermContext): string {\n  const entity = context[ref.entity];\n  if (!entity) {\n    return `!Неизвестная сущность: ${ref.entity}!`;\n  }\n\n  const resolved = getEntityForm(entity, ref.tags);\n  return resolved === '' ? `!Отсутствует термин: ${ref.entity}!` : resolved;\n}\n\nfunction getEntityForm(entity: TermContextItem, grams: Grammeme[]): string {\n  if (grams.length === 0) {\n    return entity.nominal;\n  }\n\n  const manual = entity.forms?.find(form => matchGrams(grams, form.grams));\n  return manual?.text ?? entity.nominal;\n}\n\nfunction matchGrams(query: Grammeme[], candidate: Grammeme[]): boolean {\n  for (const gram of candidate) {\n    if (!query.includes(gram)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nfunction resolveSyntactic(ref: SyntacticReference, index: number, references: ResolvedReference[]): string {\n  const master = findSyntacticMaster(ref.offset, index, references);\n  if (!master) {\n    return `!Некорректное смещение: ${ref.offset}!`;\n  }\n  return ref.nominal;\n}\n\nfunction findSyntacticMaster(\n  offset: number,\n  index: number,\n  references: ResolvedReference[]\n): ResolvedReference | undefined {\n  if (offset > 0) {\n    let position = index + 1;\n    let left = offset;\n    while (position < references.length) {\n      if (references[position].ref.type === ReferenceType.ENTITY) {\n        if (left === 1) {\n          return references[position];\n        }\n        left -= 1;\n      }\n      position += 1;\n    }\n  } else {\n    let position = index - 1;\n    let left = offset;\n    while (position >= 0) {\n      if (references[position].ref.type === ReferenceType.ENTITY) {\n        if (left === -1) {\n          return references[position];\n        }\n        left += 1;\n      }\n      position -= 1;\n    }\n  }\n  return undefined;\n}\n"],"mappings":";;;;;AA4BA,MAAM,oBAAoB;AAC1B,MAAM,2BAA2B;;AAQjC,SAAgB,eAAe,MAAgB,OAA0B;CACvE,IAAI,KAAK,MAAM,WAAW,MAAM,MAAM,QACpC,OAAO;CAET,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,MAAM,QAAQ,EAAE,OAC/C,IAAI,KAAK,MAAM,WAAW,MAAM,MAAM,QACpC,OAAO;CAGX,OAAO;AACT;;AAGA,SAAgB,eAAe,UAA8B;CAC3D,MAAM,SAAqB,CAAC;CAC5B,KAAK,MAAM,SAAS,SAAS,MAAM,GAAG,GAAG;EACvC,MAAM,OAAO,MAAM,KAAK;EACxB,IAAI,SAAS,IACX,OAAO,KAAK,IAAgB;CAEhC;CACA,OAAO,OAAO,KAAK,eAAe;AACpC;;AAGA,SAAgB,sBAAsB,MAAgC;CACpE,OAAO,EACL,OAAO,UAAU,SAAQ,cACvB,KAAK,KAAI,cAAa;EACpB,MAAM,KAAK;EACX,OAAO,GAAG,UAAU,GAAG;CACzB,EAAE,CACJ,EACF;AACF;;;;;;AAOA,SAAgB,qBAAqB,MAA+B;CAClE,MAAM,MAAM,eAAe,IAAI;CAC/B,IAAI,KAAK,SAAS,cAAc,QAC9B,MAAM,IAAI,MAAM,6BAA6B,MAAM;CAErD,OAAO,IAAI;AACb;;;;;;AAOA,SAAgB,wBAAwB,MAAkC;CACxE,MAAM,MAAM,eAAe,IAAI;CAC/B,IAAI,KAAK,SAAS,cAAc,WAC9B,MAAM,IAAI,MAAM,gCAAgC,MAAM;CAExD,OAAO,IAAI;AACb;;AAGA,SAAgB,eAAe,MAAiC;CAC9D,IAAI,KAAK,SAAS,KAAK,CAAC,KAAK,WAAW,IAAI,KAAK,CAAC,KAAK,SAAS,GAAG,GACjE,OAAO;CAGT,MAAM,SAAS,KACZ,MAAM,GAAG,KAAK,SAAS,CAAC,CAAC,CACzB,MAAM,GAAG,CAAC,CACV,KAAI,UAAS,MAAM,KAAK,CAAC;CAC5B,IAAI,OAAO,WAAW,KAAK,OAAO,OAAO,MAAM,OAAO,EAAE,CAAC,WAAW,GAAG,GACrE,OAAO;CAGT,IAAI,OAAO,EAAE,CAAC,WAAW,GAAG,KAAK,SAAS,KAAK,OAAO,EAAE,GAAG;EACzD,MAAM,SAAS,OAAO,OAAO,EAAE;EAC/B,IAAI,CAAC,OAAO,UAAU,MAAM,KAAK,WAAW,KAAK,OAAO,OAAO,IAC7D,OAAO;EAET,OAAO;GACL,MAAM,cAAc;GACpB,MAAM;IAAE;IAAQ,SAAS,OAAO;GAAG;EACrC;CACF;CAEA,OAAO;EACL,MAAM,cAAc;EACpB,MAAM;GAAE,QAAQ,OAAO;GAAI,MAAM,eAAe,OAAO,EAAE,CAAC,WAAW,KAAK,EAAE,CAAC;EAAE;CACjF;AACF;;AAGA,SAAgB,4BAA4B,MAAc,SAAyC;CACjG,IAAI,SAAS,MAAM,OAAO,KAAK,OAAO,CAAC,CAAC,WAAW,GACjD,OAAO;CAGT,IAAI,WAAW;CACf,IAAI,SAAS;CACb,KAAK,MAAM,WAAW,KAAK,SAAS,wBAAwB,GAAG;EAC7D,MAAM,SAAS,QAAQ;EACvB,MAAM,QAAQ,QAAQ,SAAS;EAC/B,IAAI,UAAU,SAAS;GACrB,UAAU,KAAK,UAAU,UAAU,QAAQ,CAAC;GAC5C,UAAU,QAAQ;GAClB,UAAU,KAAK,UAAU,QAAQ,IAAI,OAAO,QAAQ,QAAQ,QAAQ,EAAE,CAAC,MAAM;GAC7E,WAAW,QAAQ,QAAQ,EAAE,CAAC;EAChC;CACF;CACA,UAAU,KAAK,UAAU,QAAQ;CACjC,OAAO;AACT;;AAGA,SAAgB,gBAAgB,MAAwB;CACtD,MAAM,SAAmB,CAAC;CAC1B,KAAK,MAAM,WAAW,KAAK,SAAS,wBAAwB,GAAG;EAC7D,MAAM,SAAS,QAAQ,EAAE,CAAC,KAAK;EAC/B,IAAI,CAAC,OAAO,SAAS,MAAM,GACzB,OAAO,KAAK,MAAM;CAEtB;CACA,OAAO;AACT;;AAGA,SAAgB,sBAAsB,MAAc,SAA8B;CAChF,MAAM,aAAa,gBAAgB,IAAI;CACvC,IAAI,WAAW,WAAW,GACxB,OAAO;CAGT,KAAK,MAAM,OAAO,YAChB,IAAI,IAAI,IAAI,SAAS,cAAc,QACjC,IAAI,WAAW,cAAc,IAAI,IAAI,MAAyB,OAAO;CAGzE,WAAW,SAAS,KAAK,UAAU;EACjC,IAAI,IAAI,IAAI,SAAS,cAAc,WACjC,IAAI,WAAW,iBAAiB,IAAI,IAAI,MAA4B,OAAO,UAAU;CAEzF,CAAC;CAED,IAAI,WAAW;CACf,IAAI,SAAS;CACb,KAAK,MAAM,OAAO,YAAY;EAC5B,UAAU,KAAK,UAAU,UAAU,IAAI,SAAS,IAAI;EACpD,UAAU,IAAI;EACd,WAAW,IAAI,SAAS;CAC1B;CACA,UAAU,KAAK,UAAU,QAAQ;CACjC,OAAO;AACT;;AAGA,SAAgB,kBAAkB,KAAyB;CACzD,QAAQ,IAAI,MAAZ;EACE,KAAK,cAAc,QAAQ;GACzB,MAAM,SAAS,IAAI;GACnB,OAAO,KAAK,OAAO,OAAO,GAAG,OAAO,KAAK,KAAK,GAAG,EAAE;EACrD;EACA,KAAK,cAAc,WAAW;GAC5B,MAAM,YAAY,IAAI;GACtB,OAAO,KAAK,UAAU,OAAO,GAAG,UAAU,QAAQ;EACpD;CACF;AACF;;AAKA,SAAS,gBAAgB,MAAgB,OAAyB;CAChE,MAAM,YAAY,OAAO,OAAO,QAAQ,CAAC,CAAC,WAAU,SAAQ,SAAS,IAAI;CACzE,MAAM,aAAa,OAAO,OAAO,QAAQ,CAAC,CAAC,WAAU,SAAQ,SAAS,KAAK;CAC3E,IAAI,cAAc,MAAM,eAAe,IACrC,OAAO,KAAK,cAAc,KAAK;MAC1B,IAAI,cAAc,MAAM,eAAe,IAC5C,OAAO;MACF,IAAI,cAAc,MAAM,eAAe,IAC5C,OAAO;MAEP,OAAO,YAAY;AAEvB;AAEA,SAAS,gBAAgB,MAAmC;CAC1D,MAAM,SAA8B,CAAC;CACrC,KAAK,MAAM,WAAW,KAAK,SAAS,iBAAiB,GAAG;EACtD,MAAM,MAAM,eAAe,QAAQ,EAAE;EACrC,IAAI,KACF,OAAO,KAAK;GACV;GACA,UAAU;GACV,UAAU;IAAE,MAAM,QAAQ,SAAS;IAAG,KAAK,QAAQ,SAAS,KAAK,QAAQ,EAAE,CAAC;GAAO;EACrF,CAAC;CAEL;CACA,OAAO;AACT;AAEA,SAAS,cAAc,KAAsB,SAA8B;CACzE,MAAM,SAAS,QAAQ,IAAI;CAC3B,IAAI,CAAC,QACH,OAAO,0BAA0B,IAAI,OAAO;CAG9C,MAAM,WAAW,cAAc,QAAQ,IAAI,IAAI;CAC/C,OAAO,aAAa,KAAK,wBAAwB,IAAI,OAAO,KAAK;AACnE;AAEA,SAAS,cAAc,QAAyB,OAA2B;CACzE,IAAI,MAAM,WAAW,GACnB,OAAO,OAAO;CAIhB,QADe,OAAO,OAAO,MAAK,SAAQ,WAAW,OAAO,KAAK,KAAK,CAAC,EAChE,EAAQ,QAAQ,OAAO;AAChC;AAEA,SAAS,WAAW,OAAmB,WAAgC;CACrE,KAAK,MAAM,QAAQ,WACjB,IAAI,CAAC,MAAM,SAAS,IAAI,GACtB,OAAO;CAGX,OAAO;AACT;AAEA,SAAS,iBAAiB,KAAyB,OAAe,YAAyC;CAEzG,IAAI,CADW,oBAAoB,IAAI,QAAQ,OAAO,UACjD,GACH,OAAO,2BAA2B,IAAI,OAAO;CAE/C,OAAO,IAAI;AACb;AAEA,SAAS,oBACP,QACA,OACA,YAC+B;CAC/B,IAAI,SAAS,GAAG;EACd,IAAI,WAAW,QAAQ;EACvB,IAAI,OAAO;EACX,OAAO,WAAW,WAAW,QAAQ;GACnC,IAAI,WAAW,SAAS,CAAC,IAAI,SAAS,cAAc,QAAQ;IAC1D,IAAI,SAAS,GACX,OAAO,WAAW;IAEpB,QAAQ;GACV;GACA,YAAY;EACd;CACF,OAAO;EACL,IAAI,WAAW,QAAQ;EACvB,IAAI,OAAO;EACX,OAAO,YAAY,GAAG;GACpB,IAAI,WAAW,SAAS,CAAC,IAAI,SAAS,cAAc,QAAQ;IAC1D,IAAI,SAAS,IACX,OAAO,WAAW;IAEpB,QAAQ;GACV;GACA,YAAY;EACd;CACF;AAEF"}

package/dist/expression-generator-CoucLIkE.d.ts

@@ -0,0 +1,10 @@
+import { t as AstNode } from "./ast-C8sIpKdL.js";
+//#region src/rslang/parser/expression-generator.d.ts
+interface ExpressionGeneratorOptions {
+  normalize?: boolean;
+}
+/** Generates Math-syntax RS expression from AST, with optional identifier normalization. */
+declare function generateExpressionFromAst(ast: AstNode, options?: ExpressionGeneratorOptions): string;
+//#endregion
+export { generateExpressionFromAst as t };
+//# sourceMappingURL=expression-generator-CoucLIkE.d.ts.map

package/dist/library/rsform-api.d.ts

@@ -3,6 +3,7 @@ import { g as TypeClass, y as TypePath } from "../typification-Dk-fisgO.js";
 import { t as ValueClass } from "../value-class-CNI-lqXJ.js";
 import { r as AnalysisFull } from "../analyzer-QxWs73gP.js";
 import { ArgumentValue, Constituenta, CstClass, CstStatus, CstType, RSForm, RSFormStats } from "./rsform.js";
+import { AliasMapping } from "../rslang/api.js";
 
 //#region src/library/rsform-api.d.ts
 /** Checks if {@link Constituenta} is a schema issue. */
@@ -48,6 +49,16 @@ declare function generateAlias(type: CstType, schema: RSForm, takenAliases?: str
 declare function inferNewSpawnPosition(schema: RSForm, targetId: number): number;
 /** Sorts library items relevant for InlineSynthesis with specified {@link RSForm}. */
 declare function sortItemsForInlineSynthesis(receiver: RSForm, items: readonly LibraryItem[]): LibraryItem[];
+/** Fields of {@link Constituenta} that are updated by alias mapping. */
+interface ConstituentaMappableFields {
+  alias: string;
+  definition_formal: string;
+  typification_manual: string;
+  term_raw: string;
+  definition_raw: string;
+}
+/** Remap formal expressions and terminological entity references in constituent fields. */
+declare function applyMappingToConstituents<T extends ConstituentaMappableFields>(items: T[], mapping: AliasMapping, changeAliases: boolean): void;
 /** Remove alias from expression. */
 declare function removeAliasReference(expression: string, alias: string): string;
 /** Add alias to expression. */
@@ -65,5 +76,5 @@ declare function findCstByStructure(schema: RSForm, target: Constituenta, path:
 /** Retrieves name for piece of target {@link Constituenta} structure. */
 declare function getStructureName(schema: RSForm, target: Constituenta, path: TypePath): string;
 //#endregion
-export { addAliasReference, applyFilterCategory, calculateSchemaStats, canHaveFormalDefinition, canHaveManualTypification, canProduceStructure, findCstByStructure, generateAlias, getAnalysisFor, getCstTypePrefix, getStructureName, guessCstType, inferClass, inferNewSpawnPosition, inferStatus, inferTemplate, inferTemplatedType, isBaseSet, isBasicConcept, isFunctional, isLogical, isSchemaIssue, isTemplateCst, removeAliasReference, sortItemsForInlineSynthesis, typeClassForCstType, validateAliasFormat, validateNewAlias };
+export { ConstituentaMappableFields, addAliasReference, applyFilterCategory, applyMappingToConstituents, calculateSchemaStats, canHaveFormalDefinition, canHaveManualTypification, canProduceStructure, findCstByStructure, generateAlias, getAnalysisFor, getCstTypePrefix, getStructureName, guessCstType, inferClass, inferNewSpawnPosition, inferStatus, inferTemplate, inferTemplatedType, isBaseSet, isBasicConcept, isFunctional, isLogical, isSchemaIssue, isTemplateCst, removeAliasReference, sortItemsForInlineSynthesis, typeClassForCstType, validateAliasFormat, validateNewAlias };
 //# sourceMappingURL=rsform-api.d.ts.map

package/dist/library/rsform-api.js

@@ -4,6 +4,8 @@ import { applyPath } from "../rslang/semantic/typification-api.js";
 import { ValueClass } from "../rslang/semantic/value-class.js";
 import "../rslang/index.js";
 import { CstClass, CstStatus, CstType } from "./rsform.js";
+import { applyEntityReferenceMapping } from "../cctext/language-api.js";
+import { applyAliasMapping, applyTypificationMapping } from "../rslang/api.js";
 //#region src/library/rsform-api.ts
 /**
 * Module: API for formal representation for systems of concepts.
@@ -219,6 +221,16 @@ function sortItemsForInlineSynthesis(receiver, items) {
 	for (const item of items) if (!result.includes(item)) result.push(item);
 	return result;
 }
+/** Remap formal expressions and terminological entity references in constituent fields. */
+function applyMappingToConstituents(items, mapping, changeAliases) {
+	for (const cst of items) {
+		if (changeAliases && cst.alias in mapping) cst.alias = mapping[cst.alias];
+		cst.definition_formal = applyAliasMapping(cst.definition_formal, mapping);
+		cst.typification_manual = applyTypificationMapping(cst.typification_manual, mapping);
+		cst.term_raw = applyEntityReferenceMapping(cst.term_raw, mapping);
+		cst.definition_raw = applyEntityReferenceMapping(cst.definition_raw, mapping);
+	}
+}
 /** Remove alias from expression. */
 function removeAliasReference(expression, alias) {
 	const result = expression.replaceAll(new RegExp(`\\b${alias}\\b`, "g"), "DEL");
@@ -363,6 +375,6 @@ function typeCanProduceStructure(type) {
 	else return type.base.typeID !== TypeID.basic && type.base.typeID !== TypeID.integer && type.base.typeID !== TypeID.anyTypification;
 }
 //#endregion
-export { addAliasReference, applyFilterCategory, calculateSchemaStats, canHaveFormalDefinition, canHaveManualTypification, canProduceStructure, findCstByStructure, generateAlias, getAnalysisFor, getCstTypePrefix, getStructureName, guessCstType, inferClass, inferNewSpawnPosition, inferStatus, inferTemplate, inferTemplatedType, isBaseSet, isBasicConcept, isFunctional, isLogical, isSchemaIssue, isTemplateCst, removeAliasReference, sortItemsForInlineSynthesis, typeClassForCstType, validateAliasFormat, validateNewAlias };
+export { addAliasReference, applyFilterCategory, applyMappingToConstituents, calculateSchemaStats, canHaveFormalDefinition, canHaveManualTypification, canProduceStructure, findCstByStructure, generateAlias, getAnalysisFor, getCstTypePrefix, getStructureName, guessCstType, inferClass, inferNewSpawnPosition, inferStatus, inferTemplate, inferTemplatedType, isBaseSet, isBasicConcept, isFunctional, isLogical, isSchemaIssue, isTemplateCst, removeAliasReference, sortItemsForInlineSynthesis, typeClassForCstType, validateAliasFormat, validateNewAlias };
 
 //# sourceMappingURL=rsform-api.js.map

package/dist/library/rsform-api.js.map

@@ -1 +1 @@
-{"version":3,"file":"rsform-api.js","names":[],"sources":["../../src/library/rsform-api.ts"],"sourcesContent":["/**\n * Module: API for formal representation for systems of concepts.\n */\n\nimport {\n  type AnalysisFull,\n  RSErrorCode,\n  TypeClass,\n  TypeID,\n  type TypePath,\n  type Typification,\n  ValueClass\n} from '../rslang';\nimport { basic, bool, constant, type EchelonFunctional, isTypification } from '../rslang/semantic/typification';\nimport { applyPath } from '../rslang/semantic/typification-api';\n\nimport { type LibraryItem } from './library';\nimport {\n  type ArgumentValue,\n  type Constituenta,\n  CstClass,\n  CstStatus,\n  CstType,\n  type RSForm,\n  type RSFormStats\n} from './rsform';\n\n/** Record of {@link CstType} prefixes. */\nconst CST_TYPE_PREFIX: Record<CstType, string> = {\n  [CstType.NOMINAL]: 'N',\n  [CstType.BASE]: 'X',\n  [CstType.CONSTANT]: 'C',\n  [CstType.STRUCTURED]: 'S',\n  [CstType.AXIOM]: 'A',\n  [CstType.TERM]: 'D',\n  [CstType.FUNCTION]: 'F',\n  [CstType.PREDICATE]: 'P',\n  [CstType.STATEMENT]: 'T'\n};\n\n/** Record of {@link CstType} to {@link CstClass} mapping. */\nconst CST_TYPE_TO_CLASS: Record<CstType, CstClass> = {\n  [CstType.NOMINAL]: CstClass.NOMINAL,\n  [CstType.BASE]: CstClass.BASIC,\n  [CstType.CONSTANT]: CstClass.BASIC,\n  [CstType.STRUCTURED]: CstClass.BASIC,\n  [CstType.TERM]: CstClass.DERIVED,\n  [CstType.FUNCTION]: CstClass.DERIVED,\n  [CstType.AXIOM]: CstClass.STATEMENT,\n  [CstType.PREDICATE]: CstClass.DERIVED,\n  [CstType.STATEMENT]: CstClass.STATEMENT\n};\n\n/** Checks if {@link Constituenta} is a schema issue. */\nexport function isSchemaIssue(cst: Constituenta): boolean {\n  if (\n    cst.homonyms.length > 0 ||\n    cst.formalDuplicates.length > 0 ||\n    cst.status === CstStatus.INCORRECT ||\n    cst.status === CstStatus.INCALCULABLE ||\n    cst.is_type_mismatch\n  ) {\n    return true;\n  }\n  if (isBasicConcept(cst.cst_type) && !isLogical(cst.cst_type)) {\n    if (!cst.convention || !cst.term_resolved) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/** Infers the status of an expression based on parsing and value information. */\nexport function inferStatus(parse: boolean, value?: ValueClass | null): CstStatus {\n  if (!parse) {\n    return CstStatus.INCORRECT;\n  }\n  if (value === null) {\n    return CstStatus.INCALCULABLE;\n  }\n  if (value === ValueClass.PROPERTY) {\n    return CstStatus.PROPERTY;\n  }\n  return CstStatus.VERIFIED;\n}\n\n/** Infers type of constituent for a given template and arguments. */\nexport function inferTemplatedType(templateType: CstType, args: ArgumentValue[]): CstType {\n  if (args.length === 0 || args.some(arg => !arg.value)) {\n    return templateType;\n  } else if (templateType === CstType.PREDICATE) {\n    return CstType.AXIOM;\n  } else {\n    return CstType.TERM;\n  }\n}\n\n/** Checks if given expression is a template. */\nexport function inferTemplate(expression: string): boolean {\n  const match = expression.match(/R\\d+/g);\n  return (match && match?.length > 0) ?? false;\n}\n\n/** Infers the {@link CstClass} based on the provided {@link CstType} and template status. */\nexport function inferClass(type: CstType, isTemplate: boolean = false): CstClass {\n  if (isTemplate) {\n    return CstClass.TEMPLATE;\n  }\n  return CST_TYPE_TO_CLASS[type];\n}\n\n/** Check if {@link Constituenta} is a template or a category. */\nexport function isTemplateCst(cst: Constituenta): boolean {\n  return cst.cst_type === CstType.FUNCTION || cst.cst_type === CstType.PREDICATE || cst.cst_type === CstType.STATEMENT;\n}\n\n/** Apply filter based on start {@link Constituenta} type. */\nexport function applyFilterCategory(start: Constituenta, items: Constituenta[]): Constituenta[] {\n  const startIndex = items.indexOf(start);\n  if (startIndex === -1) {\n    return [];\n  }\n  const nextCategoryIndex = items.findIndex((cst, index) => index > startIndex && cst.cst_type === CstType.STATEMENT);\n\n  return items.filter((_, index) => index >= startIndex && (nextCategoryIndex === -1 || index < nextCategoryIndex));\n}\n\n/** Prefix for alias indicating {@link CstType}. */\nexport function getCstTypePrefix(type: CstType): string {\n  return CST_TYPE_PREFIX[type];\n}\n\n/** Guess {@link CstType} from user input hint. */\nexport function guessCstType(hint: string): CstType | null {\n  if (hint.length !== 1) {\n    return null;\n  }\n  for (const [type, prefix] of Object.entries(CST_TYPE_PREFIX)) {\n    if (hint === prefix) {\n      return type as CstType;\n    }\n  }\n  return null;\n}\n\n/** Evaluate if {@link CstType} is basic concept. */\nexport function isBasicConcept(type: CstType): boolean {\n  switch (type) {\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.STRUCTURED:\n    case CstType.AXIOM:\n      return true;\n\n    case CstType.TERM:\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n    case CstType.STATEMENT:\n      return false;\n  }\n}\n\n/** Evaluate if {@link CstType} is base set or constant set. */\nexport function isBaseSet(type: CstType): boolean {\n  switch (type) {\n    case CstType.BASE:\n    case CstType.CONSTANT:\n      return true;\n\n    case CstType.NOMINAL:\n    case CstType.STRUCTURED:\n    case CstType.AXIOM:\n    case CstType.TERM:\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n    case CstType.STATEMENT:\n      return false;\n  }\n}\n\n/** Evaluate if {@link CstType} is a function. */\nexport function isFunctional(type: CstType): boolean {\n  switch (type) {\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n      return true;\n\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.STRUCTURED:\n    case CstType.AXIOM:\n    case CstType.TERM:\n    case CstType.STATEMENT:\n      return false;\n  }\n}\n\n/** Evaluate if {@link CstType} is logical. */\nexport function isLogical(type: CstType): boolean {\n  switch (type) {\n    case CstType.AXIOM:\n    case CstType.STATEMENT:\n      return true;\n\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.STRUCTURED:\n    case CstType.TERM:\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n      return false;\n  }\n}\n\n/** Evaluate if {@link Constituenta} can be used produce structure. */\nexport function canProduceStructure(cst: Constituenta): boolean {\n  switch (cst.cst_type) {\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.AXIOM:\n    case CstType.STATEMENT:\n    case CstType.PREDICATE:\n      return false;\n  }\n  if (!cst.effectiveType) {\n    return false;\n  }\n  if (cst.cst_type === CstType.FUNCTION) {\n    const result = (cst.effectiveType as EchelonFunctional).result;\n    return typeCanProduceStructure(result);\n  }\n  if (!isTypification(cst.effectiveType)) {\n    return false;\n  }\n  return typeCanProduceStructure(cst.effectiveType as Typification);\n}\n\n/** Evaluate if {@link CstType} can have manual typification. */\nexport function canHaveManualTypification(type: CstType): boolean {\n  switch (type) {\n    case CstType.STRUCTURED:\n    case CstType.TERM:\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n      return true;\n\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.AXIOM:\n    case CstType.STATEMENT:\n      return false;\n  }\n}\n\n/** Validate alias format for a given {@link CstType} (prefix + digits, min length 2). */\nexport function validateAliasFormat(alias: string, type: CstType): boolean {\n  if (alias.length < 2) {\n    return false;\n  }\n  const prefix = getCstTypePrefix(type);\n  if (!alias.startsWith(prefix)) {\n    return false;\n  }\n  if (!/^\\d+$/.exec(alias.substring(prefix.length))) {\n    return false;\n  }\n  return true;\n}\n\n/** Validate new alias against {@link CstType} and {@link RSForm}. */\nexport function validateNewAlias(alias: string, type: CstType, schema: RSForm): boolean {\n  if (!validateAliasFormat(alias, type)) {\n    return false;\n  }\n  if (schema.cstByAlias.has(alias)) {\n    return false;\n  }\n  return true;\n}\n\n/** Generate alias for new {@link Constituenta} of a given {@link CstType} for current {@link RSForm}. */\nexport function generateAlias(type: CstType, schema: RSForm, takenAliases: string[] = []): string {\n  const prefix = getCstTypePrefix(type);\n  if (schema.items.length <= 0) {\n    return `${prefix}1`;\n  }\n  let index = schema.items.reduce((prev, cst, index) => {\n    if (cst.cst_type !== type) {\n      return prev;\n    }\n    index = Number(cst.alias.slice(1 - cst.alias.length)) + 1;\n    return Math.max(prev, index);\n  }, 1);\n  let alias = `${prefix}${index}`;\n  while (takenAliases.includes(alias)) {\n    index = index + 1;\n    alias = `${prefix}${index}`;\n  }\n  return alias;\n}\n\n/**\n * Id to pass as `insert_after` when creating a new {@link Constituenta} spawned by `targetId`:\n * after the last existing child of that spawner, or after the spawner itself if none.\n */\nexport function inferNewSpawnPosition(schema: RSForm, targetId: number): number {\n  let last: number | null = null;\n  for (const cst of schema.items) {\n    if (cst.spawner === targetId) {\n      last = cst.id;\n    }\n  }\n  return last ?? targetId;\n}\n\n/** Sorts library items relevant for InlineSynthesis with specified {@link RSForm}. */\nexport function sortItemsForInlineSynthesis(receiver: RSForm, items: readonly LibraryItem[]): LibraryItem[] {\n  const result = items.filter(item => item.location === receiver.location);\n  for (const item of items) {\n    if (item.visible && item.owner === item.owner && !result.includes(item)) {\n      result.push(item);\n    }\n  }\n  for (const item of items) {\n    if (item.visible && !result.includes(item)) {\n      result.push(item);\n    }\n  }\n  for (const item of items) {\n    if (!result.includes(item)) {\n      result.push(item);\n    }\n  }\n  return result;\n}\n\n/** Remove alias from expression. */\nexport function removeAliasReference(expression: string, alias: string): string {\n  const result = expression.replaceAll(new RegExp(`\\\\b${alias}\\\\b`, 'g'), 'DEL');\n  return result === 'DEL' ? '' : result;\n}\n\n/** Add alias to expression. */\nexport function addAliasReference(expression: string, alias: string): string {\n  return expression + ' ' + alias;\n}\n\n/** Returns expected {@link TypeClass} of formal definition for {@link CstType}. */\nexport function typeClassForCstType(cstType: CstType): TypeClass {\n  switch (cstType) {\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.STRUCTURED:\n    case CstType.TERM:\n      return TypeClass.typification;\n    case CstType.FUNCTION:\n      return TypeClass.function;\n    case CstType.PREDICATE:\n      return TypeClass.predicate;\n    case CstType.AXIOM:\n    case CstType.STATEMENT:\n      return TypeClass.logic;\n  }\n}\n\n/** Checks whether a constituenta type supports formal definitions. */\nexport function canHaveFormalDefinition(cstType: CstType): boolean {\n  return cstType !== CstType.BASE && cstType !== CstType.CONSTANT;\n}\n\n/** Analyze expression for {@link RSForm}. */\nexport function getAnalysisFor(expression: string, cstType: CstType, schema: RSForm, alias?: string): AnalysisFull {\n  if (!canHaveFormalDefinition(cstType)) {\n    if (expression.trim().length === 0) {\n      const fallbackAlias = alias && alias.length > 0 ? alias : 'X0';\n      const type = cstType === CstType.BASE ? bool(basic(fallbackAlias)) : bool(constant(fallbackAlias));\n      return {\n        success: true,\n        type,\n        valueClass: ValueClass.VALUE,\n        errors: [],\n        ast: null\n      };\n    }\n    return {\n      success: false,\n      type: null,\n      valueClass: null,\n      errors: [\n        {\n          code: RSErrorCode.definitionNotAllowed,\n          from: 0,\n          to: Math.max(expression.length, 1),\n          params: [cstType, alias ?? '']\n        }\n      ],\n      ast: null\n    };\n  }\n  return schema.analyzer.checkFull(expression, {\n    expected: typeClassForCstType(cstType),\n    isDomain: cstType === CstType.STRUCTURED\n  });\n}\n\n/** Calculate statistics for {@link RSForm}. */\nexport function calculateSchemaStats(target: RSForm): RSFormStats {\n  const items = target.items;\n  return {\n    count_all: items.length,\n    count_crucial: items.reduce((sum, cst) => sum + (cst.crucial ? 1 : 0), 0),\n\n    step_complexity: items.reduce((sum, cst) => sum + calculateStepComplexity(cst), 0),\n\n    count_problematic: items.reduce((sum, cst) => sum + (isSchemaIssue(cst) ? 1 : 0), 0),\n    count_homonyms: items.reduce((sum, cst) => sum + (cst.homonyms.length > 0 ? 1 : 0), 0),\n    count_formal_duplicates: items.reduce((sum, cst) => sum + (cst.formalDuplicates.length > 0 ? 1 : 0), 0),\n    count_missing_convention: items.reduce((sum, cst) => sum + (isMissingConvention(cst) ? 1 : 0), 0),\n    count_type_mismatch: items.reduce((sum, cst) => sum + (cst.is_type_mismatch ? 1 : 0), 0),\n\n    count_incorrect: items.reduce((sum, cst) => sum + (cst.status === CstStatus.INCORRECT ? 1 : 0), 0),\n    count_property: items.reduce((sum, cst) => sum + (cst.analysis?.valueClass === ValueClass.PROPERTY ? 1 : 0), 0),\n    count_incalculable: items.reduce(\n      (sum, cst) => sum + (cst.analysis?.success && cst.analysis.valueClass === null ? 1 : 0),\n      0\n    ),\n    count_inherited: items.reduce((sum, cst) => sum + (cst.is_inherited ? 1 : 0), 0),\n\n    count_text_term: items.reduce((sum, cst) => sum + (cst.term_raw ? 1 : 0), 0),\n    count_definition: items.reduce((sum, cst) => sum + (cst.definition_raw ? 1 : 0), 0),\n    count_convention: items.reduce((sum, cst) => sum + (isBasicConcept(cst.cst_type) && cst.convention ? 1 : 0), 0),\n    count_comment: items.reduce((sum, cst) => sum + (!isBasicConcept(cst.cst_type) && !cst.convention ? 1 : 0), 0),\n\n    count_base: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.BASE ? 1 : 0), 0),\n    count_constant: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.CONSTANT ? 1 : 0), 0),\n    count_structured: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.STRUCTURED ? 1 : 0), 0),\n    count_axiom: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.AXIOM ? 1 : 0), 0),\n    count_term: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.TERM ? 1 : 0), 0),\n    count_function: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.FUNCTION ? 1 : 0), 0),\n    count_predicate: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.PREDICATE ? 1 : 0), 0),\n    count_statement: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.STATEMENT ? 1 : 0), 0),\n    count_nominal: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.NOMINAL ? 1 : 0), 0)\n  };\n}\n\n/** Finds {@link Constituenta} by structure path. */\nexport function findCstByStructure(schema: RSForm, target: Constituenta, path: TypePath): Constituenta | null {\n  for (const cst of schema.items) {\n    if (cst.spawner === target.id && cst.spawner_path) {\n      if (cst.spawner_path.length === path.length && cst.spawner_path.every((v, i) => v === path[i])) {\n        return cst;\n      }\n    }\n  }\n  return null;\n}\n\n/** Retrieves name for piece of target {@link Constituenta} structure. */\nexport function getStructureName(schema: RSForm, target: Constituenta, path: TypePath): string {\n  const representation = findCstByStructure(schema, target, path);\n  if (representation) {\n    return `${representation.alias}: ${representation.term_resolved}`;\n  }\n  if (!isTypification(target.effectiveType)) {\n    return '';\n  }\n  const type = applyPath(target.effectiveType as Typification, path);\n  if (type?.typeID === TypeID.basic) {\n    const cst = schema.cstByAlias.get(type.baseID);\n    if (cst?.term_resolved) {\n      return `${cst.alias}: ${cst.term_resolved}`;\n    }\n  }\n  return '';\n}\n\n// ========= Internals =====\nfunction calculateStepComplexity(cst: Constituenta): number {\n  if (cst.cst_type === CstType.AXIOM || cst.cst_type === CstType.NOMINAL || !isBasicConcept(cst.cst_type)) {\n    return 0;\n  }\n  if (cst.cst_type === CstType.BASE || cst.cst_type === CstType.CONSTANT || !cst.effectiveType) {\n    return 1;\n  }\n\n  const type = cst.effectiveType as Typification;\n  return calculateTypificationComplexity(type) + 1;\n}\n\nfunction calculateTypificationComplexity(type: Typification): number {\n  switch (type.typeID) {\n    case TypeID.basic:\n    case TypeID.integer:\n    case TypeID.anyTypification:\n      return 0;\n    case TypeID.tuple:\n      return (\n        type.factors.length + type.factors.reduce((sum, factor) => sum + calculateTypificationComplexity(factor), 0)\n      );\n    case TypeID.collection:\n      if (type.base.typeID === TypeID.tuple) {\n        let sum = 0;\n        type.base.factors.forEach(factor => {\n          sum += calculateTypificationComplexity(factor);\n        });\n        return sum + type.base.factors.length;\n      } else if (type.base.typeID === TypeID.collection) {\n        return calculateTypificationComplexity(type.base) + 1;\n      }\n      return 0;\n  }\n}\n\nfunction isMissingConvention(cst: Constituenta): boolean {\n  if (isBasicConcept(cst.cst_type) && !isLogical(cst.cst_type)) {\n    if (!cst.convention || !cst.term_resolved) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/** Evaluate if {@link Typification} can be used to produce structure. */\nfunction typeCanProduceStructure(type: Typification): boolean {\n  if (type.typeID === TypeID.basic || type.typeID === TypeID.integer || type.typeID === TypeID.anyTypification) {\n    return false;\n  } else if (type.typeID === TypeID.tuple) {\n    return true;\n  } else {\n    return (\n      type.base.typeID !== TypeID.basic &&\n      type.base.typeID !== TypeID.integer &&\n      type.base.typeID !== TypeID.anyTypification\n    );\n  }\n}\n"],"mappings":";;;;;;;;;;;AA4BA,MAAM,kBAA2C;EAC9C,QAAQ,UAAU;EAClB,QAAQ,OAAO;EACf,QAAQ,WAAW;EACnB,QAAQ,aAAa;EACrB,QAAQ,QAAQ;EAChB,QAAQ,OAAO;EACf,QAAQ,WAAW;EACnB,QAAQ,YAAY;EACpB,QAAQ,YAAY;AACvB;;AAGA,MAAM,oBAA+C;EAClD,QAAQ,UAAU,SAAS;EAC3B,QAAQ,OAAO,SAAS;EACxB,QAAQ,WAAW,SAAS;EAC5B,QAAQ,aAAa,SAAS;EAC9B,QAAQ,OAAO,SAAS;EACxB,QAAQ,WAAW,SAAS;EAC5B,QAAQ,QAAQ,SAAS;EACzB,QAAQ,YAAY,SAAS;EAC7B,QAAQ,YAAY,SAAS;AAChC;;AAGA,SAAgB,cAAc,KAA4B;CACxD,IACE,IAAI,SAAS,SAAS,KACtB,IAAI,iBAAiB,SAAS,KAC9B,IAAI,WAAW,UAAU,aACzB,IAAI,WAAW,UAAU,gBACzB,IAAI,kBAEJ,OAAO;CAET,IAAI,eAAe,IAAI,QAAQ,KAAK,CAAC,UAAU,IAAI,QAAQ,GACzD;MAAI,CAAC,IAAI,cAAc,CAAC,IAAI,eAC1B,OAAO;CACT;CAEF,OAAO;AACT;;AAGA,SAAgB,YAAY,OAAgB,OAAsC;CAChF,IAAI,CAAC,OACH,OAAO,UAAU;CAEnB,IAAI,UAAU,MACZ,OAAO,UAAU;CAEnB,IAAI,UAAU,WAAW,UACvB,OAAO,UAAU;CAEnB,OAAO,UAAU;AACnB;;AAGA,SAAgB,mBAAmB,cAAuB,MAAgC;CACxF,IAAI,KAAK,WAAW,KAAK,KAAK,MAAK,QAAO,CAAC,IAAI,KAAK,GAClD,OAAO;MACF,IAAI,iBAAiB,QAAQ,WAClC,OAAO,QAAQ;MAEf,OAAO,QAAQ;AAEnB;;AAGA,SAAgB,cAAc,YAA6B;CACzD,MAAM,QAAQ,WAAW,MAAM,OAAO;CACtC,QAAQ,SAAS,OAAO,SAAS,MAAM;AACzC;;AAGA,SAAgB,WAAW,MAAe,aAAsB,OAAiB;CAC/E,IAAI,YACF,OAAO,SAAS;CAElB,OAAO,kBAAkB;AAC3B;;AAGA,SAAgB,cAAc,KAA4B;CACxD,OAAO,IAAI,aAAa,QAAQ,YAAY,IAAI,aAAa,QAAQ,aAAa,IAAI,aAAa,QAAQ;AAC7G;;AAGA,SAAgB,oBAAoB,OAAqB,OAAuC;CAC9F,MAAM,aAAa,MAAM,QAAQ,KAAK;CACtC,IAAI,eAAe,IACjB,OAAO,CAAC;CAEV,MAAM,oBAAoB,MAAM,WAAW,KAAK,UAAU,QAAQ,cAAc,IAAI,aAAa,QAAQ,SAAS;CAElH,OAAO,MAAM,QAAQ,GAAG,UAAU,SAAS,eAAe,sBAAsB,MAAM,QAAQ,kBAAkB;AAClH;;AAGA,SAAgB,iBAAiB,MAAuB;CACtD,OAAO,gBAAgB;AACzB;;AAGA,SAAgB,aAAa,MAA8B;CACzD,IAAI,KAAK,WAAW,GAClB,OAAO;CAET,KAAK,MAAM,CAAC,MAAM,WAAW,OAAO,QAAQ,eAAe,GACzD,IAAI,SAAS,QACX,OAAO;CAGX,OAAO;AACT;;AAGA,SAAgB,eAAe,MAAwB;CACrD,QAAQ,MAAR;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,OACX,OAAO;EAET,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;CACX;AACF;;AAGA,SAAgB,UAAU,MAAwB;CAChD,QAAQ,MAAR;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ,UACX,OAAO;EAET,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;CACX;AACF;;AAGA,SAAgB,aAAa,MAAwB;CACnD,QAAQ,MAAR;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;EAET,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;CACX;AACF;;AAGA,SAAgB,UAAU,MAAwB;CAChD,QAAQ,MAAR;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;EAET,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;CACX;AACF;;AAGA,SAAgB,oBAAoB,KAA4B;CAC9D,QAAQ,IAAI,UAAZ;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;CACX;CACA,IAAI,CAAC,IAAI,eACP,OAAO;CAET,IAAI,IAAI,aAAa,QAAQ,UAAU;EACrC,MAAM,SAAU,IAAI,cAAoC;EACxD,OAAO,wBAAwB,MAAM;CACvC;CACA,IAAI,CAAC,eAAe,IAAI,aAAa,GACnC,OAAO;CAET,OAAO,wBAAwB,IAAI,aAA6B;AAClE;;AAGA,SAAgB,0BAA0B,MAAwB;CAChE,QAAQ,MAAR;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;EAET,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;CACX;AACF;;AAGA,SAAgB,oBAAoB,OAAe,MAAwB;CACzE,IAAI,MAAM,SAAS,GACjB,OAAO;CAET,MAAM,SAAS,iBAAiB,IAAI;CACpC,IAAI,CAAC,MAAM,WAAW,MAAM,GAC1B,OAAO;CAET,IAAI,CAAC,QAAQ,KAAK,MAAM,UAAU,OAAO,MAAM,CAAC,GAC9C,OAAO;CAET,OAAO;AACT;;AAGA,SAAgB,iBAAiB,OAAe,MAAe,QAAyB;CACtF,IAAI,CAAC,oBAAoB,OAAO,IAAI,GAClC,OAAO;CAET,IAAI,OAAO,WAAW,IAAI,KAAK,GAC7B,OAAO;CAET,OAAO;AACT;;AAGA,SAAgB,cAAc,MAAe,QAAgB,eAAyB,CAAC,GAAW;CAChG,MAAM,SAAS,iBAAiB,IAAI;CACpC,IAAI,OAAO,MAAM,UAAU,GACzB,OAAO,GAAG,OAAO;CAEnB,IAAI,QAAQ,OAAO,MAAM,QAAQ,MAAM,KAAK,UAAU;EACpD,IAAI,IAAI,aAAa,MACnB,OAAO;EAET,QAAQ,OAAO,IAAI,MAAM,MAAM,IAAI,IAAI,MAAM,MAAM,CAAC,IAAI;EACxD,OAAO,KAAK,IAAI,MAAM,KAAK;CAC7B,GAAG,CAAC;CACJ,IAAI,QAAQ,GAAG,SAAS;CACxB,OAAO,aAAa,SAAS,KAAK,GAAG;EACnC,QAAQ,QAAQ;EAChB,QAAQ,GAAG,SAAS;CACtB;CACA,OAAO;AACT;;;;;AAMA,SAAgB,sBAAsB,QAAgB,UAA0B;CAC9E,IAAI,OAAsB;CAC1B,KAAK,MAAM,OAAO,OAAO,OACvB,IAAI,IAAI,YAAY,UAClB,OAAO,IAAI;CAGf,OAAO,QAAQ;AACjB;;AAGA,SAAgB,4BAA4B,UAAkB,OAA8C;CAC1G,MAAM,SAAS,MAAM,QAAO,SAAQ,KAAK,aAAa,SAAS,QAAQ;CACvE,KAAK,MAAM,QAAQ,OACjB,IAAI,KAAK,WAAW,KAAK,UAAU,KAAK,SAAS,CAAC,OAAO,SAAS,IAAI,GACpE,OAAO,KAAK,IAAI;CAGpB,KAAK,MAAM,QAAQ,OACjB,IAAI,KAAK,WAAW,CAAC,OAAO,SAAS,IAAI,GACvC,OAAO,KAAK,IAAI;CAGpB,KAAK,MAAM,QAAQ,OACjB,IAAI,CAAC,OAAO,SAAS,IAAI,GACvB,OAAO,KAAK,IAAI;CAGpB,OAAO;AACT;;AAGA,SAAgB,qBAAqB,YAAoB,OAAuB;CAC9E,MAAM,SAAS,WAAW,WAAW,IAAI,OAAO,MAAM,MAAM,MAAM,GAAG,GAAG,KAAK;CAC7E,OAAO,WAAW,QAAQ,KAAK;AACjC;;AAGA,SAAgB,kBAAkB,YAAoB,OAAuB;CAC3E,OAAO,aAAa,MAAM;AAC5B;;AAGA,SAAgB,oBAAoB,SAA6B;CAC/D,QAAQ,SAAR;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,MACX,OAAO,UAAU;EACnB,KAAK,QAAQ,UACX,OAAO,UAAU;EACnB,KAAK,QAAQ,WACX,OAAO,UAAU;EACnB,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO,UAAU;CACrB;AACF;;AAGA,SAAgB,wBAAwB,SAA2B;CACjE,OAAO,YAAY,QAAQ,QAAQ,YAAY,QAAQ;AACzD;;AAGA,SAAgB,eAAe,YAAoB,SAAkB,QAAgB,OAA8B;CACjH,IAAI,CAAC,wBAAwB,OAAO,GAAG;EACrC,IAAI,WAAW,KAAK,CAAC,CAAC,WAAW,GAAG;GAClC,MAAM,gBAAgB,SAAS,MAAM,SAAS,IAAI,QAAQ;GAE1D,OAAO;IACL,SAAS;IACT,MAHW,YAAY,QAAQ,OAAO,KAAK,MAAM,aAAa,CAAC,IAAI,KAAK,SAAS,aAAa,CAAC;IAI/F,YAAY,WAAW;IACvB,QAAQ,CAAC;IACT,KAAK;GACP;EACF;EACA,OAAO;GACL,SAAS;GACT,MAAM;GACN,YAAY;GACZ,QAAQ,CACN;IACE,MAAM,YAAY;IAClB,MAAM;IACN,IAAI,KAAK,IAAI,WAAW,QAAQ,CAAC;IACjC,QAAQ,CAAC,SAAS,SAAS,EAAE;GAC/B,CACF;GACA,KAAK;EACP;CACF;CACA,OAAO,OAAO,SAAS,UAAU,YAAY;EAC3C,UAAU,oBAAoB,OAAO;EACrC,UAAU,YAAY,QAAQ;CAChC,CAAC;AACH;;AAGA,SAAgB,qBAAqB,QAA6B;CAChE,MAAM,QAAQ,OAAO;CACrB,OAAO;EACL,WAAW,MAAM;EACjB,eAAe,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,UAAU,IAAI,IAAI,CAAC;EAExE,iBAAiB,MAAM,QAAQ,KAAK,QAAQ,MAAM,wBAAwB,GAAG,GAAG,CAAC;EAEjF,mBAAmB,MAAM,QAAQ,KAAK,QAAQ,OAAO,cAAc,GAAG,IAAI,IAAI,IAAI,CAAC;EACnF,gBAAgB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,SAAS,SAAS,IAAI,IAAI,IAAI,CAAC;EACrF,yBAAyB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,iBAAiB,SAAS,IAAI,IAAI,IAAI,CAAC;EACtG,0BAA0B,MAAM,QAAQ,KAAK,QAAQ,OAAO,oBAAoB,GAAG,IAAI,IAAI,IAAI,CAAC;EAChG,qBAAqB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,mBAAmB,IAAI,IAAI,CAAC;EAEvF,iBAAiB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,WAAW,UAAU,YAAY,IAAI,IAAI,CAAC;EACjG,gBAAgB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,UAAU,eAAe,WAAW,WAAW,IAAI,IAAI,CAAC;EAC9G,oBAAoB,MAAM,QACvB,KAAK,QAAQ,OAAO,IAAI,UAAU,WAAW,IAAI,SAAS,eAAe,OAAO,IAAI,IACrF,CACF;EACA,iBAAiB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,eAAe,IAAI,IAAI,CAAC;EAE/E,iBAAiB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,WAAW,IAAI,IAAI,CAAC;EAC3E,kBAAkB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,iBAAiB,IAAI,IAAI,CAAC;EAClF,kBAAkB,MAAM,QAAQ,KAAK,QAAQ,OAAO,eAAe,IAAI,QAAQ,KAAK,IAAI,aAAa,IAAI,IAAI,CAAC;EAC9G,eAAe,MAAM,QAAQ,KAAK,QAAQ,OAAO,CAAC,eAAe,IAAI,QAAQ,KAAK,CAAC,IAAI,aAAa,IAAI,IAAI,CAAC;EAE7G,YAAY,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,OAAO,IAAI,IAAI,CAAC;EACvF,gBAAgB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,WAAW,IAAI,IAAI,CAAC;EAC/F,kBAAkB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,aAAa,IAAI,IAAI,CAAC;EACnG,aAAa,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,QAAQ,IAAI,IAAI,CAAC;EACzF,YAAY,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,OAAO,IAAI,IAAI,CAAC;EACvF,gBAAgB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,WAAW,IAAI,IAAI,CAAC;EAC/F,iBAAiB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,YAAY,IAAI,IAAI,CAAC;EACjG,iBAAiB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,YAAY,IAAI,IAAI,CAAC;EACjG,eAAe,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,UAAU,IAAI,IAAI,CAAC;CAC/F;AACF;;AAGA,SAAgB,mBAAmB,QAAgB,QAAsB,MAAqC;CAC5G,KAAK,MAAM,OAAO,OAAO,OACvB,IAAI,IAAI,YAAY,OAAO,MAAM,IAAI,cACnC;MAAI,IAAI,aAAa,WAAW,KAAK,UAAU,IAAI,aAAa,OAAO,GAAG,MAAM,MAAM,KAAK,EAAE,GAC3F,OAAO;CACT;CAGJ,OAAO;AACT;;AAGA,SAAgB,iBAAiB,QAAgB,QAAsB,MAAwB;CAC7F,MAAM,iBAAiB,mBAAmB,QAAQ,QAAQ,IAAI;CAC9D,IAAI,gBACF,OAAO,GAAG,eAAe,MAAM,IAAI,eAAe;CAEpD,IAAI,CAAC,eAAe,OAAO,aAAa,GACtC,OAAO;CAET,MAAM,OAAO,UAAU,OAAO,eAA+B,IAAI;CACjE,IAAI,MAAM,WAAW,OAAO,OAAO;EACjC,MAAM,MAAM,OAAO,WAAW,IAAI,KAAK,MAAM;EAC7C,IAAI,KAAK,eACP,OAAO,GAAG,IAAI,MAAM,IAAI,IAAI;CAEhC;CACA,OAAO;AACT;AAGA,SAAS,wBAAwB,KAA2B;CAC1D,IAAI,IAAI,aAAa,QAAQ,SAAS,IAAI,aAAa,QAAQ,WAAW,CAAC,eAAe,IAAI,QAAQ,GACpG,OAAO;CAET,IAAI,IAAI,aAAa,QAAQ,QAAQ,IAAI,aAAa,QAAQ,YAAY,CAAC,IAAI,eAC7E,OAAO;CAGT,MAAM,OAAO,IAAI;CACjB,OAAO,gCAAgC,IAAI,IAAI;AACjD;AAEA,SAAS,gCAAgC,MAA4B;CACnE,QAAQ,KAAK,QAAb;EACE,KAAK,OAAO;EACZ,KAAK,OAAO;EACZ,KAAK,OAAO,iBACV,OAAO;EACT,KAAK,OAAO,OACV,OACE,KAAK,QAAQ,SAAS,KAAK,QAAQ,QAAQ,KAAK,WAAW,MAAM,gCAAgC,MAAM,GAAG,CAAC;EAE/G,KAAK,OAAO;GACV,IAAI,KAAK,KAAK,WAAW,OAAO,OAAO;IACrC,IAAI,MAAM;IACV,KAAK,KAAK,QAAQ,SAAQ,WAAU;KAClC,OAAO,gCAAgC,MAAM;IAC/C,CAAC;IACD,OAAO,MAAM,KAAK,KAAK,QAAQ;GACjC,OAAO,IAAI,KAAK,KAAK,WAAW,OAAO,YACrC,OAAO,gCAAgC,KAAK,IAAI,IAAI;GAEtD,OAAO;CACX;AACF;AAEA,SAAS,oBAAoB,KAA4B;CACvD,IAAI,eAAe,IAAI,QAAQ,KAAK,CAAC,UAAU,IAAI,QAAQ,GACzD;MAAI,CAAC,IAAI,cAAc,CAAC,IAAI,eAC1B,OAAO;CACT;CAEF,OAAO;AACT;;AAGA,SAAS,wBAAwB,MAA6B;CAC5D,IAAI,KAAK,WAAW,OAAO,SAAS,KAAK,WAAW,OAAO,WAAW,KAAK,WAAW,OAAO,iBAC3F,OAAO;MACF,IAAI,KAAK,WAAW,OAAO,OAChC,OAAO;MAEP,OACE,KAAK,KAAK,WAAW,OAAO,SAC5B,KAAK,KAAK,WAAW,OAAO,WAC5B,KAAK,KAAK,WAAW,OAAO;AAGlC"}
+{"version":3,"file":"rsform-api.js","names":[],"sources":["../../src/library/rsform-api.ts"],"sourcesContent":["/**\n * Module: API for formal representation for systems of concepts.\n */\n\nimport { applyEntityReferenceMapping } from '../cctext/language-api';\nimport {\n  type AnalysisFull,\n  RSErrorCode,\n  TypeClass,\n  TypeID,\n  type TypePath,\n  type Typification,\n  ValueClass\n} from '../rslang';\nimport { type AliasMapping, applyAliasMapping, applyTypificationMapping } from '../rslang/api';\nimport { basic, bool, constant, type EchelonFunctional, isTypification } from '../rslang/semantic/typification';\nimport { applyPath } from '../rslang/semantic/typification-api';\n\nimport { type LibraryItem } from './library';\nimport {\n  type ArgumentValue,\n  type Constituenta,\n  CstClass,\n  CstStatus,\n  CstType,\n  type RSForm,\n  type RSFormStats\n} from './rsform';\n\n/** Record of {@link CstType} prefixes. */\nconst CST_TYPE_PREFIX: Record<CstType, string> = {\n  [CstType.NOMINAL]: 'N',\n  [CstType.BASE]: 'X',\n  [CstType.CONSTANT]: 'C',\n  [CstType.STRUCTURED]: 'S',\n  [CstType.AXIOM]: 'A',\n  [CstType.TERM]: 'D',\n  [CstType.FUNCTION]: 'F',\n  [CstType.PREDICATE]: 'P',\n  [CstType.STATEMENT]: 'T'\n};\n\n/** Record of {@link CstType} to {@link CstClass} mapping. */\nconst CST_TYPE_TO_CLASS: Record<CstType, CstClass> = {\n  [CstType.NOMINAL]: CstClass.NOMINAL,\n  [CstType.BASE]: CstClass.BASIC,\n  [CstType.CONSTANT]: CstClass.BASIC,\n  [CstType.STRUCTURED]: CstClass.BASIC,\n  [CstType.TERM]: CstClass.DERIVED,\n  [CstType.FUNCTION]: CstClass.DERIVED,\n  [CstType.AXIOM]: CstClass.STATEMENT,\n  [CstType.PREDICATE]: CstClass.DERIVED,\n  [CstType.STATEMENT]: CstClass.STATEMENT\n};\n\n/** Checks if {@link Constituenta} is a schema issue. */\nexport function isSchemaIssue(cst: Constituenta): boolean {\n  if (\n    cst.homonyms.length > 0 ||\n    cst.formalDuplicates.length > 0 ||\n    cst.status === CstStatus.INCORRECT ||\n    cst.status === CstStatus.INCALCULABLE ||\n    cst.is_type_mismatch\n  ) {\n    return true;\n  }\n  if (isBasicConcept(cst.cst_type) && !isLogical(cst.cst_type)) {\n    if (!cst.convention || !cst.term_resolved) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/** Infers the status of an expression based on parsing and value information. */\nexport function inferStatus(parse: boolean, value?: ValueClass | null): CstStatus {\n  if (!parse) {\n    return CstStatus.INCORRECT;\n  }\n  if (value === null) {\n    return CstStatus.INCALCULABLE;\n  }\n  if (value === ValueClass.PROPERTY) {\n    return CstStatus.PROPERTY;\n  }\n  return CstStatus.VERIFIED;\n}\n\n/** Infers type of constituent for a given template and arguments. */\nexport function inferTemplatedType(templateType: CstType, args: ArgumentValue[]): CstType {\n  if (args.length === 0 || args.some(arg => !arg.value)) {\n    return templateType;\n  } else if (templateType === CstType.PREDICATE) {\n    return CstType.AXIOM;\n  } else {\n    return CstType.TERM;\n  }\n}\n\n/** Checks if given expression is a template. */\nexport function inferTemplate(expression: string): boolean {\n  const match = expression.match(/R\\d+/g);\n  return (match && match?.length > 0) ?? false;\n}\n\n/** Infers the {@link CstClass} based on the provided {@link CstType} and template status. */\nexport function inferClass(type: CstType, isTemplate: boolean = false): CstClass {\n  if (isTemplate) {\n    return CstClass.TEMPLATE;\n  }\n  return CST_TYPE_TO_CLASS[type];\n}\n\n/** Check if {@link Constituenta} is a template or a category. */\nexport function isTemplateCst(cst: Constituenta): boolean {\n  return cst.cst_type === CstType.FUNCTION || cst.cst_type === CstType.PREDICATE || cst.cst_type === CstType.STATEMENT;\n}\n\n/** Apply filter based on start {@link Constituenta} type. */\nexport function applyFilterCategory(start: Constituenta, items: Constituenta[]): Constituenta[] {\n  const startIndex = items.indexOf(start);\n  if (startIndex === -1) {\n    return [];\n  }\n  const nextCategoryIndex = items.findIndex((cst, index) => index > startIndex && cst.cst_type === CstType.STATEMENT);\n\n  return items.filter((_, index) => index >= startIndex && (nextCategoryIndex === -1 || index < nextCategoryIndex));\n}\n\n/** Prefix for alias indicating {@link CstType}. */\nexport function getCstTypePrefix(type: CstType): string {\n  return CST_TYPE_PREFIX[type];\n}\n\n/** Guess {@link CstType} from user input hint. */\nexport function guessCstType(hint: string): CstType | null {\n  if (hint.length !== 1) {\n    return null;\n  }\n  for (const [type, prefix] of Object.entries(CST_TYPE_PREFIX)) {\n    if (hint === prefix) {\n      return type as CstType;\n    }\n  }\n  return null;\n}\n\n/** Evaluate if {@link CstType} is basic concept. */\nexport function isBasicConcept(type: CstType): boolean {\n  switch (type) {\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.STRUCTURED:\n    case CstType.AXIOM:\n      return true;\n\n    case CstType.TERM:\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n    case CstType.STATEMENT:\n      return false;\n  }\n}\n\n/** Evaluate if {@link CstType} is base set or constant set. */\nexport function isBaseSet(type: CstType): boolean {\n  switch (type) {\n    case CstType.BASE:\n    case CstType.CONSTANT:\n      return true;\n\n    case CstType.NOMINAL:\n    case CstType.STRUCTURED:\n    case CstType.AXIOM:\n    case CstType.TERM:\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n    case CstType.STATEMENT:\n      return false;\n  }\n}\n\n/** Evaluate if {@link CstType} is a function. */\nexport function isFunctional(type: CstType): boolean {\n  switch (type) {\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n      return true;\n\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.STRUCTURED:\n    case CstType.AXIOM:\n    case CstType.TERM:\n    case CstType.STATEMENT:\n      return false;\n  }\n}\n\n/** Evaluate if {@link CstType} is logical. */\nexport function isLogical(type: CstType): boolean {\n  switch (type) {\n    case CstType.AXIOM:\n    case CstType.STATEMENT:\n      return true;\n\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.STRUCTURED:\n    case CstType.TERM:\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n      return false;\n  }\n}\n\n/** Evaluate if {@link Constituenta} can be used produce structure. */\nexport function canProduceStructure(cst: Constituenta): boolean {\n  switch (cst.cst_type) {\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.AXIOM:\n    case CstType.STATEMENT:\n    case CstType.PREDICATE:\n      return false;\n  }\n  if (!cst.effectiveType) {\n    return false;\n  }\n  if (cst.cst_type === CstType.FUNCTION) {\n    const result = (cst.effectiveType as EchelonFunctional).result;\n    return typeCanProduceStructure(result);\n  }\n  if (!isTypification(cst.effectiveType)) {\n    return false;\n  }\n  return typeCanProduceStructure(cst.effectiveType as Typification);\n}\n\n/** Evaluate if {@link CstType} can have manual typification. */\nexport function canHaveManualTypification(type: CstType): boolean {\n  switch (type) {\n    case CstType.STRUCTURED:\n    case CstType.TERM:\n    case CstType.FUNCTION:\n    case CstType.PREDICATE:\n      return true;\n\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.AXIOM:\n    case CstType.STATEMENT:\n      return false;\n  }\n}\n\n/** Validate alias format for a given {@link CstType} (prefix + digits, min length 2). */\nexport function validateAliasFormat(alias: string, type: CstType): boolean {\n  if (alias.length < 2) {\n    return false;\n  }\n  const prefix = getCstTypePrefix(type);\n  if (!alias.startsWith(prefix)) {\n    return false;\n  }\n  if (!/^\\d+$/.exec(alias.substring(prefix.length))) {\n    return false;\n  }\n  return true;\n}\n\n/** Validate new alias against {@link CstType} and {@link RSForm}. */\nexport function validateNewAlias(alias: string, type: CstType, schema: RSForm): boolean {\n  if (!validateAliasFormat(alias, type)) {\n    return false;\n  }\n  if (schema.cstByAlias.has(alias)) {\n    return false;\n  }\n  return true;\n}\n\n/** Generate alias for new {@link Constituenta} of a given {@link CstType} for current {@link RSForm}. */\nexport function generateAlias(type: CstType, schema: RSForm, takenAliases: string[] = []): string {\n  const prefix = getCstTypePrefix(type);\n  if (schema.items.length <= 0) {\n    return `${prefix}1`;\n  }\n  let index = schema.items.reduce((prev, cst, index) => {\n    if (cst.cst_type !== type) {\n      return prev;\n    }\n    index = Number(cst.alias.slice(1 - cst.alias.length)) + 1;\n    return Math.max(prev, index);\n  }, 1);\n  let alias = `${prefix}${index}`;\n  while (takenAliases.includes(alias)) {\n    index = index + 1;\n    alias = `${prefix}${index}`;\n  }\n  return alias;\n}\n\n/**\n * Id to pass as `insert_after` when creating a new {@link Constituenta} spawned by `targetId`:\n * after the last existing child of that spawner, or after the spawner itself if none.\n */\nexport function inferNewSpawnPosition(schema: RSForm, targetId: number): number {\n  let last: number | null = null;\n  for (const cst of schema.items) {\n    if (cst.spawner === targetId) {\n      last = cst.id;\n    }\n  }\n  return last ?? targetId;\n}\n\n/** Sorts library items relevant for InlineSynthesis with specified {@link RSForm}. */\nexport function sortItemsForInlineSynthesis(receiver: RSForm, items: readonly LibraryItem[]): LibraryItem[] {\n  const result = items.filter(item => item.location === receiver.location);\n  for (const item of items) {\n    if (item.visible && item.owner === item.owner && !result.includes(item)) {\n      result.push(item);\n    }\n  }\n  for (const item of items) {\n    if (item.visible && !result.includes(item)) {\n      result.push(item);\n    }\n  }\n  for (const item of items) {\n    if (!result.includes(item)) {\n      result.push(item);\n    }\n  }\n  return result;\n}\n\n/** Fields of {@link Constituenta} that are updated by alias mapping. */\nexport interface ConstituentaMappableFields {\n  alias: string;\n  definition_formal: string;\n  typification_manual: string;\n  term_raw: string;\n  definition_raw: string;\n}\n\n/** Remap formal expressions and terminological entity references in constituent fields. */\nexport function applyMappingToConstituents<T extends ConstituentaMappableFields>(\n  items: T[],\n  mapping: AliasMapping,\n  changeAliases: boolean\n): void {\n  for (const cst of items) {\n    if (changeAliases && cst.alias in mapping) {\n      cst.alias = mapping[cst.alias];\n    }\n    cst.definition_formal = applyAliasMapping(cst.definition_formal, mapping);\n    cst.typification_manual = applyTypificationMapping(cst.typification_manual, mapping);\n    cst.term_raw = applyEntityReferenceMapping(cst.term_raw, mapping);\n    cst.definition_raw = applyEntityReferenceMapping(cst.definition_raw, mapping);\n  }\n}\n\n/** Remove alias from expression. */\nexport function removeAliasReference(expression: string, alias: string): string {\n  const result = expression.replaceAll(new RegExp(`\\\\b${alias}\\\\b`, 'g'), 'DEL');\n  return result === 'DEL' ? '' : result;\n}\n\n/** Add alias to expression. */\nexport function addAliasReference(expression: string, alias: string): string {\n  return expression + ' ' + alias;\n}\n\n/** Returns expected {@link TypeClass} of formal definition for {@link CstType}. */\nexport function typeClassForCstType(cstType: CstType): TypeClass {\n  switch (cstType) {\n    case CstType.NOMINAL:\n    case CstType.BASE:\n    case CstType.CONSTANT:\n    case CstType.STRUCTURED:\n    case CstType.TERM:\n      return TypeClass.typification;\n    case CstType.FUNCTION:\n      return TypeClass.function;\n    case CstType.PREDICATE:\n      return TypeClass.predicate;\n    case CstType.AXIOM:\n    case CstType.STATEMENT:\n      return TypeClass.logic;\n  }\n}\n\n/** Checks whether a constituenta type supports formal definitions. */\nexport function canHaveFormalDefinition(cstType: CstType): boolean {\n  return cstType !== CstType.BASE && cstType !== CstType.CONSTANT;\n}\n\n/** Analyze expression for {@link RSForm}. */\nexport function getAnalysisFor(expression: string, cstType: CstType, schema: RSForm, alias?: string): AnalysisFull {\n  if (!canHaveFormalDefinition(cstType)) {\n    if (expression.trim().length === 0) {\n      const fallbackAlias = alias && alias.length > 0 ? alias : 'X0';\n      const type = cstType === CstType.BASE ? bool(basic(fallbackAlias)) : bool(constant(fallbackAlias));\n      return {\n        success: true,\n        type,\n        valueClass: ValueClass.VALUE,\n        errors: [],\n        ast: null\n      };\n    }\n    return {\n      success: false,\n      type: null,\n      valueClass: null,\n      errors: [\n        {\n          code: RSErrorCode.definitionNotAllowed,\n          from: 0,\n          to: Math.max(expression.length, 1),\n          params: [cstType, alias ?? '']\n        }\n      ],\n      ast: null\n    };\n  }\n  return schema.analyzer.checkFull(expression, {\n    expected: typeClassForCstType(cstType),\n    isDomain: cstType === CstType.STRUCTURED\n  });\n}\n\n/** Calculate statistics for {@link RSForm}. */\nexport function calculateSchemaStats(target: RSForm): RSFormStats {\n  const items = target.items;\n  return {\n    count_all: items.length,\n    count_crucial: items.reduce((sum, cst) => sum + (cst.crucial ? 1 : 0), 0),\n\n    step_complexity: items.reduce((sum, cst) => sum + calculateStepComplexity(cst), 0),\n\n    count_problematic: items.reduce((sum, cst) => sum + (isSchemaIssue(cst) ? 1 : 0), 0),\n    count_homonyms: items.reduce((sum, cst) => sum + (cst.homonyms.length > 0 ? 1 : 0), 0),\n    count_formal_duplicates: items.reduce((sum, cst) => sum + (cst.formalDuplicates.length > 0 ? 1 : 0), 0),\n    count_missing_convention: items.reduce((sum, cst) => sum + (isMissingConvention(cst) ? 1 : 0), 0),\n    count_type_mismatch: items.reduce((sum, cst) => sum + (cst.is_type_mismatch ? 1 : 0), 0),\n\n    count_incorrect: items.reduce((sum, cst) => sum + (cst.status === CstStatus.INCORRECT ? 1 : 0), 0),\n    count_property: items.reduce((sum, cst) => sum + (cst.analysis?.valueClass === ValueClass.PROPERTY ? 1 : 0), 0),\n    count_incalculable: items.reduce(\n      (sum, cst) => sum + (cst.analysis?.success && cst.analysis.valueClass === null ? 1 : 0),\n      0\n    ),\n    count_inherited: items.reduce((sum, cst) => sum + (cst.is_inherited ? 1 : 0), 0),\n\n    count_text_term: items.reduce((sum, cst) => sum + (cst.term_raw ? 1 : 0), 0),\n    count_definition: items.reduce((sum, cst) => sum + (cst.definition_raw ? 1 : 0), 0),\n    count_convention: items.reduce((sum, cst) => sum + (isBasicConcept(cst.cst_type) && cst.convention ? 1 : 0), 0),\n    count_comment: items.reduce((sum, cst) => sum + (!isBasicConcept(cst.cst_type) && !cst.convention ? 1 : 0), 0),\n\n    count_base: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.BASE ? 1 : 0), 0),\n    count_constant: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.CONSTANT ? 1 : 0), 0),\n    count_structured: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.STRUCTURED ? 1 : 0), 0),\n    count_axiom: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.AXIOM ? 1 : 0), 0),\n    count_term: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.TERM ? 1 : 0), 0),\n    count_function: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.FUNCTION ? 1 : 0), 0),\n    count_predicate: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.PREDICATE ? 1 : 0), 0),\n    count_statement: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.STATEMENT ? 1 : 0), 0),\n    count_nominal: items.reduce((sum, cst) => sum + (cst.cst_type === CstType.NOMINAL ? 1 : 0), 0)\n  };\n}\n\n/** Finds {@link Constituenta} by structure path. */\nexport function findCstByStructure(schema: RSForm, target: Constituenta, path: TypePath): Constituenta | null {\n  for (const cst of schema.items) {\n    if (cst.spawner === target.id && cst.spawner_path) {\n      if (cst.spawner_path.length === path.length && cst.spawner_path.every((v, i) => v === path[i])) {\n        return cst;\n      }\n    }\n  }\n  return null;\n}\n\n/** Retrieves name for piece of target {@link Constituenta} structure. */\nexport function getStructureName(schema: RSForm, target: Constituenta, path: TypePath): string {\n  const representation = findCstByStructure(schema, target, path);\n  if (representation) {\n    return `${representation.alias}: ${representation.term_resolved}`;\n  }\n  if (!isTypification(target.effectiveType)) {\n    return '';\n  }\n  const type = applyPath(target.effectiveType as Typification, path);\n  if (type?.typeID === TypeID.basic) {\n    const cst = schema.cstByAlias.get(type.baseID);\n    if (cst?.term_resolved) {\n      return `${cst.alias}: ${cst.term_resolved}`;\n    }\n  }\n  return '';\n}\n\n// ========= Internals =====\nfunction calculateStepComplexity(cst: Constituenta): number {\n  if (cst.cst_type === CstType.AXIOM || cst.cst_type === CstType.NOMINAL || !isBasicConcept(cst.cst_type)) {\n    return 0;\n  }\n  if (cst.cst_type === CstType.BASE || cst.cst_type === CstType.CONSTANT || !cst.effectiveType) {\n    return 1;\n  }\n\n  const type = cst.effectiveType as Typification;\n  return calculateTypificationComplexity(type) + 1;\n}\n\nfunction calculateTypificationComplexity(type: Typification): number {\n  switch (type.typeID) {\n    case TypeID.basic:\n    case TypeID.integer:\n    case TypeID.anyTypification:\n      return 0;\n    case TypeID.tuple:\n      return (\n        type.factors.length + type.factors.reduce((sum, factor) => sum + calculateTypificationComplexity(factor), 0)\n      );\n    case TypeID.collection:\n      if (type.base.typeID === TypeID.tuple) {\n        let sum = 0;\n        type.base.factors.forEach(factor => {\n          sum += calculateTypificationComplexity(factor);\n        });\n        return sum + type.base.factors.length;\n      } else if (type.base.typeID === TypeID.collection) {\n        return calculateTypificationComplexity(type.base) + 1;\n      }\n      return 0;\n  }\n}\n\nfunction isMissingConvention(cst: Constituenta): boolean {\n  if (isBasicConcept(cst.cst_type) && !isLogical(cst.cst_type)) {\n    if (!cst.convention || !cst.term_resolved) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/** Evaluate if {@link Typification} can be used to produce structure. */\nfunction typeCanProduceStructure(type: Typification): boolean {\n  if (type.typeID === TypeID.basic || type.typeID === TypeID.integer || type.typeID === TypeID.anyTypification) {\n    return false;\n  } else if (type.typeID === TypeID.tuple) {\n    return true;\n  } else {\n    return (\n      type.base.typeID !== TypeID.basic &&\n      type.base.typeID !== TypeID.integer &&\n      type.base.typeID !== TypeID.anyTypification\n    );\n  }\n}\n"],"mappings":";;;;;;;;;;;;;AA8BA,MAAM,kBAA2C;EAC9C,QAAQ,UAAU;EAClB,QAAQ,OAAO;EACf,QAAQ,WAAW;EACnB,QAAQ,aAAa;EACrB,QAAQ,QAAQ;EAChB,QAAQ,OAAO;EACf,QAAQ,WAAW;EACnB,QAAQ,YAAY;EACpB,QAAQ,YAAY;AACvB;;AAGA,MAAM,oBAA+C;EAClD,QAAQ,UAAU,SAAS;EAC3B,QAAQ,OAAO,SAAS;EACxB,QAAQ,WAAW,SAAS;EAC5B,QAAQ,aAAa,SAAS;EAC9B,QAAQ,OAAO,SAAS;EACxB,QAAQ,WAAW,SAAS;EAC5B,QAAQ,QAAQ,SAAS;EACzB,QAAQ,YAAY,SAAS;EAC7B,QAAQ,YAAY,SAAS;AAChC;;AAGA,SAAgB,cAAc,KAA4B;CACxD,IACE,IAAI,SAAS,SAAS,KACtB,IAAI,iBAAiB,SAAS,KAC9B,IAAI,WAAW,UAAU,aACzB,IAAI,WAAW,UAAU,gBACzB,IAAI,kBAEJ,OAAO;CAET,IAAI,eAAe,IAAI,QAAQ,KAAK,CAAC,UAAU,IAAI,QAAQ,GACzD;MAAI,CAAC,IAAI,cAAc,CAAC,IAAI,eAC1B,OAAO;CACT;CAEF,OAAO;AACT;;AAGA,SAAgB,YAAY,OAAgB,OAAsC;CAChF,IAAI,CAAC,OACH,OAAO,UAAU;CAEnB,IAAI,UAAU,MACZ,OAAO,UAAU;CAEnB,IAAI,UAAU,WAAW,UACvB,OAAO,UAAU;CAEnB,OAAO,UAAU;AACnB;;AAGA,SAAgB,mBAAmB,cAAuB,MAAgC;CACxF,IAAI,KAAK,WAAW,KAAK,KAAK,MAAK,QAAO,CAAC,IAAI,KAAK,GAClD,OAAO;MACF,IAAI,iBAAiB,QAAQ,WAClC,OAAO,QAAQ;MAEf,OAAO,QAAQ;AAEnB;;AAGA,SAAgB,cAAc,YAA6B;CACzD,MAAM,QAAQ,WAAW,MAAM,OAAO;CACtC,QAAQ,SAAS,OAAO,SAAS,MAAM;AACzC;;AAGA,SAAgB,WAAW,MAAe,aAAsB,OAAiB;CAC/E,IAAI,YACF,OAAO,SAAS;CAElB,OAAO,kBAAkB;AAC3B;;AAGA,SAAgB,cAAc,KAA4B;CACxD,OAAO,IAAI,aAAa,QAAQ,YAAY,IAAI,aAAa,QAAQ,aAAa,IAAI,aAAa,QAAQ;AAC7G;;AAGA,SAAgB,oBAAoB,OAAqB,OAAuC;CAC9F,MAAM,aAAa,MAAM,QAAQ,KAAK;CACtC,IAAI,eAAe,IACjB,OAAO,CAAC;CAEV,MAAM,oBAAoB,MAAM,WAAW,KAAK,UAAU,QAAQ,cAAc,IAAI,aAAa,QAAQ,SAAS;CAElH,OAAO,MAAM,QAAQ,GAAG,UAAU,SAAS,eAAe,sBAAsB,MAAM,QAAQ,kBAAkB;AAClH;;AAGA,SAAgB,iBAAiB,MAAuB;CACtD,OAAO,gBAAgB;AACzB;;AAGA,SAAgB,aAAa,MAA8B;CACzD,IAAI,KAAK,WAAW,GAClB,OAAO;CAET,KAAK,MAAM,CAAC,MAAM,WAAW,OAAO,QAAQ,eAAe,GACzD,IAAI,SAAS,QACX,OAAO;CAGX,OAAO;AACT;;AAGA,SAAgB,eAAe,MAAwB;CACrD,QAAQ,MAAR;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,OACX,OAAO;EAET,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;CACX;AACF;;AAGA,SAAgB,UAAU,MAAwB;CAChD,QAAQ,MAAR;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ,UACX,OAAO;EAET,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;CACX;AACF;;AAGA,SAAgB,aAAa,MAAwB;CACnD,QAAQ,MAAR;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;EAET,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;CACX;AACF;;AAGA,SAAgB,UAAU,MAAwB;CAChD,QAAQ,MAAR;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;EAET,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;CACX;AACF;;AAGA,SAAgB,oBAAoB,KAA4B;CAC9D,QAAQ,IAAI,UAAZ;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;CACX;CACA,IAAI,CAAC,IAAI,eACP,OAAO;CAET,IAAI,IAAI,aAAa,QAAQ,UAAU;EACrC,MAAM,SAAU,IAAI,cAAoC;EACxD,OAAO,wBAAwB,MAAM;CACvC;CACA,IAAI,CAAC,eAAe,IAAI,aAAa,GACnC,OAAO;CAET,OAAO,wBAAwB,IAAI,aAA6B;AAClE;;AAGA,SAAgB,0BAA0B,MAAwB;CAChE,QAAQ,MAAR;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;EAET,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO;CACX;AACF;;AAGA,SAAgB,oBAAoB,OAAe,MAAwB;CACzE,IAAI,MAAM,SAAS,GACjB,OAAO;CAET,MAAM,SAAS,iBAAiB,IAAI;CACpC,IAAI,CAAC,MAAM,WAAW,MAAM,GAC1B,OAAO;CAET,IAAI,CAAC,QAAQ,KAAK,MAAM,UAAU,OAAO,MAAM,CAAC,GAC9C,OAAO;CAET,OAAO;AACT;;AAGA,SAAgB,iBAAiB,OAAe,MAAe,QAAyB;CACtF,IAAI,CAAC,oBAAoB,OAAO,IAAI,GAClC,OAAO;CAET,IAAI,OAAO,WAAW,IAAI,KAAK,GAC7B,OAAO;CAET,OAAO;AACT;;AAGA,SAAgB,cAAc,MAAe,QAAgB,eAAyB,CAAC,GAAW;CAChG,MAAM,SAAS,iBAAiB,IAAI;CACpC,IAAI,OAAO,MAAM,UAAU,GACzB,OAAO,GAAG,OAAO;CAEnB,IAAI,QAAQ,OAAO,MAAM,QAAQ,MAAM,KAAK,UAAU;EACpD,IAAI,IAAI,aAAa,MACnB,OAAO;EAET,QAAQ,OAAO,IAAI,MAAM,MAAM,IAAI,IAAI,MAAM,MAAM,CAAC,IAAI;EACxD,OAAO,KAAK,IAAI,MAAM,KAAK;CAC7B,GAAG,CAAC;CACJ,IAAI,QAAQ,GAAG,SAAS;CACxB,OAAO,aAAa,SAAS,KAAK,GAAG;EACnC,QAAQ,QAAQ;EAChB,QAAQ,GAAG,SAAS;CACtB;CACA,OAAO;AACT;;;;;AAMA,SAAgB,sBAAsB,QAAgB,UAA0B;CAC9E,IAAI,OAAsB;CAC1B,KAAK,MAAM,OAAO,OAAO,OACvB,IAAI,IAAI,YAAY,UAClB,OAAO,IAAI;CAGf,OAAO,QAAQ;AACjB;;AAGA,SAAgB,4BAA4B,UAAkB,OAA8C;CAC1G,MAAM,SAAS,MAAM,QAAO,SAAQ,KAAK,aAAa,SAAS,QAAQ;CACvE,KAAK,MAAM,QAAQ,OACjB,IAAI,KAAK,WAAW,KAAK,UAAU,KAAK,SAAS,CAAC,OAAO,SAAS,IAAI,GACpE,OAAO,KAAK,IAAI;CAGpB,KAAK,MAAM,QAAQ,OACjB,IAAI,KAAK,WAAW,CAAC,OAAO,SAAS,IAAI,GACvC,OAAO,KAAK,IAAI;CAGpB,KAAK,MAAM,QAAQ,OACjB,IAAI,CAAC,OAAO,SAAS,IAAI,GACvB,OAAO,KAAK,IAAI;CAGpB,OAAO;AACT;;AAYA,SAAgB,2BACd,OACA,SACA,eACM;CACN,KAAK,MAAM,OAAO,OAAO;EACvB,IAAI,iBAAiB,IAAI,SAAS,SAChC,IAAI,QAAQ,QAAQ,IAAI;EAE1B,IAAI,oBAAoB,kBAAkB,IAAI,mBAAmB,OAAO;EACxE,IAAI,sBAAsB,yBAAyB,IAAI,qBAAqB,OAAO;EACnF,IAAI,WAAW,4BAA4B,IAAI,UAAU,OAAO;EAChE,IAAI,iBAAiB,4BAA4B,IAAI,gBAAgB,OAAO;CAC9E;AACF;;AAGA,SAAgB,qBAAqB,YAAoB,OAAuB;CAC9E,MAAM,SAAS,WAAW,WAAW,IAAI,OAAO,MAAM,MAAM,MAAM,GAAG,GAAG,KAAK;CAC7E,OAAO,WAAW,QAAQ,KAAK;AACjC;;AAGA,SAAgB,kBAAkB,YAAoB,OAAuB;CAC3E,OAAO,aAAa,MAAM;AAC5B;;AAGA,SAAgB,oBAAoB,SAA6B;CAC/D,QAAQ,SAAR;EACE,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ,MACX,OAAO,UAAU;EACnB,KAAK,QAAQ,UACX,OAAO,UAAU;EACnB,KAAK,QAAQ,WACX,OAAO,UAAU;EACnB,KAAK,QAAQ;EACb,KAAK,QAAQ,WACX,OAAO,UAAU;CACrB;AACF;;AAGA,SAAgB,wBAAwB,SAA2B;CACjE,OAAO,YAAY,QAAQ,QAAQ,YAAY,QAAQ;AACzD;;AAGA,SAAgB,eAAe,YAAoB,SAAkB,QAAgB,OAA8B;CACjH,IAAI,CAAC,wBAAwB,OAAO,GAAG;EACrC,IAAI,WAAW,KAAK,CAAC,CAAC,WAAW,GAAG;GAClC,MAAM,gBAAgB,SAAS,MAAM,SAAS,IAAI,QAAQ;GAE1D,OAAO;IACL,SAAS;IACT,MAHW,YAAY,QAAQ,OAAO,KAAK,MAAM,aAAa,CAAC,IAAI,KAAK,SAAS,aAAa,CAAC;IAI/F,YAAY,WAAW;IACvB,QAAQ,CAAC;IACT,KAAK;GACP;EACF;EACA,OAAO;GACL,SAAS;GACT,MAAM;GACN,YAAY;GACZ,QAAQ,CACN;IACE,MAAM,YAAY;IAClB,MAAM;IACN,IAAI,KAAK,IAAI,WAAW,QAAQ,CAAC;IACjC,QAAQ,CAAC,SAAS,SAAS,EAAE;GAC/B,CACF;GACA,KAAK;EACP;CACF;CACA,OAAO,OAAO,SAAS,UAAU,YAAY;EAC3C,UAAU,oBAAoB,OAAO;EACrC,UAAU,YAAY,QAAQ;CAChC,CAAC;AACH;;AAGA,SAAgB,qBAAqB,QAA6B;CAChE,MAAM,QAAQ,OAAO;CACrB,OAAO;EACL,WAAW,MAAM;EACjB,eAAe,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,UAAU,IAAI,IAAI,CAAC;EAExE,iBAAiB,MAAM,QAAQ,KAAK,QAAQ,MAAM,wBAAwB,GAAG,GAAG,CAAC;EAEjF,mBAAmB,MAAM,QAAQ,KAAK,QAAQ,OAAO,cAAc,GAAG,IAAI,IAAI,IAAI,CAAC;EACnF,gBAAgB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,SAAS,SAAS,IAAI,IAAI,IAAI,CAAC;EACrF,yBAAyB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,iBAAiB,SAAS,IAAI,IAAI,IAAI,CAAC;EACtG,0BAA0B,MAAM,QAAQ,KAAK,QAAQ,OAAO,oBAAoB,GAAG,IAAI,IAAI,IAAI,CAAC;EAChG,qBAAqB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,mBAAmB,IAAI,IAAI,CAAC;EAEvF,iBAAiB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,WAAW,UAAU,YAAY,IAAI,IAAI,CAAC;EACjG,gBAAgB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,UAAU,eAAe,WAAW,WAAW,IAAI,IAAI,CAAC;EAC9G,oBAAoB,MAAM,QACvB,KAAK,QAAQ,OAAO,IAAI,UAAU,WAAW,IAAI,SAAS,eAAe,OAAO,IAAI,IACrF,CACF;EACA,iBAAiB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,eAAe,IAAI,IAAI,CAAC;EAE/E,iBAAiB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,WAAW,IAAI,IAAI,CAAC;EAC3E,kBAAkB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,iBAAiB,IAAI,IAAI,CAAC;EAClF,kBAAkB,MAAM,QAAQ,KAAK,QAAQ,OAAO,eAAe,IAAI,QAAQ,KAAK,IAAI,aAAa,IAAI,IAAI,CAAC;EAC9G,eAAe,MAAM,QAAQ,KAAK,QAAQ,OAAO,CAAC,eAAe,IAAI,QAAQ,KAAK,CAAC,IAAI,aAAa,IAAI,IAAI,CAAC;EAE7G,YAAY,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,OAAO,IAAI,IAAI,CAAC;EACvF,gBAAgB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,WAAW,IAAI,IAAI,CAAC;EAC/F,kBAAkB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,aAAa,IAAI,IAAI,CAAC;EACnG,aAAa,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,QAAQ,IAAI,IAAI,CAAC;EACzF,YAAY,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,OAAO,IAAI,IAAI,CAAC;EACvF,gBAAgB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,WAAW,IAAI,IAAI,CAAC;EAC/F,iBAAiB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,YAAY,IAAI,IAAI,CAAC;EACjG,iBAAiB,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,YAAY,IAAI,IAAI,CAAC;EACjG,eAAe,MAAM,QAAQ,KAAK,QAAQ,OAAO,IAAI,aAAa,QAAQ,UAAU,IAAI,IAAI,CAAC;CAC/F;AACF;;AAGA,SAAgB,mBAAmB,QAAgB,QAAsB,MAAqC;CAC5G,KAAK,MAAM,OAAO,OAAO,OACvB,IAAI,IAAI,YAAY,OAAO,MAAM,IAAI,cACnC;MAAI,IAAI,aAAa,WAAW,KAAK,UAAU,IAAI,aAAa,OAAO,GAAG,MAAM,MAAM,KAAK,EAAE,GAC3F,OAAO;CACT;CAGJ,OAAO;AACT;;AAGA,SAAgB,iBAAiB,QAAgB,QAAsB,MAAwB;CAC7F,MAAM,iBAAiB,mBAAmB,QAAQ,QAAQ,IAAI;CAC9D,IAAI,gBACF,OAAO,GAAG,eAAe,MAAM,IAAI,eAAe;CAEpD,IAAI,CAAC,eAAe,OAAO,aAAa,GACtC,OAAO;CAET,MAAM,OAAO,UAAU,OAAO,eAA+B,IAAI;CACjE,IAAI,MAAM,WAAW,OAAO,OAAO;EACjC,MAAM,MAAM,OAAO,WAAW,IAAI,KAAK,MAAM;EAC7C,IAAI,KAAK,eACP,OAAO,GAAG,IAAI,MAAM,IAAI,IAAI;CAEhC;CACA,OAAO;AACT;AAGA,SAAS,wBAAwB,KAA2B;CAC1D,IAAI,IAAI,aAAa,QAAQ,SAAS,IAAI,aAAa,QAAQ,WAAW,CAAC,eAAe,IAAI,QAAQ,GACpG,OAAO;CAET,IAAI,IAAI,aAAa,QAAQ,QAAQ,IAAI,aAAa,QAAQ,YAAY,CAAC,IAAI,eAC7E,OAAO;CAGT,MAAM,OAAO,IAAI;CACjB,OAAO,gCAAgC,IAAI,IAAI;AACjD;AAEA,SAAS,gCAAgC,MAA4B;CACnE,QAAQ,KAAK,QAAb;EACE,KAAK,OAAO;EACZ,KAAK,OAAO;EACZ,KAAK,OAAO,iBACV,OAAO;EACT,KAAK,OAAO,OACV,OACE,KAAK,QAAQ,SAAS,KAAK,QAAQ,QAAQ,KAAK,WAAW,MAAM,gCAAgC,MAAM,GAAG,CAAC;EAE/G,KAAK,OAAO;GACV,IAAI,KAAK,KAAK,WAAW,OAAO,OAAO;IACrC,IAAI,MAAM;IACV,KAAK,KAAK,QAAQ,SAAQ,WAAU;KAClC,OAAO,gCAAgC,MAAM;IAC/C,CAAC;IACD,OAAO,MAAM,KAAK,KAAK,QAAQ;GACjC,OAAO,IAAI,KAAK,KAAK,WAAW,OAAO,YACrC,OAAO,gCAAgC,KAAK,IAAI,IAAI;GAEtD,OAAO;CACX;AACF;AAEA,SAAS,oBAAoB,KAA4B;CACvD,IAAI,eAAe,IAAI,QAAQ,KAAK,CAAC,UAAU,IAAI,QAAQ,GACzD;MAAI,CAAC,IAAI,cAAc,CAAC,IAAI,eAC1B,OAAO;CACT;CAEF,OAAO;AACT;;AAGA,SAAS,wBAAwB,MAA6B;CAC5D,IAAI,KAAK,WAAW,OAAO,SAAS,KAAK,WAAW,OAAO,WAAW,KAAK,WAAW,OAAO,iBAC3F,OAAO;MACF,IAAI,KAAK,WAAW,OAAO,OAChC,OAAO;MAEP,OACE,KAAK,KAAK,WAAW,OAAO,SAC5B,KAAK,KAAK,WAAW,OAAO,WAC5B,KAAK,KAAK,WAAW,OAAO;AAGlC"}

package/dist/library/structure-planner.js

@@ -2,8 +2,8 @@ import { TypeID, bool, isTypification, makeTypePath } from "../rslang/semantic/t
 import { labelType } from "../rslang/labels.js";
 import "../rslang/index.js";
 import { CstType } from "./rsform.js";
-import { findCstByStructure } from "./rsform-api.js";
 import { splitTemplateDefinition } from "../rslang/api.js";
+import { findCstByStructure } from "./rsform-api.js";
 //#region src/library/structure-planner.ts
 /** Structure planner for {@link Constituenta}. */
 var StructurePlanner = class {

package/dist/rslang/api.d.ts

@@ -1,6 +1,6 @@
 import { t as AstNode } from "../ast-C8sIpKdL.js";
 import { n as ArgumentsType } from "../arguments-extractor-1acwjQNc.js";
-import { generateExpressionFromAst } from "./parser/expression-generator.js";
+import { t as generateExpressionFromAst } from "../expression-generator-CoucLIkE.js";
 
 //#region src/rslang/api.d.ts
 /** Represents alias mapping. */

package/dist/rslang/parser/expression-generator.d.ts

@@ -1,10 +1,2 @@
-import { t as AstNode } from "../../ast-C8sIpKdL.js";
-//#region src/rslang/parser/expression-generator.d.ts
-interface ExpressionGeneratorOptions {
-  normalize?: boolean;
-}
-/** Generates Math-syntax RS expression from AST, with optional identifier normalization. */
-declare function generateExpressionFromAst(ast: AstNode, options?: ExpressionGeneratorOptions): string;
-//#endregion
-export { generateExpressionFromAst };
-//# sourceMappingURL=expression-generator.d.ts.map
+import { t as generateExpressionFromAst } from "../../expression-generator-CoucLIkE.js";
+export { generateExpressionFromAst };

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

@@ -1,2 +1,2 @@
-import { t as extractSyntaxErrors } from "../../../syntax-errors-pCI6RicF.js";
+import { t as extractSyntaxErrors } from "../../../syntax-errors-B6c2vsan.js";
 export { extractSyntaxErrors };

package/dist/rslang/semantic/analyzer.js

@@ -7,7 +7,7 @@ import { TypeID, basic, bool, constant, debool } from "./typification.js";
 import { labelType } from "../labels.js";
 import { parser } from "../parser/parser.js";
 import { normalizeAST } from "../parser/normalize.js";
-import { t as extractSyntaxErrors } from "../../syntax-errors-pCI6RicF.js";
+import { t as extractSyntaxErrors } from "../../syntax-errors-B6c2vsan.js";
 import { getTypeClass } from "./typification-api.js";
 import { TypeAuditor } from "./type-auditor.js";
 import { ValueClass } from "./value-class.js";

package/dist/{syntax-errors-pCI6RicF.js → syntax-errors-B6c2vsan.js}

@@ -139,6 +139,9 @@ function isTextToken(node, expression, text) {
 //#endregion
 //#region src/rslang/parser/syntax-errors/generators.ts
 const classifyIncompleteGenerator = (node, expression) => detectIncompleteDeclarative(node, expression) ?? detectIncompleteImperative(node, expression) ?? detectIncompleteRecursion(node, expression);
+function isIncompleteGeneratorBodyCode(code) {
+	return code === RSErrorCode.expectedDeclarativeBody || code === RSErrorCode.expectedImperativeBody || code === RSErrorCode.expectedRecursiveBody;
+}
 function detectIncompleteDeclarative(node, expression) {
 	return detectIncompleteGeneratorBody(node, expression, findAncestor(node, (target) => target.typeID === 60 || target.typeID === TokenID.NT_DECLARATIVE_EXPR), RSErrorCode.expectedDeclarativeBody, (slot) => isIncompleteDeclarativeBody(slot.nodes));
 }
@@ -338,9 +341,6 @@ function detectIncompleteQuantifier(node, expression) {
 		}
 	});
 }
-function isIncompleteGeneratorBodyCode(code) {
-	return code === RSErrorCode.expectedDeclarativeBody || code === RSErrorCode.expectedImperativeBody || code === RSErrorCode.expectedRecursiveBody;
-}
 //#endregion
 //#region src/rslang/parser/syntax-errors/incomplete-operands.ts
 const classifyIncompleteOperands = (node, expression) => detectIncompleteUnaryOperand(node, expression) ?? detectIncompleteBinaryOperand(node, expression) ?? detectIncompleteBooleanOperand(node, expression);
@@ -574,8 +574,30 @@ function collapseContiguousUnknownSyntax(errors) {
 	const unknowns = errors.filter((error) => error.code === RSErrorCode.unknownSyntax);
 	if (unknowns.length <= 1) return errors;
 	const others = errors.filter((error) => error.code !== RSErrorCode.unknownSyntax);
-	const first = [...unknowns].sort((left, right) => left.from - right.from)[0];
-	return [...others, first];
+	const sorted = [...unknowns].sort((left, right) => left.from - right.from || left.to - right.to);
+	const merged = [];
+	let clusterFrom = sorted[0].from;
+	let clusterTo = sorted[0].to;
+	for (let index = 1; index < sorted.length; index++) {
+		const error = sorted[index];
+		if (error.from <= clusterTo) {
+			clusterTo = Math.max(clusterTo, error.to);
+			continue;
+		}
+		merged.push({
+			code: RSErrorCode.unknownSyntax,
+			from: clusterFrom,
+			to: clusterTo
+		});
+		clusterFrom = error.from;
+		clusterTo = error.to;
+	}
+	merged.push({
+		code: RSErrorCode.unknownSyntax,
+		from: clusterFrom,
+		to: clusterTo
+	});
+	return [...others, ...merged];
 }
 function rangesOverlap(a, b) {
 	return a.from < b.to && b.from < a.to;
@@ -686,4 +708,4 @@ function extractInternal(node, expression, collect, hasBracketErrors, options) {
 //#endregion
 export { extractSyntaxErrors as t };
 
-//# sourceMappingURL=syntax-errors-pCI6RicF.js.map
+//# sourceMappingURL=syntax-errors-B6c2vsan.js.map

package/dist/syntax-errors-B6c2vsan.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"syntax-errors-B6c2vsan.js","names":["TypeClassEnum"],"sources":["../src/rslang/parser/syntax-errors/context.ts","../src/rslang/parser/syntax-errors/ast-utils.ts","../src/rslang/parser/syntax-errors/function-calls.ts","../src/rslang/parser/syntax-errors/error-builders.ts","../src/rslang/parser/syntax-errors/generators.ts","../src/rslang/parser/syntax-errors/trailing-slot.ts","../src/rslang/parser/syntax-errors/incomplete-formal.ts","../src/rslang/parser/syntax-errors/incomplete-operands.ts","../src/rslang/parser/syntax-errors/classify.ts","../src/rslang/parser/syntax-errors/expression-errors.ts","../src/rslang/parser/syntax-errors/index.ts"],"sourcesContent":["/**\n * Types for the parse-error classifier pipeline.\n */\n\nimport type { AstNode } from '../../../parsing';\nimport type { RSErrorDescription } from '../../error';\nimport type { TypeClass } from '../../semantic/typification';\n\n/** Shared state passed through parse-error classifiers. */\nexport interface ClassifyContext {\n  hasBracketErrors: boolean;\n  expected?: TypeClass;\n}\n\n/** Classifies a single ERROR node into a specific syntax error, if possible. */\nexport type ErrorClassifier = (\n  node: AstNode,\n  expression: string,\n  context: ClassifyContext\n) => RSErrorDescription | null;\n\n/** Skips classifiers that conflict with bracket-level diagnostics. */\nexport function whenNoBracketErrors(classifier: ErrorClassifier): ErrorClassifier {\n  return (node, expression, context) => (context.hasBracketErrors ? null : classifier(node, expression, context));\n}\n","/**\n * AST navigation helpers and node-type predicates for classifiers.\n *\n * Predicates accept grammar terms **or** {@link TokenID} because `normalizeAST` runs before\n * error extraction and leaves `hasError` subtrees unnormalized — see `parser/README.md`.\n */\n\nimport type { AstNode } from '../../../parsing';\nimport { Filter, Function, Function_decl, Logic_quantor, Predicate } from '../parser.terms';\nimport { TokenID } from '../token';\n\nexport function 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\nexport function 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\nexport function 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\nexport function subtreeHasError(node: AstNode): boolean {\n  if (node.typeID === TokenID.ERROR) {\n    return true;\n  }\n  return node.children.some(subtreeHasError);\n}\n\nexport function isFunctionDeclNode(node: AstNode): boolean {\n  return node.typeID === Function_decl || node.typeID === TokenID.NT_FUNC_DEFINITION;\n}\n\nexport function isQuantifierNode(node: AstNode): boolean {\n  return node.typeID === Logic_quantor;\n}\n\nexport function isFunctionNode(node: AstNode): boolean {\n  return node.typeID === Function || node.typeID === TokenID.ID_FUNCTION;\n}\n\nexport function isPredicateNode(node: AstNode): boolean {\n  return node.typeID === Predicate || node.typeID === TokenID.ID_PREDICATE;\n}\n\nexport function isFilterNode(node: AstNode): boolean {\n  return node.typeID === Filter || node.typeID === TokenID.FILTER;\n}\n\nexport function findMatchingCloseBracket(expression: string, openPos: number): number {\n  if (expression[openPos] !== '[') {\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\nexport function getErrorOperandNode(node: AstNode): AstNode | null {\n  if (node.typeID === TokenID.ERROR) {\n    return node;\n  }\n  if (node.children.length === 1) {\n    return getErrorOperandNode(node.children[0]);\n  }\n  return null;\n}\n\nexport function 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","/**\n * Malformed calls: `Fi…(…)`, `F1` / `P1` without or with wrong argument brackets.\n */\n\nimport type { AstNode } from '../../../parsing';\nimport { RSErrorCode, type RSErrorDescription } from '../../error';\n\nimport {\n  findAncestor,\n  findMatchingCloseBracket,\n  findRelatedNode,\n  isFilterNode,\n  isFunctionNode,\n  isPredicateNode\n} from './ast-utils';\nimport type { ErrorClassifier } from './context';\n\nexport const classifyFilterParenMismatch: ErrorClassifier = (node, expression) => {\n  const filterNode = findAncestor(node, isFilterNode) ?? findRelatedNode(node, isFilterNode);\n  if (filterNode === null || expression[filterNode.to] !== '(') {\n    return null;\n  }\n\n  return {\n    code: RSErrorCode.invalidFilterSyntax,\n    from: filterNode.from,\n    to: filterNode.to + 1\n  };\n};\n\nexport const classifyGlobalFuncCall: ErrorClassifier = (node, expression) => {\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 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  if (/^\\s*$/.test(rest)) {\n    return withoutArgs;\n  }\n\n  if (/^\\s*\\(/.test(rest)) {\n    return {\n      code: RSErrorCode.globalFuncParenCall,\n      from: funcNode.from,\n      to: funcNode.to,\n      params: [name]\n    };\n  }\n\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 && rest.slice(openBracket[0].length, closeIdx).trim().length === 0) {\n    return withoutArgs;\n  }\n\n  return null;\n}\n","/**\n * Small helpers for building `RSErrorDescription` values from AST nodes.\n */\n\nimport type { AstNode } from '../../../parsing';\nimport { type RSErrorCode, type RSErrorDescription } from '../../error';\n\nexport function errorAt(node: AstNode, code: RSErrorCode, params?: readonly string[]): RSErrorDescription {\n  return {\n    code,\n    from: node.from,\n    to: node.to,\n    params\n  };\n}\n\nexport function hasOnlyClosingSuffix(expression: string, from: number): boolean {\n  const suffix = expression.slice(from).trim();\n  return suffix.length === 0 || /^[\\]\\)\\}]*$/.test(suffix);\n}\n\nexport function sliceText(node: AstNode, expression: string): string {\n  return expression.slice(node.from, node.to);\n}\n\nexport function isTextToken(node: AstNode, expression: string, text: string): boolean {\n  return sliceText(node, expression) === text;\n}\n","/**\n * Incomplete generator bodies: declarative `D{…}`, imperative `I{…}`, recursive `R{…}`.\n */\n\nimport type { AstNode } from '../../../parsing';\nimport { RSErrorCode, type RSErrorDescription } from '../../error';\nimport { Declarative, Imp_blocks, Imperative, Recursion, Setexpr } from '../parser.terms';\nimport { TokenID } from '../token';\n\nimport { findAncestor, isDescendantOf, isErrorPlaceholder, subtreeHasError } from './ast-utils';\nimport type { ErrorClassifier } from './context';\nimport { errorAt, isTextToken } from './error-builders';\n\nexport const classifyIncompleteGenerator: ErrorClassifier = (node, expression) =>\n  detectIncompleteDeclarative(node, expression) ??\n  detectIncompleteImperative(node, expression) ??\n  detectIncompleteRecursion(node, expression);\n\nexport function isIncompleteGeneratorBodyCode(code: RSErrorCode): boolean {\n  return (\n    code === RSErrorCode.expectedDeclarativeBody ||\n    code === RSErrorCode.expectedImperativeBody ||\n    code === RSErrorCode.expectedRecursiveBody\n  );\n}\n\ninterface GeneratorBodySlot {\n  nodes: AstNode[];\n  headerEndIndex: number;\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.nodes)\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.nodes)\n  );\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 || expression.slice(generatorNode.to).trim().length > 0) {\n    return null;\n  }\n\n  const slot = getGeneratorBodySlot(generatorNode, expression);\n  if (slot === null || !isIncomplete(slot) || !generatorHeaderIsValid(generatorNode, expression, slot.headerEndIndex)) {\n    return null;\n  }\n\n  if (!isErrorInBodySlot(node, slot, generatorNode)) {\n    return null;\n  }\n\n  return errorAt(node, code);\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 => isTextToken(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 => isTextToken(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 => isTextToken(child, expression, '∈'));\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 (isTextToken(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 (isTextToken(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(nodes: AstNode[]): boolean {\n  return isEmptyOrErrorOnlyBody(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(nodes: AstNode[]): boolean {\n  return isEmptyOrErrorOnlyBody(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 (isTextToken(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 findRecursionInit(recursionNode: AstNode, expression: string): AstNode | null {\n  const assignIndex = recursionNode.children.findIndex(child => isTextToken(child, expression, ':='));\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 (isTextToken(child, expression, '|') || isClosingBrace(child, expression)) {\n      continue;\n    }\n    return child;\n  }\n\n  return null;\n}\n\nfunction isClosingBrace(node: AstNode, expression: string): boolean {\n  return node.typeID !== TokenID.ERROR && isTextToken(node, expression, '}');\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","/**\n * Reusable pattern: container header is valid, last child is `ERROR`, input ends here.\n *\n * @see incomplete-formal.ts — function declarations, quantifiers\n */\n\nimport type { AstNode } from '../../../parsing';\nimport { type RSErrorCode, type RSErrorDescription } from '../../error';\nimport { TokenID } from '../token';\n\nimport { errorAt } from './error-builders';\n\nexport function detectTrailingErrorSlot(\n  node: AstNode,\n  expression: string,\n  container: AstNode | null,\n  options: {\n    headerValid?: (container: AstNode) => boolean;\n    code: RSErrorCode | ((container: AstNode, bodyChild: AstNode) => RSErrorCode | null);\n  }\n): RSErrorDescription | null {\n  if (container === null) {\n    return null;\n  }\n\n  const bodyChild = container.children[container.children.length - 1];\n  if (bodyChild?.typeID !== TokenID.ERROR || node !== bodyChild) {\n    return null;\n  }\n\n  if (expression.slice(container.to).trim().length > 0) {\n    return null;\n  }\n\n  if (options.headerValid !== undefined && !options.headerValid(container)) {\n    return null;\n  }\n\n  const code = typeof options.code === 'function' ? options.code(container, bodyChild) : options.code;\n  if (code === null) {\n    return null;\n  }\n\n  return errorAt(bodyChild, code);\n}\n","/**\n * Incomplete formal headers: `[α∈…]` declarations and quantifiers (`∀α∈…`).\n */\n\nimport type { AstNode } from '../../../parsing';\nimport { RSErrorCode, type RSErrorDescription } from '../../error';\nimport { TypeClass as TypeClassEnum } from '../../semantic/typification';\nimport { Arguments, Variable_pack } from '../parser.terms';\nimport { TokenID } from '../token';\n\nimport { findAncestor, isFunctionDeclNode, isQuantifierNode, subtreeHasError } from './ast-utils';\nimport type { ClassifyContext, ErrorClassifier } from './context';\nimport { detectTrailingErrorSlot } from './trailing-slot';\n\nexport const classifyIncompleteFormal: ErrorClassifier = (node, expression, context) =>\n  detectIncompleteFunctionDecl(node, expression, context.expected) ?? detectIncompleteQuantifier(node, expression);\n\nfunction detectIncompleteFunctionDecl(\n  node: AstNode,\n  expression: string,\n  expected?: ClassifyContext['expected']\n): RSErrorDescription | null {\n  return detectTrailingErrorSlot(node, expression, findAncestor(node, isFunctionDeclNode), {\n    headerValid: container => {\n      const argsNode = container.children.find(\n        child => child.typeID === Arguments || child.typeID === TokenID.NT_ARGUMENTS\n      );\n      return argsNode !== undefined && !subtreeHasError(argsNode);\n    },\n    code: () => incompleteFormalExpressionCode(expected)\n  });\n}\n\nfunction incompleteFormalExpressionCode(expected?: ClassifyContext['expected']): 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  return detectTrailingErrorSlot(node, expression, findAncestor(node, isQuantifierNode), {\n    headerValid: container => {\n      const varPack = container.children.find(\n        child => child.typeID === Variable_pack || child.typeID === TokenID.NT_ENUM_DECL\n      );\n      return varPack !== undefined && !subtreeHasError(varPack);\n    },\n    code: (container, bodyChild) => {\n      const inIndex = container.children.findIndex(child => expression.slice(child.from, child.to) === '∈');\n      if (inIndex < 0) {\n        return RSErrorCode.expectedQuantifierDomain;\n      }\n\n      const domainChild = container.children[inIndex + 1];\n      if (domainChild === undefined || domainChild === bodyChild || subtreeHasError(domainChild)) {\n        return RSErrorCode.expectedQuantifierDomain;\n      }\n\n      return RSErrorCode.expectedQuantifierBody;\n    }\n  });\n}\n","/**\n * Incomplete operators and bracket argument lists (`P1[S1, ]`).\n *\n * Tuple enums `(α,β,)` intentionally stay `unknownSyntax` — not `expectedArgument`.\n */\n\nimport type { AstNode } from '../../../parsing';\nimport { RSErrorCode, type RSErrorDescription } from '../../error';\nimport { Boolean, Expr_enum_min2, Logic_binary, Logic_predicates, Logic_unary, Setexpr_binary } from '../parser.terms';\nimport { TokenID } from '../token';\n\nimport {\n  findAncestor,\n  findMatchingCloseBracket,\n  getErrorOperandNode,\n  isFilterNode,\n  isFunctionNode,\n  isPredicateNode,\n  subtreeHasError\n} from './ast-utils';\nimport type { ErrorClassifier } from './context';\nimport { errorAt, hasOnlyClosingSuffix, isTextToken, sliceText } from './error-builders';\n\nexport const classifyIncompleteOperands: ErrorClassifier = (node, expression) =>\n  detectIncompleteUnaryOperand(node, expression) ??\n  detectIncompleteBinaryOperand(node, expression) ??\n  detectIncompleteBooleanOperand(node, expression);\n\nexport const classifyIncompleteArgument: ErrorClassifier = (node, expression) =>\n  detectIncompleteArgument(node, expression);\n\nfunction detectIncompleteUnaryOperand(node: AstNode, expression: string): RSErrorDescription | null {\n  const unaryNode = findAncestor(node, target => target.typeID === Logic_unary);\n  if (unaryNode === null) {\n    return null;\n  }\n\n  const operandChild = unaryNode.children[unaryNode.children.length - 1];\n  if (operandChild?.typeID !== TokenID.ERROR || node !== operandChild) {\n    return null;\n  }\n\n  if (expression.slice(unaryNode.to).trim().length > 0) {\n    return null;\n  }\n\n  const operatorChild = unaryNode.children[0];\n  if (operatorChild === undefined || operatorChild === operandChild) {\n    return null;\n  }\n\n  if (!isTextToken(operatorChild, expression, '¬')) {\n    return null;\n  }\n\n  return errorAt(operandChild, RSErrorCode.expectedUnaryOperand);\n}\n\nfunction detectIncompleteBinaryOperand(node: AstNode, expression: string): RSErrorDescription | null {\n  const binaryNode = findAncestor(\n    node,\n    target => target.typeID === Logic_binary || target.typeID === Logic_predicates || target.typeID === Setexpr_binary\n  );\n  if (binaryNode === null) {\n    return null;\n  }\n\n  const operandChild = binaryNode.children[binaryNode.children.length - 1];\n  if (operandChild?.typeID !== TokenID.ERROR || node !== operandChild) {\n    return null;\n  }\n\n  if (expression.slice(binaryNode.to).trim().length > 0) {\n    return null;\n  }\n\n  if (binaryNode.children.length < 2) {\n    return null;\n  }\n\n  const leftChild = binaryNode.children[0];\n  if (leftChild.typeID === TokenID.ERROR || subtreeHasError(leftChild)) {\n    return null;\n  }\n\n  return errorAt(operandChild, RSErrorCode.expectedRightOperand);\n}\n\nfunction detectIncompleteBooleanOperand(node: AstNode, expression: string): RSErrorDescription | null {\n  const booleanNode = findAncestor(node, target => target.typeID === Boolean);\n  if (booleanNode === null) {\n    return null;\n  }\n\n  const operandChild = findTrailingErrorOperand(booleanNode, expression);\n  if (operandChild === null || node !== operandChild) {\n    return null;\n  }\n\n  if (!hasOnlyClosingSuffix(expression, booleanNode.to)) {\n    return null;\n  }\n\n  return errorAt(operandChild, RSErrorCode.expectedRightOperand);\n}\n\nfunction detectIncompleteArgument(node: AstNode, expression: string): RSErrorDescription | null {\n  const enumNode = findAncestor(node, target => target.typeID === Expr_enum_min2);\n  if (enumNode === null || !isLegitimateArgumentEnum(enumNode, expression)) {\n    return null;\n  }\n\n  const errorChild = findEnumArgumentError(enumNode, expression);\n  if (errorChild === null || node !== errorChild || !hasOnlyClosingSuffix(expression, enumNode.to)) {\n    return null;\n  }\n\n  return errorAt(errorChild, RSErrorCode.expectedArgument);\n}\n\nfunction findTrailingErrorOperand(container: AstNode, expression: string): AstNode | null {\n  for (let index = container.children.length - 1; index >= 0; index--) {\n    const child = container.children[index];\n    if (isOperandStructuralToken(child, expression)) {\n      continue;\n    }\n    return getErrorOperandNode(child);\n  }\n  return null;\n}\n\nfunction findEnumArgumentError(enumNode: AstNode, expression: string): AstNode | null {\n  for (const child of enumNode.children) {\n    if (isTextToken(child, expression, ',')) {\n      continue;\n    }\n    const errorNode = getErrorOperandNode(child);\n    if (errorNode !== null) {\n      return errorNode;\n    }\n  }\n  return null;\n}\n\nfunction isOperandStructuralToken(node: AstNode, expression: string): boolean {\n  const text = sliceText(node, expression);\n  return text === '(' || text === ')' || text === 'ℬ';\n}\n\nfunction isLegitimateArgumentEnum(enumNode: AstNode, expression: string): boolean {\n  return findCallHostForBracketEnum(enumNode, expression) !== null;\n}\n\nfunction findCallHostForBracketEnum(enumNode: AstNode, expression: string): AstNode | null {\n  let current: AstNode | null = enumNode.parent;\n  while (current !== null) {\n    for (const child of current.children) {\n      if (!isFunctionNode(child) && !isPredicateNode(child) && !isFilterNode(child)) {\n        continue;\n      }\n      if (isEnumInCallBrackets(enumNode, child, expression)) {\n        return child;\n      }\n    }\n    current = current.parent;\n  }\n  return null;\n}\n\nfunction isEnumInCallBrackets(enumNode: AstNode, nameNode: AstNode, expression: string): boolean {\n  const rest = expression.slice(nameNode.to);\n  const match = /^\\s*\\[/.exec(rest);\n  if (match === null) {\n    return false;\n  }\n\n  const openPos = nameNode.to + match.index + match[0].indexOf('[');\n  const closePos = findMatchingCloseBracket(expression, openPos);\n  if (closePos < 0) {\n    return false;\n  }\n\n  return enumNode.from > openPos && enumNode.from < closePos;\n}\n","/**\n * Parse-error classification: ordered classifier chain and P8400 fallback.\n *\n * Register new detectors in `PARSE_ERROR_CLASSIFIERS` (first match wins).\n */\n\nimport type { AstNode } from '../../../parsing';\nimport { RSErrorCode, type RSErrorDescription } from '../../error';\nimport { Variable } from '../parser.terms';\n\nimport type { ClassifyContext, ErrorClassifier } from './context';\nimport { whenNoBracketErrors } from './context';\nimport { classifyFilterParenMismatch, classifyGlobalFuncCall } from './function-calls';\nimport { classifyIncompleteGenerator } from './generators';\nimport { classifyIncompleteFormal } from './incomplete-formal';\nimport { classifyIncompleteArgument, classifyIncompleteOperands } from './incomplete-operands';\n\nconst PARSE_ERROR_CLASSIFIERS: ErrorClassifier[] = [\n  classifyIncompleteFormal,\n  classifyIncompleteGenerator,\n  whenNoBracketErrors(classifyIncompleteOperands),\n  whenNoBracketErrors(classifyIncompleteArgument),\n  classifyFilterParenMismatch,\n  classifyGlobalFuncCall\n];\n\n/** Runs classifiers in priority order for one `ERROR` AST node. */\nexport function classifyParseError(\n  node: AstNode,\n  expression: string,\n  context: ClassifyContext\n): RSErrorDescription | null {\n  for (const classifier of PARSE_ERROR_CLASSIFIERS) {\n    const error = classifier(node, expression, context);\n    if (error !== null) {\n      return error;\n    }\n  }\n  return null;\n}\n\n/** Default rules when no classifier matched: `expectedLocal` or `unknownSyntax`. */\nexport function classifyFallbackError(\n  node: AstNode,\n  ignoreUnknownErrors: boolean\n): { error: RSErrorDescription; target: AstNode } | null {\n  const parent = node.parent;\n  if (parent === null) {\n    return ignoreUnknownErrors\n      ? null\n      : { error: { code: RSErrorCode.unknownSyntax, from: node.from, to: node.to }, target: node };\n  }\n\n  if (parent.typeID === Variable) {\n    return {\n      error: { code: RSErrorCode.expectedLocal, from: parent.from, to: parent.to },\n      target: parent\n    };\n  }\n\n  if (ignoreUnknownErrors) {\n    return null;\n  }\n\n  const target = node.from === node.to ? parent : node;\n  return {\n    error: { code: RSErrorCode.unknownSyntax, from: target.from, to: target.to },\n    target\n  };\n}\n","/**\n * Expression-level diagnostics (no AST required) and error deduplication.\n */\n\nimport { RSErrorCode, type RSErrorDescription } from '../../error';\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\nexport function 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\nexport function 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\nexport function 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  const filtered = result.filter(\n    error => error.code !== RSErrorCode.unknownSyntax || !specific.some(item => rangesOverlap(error, item))\n  );\n  return collapseContiguousUnknownSyntax(filtered);\n}\n\nfunction collapseContiguousUnknownSyntax(errors: RSErrorDescription[]): RSErrorDescription[] {\n  const unknowns = errors.filter(error => error.code === RSErrorCode.unknownSyntax);\n  if (unknowns.length <= 1) {\n    return errors;\n  }\n\n  const others = errors.filter(error => error.code !== RSErrorCode.unknownSyntax);\n  const sorted = [...unknowns].sort((left, right) => left.from - right.from || left.to - right.to);\n  const merged: RSErrorDescription[] = [];\n\n  let clusterFrom = sorted[0].from;\n  let clusterTo = sorted[0].to;\n\n  for (let index = 1; index < sorted.length; index++) {\n    const error = sorted[index];\n    if (error.from <= clusterTo) {\n      clusterTo = Math.max(clusterTo, error.to);\n      continue;\n    }\n\n    merged.push({ code: RSErrorCode.unknownSyntax, from: clusterFrom, to: clusterTo });\n    clusterFrom = error.from;\n    clusterTo = error.to;\n  }\n\n  merged.push({ code: RSErrorCode.unknownSyntax, from: clusterFrom, to: clusterTo });\n  return [...others, ...merged];\n}\n\nfunction rangesOverlap(a: RSErrorDescription, b: RSErrorDescription): boolean {\n  return a.from < b.to && b.from < a.to;\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","/**\n * Syntax error extraction — public entry point.\n *\n * Expects the **hybrid** AST produced by `normalizeAST` (see `parser/README.md`).\n * See {@link ./README.md} for pipeline, classifier order, and how to add codes.\n *\n * @module rslang/parser/syntax-errors\n */\n\nimport { type AstNode, visitAstDFS } from '../../../parsing';\nimport { annotateError } from '../../ast-annotations';\nimport { type ErrorReporter, type RSErrorDescription } from '../../error';\nimport { type TypeClass } from '../../semantic/typification';\nimport { TokenID } from '../token';\n\nimport { classifyFallbackError, classifyParseError } from './classify';\nimport { deduplicateErrors, extractBracketErrors, extractForbiddenCharacterErrors } from './expression-errors';\nimport { isIncompleteGeneratorBodyCode } from './generators';\n\n/** When set, refines incomplete formal headers (`[α∈…]`, quantifiers). */\nexport interface SyntaxErrorOptions {\n  expected?: TypeClass;\n}\n\n/**\n * Walks a parsed expression AST and reports syntax errors.\n *\n * @param ast - Root AST from `buildTree(parser.parse(expression))`\n * @param expression - Original source text (positions must match the AST)\n * @param reporter - Called once per deduplicated error\n * @param annotateErrors - When true, also calls `annotateError` on the triggering node\n * @param options - Optional typification hint for incomplete formal expressions\n */\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\nfunction extractInternal(\n  node: AstNode,\n  expression: string,\n  collect: (error: RSErrorDescription, target: AstNode) => void,\n  hasBracketErrors: boolean,\n  options?: SyntaxErrorOptions\n) {\n  if (node.typeID !== TokenID.ERROR) {\n    return;\n  }\n\n  const classified = classifyParseError(node, expression, { hasBracketErrors, expected: options?.expected });\n  if (classified !== null) {\n    collect(classified, node);\n    return;\n  }\n\n  const fallback = classifyFallbackError(node, hasBracketErrors);\n  if (fallback !== null) {\n    collect(fallback.error, fallback.target);\n  }\n}\n"],"mappings":";;;;;;;;;AAsBA,SAAgB,oBAAoB,YAA8C;CAChF,QAAQ,MAAM,YAAY,YAAa,QAAQ,mBAAmB,OAAO,WAAW,MAAM,YAAY,OAAO;AAC/G;;;ACbA,SAAgB,aAAa,MAAe,WAAuD;CACjG,IAAI,UAA0B;CAC9B,OAAO,YAAY,MAAM;EACvB,IAAI,UAAU,OAAO,GACnB,OAAO;EAET,UAAU,QAAQ;CACpB;CACA,OAAO;AACT;AAEA,SAAgB,gBAAgB,MAAe,WAAyD;CACtG,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,SAAgB,eAAe,UAAmB,MAAwB;CACxE,IAAI,UAA0B,KAAK;CACnC,OAAO,YAAY,MAAM;EACvB,IAAI,YAAY,UACd,OAAO;EAET,UAAU,QAAQ;CACpB;CACA,OAAO;AACT;AAEA,SAAgB,gBAAgB,MAAwB;CACtD,IAAI,KAAK,WAAW,QAAQ,OAC1B,OAAO;CAET,OAAO,KAAK,SAAS,KAAK,eAAe;AAC3C;AAEA,SAAgB,mBAAmB,MAAwB;CACzD,OAAO,KAAK,WAAA,MAA4B,KAAK,WAAW,QAAQ;AAClE;AAEA,SAAgB,iBAAiB,MAAwB;CACvD,OAAO,KAAK,WAAA;AACd;AAEA,SAAgB,eAAe,MAAwB;CACrD,OAAO,KAAK,WAAA,MAAuB,KAAK,WAAW,QAAQ;AAC7D;AAEA,SAAgB,gBAAgB,MAAwB;CACtD,OAAO,KAAK,WAAA,MAAwB,KAAK,WAAW,QAAQ;AAC9D;AAEA,SAAgB,aAAa,MAAwB;CACnD,OAAO,KAAK,WAAA,MAAqB,KAAK,WAAW,QAAQ;AAC3D;AAEA,SAAgB,yBAAyB,YAAoB,SAAyB;CACpF,IAAI,WAAW,aAAa,KAC1B,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,SAAgB,oBAAoB,MAA+B;CACjE,IAAI,KAAK,WAAW,QAAQ,OAC1B,OAAO;CAET,IAAI,KAAK,SAAS,WAAW,GAC3B,OAAO,oBAAoB,KAAK,SAAS,EAAE;CAE7C,OAAO;AACT;AAEA,SAAgB,mBAAmB,MAAwB;CACzD,IAAI,KAAK,WAAW,QAAQ,OAC1B,OAAO;CAET,IAAI,KAAK,SAAS,WAAW,GAC3B,OAAO;CAET,OAAO,KAAK,SAAS,OAAM,UAAS,mBAAmB,KAAK,CAAC;AAC/D;;;AC9FA,MAAa,+BAAgD,MAAM,eAAe;CAChF,MAAM,aAAa,aAAa,MAAM,YAAY,KAAK,gBAAgB,MAAM,YAAY;CACzF,IAAI,eAAe,QAAQ,WAAW,WAAW,QAAQ,KACvD,OAAO;CAGT,OAAO;EACL,MAAM,YAAY;EAClB,MAAM,WAAW;EACjB,IAAI,WAAW,KAAK;CACtB;AACF;AAEA,MAAa,0BAA2C,MAAM,eAAe;CAC3E,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,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;CAEA,IAAI,QAAQ,KAAK,IAAI,GACnB,OAAO;CAGT,IAAI,SAAS,KAAK,IAAI,GACpB,OAAO;EACL,MAAM,YAAY;EAClB,MAAM,SAAS;EACf,IAAI,SAAS;EACb,QAAQ,CAAC,IAAI;CACf;CAGF,MAAM,cAAc,SAAS,KAAK,IAAI;CACtC,IAAI,gBAAgB,MAClB,OAAO;CAGT,MAAM,WAAW,yBAAyB,MAAM,YAAY,EAAE,CAAC,SAAS,CAAC;CACzE,IAAI,YAAY,KAAK,KAAK,MAAM,YAAY,EAAE,CAAC,QAAQ,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,GACjF,OAAO;CAGT,OAAO;AACT;;;ACpEA,SAAgB,QAAQ,MAAe,MAAmB,QAAgD;CACxG,OAAO;EACL;EACA,MAAM,KAAK;EACX,IAAI,KAAK;EACT;CACF;AACF;AAEA,SAAgB,qBAAqB,YAAoB,MAAuB;CAC9E,MAAM,SAAS,WAAW,MAAM,IAAI,CAAC,CAAC,KAAK;CAC3C,OAAO,OAAO,WAAW,KAAK,cAAc,KAAK,MAAM;AACzD;AAEA,SAAgB,UAAU,MAAe,YAA4B;CACnE,OAAO,WAAW,MAAM,KAAK,MAAM,KAAK,EAAE;AAC5C;AAEA,SAAgB,YAAY,MAAe,YAAoB,MAAuB;CACpF,OAAO,UAAU,MAAM,UAAU,MAAM;AACzC;;;ACdA,MAAa,+BAAgD,MAAM,eACjE,4BAA4B,MAAM,UAAU,KAC5C,2BAA2B,MAAM,UAAU,KAC3C,0BAA0B,MAAM,UAAU;AAE5C,SAAgB,8BAA8B,MAA4B;CACxE,OACE,SAAS,YAAY,2BACrB,SAAS,YAAY,0BACrB,SAAS,YAAY;AAEzB;AAOA,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,KAAK,KAAK,CACxC;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,KAAK,KAAK,CACtC;AACF;AAEA,SAAS,8BACP,MACA,YACA,eACA,MACA,cAC2B;CAC3B,IAAI,kBAAkB,QAAQ,WAAW,MAAM,cAAc,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,SAAS,GAC/E,OAAO;CAGT,MAAM,OAAO,qBAAqB,eAAe,UAAU;CAC3D,IAAI,SAAS,QAAQ,CAAC,aAAa,IAAI,KAAK,CAAC,uBAAuB,eAAe,YAAY,KAAK,cAAc,GAChH,OAAO;CAGT,IAAI,CAAC,kBAAkB,MAAM,MAAM,aAAa,GAC9C,OAAO;CAGT,OAAO,QAAQ,MAAM,IAAI;AAC3B;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,YAAY,GAAG,CAAC;CAC1F,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,YAAY,GAAG,CAAC;CACzF,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,YAAY,OAAO,YAAY,GAAG,CAAC;CACxF,IAAI,UAAU,GACZ,OAAO;CAGT,KAAK,IAAI,QAAQ,UAAU,GAAG,QAAQ,SAAS,SAAS,QAAQ,SAAS;EACvE,MAAM,QAAQ,SAAS,SAAS;EAChC,IAAI,YAAY,OAAO,YAAY,GAAG,KAAK,eAAe,OAAO,UAAU,GACzE;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,YAAY,GAAG,GAC3C,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,OAA2B;CAC9D,OAAO,uBAAuB,KAAK;AACrC;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,OAA2B;CAC5D,OAAO,uBAAuB,KAAK;AACrC;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,YAAY,WAAW,YAAY,GAAG,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,kBAAkB,eAAwB,YAAoC;CACrF,MAAM,cAAc,cAAc,SAAS,WAAU,UAAS,YAAY,OAAO,YAAY,IAAI,CAAC;CAClG,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,YAAY,GAAG,KAAK,eAAe,OAAO,UAAU,GACzE;EAEF,OAAO;CACT;CAEA,OAAO;AACT;AAEA,SAAS,eAAe,MAAe,YAA6B;CAClE,OAAO,KAAK,WAAW,QAAQ,SAAS,YAAY,MAAM,YAAY,GAAG;AAC3E;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;;;AC9SA,SAAgB,wBACd,MACA,YACA,WACA,SAI2B;CAC3B,IAAI,cAAc,MAChB,OAAO;CAGT,MAAM,YAAY,UAAU,SAAS,UAAU,SAAS,SAAS;CACjE,IAAI,WAAW,WAAW,QAAQ,SAAS,SAAS,WAClD,OAAO;CAGT,IAAI,WAAW,MAAM,UAAU,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,SAAS,GACjD,OAAO;CAGT,IAAI,QAAQ,gBAAgB,UAAa,CAAC,QAAQ,YAAY,SAAS,GACrE,OAAO;CAGT,MAAM,OAAO,OAAO,QAAQ,SAAS,aAAa,QAAQ,KAAK,WAAW,SAAS,IAAI,QAAQ;CAC/F,IAAI,SAAS,MACX,OAAO;CAGT,OAAO,QAAQ,WAAW,IAAI;AAChC;;;AC9BA,MAAa,4BAA6C,MAAM,YAAY,YAC1E,6BAA6B,MAAM,YAAY,QAAQ,QAAQ,KAAK,2BAA2B,MAAM,UAAU;AAEjH,SAAS,6BACP,MACA,YACA,UAC2B;CAC3B,OAAO,wBAAwB,MAAM,YAAY,aAAa,MAAM,kBAAkB,GAAG;EACvF,cAAa,cAAa;GACxB,MAAM,WAAW,UAAU,SAAS,MAClC,UAAS,MAAM,WAAA,MAAwB,MAAM,WAAW,QAAQ,YAClE;GACA,OAAO,aAAa,UAAa,CAAC,gBAAgB,QAAQ;EAC5D;EACA,YAAY,+BAA+B,QAAQ;CACrD,CAAC;AACH;AAEA,SAAS,+BAA+B,UAAqD;CAC3F,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,OAAO,wBAAwB,MAAM,YAAY,aAAa,MAAM,gBAAgB,GAAG;EACrF,cAAa,cAAa;GACxB,MAAM,UAAU,UAAU,SAAS,MACjC,UAAS,MAAM,WAAA,MAA4B,MAAM,WAAW,QAAQ,YACtE;GACA,OAAO,YAAY,UAAa,CAAC,gBAAgB,OAAO;EAC1D;EACA,OAAO,WAAW,cAAc;GAC9B,MAAM,UAAU,UAAU,SAAS,WAAU,UAAS,WAAW,MAAM,MAAM,MAAM,MAAM,EAAE,MAAM,GAAG;GACpG,IAAI,UAAU,GACZ,OAAO,YAAY;GAGrB,MAAM,cAAc,UAAU,SAAS,UAAU;GACjD,IAAI,gBAAgB,UAAa,gBAAgB,aAAa,gBAAgB,WAAW,GACvF,OAAO,YAAY;GAGrB,OAAO,YAAY;EACrB;CACF,CAAC;AACH;;;AC5CA,MAAa,8BAA+C,MAAM,eAChE,6BAA6B,MAAM,UAAU,KAC7C,8BAA8B,MAAM,UAAU,KAC9C,+BAA+B,MAAM,UAAU;AAEjD,MAAa,8BAA+C,MAAM,eAChE,yBAAyB,MAAM,UAAU;AAE3C,SAAS,6BAA6B,MAAe,YAA+C;CAClG,MAAM,YAAY,aAAa,OAAM,WAAU,OAAO,WAAA,EAAsB;CAC5E,IAAI,cAAc,MAChB,OAAO;CAGT,MAAM,eAAe,UAAU,SAAS,UAAU,SAAS,SAAS;CACpE,IAAI,cAAc,WAAW,QAAQ,SAAS,SAAS,cACrD,OAAO;CAGT,IAAI,WAAW,MAAM,UAAU,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,SAAS,GACjD,OAAO;CAGT,MAAM,gBAAgB,UAAU,SAAS;CACzC,IAAI,kBAAkB,UAAa,kBAAkB,cACnD,OAAO;CAGT,IAAI,CAAC,YAAY,eAAe,YAAY,GAAG,GAC7C,OAAO;CAGT,OAAO,QAAQ,cAAc,YAAY,oBAAoB;AAC/D;AAEA,SAAS,8BAA8B,MAAe,YAA+C;CACnG,MAAM,aAAa,aACjB,OACA,WAAU,OAAO,WAAA,MAA2B,OAAO,WAAA,KAA+B,OAAO,WAAA,EAC3F;CACA,IAAI,eAAe,MACjB,OAAO;CAGT,MAAM,eAAe,WAAW,SAAS,WAAW,SAAS,SAAS;CACtE,IAAI,cAAc,WAAW,QAAQ,SAAS,SAAS,cACrD,OAAO;CAGT,IAAI,WAAW,MAAM,WAAW,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,SAAS,GAClD,OAAO;CAGT,IAAI,WAAW,SAAS,SAAS,GAC/B,OAAO;CAGT,MAAM,YAAY,WAAW,SAAS;CACtC,IAAI,UAAU,WAAW,QAAQ,SAAS,gBAAgB,SAAS,GACjE,OAAO;CAGT,OAAO,QAAQ,cAAc,YAAY,oBAAoB;AAC/D;AAEA,SAAS,+BAA+B,MAAe,YAA+C;CACpG,MAAM,cAAc,aAAa,OAAM,WAAU,OAAO,WAAA,EAAkB;CAC1E,IAAI,gBAAgB,MAClB,OAAO;CAGT,MAAM,eAAe,yBAAyB,aAAa,UAAU;CACrE,IAAI,iBAAiB,QAAQ,SAAS,cACpC,OAAO;CAGT,IAAI,CAAC,qBAAqB,YAAY,YAAY,EAAE,GAClD,OAAO;CAGT,OAAO,QAAQ,cAAc,YAAY,oBAAoB;AAC/D;AAEA,SAAS,yBAAyB,MAAe,YAA+C;CAC9F,MAAM,WAAW,aAAa,OAAM,WAAU,OAAO,WAAA,CAAyB;CAC9E,IAAI,aAAa,QAAQ,CAAC,yBAAyB,UAAU,UAAU,GACrE,OAAO;CAGT,MAAM,aAAa,sBAAsB,UAAU,UAAU;CAC7D,IAAI,eAAe,QAAQ,SAAS,cAAc,CAAC,qBAAqB,YAAY,SAAS,EAAE,GAC7F,OAAO;CAGT,OAAO,QAAQ,YAAY,YAAY,gBAAgB;AACzD;AAEA,SAAS,yBAAyB,WAAoB,YAAoC;CACxF,KAAK,IAAI,QAAQ,UAAU,SAAS,SAAS,GAAG,SAAS,GAAG,SAAS;EACnE,MAAM,QAAQ,UAAU,SAAS;EACjC,IAAI,yBAAyB,OAAO,UAAU,GAC5C;EAEF,OAAO,oBAAoB,KAAK;CAClC;CACA,OAAO;AACT;AAEA,SAAS,sBAAsB,UAAmB,YAAoC;CACpF,KAAK,MAAM,SAAS,SAAS,UAAU;EACrC,IAAI,YAAY,OAAO,YAAY,GAAG,GACpC;EAEF,MAAM,YAAY,oBAAoB,KAAK;EAC3C,IAAI,cAAc,MAChB,OAAO;CAEX;CACA,OAAO;AACT;AAEA,SAAS,yBAAyB,MAAe,YAA6B;CAC5E,MAAM,OAAO,UAAU,MAAM,UAAU;CACvC,OAAO,SAAS,OAAO,SAAS,OAAO,SAAS;AAClD;AAEA,SAAS,yBAAyB,UAAmB,YAA6B;CAChF,OAAO,2BAA2B,UAAU,UAAU,MAAM;AAC9D;AAEA,SAAS,2BAA2B,UAAmB,YAAoC;CACzF,IAAI,UAA0B,SAAS;CACvC,OAAO,YAAY,MAAM;EACvB,KAAK,MAAM,SAAS,QAAQ,UAAU;GACpC,IAAI,CAAC,eAAe,KAAK,KAAK,CAAC,gBAAgB,KAAK,KAAK,CAAC,aAAa,KAAK,GAC1E;GAEF,IAAI,qBAAqB,UAAU,OAAO,UAAU,GAClD,OAAO;EAEX;EACA,UAAU,QAAQ;CACpB;CACA,OAAO;AACT;AAEA,SAAS,qBAAqB,UAAmB,UAAmB,YAA6B;CAC/F,MAAM,OAAO,WAAW,MAAM,SAAS,EAAE;CACzC,MAAM,QAAQ,SAAS,KAAK,IAAI;CAChC,IAAI,UAAU,MACZ,OAAO;CAGT,MAAM,UAAU,SAAS,KAAK,MAAM,QAAQ,MAAM,EAAE,CAAC,QAAQ,GAAG;CAChE,MAAM,WAAW,yBAAyB,YAAY,OAAO;CAC7D,IAAI,WAAW,GACb,OAAO;CAGT,OAAO,SAAS,OAAO,WAAW,SAAS,OAAO;AACpD;;;ACtKA,MAAM,0BAA6C;CACjD;CACA;CACA,oBAAoB,0BAA0B;CAC9C,oBAAoB,0BAA0B;CAC9C;CACA;AACF;;AAGA,SAAgB,mBACd,MACA,YACA,SAC2B;CAC3B,KAAK,MAAM,cAAc,yBAAyB;EAChD,MAAM,QAAQ,WAAW,MAAM,YAAY,OAAO;EAClD,IAAI,UAAU,MACZ,OAAO;CAEX;CACA,OAAO;AACT;;AAGA,SAAgB,sBACd,MACA,qBACuD;CACvD,MAAM,SAAS,KAAK;CACpB,IAAI,WAAW,MACb,OAAO,sBACH,OACA;EAAE,OAAO;GAAE,MAAM,YAAY;GAAe,MAAM,KAAK;GAAM,IAAI,KAAK;EAAG;EAAG,QAAQ;CAAK;CAG/F,IAAI,OAAO,WAAA,GACT,OAAO;EACL,OAAO;GAAE,MAAM,YAAY;GAAe,MAAM,OAAO;GAAM,IAAI,OAAO;EAAG;EAC3E,QAAQ;CACV;CAGF,IAAI,qBACF,OAAO;CAGT,MAAM,SAAS,KAAK,SAAS,KAAK,KAAK,SAAS;CAChD,OAAO;EACL,OAAO;GAAE,MAAM,YAAY;GAAe,MAAM,OAAO;GAAM,IAAI,OAAO;EAAG;EAC3E;CACF;AACF;;;;;;ACvDA,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,SAAgB,gCAAgC,YAA0C;CACxF,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,SAAgB,qBAAqB,YAA+C;CAClF,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,SAAgB,kBAAkB,QAAoD;CACpF,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;CAIhF,OAAO,gCAHU,OAAO,QACtB,UAAS,MAAM,SAAS,YAAY,iBAAiB,CAAC,SAAS,MAAK,SAAQ,cAAc,OAAO,IAAI,CAAC,CAEjE,CAAQ;AACjD;AAEA,SAAS,gCAAgC,QAAoD;CAC3F,MAAM,WAAW,OAAO,QAAO,UAAS,MAAM,SAAS,YAAY,aAAa;CAChF,IAAI,SAAS,UAAU,GACrB,OAAO;CAGT,MAAM,SAAS,OAAO,QAAO,UAAS,MAAM,SAAS,YAAY,aAAa;CAC9E,MAAM,SAAS,CAAC,GAAG,QAAQ,CAAC,CAAC,MAAM,MAAM,UAAU,KAAK,OAAO,MAAM,QAAQ,KAAK,KAAK,MAAM,EAAE;CAC/F,MAAM,SAA+B,CAAC;CAEtC,IAAI,cAAc,OAAO,EAAE,CAAC;CAC5B,IAAI,YAAY,OAAO,EAAE,CAAC;CAE1B,KAAK,IAAI,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS;EAClD,MAAM,QAAQ,OAAO;EACrB,IAAI,MAAM,QAAQ,WAAW;GAC3B,YAAY,KAAK,IAAI,WAAW,MAAM,EAAE;GACxC;EACF;EAEA,OAAO,KAAK;GAAE,MAAM,YAAY;GAAe,MAAM;GAAa,IAAI;EAAU,CAAC;EACjF,cAAc,MAAM;EACpB,YAAY,MAAM;CACpB;CAEA,OAAO,KAAK;EAAE,MAAM,YAAY;EAAe,MAAM;EAAa,IAAI;CAAU,CAAC;CACjF,OAAO,CAAC,GAAG,QAAQ,GAAG,MAAM;AAC9B;AAEA,SAAS,cAAc,GAAuB,GAAgC;CAC5E,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE;AACrC;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;;;;;;;;;;;;;;;;;;;;AC7NA,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;AAEA,SAAS,gBACP,MACA,YACA,SACA,kBACA,SACA;CACA,IAAI,KAAK,WAAW,QAAQ,OAC1B;CAGF,MAAM,aAAa,mBAAmB,MAAM,YAAY;EAAE;EAAkB,UAAU,SAAS;CAAS,CAAC;CACzG,IAAI,eAAe,MAAM;EACvB,QAAQ,YAAY,IAAI;EACxB;CACF;CAEA,MAAM,WAAW,sBAAsB,MAAM,gBAAgB;CAC7D,IAAI,aAAa,MACf,QAAQ,SAAS,OAAO,SAAS,MAAM;AAE3C"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@rsconcept/domain",
-  "version": "1.7.1",
+  "version": "1.7.3",
   "description": "Shared TypeScript domain for RS language, RSForm, RSModel, RSEngine, OSS, and concept-text helpers.",
   "license": "MIT",
   "author": "IRBorisov",

package/src/cctext/language-api.test.ts

@@ -2,6 +2,7 @@ import { describe, expect, it } from 'vitest';
 
 import { Grammeme } from './language';
 import {
+  applyEntityReferenceMapping,
   extractEntities,
   generateNominalLexeme,
   parseEntityReference,
@@ -114,6 +115,17 @@ describe('Testing reference parsing', () => {
   });
 });
 
+describe('applyEntityReferenceMapping', () => {
+  it('replaces entity aliases in terminological references', () => {
+    expect(applyEntityReferenceMapping('@{X1|sing}', { X1: 'X3' })).toBe('@{X3|sing}');
+    expect(applyEntityReferenceMapping('@{X1|sing} and @{X2|plur}', { X1: 'X3', X2: 'X4' })).toBe(
+      '@{X3|sing} and @{X4|plur}'
+    );
+    expect(applyEntityReferenceMapping('', { X1: 'X3' })).toBe('');
+    expect(applyEntityReferenceMapping('plain text', { X1: 'X3' })).toBe('plain text');
+  });
+});
+
 describe('Testing reference resolution', () => {
   it('extracts entity references', () => {
     expect(extractEntities('@{X1|} and @{1|nominal} and @{X2|sing,gent} and @{X1|plur,nomn}')).toStrictEqual([

package/src/cctext/language-api.ts

@@ -128,6 +128,28 @@ export function parseReference(text: string): IReference | null {
   };
 }
 
+/** Apply alias mapping to entity references in terminological text. */
+export function applyEntityReferenceMapping(text: string, mapping: Record<string, string>): string {
+  if (text === '' || Object.keys(mapping).length === 0) {
+    return text;
+  }
+
+  let posInput = 0;
+  let output = '';
+  for (const segment of text.matchAll(ENTITY_REFERENCE_PATTERN)) {
+    const entity = segment[1];
+    const start = segment.index ?? 0;
+    if (entity in mapping) {
+      output += text.substring(posInput, start + 2);
+      output += mapping[entity];
+      output += text.substring(start + 2 + entity.length, start + segment[0].length);
+      posInput = start + segment[0].length;
+    }
+  }
+  output += text.substring(posInput);
+  return output;
+}
+
 /** Extracts unique entity aliases referenced by text. */
 export function extractEntities(text: string): string[] {
   const result: string[] = [];

package/src/library/rsform-api.test.ts

@@ -3,7 +3,7 @@ import { describe, expect, it } from 'vitest';
 import { RSErrorCode } from '../rslang/error';
 
 import { CstType, type RSForm } from './rsform';
-import { getAnalysisFor, validateAliasFormat } from './rsform-api';
+import { applyMappingToConstituents, getAnalysisFor, validateAliasFormat } from './rsform-api';
 
 const emptySchema = {} as RSForm;
 
@@ -50,3 +50,24 @@ describe('getAnalysisFor', () => {
     });
   });
 });
+
+describe('applyMappingToConstituents', () => {
+  it('updates formal expressions and terminological references', () => {
+    const items = [
+      {
+        alias: 'X3',
+        definition_formal: 'X1 = X2',
+        typification_manual: 'ℬ(X1)',
+        term_raw: '@{X1|sing}',
+        definition_raw: '@{X2|sing}'
+      }
+    ];
+
+    applyMappingToConstituents(items, { X1: 'X3', X2: 'X4' }, false);
+
+    expect(items[0].definition_formal).toBe('X3 = X4');
+    expect(items[0].typification_manual).toBe('ℬ(X3)');
+    expect(items[0].term_raw).toBe('@{X3|sing}');
+    expect(items[0].definition_raw).toBe('@{X4|sing}');
+  });
+});

package/src/library/rsform-api.ts

@@ -2,6 +2,7 @@
  * Module: API for formal representation for systems of concepts.
  */
 
+import { applyEntityReferenceMapping } from '../cctext/language-api';
 import {
   type AnalysisFull,
   RSErrorCode,
@@ -11,6 +12,7 @@ import {
   type Typification,
   ValueClass
 } from '../rslang';
+import { type AliasMapping, applyAliasMapping, applyTypificationMapping } from '../rslang/api';
 import { basic, bool, constant, type EchelonFunctional, isTypification } from '../rslang/semantic/typification';
 import { applyPath } from '../rslang/semantic/typification-api';
 
@@ -339,6 +341,32 @@ export function sortItemsForInlineSynthesis(receiver: RSForm, items: readonly Li
   return result;
 }
 
+/** Fields of {@link Constituenta} that are updated by alias mapping. */
+export interface ConstituentaMappableFields {
+  alias: string;
+  definition_formal: string;
+  typification_manual: string;
+  term_raw: string;
+  definition_raw: string;
+}
+
+/** Remap formal expressions and terminological entity references in constituent fields. */
+export function applyMappingToConstituents<T extends ConstituentaMappableFields>(
+  items: T[],
+  mapping: AliasMapping,
+  changeAliases: boolean
+): void {
+  for (const cst of items) {
+    if (changeAliases && cst.alias in mapping) {
+      cst.alias = mapping[cst.alias];
+    }
+    cst.definition_formal = applyAliasMapping(cst.definition_formal, mapping);
+    cst.typification_manual = applyTypificationMapping(cst.typification_manual, mapping);
+    cst.term_raw = applyEntityReferenceMapping(cst.term_raw, mapping);
+    cst.definition_raw = applyEntityReferenceMapping(cst.definition_raw, mapping);
+  }
+}
+
 /** Remove alias from expression. */
 export function removeAliasReference(expression: string, alias: string): string {
   const result = expression.replaceAll(new RegExp(`\\b${alias}\\b`, 'g'), 'DEL');

package/src/rslang/parser/parser.test.ts

@@ -134,7 +134,7 @@ const testUnknownSyntaxData = [
   ['P1[,S1]', { code: RSErrorCode.unknownSyntax, from: 3, to: 4 }],
   ['(,β)', { code: RSErrorCode.unknownSyntax, from: 1, to: 1 }],
   ['(α,β,)', { code: RSErrorCode.unknownSyntax, from: 1, to: 5 }],
-  ['F1[S1][S2]', { code: RSErrorCode.unknownSyntax, from: 6, to: 7 }],
+  ['F1[S1][S2]', { code: RSErrorCode.unknownSyntax, from: 6, to: 10 }],
   [':∈X1', { code: RSErrorCode.unknownSyntax, from: 0, to: 2 }]
 ] as const;
 

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

@@ -156,8 +156,26 @@ function collapseContiguousUnknownSyntax(errors: RSErrorDescription[]): RSErrorD
   }
 
   const others = errors.filter(error => error.code !== RSErrorCode.unknownSyntax);
-  const first = [...unknowns].sort((left, right) => left.from - right.from)[0];
-  return [...others, first];
+  const sorted = [...unknowns].sort((left, right) => left.from - right.from || left.to - right.to);
+  const merged: RSErrorDescription[] = [];
+
+  let clusterFrom = sorted[0].from;
+  let clusterTo = sorted[0].to;
+
+  for (let index = 1; index < sorted.length; index++) {
+    const error = sorted[index];
+    if (error.from <= clusterTo) {
+      clusterTo = Math.max(clusterTo, error.to);
+      continue;
+    }
+
+    merged.push({ code: RSErrorCode.unknownSyntax, from: clusterFrom, to: clusterTo });
+    clusterFrom = error.from;
+    clusterTo = error.to;
+  }
+
+  merged.push({ code: RSErrorCode.unknownSyntax, from: clusterFrom, to: clusterTo });
+  return [...others, ...merged];
 }
 
 function rangesOverlap(a: RSErrorDescription, b: RSErrorDescription): boolean {

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

@@ -16,6 +16,14 @@ export const classifyIncompleteGenerator: ErrorClassifier = (node, expression) =
   detectIncompleteImperative(node, expression) ??
   detectIncompleteRecursion(node, expression);
 
+export function isIncompleteGeneratorBodyCode(code: RSErrorCode): boolean {
+  return (
+    code === RSErrorCode.expectedDeclarativeBody ||
+    code === RSErrorCode.expectedImperativeBody ||
+    code === RSErrorCode.expectedRecursiveBody
+  );
+}
+
 interface GeneratorBodySlot {
   nodes: AstNode[];
   headerEndIndex: number;

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

@@ -66,11 +66,3 @@ function detectIncompleteQuantifier(node: AstNode, expression: string): RSErrorD
     }
   });
 }
-
-export function isIncompleteGeneratorBodyCode(code: RSErrorCode): boolean {
-  return (
-    code === RSErrorCode.expectedDeclarativeBody ||
-    code === RSErrorCode.expectedImperativeBody ||
-    code === RSErrorCode.expectedRecursiveBody
-  );
-}

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

@@ -15,7 +15,7 @@ import { TokenID } from '../token';
 
 import { classifyFallbackError, classifyParseError } from './classify';
 import { deduplicateErrors, extractBracketErrors, extractForbiddenCharacterErrors } from './expression-errors';
-import { isIncompleteGeneratorBodyCode } from './incomplete-formal';
+import { isIncompleteGeneratorBodyCode } from './generators';
 
 /** When set, refines incomplete formal headers (`[α∈…]`, quantifiers). */
 export interface SyntaxErrorOptions {

package/dist/syntax-errors-pCI6RicF.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"syntax-errors-pCI6RicF.js","names":["TypeClassEnum"],"sources":["../src/rslang/parser/syntax-errors/context.ts","../src/rslang/parser/syntax-errors/ast-utils.ts","../src/rslang/parser/syntax-errors/function-calls.ts","../src/rslang/parser/syntax-errors/error-builders.ts","../src/rslang/parser/syntax-errors/generators.ts","../src/rslang/parser/syntax-errors/trailing-slot.ts","../src/rslang/parser/syntax-errors/incomplete-formal.ts","../src/rslang/parser/syntax-errors/incomplete-operands.ts","../src/rslang/parser/syntax-errors/classify.ts","../src/rslang/parser/syntax-errors/expression-errors.ts","../src/rslang/parser/syntax-errors/index.ts"],"sourcesContent":["/**\n * Types for the parse-error classifier pipeline.\n */\n\nimport type { AstNode } from '../../../parsing';\nimport type { RSErrorDescription } from '../../error';\nimport type { TypeClass } from '../../semantic/typification';\n\n/** Shared state passed through parse-error classifiers. */\nexport interface ClassifyContext {\n  hasBracketErrors: boolean;\n  expected?: TypeClass;\n}\n\n/** Classifies a single ERROR node into a specific syntax error, if possible. */\nexport type ErrorClassifier = (\n  node: AstNode,\n  expression: string,\n  context: ClassifyContext\n) => RSErrorDescription | null;\n\n/** Skips classifiers that conflict with bracket-level diagnostics. */\nexport function whenNoBracketErrors(classifier: ErrorClassifier): ErrorClassifier {\n  return (node, expression, context) => (context.hasBracketErrors ? null : classifier(node, expression, context));\n}\n","/**\n * AST navigation helpers and node-type predicates for classifiers.\n *\n * Predicates accept grammar terms **or** {@link TokenID} because `normalizeAST` runs before\n * error extraction and leaves `hasError` subtrees unnormalized — see `parser/README.md`.\n */\n\nimport type { AstNode } from '../../../parsing';\nimport { Filter, Function, Function_decl, Logic_quantor, Predicate } from '../parser.terms';\nimport { TokenID } from '../token';\n\nexport function 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\nexport function 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\nexport function 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\nexport function subtreeHasError(node: AstNode): boolean {\n  if (node.typeID === TokenID.ERROR) {\n    return true;\n  }\n  return node.children.some(subtreeHasError);\n}\n\nexport function isFunctionDeclNode(node: AstNode): boolean {\n  return node.typeID === Function_decl || node.typeID === TokenID.NT_FUNC_DEFINITION;\n}\n\nexport function isQuantifierNode(node: AstNode): boolean {\n  return node.typeID === Logic_quantor;\n}\n\nexport function isFunctionNode(node: AstNode): boolean {\n  return node.typeID === Function || node.typeID === TokenID.ID_FUNCTION;\n}\n\nexport function isPredicateNode(node: AstNode): boolean {\n  return node.typeID === Predicate || node.typeID === TokenID.ID_PREDICATE;\n}\n\nexport function isFilterNode(node: AstNode): boolean {\n  return node.typeID === Filter || node.typeID === TokenID.FILTER;\n}\n\nexport function findMatchingCloseBracket(expression: string, openPos: number): number {\n  if (expression[openPos] !== '[') {\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\nexport function getErrorOperandNode(node: AstNode): AstNode | null {\n  if (node.typeID === TokenID.ERROR) {\n    return node;\n  }\n  if (node.children.length === 1) {\n    return getErrorOperandNode(node.children[0]);\n  }\n  return null;\n}\n\nexport function 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","/**\n * Malformed calls: `Fi…(…)`, `F1` / `P1` without or with wrong argument brackets.\n */\n\nimport type { AstNode } from '../../../parsing';\nimport { RSErrorCode, type RSErrorDescription } from '../../error';\n\nimport {\n  findAncestor,\n  findMatchingCloseBracket,\n  findRelatedNode,\n  isFilterNode,\n  isFunctionNode,\n  isPredicateNode\n} from './ast-utils';\nimport type { ErrorClassifier } from './context';\n\nexport const classifyFilterParenMismatch: ErrorClassifier = (node, expression) => {\n  const filterNode = findAncestor(node, isFilterNode) ?? findRelatedNode(node, isFilterNode);\n  if (filterNode === null || expression[filterNode.to] !== '(') {\n    return null;\n  }\n\n  return {\n    code: RSErrorCode.invalidFilterSyntax,\n    from: filterNode.from,\n    to: filterNode.to + 1\n  };\n};\n\nexport const classifyGlobalFuncCall: ErrorClassifier = (node, expression) => {\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 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  if (/^\\s*$/.test(rest)) {\n    return withoutArgs;\n  }\n\n  if (/^\\s*\\(/.test(rest)) {\n    return {\n      code: RSErrorCode.globalFuncParenCall,\n      from: funcNode.from,\n      to: funcNode.to,\n      params: [name]\n    };\n  }\n\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 && rest.slice(openBracket[0].length, closeIdx).trim().length === 0) {\n    return withoutArgs;\n  }\n\n  return null;\n}\n","/**\n * Small helpers for building `RSErrorDescription` values from AST nodes.\n */\n\nimport type { AstNode } from '../../../parsing';\nimport { type RSErrorCode, type RSErrorDescription } from '../../error';\n\nexport function errorAt(node: AstNode, code: RSErrorCode, params?: readonly string[]): RSErrorDescription {\n  return {\n    code,\n    from: node.from,\n    to: node.to,\n    params\n  };\n}\n\nexport function hasOnlyClosingSuffix(expression: string, from: number): boolean {\n  const suffix = expression.slice(from).trim();\n  return suffix.length === 0 || /^[\\]\\)\\}]*$/.test(suffix);\n}\n\nexport function sliceText(node: AstNode, expression: string): string {\n  return expression.slice(node.from, node.to);\n}\n\nexport function isTextToken(node: AstNode, expression: string, text: string): boolean {\n  return sliceText(node, expression) === text;\n}\n","/**\n * Incomplete generator bodies: declarative `D{…}`, imperative `I{…}`, recursive `R{…}`.\n */\n\nimport type { AstNode } from '../../../parsing';\nimport { RSErrorCode, type RSErrorDescription } from '../../error';\nimport { Declarative, Imp_blocks, Imperative, Recursion, Setexpr } from '../parser.terms';\nimport { TokenID } from '../token';\n\nimport { findAncestor, isDescendantOf, isErrorPlaceholder, subtreeHasError } from './ast-utils';\nimport type { ErrorClassifier } from './context';\nimport { errorAt, isTextToken } from './error-builders';\n\nexport const classifyIncompleteGenerator: ErrorClassifier = (node, expression) =>\n  detectIncompleteDeclarative(node, expression) ??\n  detectIncompleteImperative(node, expression) ??\n  detectIncompleteRecursion(node, expression);\n\ninterface GeneratorBodySlot {\n  nodes: AstNode[];\n  headerEndIndex: number;\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.nodes)\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.nodes)\n  );\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 || expression.slice(generatorNode.to).trim().length > 0) {\n    return null;\n  }\n\n  const slot = getGeneratorBodySlot(generatorNode, expression);\n  if (slot === null || !isIncomplete(slot) || !generatorHeaderIsValid(generatorNode, expression, slot.headerEndIndex)) {\n    return null;\n  }\n\n  if (!isErrorInBodySlot(node, slot, generatorNode)) {\n    return null;\n  }\n\n  return errorAt(node, code);\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 => isTextToken(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 => isTextToken(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 => isTextToken(child, expression, '∈'));\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 (isTextToken(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 (isTextToken(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(nodes: AstNode[]): boolean {\n  return isEmptyOrErrorOnlyBody(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(nodes: AstNode[]): boolean {\n  return isEmptyOrErrorOnlyBody(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 (isTextToken(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 findRecursionInit(recursionNode: AstNode, expression: string): AstNode | null {\n  const assignIndex = recursionNode.children.findIndex(child => isTextToken(child, expression, ':='));\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 (isTextToken(child, expression, '|') || isClosingBrace(child, expression)) {\n      continue;\n    }\n    return child;\n  }\n\n  return null;\n}\n\nfunction isClosingBrace(node: AstNode, expression: string): boolean {\n  return node.typeID !== TokenID.ERROR && isTextToken(node, expression, '}');\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","/**\n * Reusable pattern: container header is valid, last child is `ERROR`, input ends here.\n *\n * @see incomplete-formal.ts — function declarations, quantifiers\n */\n\nimport type { AstNode } from '../../../parsing';\nimport { type RSErrorCode, type RSErrorDescription } from '../../error';\nimport { TokenID } from '../token';\n\nimport { errorAt } from './error-builders';\n\nexport function detectTrailingErrorSlot(\n  node: AstNode,\n  expression: string,\n  container: AstNode | null,\n  options: {\n    headerValid?: (container: AstNode) => boolean;\n    code: RSErrorCode | ((container: AstNode, bodyChild: AstNode) => RSErrorCode | null);\n  }\n): RSErrorDescription | null {\n  if (container === null) {\n    return null;\n  }\n\n  const bodyChild = container.children[container.children.length - 1];\n  if (bodyChild?.typeID !== TokenID.ERROR || node !== bodyChild) {\n    return null;\n  }\n\n  if (expression.slice(container.to).trim().length > 0) {\n    return null;\n  }\n\n  if (options.headerValid !== undefined && !options.headerValid(container)) {\n    return null;\n  }\n\n  const code = typeof options.code === 'function' ? options.code(container, bodyChild) : options.code;\n  if (code === null) {\n    return null;\n  }\n\n  return errorAt(bodyChild, code);\n}\n","/**\n * Incomplete formal headers: `[α∈…]` declarations and quantifiers (`∀α∈…`).\n */\n\nimport type { AstNode } from '../../../parsing';\nimport { RSErrorCode, type RSErrorDescription } from '../../error';\nimport { TypeClass as TypeClassEnum } from '../../semantic/typification';\nimport { Arguments, Variable_pack } from '../parser.terms';\nimport { TokenID } from '../token';\n\nimport { findAncestor, isFunctionDeclNode, isQuantifierNode, subtreeHasError } from './ast-utils';\nimport type { ClassifyContext, ErrorClassifier } from './context';\nimport { detectTrailingErrorSlot } from './trailing-slot';\n\nexport const classifyIncompleteFormal: ErrorClassifier = (node, expression, context) =>\n  detectIncompleteFunctionDecl(node, expression, context.expected) ?? detectIncompleteQuantifier(node, expression);\n\nfunction detectIncompleteFunctionDecl(\n  node: AstNode,\n  expression: string,\n  expected?: ClassifyContext['expected']\n): RSErrorDescription | null {\n  return detectTrailingErrorSlot(node, expression, findAncestor(node, isFunctionDeclNode), {\n    headerValid: container => {\n      const argsNode = container.children.find(\n        child => child.typeID === Arguments || child.typeID === TokenID.NT_ARGUMENTS\n      );\n      return argsNode !== undefined && !subtreeHasError(argsNode);\n    },\n    code: () => incompleteFormalExpressionCode(expected)\n  });\n}\n\nfunction incompleteFormalExpressionCode(expected?: ClassifyContext['expected']): 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  return detectTrailingErrorSlot(node, expression, findAncestor(node, isQuantifierNode), {\n    headerValid: container => {\n      const varPack = container.children.find(\n        child => child.typeID === Variable_pack || child.typeID === TokenID.NT_ENUM_DECL\n      );\n      return varPack !== undefined && !subtreeHasError(varPack);\n    },\n    code: (container, bodyChild) => {\n      const inIndex = container.children.findIndex(child => expression.slice(child.from, child.to) === '∈');\n      if (inIndex < 0) {\n        return RSErrorCode.expectedQuantifierDomain;\n      }\n\n      const domainChild = container.children[inIndex + 1];\n      if (domainChild === undefined || domainChild === bodyChild || subtreeHasError(domainChild)) {\n        return RSErrorCode.expectedQuantifierDomain;\n      }\n\n      return RSErrorCode.expectedQuantifierBody;\n    }\n  });\n}\n\nexport function isIncompleteGeneratorBodyCode(code: RSErrorCode): boolean {\n  return (\n    code === RSErrorCode.expectedDeclarativeBody ||\n    code === RSErrorCode.expectedImperativeBody ||\n    code === RSErrorCode.expectedRecursiveBody\n  );\n}\n","/**\n * Incomplete operators and bracket argument lists (`P1[S1, ]`).\n *\n * Tuple enums `(α,β,)` intentionally stay `unknownSyntax` — not `expectedArgument`.\n */\n\nimport type { AstNode } from '../../../parsing';\nimport { RSErrorCode, type RSErrorDescription } from '../../error';\nimport { Boolean, Expr_enum_min2, Logic_binary, Logic_predicates, Logic_unary, Setexpr_binary } from '../parser.terms';\nimport { TokenID } from '../token';\n\nimport {\n  findAncestor,\n  findMatchingCloseBracket,\n  getErrorOperandNode,\n  isFilterNode,\n  isFunctionNode,\n  isPredicateNode,\n  subtreeHasError\n} from './ast-utils';\nimport type { ErrorClassifier } from './context';\nimport { errorAt, hasOnlyClosingSuffix, isTextToken, sliceText } from './error-builders';\n\nexport const classifyIncompleteOperands: ErrorClassifier = (node, expression) =>\n  detectIncompleteUnaryOperand(node, expression) ??\n  detectIncompleteBinaryOperand(node, expression) ??\n  detectIncompleteBooleanOperand(node, expression);\n\nexport const classifyIncompleteArgument: ErrorClassifier = (node, expression) =>\n  detectIncompleteArgument(node, expression);\n\nfunction detectIncompleteUnaryOperand(node: AstNode, expression: string): RSErrorDescription | null {\n  const unaryNode = findAncestor(node, target => target.typeID === Logic_unary);\n  if (unaryNode === null) {\n    return null;\n  }\n\n  const operandChild = unaryNode.children[unaryNode.children.length - 1];\n  if (operandChild?.typeID !== TokenID.ERROR || node !== operandChild) {\n    return null;\n  }\n\n  if (expression.slice(unaryNode.to).trim().length > 0) {\n    return null;\n  }\n\n  const operatorChild = unaryNode.children[0];\n  if (operatorChild === undefined || operatorChild === operandChild) {\n    return null;\n  }\n\n  if (!isTextToken(operatorChild, expression, '¬')) {\n    return null;\n  }\n\n  return errorAt(operandChild, RSErrorCode.expectedUnaryOperand);\n}\n\nfunction detectIncompleteBinaryOperand(node: AstNode, expression: string): RSErrorDescription | null {\n  const binaryNode = findAncestor(\n    node,\n    target => target.typeID === Logic_binary || target.typeID === Logic_predicates || target.typeID === Setexpr_binary\n  );\n  if (binaryNode === null) {\n    return null;\n  }\n\n  const operandChild = binaryNode.children[binaryNode.children.length - 1];\n  if (operandChild?.typeID !== TokenID.ERROR || node !== operandChild) {\n    return null;\n  }\n\n  if (expression.slice(binaryNode.to).trim().length > 0) {\n    return null;\n  }\n\n  if (binaryNode.children.length < 2) {\n    return null;\n  }\n\n  const leftChild = binaryNode.children[0];\n  if (leftChild.typeID === TokenID.ERROR || subtreeHasError(leftChild)) {\n    return null;\n  }\n\n  return errorAt(operandChild, RSErrorCode.expectedRightOperand);\n}\n\nfunction detectIncompleteBooleanOperand(node: AstNode, expression: string): RSErrorDescription | null {\n  const booleanNode = findAncestor(node, target => target.typeID === Boolean);\n  if (booleanNode === null) {\n    return null;\n  }\n\n  const operandChild = findTrailingErrorOperand(booleanNode, expression);\n  if (operandChild === null || node !== operandChild) {\n    return null;\n  }\n\n  if (!hasOnlyClosingSuffix(expression, booleanNode.to)) {\n    return null;\n  }\n\n  return errorAt(operandChild, RSErrorCode.expectedRightOperand);\n}\n\nfunction detectIncompleteArgument(node: AstNode, expression: string): RSErrorDescription | null {\n  const enumNode = findAncestor(node, target => target.typeID === Expr_enum_min2);\n  if (enumNode === null || !isLegitimateArgumentEnum(enumNode, expression)) {\n    return null;\n  }\n\n  const errorChild = findEnumArgumentError(enumNode, expression);\n  if (errorChild === null || node !== errorChild || !hasOnlyClosingSuffix(expression, enumNode.to)) {\n    return null;\n  }\n\n  return errorAt(errorChild, RSErrorCode.expectedArgument);\n}\n\nfunction findTrailingErrorOperand(container: AstNode, expression: string): AstNode | null {\n  for (let index = container.children.length - 1; index >= 0; index--) {\n    const child = container.children[index];\n    if (isOperandStructuralToken(child, expression)) {\n      continue;\n    }\n    return getErrorOperandNode(child);\n  }\n  return null;\n}\n\nfunction findEnumArgumentError(enumNode: AstNode, expression: string): AstNode | null {\n  for (const child of enumNode.children) {\n    if (isTextToken(child, expression, ',')) {\n      continue;\n    }\n    const errorNode = getErrorOperandNode(child);\n    if (errorNode !== null) {\n      return errorNode;\n    }\n  }\n  return null;\n}\n\nfunction isOperandStructuralToken(node: AstNode, expression: string): boolean {\n  const text = sliceText(node, expression);\n  return text === '(' || text === ')' || text === 'ℬ';\n}\n\nfunction isLegitimateArgumentEnum(enumNode: AstNode, expression: string): boolean {\n  return findCallHostForBracketEnum(enumNode, expression) !== null;\n}\n\nfunction findCallHostForBracketEnum(enumNode: AstNode, expression: string): AstNode | null {\n  let current: AstNode | null = enumNode.parent;\n  while (current !== null) {\n    for (const child of current.children) {\n      if (!isFunctionNode(child) && !isPredicateNode(child) && !isFilterNode(child)) {\n        continue;\n      }\n      if (isEnumInCallBrackets(enumNode, child, expression)) {\n        return child;\n      }\n    }\n    current = current.parent;\n  }\n  return null;\n}\n\nfunction isEnumInCallBrackets(enumNode: AstNode, nameNode: AstNode, expression: string): boolean {\n  const rest = expression.slice(nameNode.to);\n  const match = /^\\s*\\[/.exec(rest);\n  if (match === null) {\n    return false;\n  }\n\n  const openPos = nameNode.to + match.index + match[0].indexOf('[');\n  const closePos = findMatchingCloseBracket(expression, openPos);\n  if (closePos < 0) {\n    return false;\n  }\n\n  return enumNode.from > openPos && enumNode.from < closePos;\n}\n","/**\n * Parse-error classification: ordered classifier chain and P8400 fallback.\n *\n * Register new detectors in `PARSE_ERROR_CLASSIFIERS` (first match wins).\n */\n\nimport type { AstNode } from '../../../parsing';\nimport { RSErrorCode, type RSErrorDescription } from '../../error';\nimport { Variable } from '../parser.terms';\n\nimport type { ClassifyContext, ErrorClassifier } from './context';\nimport { whenNoBracketErrors } from './context';\nimport { classifyFilterParenMismatch, classifyGlobalFuncCall } from './function-calls';\nimport { classifyIncompleteGenerator } from './generators';\nimport { classifyIncompleteFormal } from './incomplete-formal';\nimport { classifyIncompleteArgument, classifyIncompleteOperands } from './incomplete-operands';\n\nconst PARSE_ERROR_CLASSIFIERS: ErrorClassifier[] = [\n  classifyIncompleteFormal,\n  classifyIncompleteGenerator,\n  whenNoBracketErrors(classifyIncompleteOperands),\n  whenNoBracketErrors(classifyIncompleteArgument),\n  classifyFilterParenMismatch,\n  classifyGlobalFuncCall\n];\n\n/** Runs classifiers in priority order for one `ERROR` AST node. */\nexport function classifyParseError(\n  node: AstNode,\n  expression: string,\n  context: ClassifyContext\n): RSErrorDescription | null {\n  for (const classifier of PARSE_ERROR_CLASSIFIERS) {\n    const error = classifier(node, expression, context);\n    if (error !== null) {\n      return error;\n    }\n  }\n  return null;\n}\n\n/** Default rules when no classifier matched: `expectedLocal` or `unknownSyntax`. */\nexport function classifyFallbackError(\n  node: AstNode,\n  ignoreUnknownErrors: boolean\n): { error: RSErrorDescription; target: AstNode } | null {\n  const parent = node.parent;\n  if (parent === null) {\n    return ignoreUnknownErrors\n      ? null\n      : { error: { code: RSErrorCode.unknownSyntax, from: node.from, to: node.to }, target: node };\n  }\n\n  if (parent.typeID === Variable) {\n    return {\n      error: { code: RSErrorCode.expectedLocal, from: parent.from, to: parent.to },\n      target: parent\n    };\n  }\n\n  if (ignoreUnknownErrors) {\n    return null;\n  }\n\n  const target = node.from === node.to ? parent : node;\n  return {\n    error: { code: RSErrorCode.unknownSyntax, from: target.from, to: target.to },\n    target\n  };\n}\n","/**\n * Expression-level diagnostics (no AST required) and error deduplication.\n */\n\nimport { RSErrorCode, type RSErrorDescription } from '../../error';\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\nexport function 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\nexport function 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\nexport function 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  const filtered = result.filter(\n    error => error.code !== RSErrorCode.unknownSyntax || !specific.some(item => rangesOverlap(error, item))\n  );\n  return collapseContiguousUnknownSyntax(filtered);\n}\n\nfunction collapseContiguousUnknownSyntax(errors: RSErrorDescription[]): RSErrorDescription[] {\n  const unknowns = errors.filter(error => error.code === RSErrorCode.unknownSyntax);\n  if (unknowns.length <= 1) {\n    return errors;\n  }\n\n  const others = errors.filter(error => error.code !== RSErrorCode.unknownSyntax);\n  const first = [...unknowns].sort((left, right) => left.from - right.from)[0];\n  return [...others, first];\n}\n\nfunction rangesOverlap(a: RSErrorDescription, b: RSErrorDescription): boolean {\n  return a.from < b.to && b.from < a.to;\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","/**\n * Syntax error extraction — public entry point.\n *\n * Expects the **hybrid** AST produced by `normalizeAST` (see `parser/README.md`).\n * See {@link ./README.md} for pipeline, classifier order, and how to add codes.\n *\n * @module rslang/parser/syntax-errors\n */\n\nimport { type AstNode, visitAstDFS } from '../../../parsing';\nimport { annotateError } from '../../ast-annotations';\nimport { type ErrorReporter, type RSErrorDescription } from '../../error';\nimport { type TypeClass } from '../../semantic/typification';\nimport { TokenID } from '../token';\n\nimport { classifyFallbackError, classifyParseError } from './classify';\nimport { deduplicateErrors, extractBracketErrors, extractForbiddenCharacterErrors } from './expression-errors';\nimport { isIncompleteGeneratorBodyCode } from './incomplete-formal';\n\n/** When set, refines incomplete formal headers (`[α∈…]`, quantifiers). */\nexport interface SyntaxErrorOptions {\n  expected?: TypeClass;\n}\n\n/**\n * Walks a parsed expression AST and reports syntax errors.\n *\n * @param ast - Root AST from `buildTree(parser.parse(expression))`\n * @param expression - Original source text (positions must match the AST)\n * @param reporter - Called once per deduplicated error\n * @param annotateErrors - When true, also calls `annotateError` on the triggering node\n * @param options - Optional typification hint for incomplete formal expressions\n */\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\nfunction extractInternal(\n  node: AstNode,\n  expression: string,\n  collect: (error: RSErrorDescription, target: AstNode) => void,\n  hasBracketErrors: boolean,\n  options?: SyntaxErrorOptions\n) {\n  if (node.typeID !== TokenID.ERROR) {\n    return;\n  }\n\n  const classified = classifyParseError(node, expression, { hasBracketErrors, expected: options?.expected });\n  if (classified !== null) {\n    collect(classified, node);\n    return;\n  }\n\n  const fallback = classifyFallbackError(node, hasBracketErrors);\n  if (fallback !== null) {\n    collect(fallback.error, fallback.target);\n  }\n}\n"],"mappings":";;;;;;;;;AAsBA,SAAgB,oBAAoB,YAA8C;CAChF,QAAQ,MAAM,YAAY,YAAa,QAAQ,mBAAmB,OAAO,WAAW,MAAM,YAAY,OAAO;AAC/G;;;ACbA,SAAgB,aAAa,MAAe,WAAuD;CACjG,IAAI,UAA0B;CAC9B,OAAO,YAAY,MAAM;EACvB,IAAI,UAAU,OAAO,GACnB,OAAO;EAET,UAAU,QAAQ;CACpB;CACA,OAAO;AACT;AAEA,SAAgB,gBAAgB,MAAe,WAAyD;CACtG,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,SAAgB,eAAe,UAAmB,MAAwB;CACxE,IAAI,UAA0B,KAAK;CACnC,OAAO,YAAY,MAAM;EACvB,IAAI,YAAY,UACd,OAAO;EAET,UAAU,QAAQ;CACpB;CACA,OAAO;AACT;AAEA,SAAgB,gBAAgB,MAAwB;CACtD,IAAI,KAAK,WAAW,QAAQ,OAC1B,OAAO;CAET,OAAO,KAAK,SAAS,KAAK,eAAe;AAC3C;AAEA,SAAgB,mBAAmB,MAAwB;CACzD,OAAO,KAAK,WAAA,MAA4B,KAAK,WAAW,QAAQ;AAClE;AAEA,SAAgB,iBAAiB,MAAwB;CACvD,OAAO,KAAK,WAAA;AACd;AAEA,SAAgB,eAAe,MAAwB;CACrD,OAAO,KAAK,WAAA,MAAuB,KAAK,WAAW,QAAQ;AAC7D;AAEA,SAAgB,gBAAgB,MAAwB;CACtD,OAAO,KAAK,WAAA,MAAwB,KAAK,WAAW,QAAQ;AAC9D;AAEA,SAAgB,aAAa,MAAwB;CACnD,OAAO,KAAK,WAAA,MAAqB,KAAK,WAAW,QAAQ;AAC3D;AAEA,SAAgB,yBAAyB,YAAoB,SAAyB;CACpF,IAAI,WAAW,aAAa,KAC1B,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,SAAgB,oBAAoB,MAA+B;CACjE,IAAI,KAAK,WAAW,QAAQ,OAC1B,OAAO;CAET,IAAI,KAAK,SAAS,WAAW,GAC3B,OAAO,oBAAoB,KAAK,SAAS,EAAE;CAE7C,OAAO;AACT;AAEA,SAAgB,mBAAmB,MAAwB;CACzD,IAAI,KAAK,WAAW,QAAQ,OAC1B,OAAO;CAET,IAAI,KAAK,SAAS,WAAW,GAC3B,OAAO;CAET,OAAO,KAAK,SAAS,OAAM,UAAS,mBAAmB,KAAK,CAAC;AAC/D;;;AC9FA,MAAa,+BAAgD,MAAM,eAAe;CAChF,MAAM,aAAa,aAAa,MAAM,YAAY,KAAK,gBAAgB,MAAM,YAAY;CACzF,IAAI,eAAe,QAAQ,WAAW,WAAW,QAAQ,KACvD,OAAO;CAGT,OAAO;EACL,MAAM,YAAY;EAClB,MAAM,WAAW;EACjB,IAAI,WAAW,KAAK;CACtB;AACF;AAEA,MAAa,0BAA2C,MAAM,eAAe;CAC3E,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,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;CAEA,IAAI,QAAQ,KAAK,IAAI,GACnB,OAAO;CAGT,IAAI,SAAS,KAAK,IAAI,GACpB,OAAO;EACL,MAAM,YAAY;EAClB,MAAM,SAAS;EACf,IAAI,SAAS;EACb,QAAQ,CAAC,IAAI;CACf;CAGF,MAAM,cAAc,SAAS,KAAK,IAAI;CACtC,IAAI,gBAAgB,MAClB,OAAO;CAGT,MAAM,WAAW,yBAAyB,MAAM,YAAY,EAAE,CAAC,SAAS,CAAC;CACzE,IAAI,YAAY,KAAK,KAAK,MAAM,YAAY,EAAE,CAAC,QAAQ,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,GACjF,OAAO;CAGT,OAAO;AACT;;;ACpEA,SAAgB,QAAQ,MAAe,MAAmB,QAAgD;CACxG,OAAO;EACL;EACA,MAAM,KAAK;EACX,IAAI,KAAK;EACT;CACF;AACF;AAEA,SAAgB,qBAAqB,YAAoB,MAAuB;CAC9E,MAAM,SAAS,WAAW,MAAM,IAAI,CAAC,CAAC,KAAK;CAC3C,OAAO,OAAO,WAAW,KAAK,cAAc,KAAK,MAAM;AACzD;AAEA,SAAgB,UAAU,MAAe,YAA4B;CACnE,OAAO,WAAW,MAAM,KAAK,MAAM,KAAK,EAAE;AAC5C;AAEA,SAAgB,YAAY,MAAe,YAAoB,MAAuB;CACpF,OAAO,UAAU,MAAM,UAAU,MAAM;AACzC;;;ACdA,MAAa,+BAAgD,MAAM,eACjE,4BAA4B,MAAM,UAAU,KAC5C,2BAA2B,MAAM,UAAU,KAC3C,0BAA0B,MAAM,UAAU;AAO5C,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,KAAK,KAAK,CACxC;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,KAAK,KAAK,CACtC;AACF;AAEA,SAAS,8BACP,MACA,YACA,eACA,MACA,cAC2B;CAC3B,IAAI,kBAAkB,QAAQ,WAAW,MAAM,cAAc,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,SAAS,GAC/E,OAAO;CAGT,MAAM,OAAO,qBAAqB,eAAe,UAAU;CAC3D,IAAI,SAAS,QAAQ,CAAC,aAAa,IAAI,KAAK,CAAC,uBAAuB,eAAe,YAAY,KAAK,cAAc,GAChH,OAAO;CAGT,IAAI,CAAC,kBAAkB,MAAM,MAAM,aAAa,GAC9C,OAAO;CAGT,OAAO,QAAQ,MAAM,IAAI;AAC3B;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,YAAY,GAAG,CAAC;CAC1F,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,YAAY,GAAG,CAAC;CACzF,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,YAAY,OAAO,YAAY,GAAG,CAAC;CACxF,IAAI,UAAU,GACZ,OAAO;CAGT,KAAK,IAAI,QAAQ,UAAU,GAAG,QAAQ,SAAS,SAAS,QAAQ,SAAS;EACvE,MAAM,QAAQ,SAAS,SAAS;EAChC,IAAI,YAAY,OAAO,YAAY,GAAG,KAAK,eAAe,OAAO,UAAU,GACzE;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,YAAY,GAAG,GAC3C,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,OAA2B;CAC9D,OAAO,uBAAuB,KAAK;AACrC;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,OAA2B;CAC5D,OAAO,uBAAuB,KAAK;AACrC;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,YAAY,WAAW,YAAY,GAAG,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,kBAAkB,eAAwB,YAAoC;CACrF,MAAM,cAAc,cAAc,SAAS,WAAU,UAAS,YAAY,OAAO,YAAY,IAAI,CAAC;CAClG,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,YAAY,GAAG,KAAK,eAAe,OAAO,UAAU,GACzE;EAEF,OAAO;CACT;CAEA,OAAO;AACT;AAEA,SAAS,eAAe,MAAe,YAA6B;CAClE,OAAO,KAAK,WAAW,QAAQ,SAAS,YAAY,MAAM,YAAY,GAAG;AAC3E;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;;;ACtSA,SAAgB,wBACd,MACA,YACA,WACA,SAI2B;CAC3B,IAAI,cAAc,MAChB,OAAO;CAGT,MAAM,YAAY,UAAU,SAAS,UAAU,SAAS,SAAS;CACjE,IAAI,WAAW,WAAW,QAAQ,SAAS,SAAS,WAClD,OAAO;CAGT,IAAI,WAAW,MAAM,UAAU,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,SAAS,GACjD,OAAO;CAGT,IAAI,QAAQ,gBAAgB,UAAa,CAAC,QAAQ,YAAY,SAAS,GACrE,OAAO;CAGT,MAAM,OAAO,OAAO,QAAQ,SAAS,aAAa,QAAQ,KAAK,WAAW,SAAS,IAAI,QAAQ;CAC/F,IAAI,SAAS,MACX,OAAO;CAGT,OAAO,QAAQ,WAAW,IAAI;AAChC;;;AC9BA,MAAa,4BAA6C,MAAM,YAAY,YAC1E,6BAA6B,MAAM,YAAY,QAAQ,QAAQ,KAAK,2BAA2B,MAAM,UAAU;AAEjH,SAAS,6BACP,MACA,YACA,UAC2B;CAC3B,OAAO,wBAAwB,MAAM,YAAY,aAAa,MAAM,kBAAkB,GAAG;EACvF,cAAa,cAAa;GACxB,MAAM,WAAW,UAAU,SAAS,MAClC,UAAS,MAAM,WAAA,MAAwB,MAAM,WAAW,QAAQ,YAClE;GACA,OAAO,aAAa,UAAa,CAAC,gBAAgB,QAAQ;EAC5D;EACA,YAAY,+BAA+B,QAAQ;CACrD,CAAC;AACH;AAEA,SAAS,+BAA+B,UAAqD;CAC3F,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,OAAO,wBAAwB,MAAM,YAAY,aAAa,MAAM,gBAAgB,GAAG;EACrF,cAAa,cAAa;GACxB,MAAM,UAAU,UAAU,SAAS,MACjC,UAAS,MAAM,WAAA,MAA4B,MAAM,WAAW,QAAQ,YACtE;GACA,OAAO,YAAY,UAAa,CAAC,gBAAgB,OAAO;EAC1D;EACA,OAAO,WAAW,cAAc;GAC9B,MAAM,UAAU,UAAU,SAAS,WAAU,UAAS,WAAW,MAAM,MAAM,MAAM,MAAM,EAAE,MAAM,GAAG;GACpG,IAAI,UAAU,GACZ,OAAO,YAAY;GAGrB,MAAM,cAAc,UAAU,SAAS,UAAU;GACjD,IAAI,gBAAgB,UAAa,gBAAgB,aAAa,gBAAgB,WAAW,GACvF,OAAO,YAAY;GAGrB,OAAO,YAAY;EACrB;CACF,CAAC;AACH;AAEA,SAAgB,8BAA8B,MAA4B;CACxE,OACE,SAAS,YAAY,2BACrB,SAAS,YAAY,0BACrB,SAAS,YAAY;AAEzB;;;ACpDA,MAAa,8BAA+C,MAAM,eAChE,6BAA6B,MAAM,UAAU,KAC7C,8BAA8B,MAAM,UAAU,KAC9C,+BAA+B,MAAM,UAAU;AAEjD,MAAa,8BAA+C,MAAM,eAChE,yBAAyB,MAAM,UAAU;AAE3C,SAAS,6BAA6B,MAAe,YAA+C;CAClG,MAAM,YAAY,aAAa,OAAM,WAAU,OAAO,WAAA,EAAsB;CAC5E,IAAI,cAAc,MAChB,OAAO;CAGT,MAAM,eAAe,UAAU,SAAS,UAAU,SAAS,SAAS;CACpE,IAAI,cAAc,WAAW,QAAQ,SAAS,SAAS,cACrD,OAAO;CAGT,IAAI,WAAW,MAAM,UAAU,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,SAAS,GACjD,OAAO;CAGT,MAAM,gBAAgB,UAAU,SAAS;CACzC,IAAI,kBAAkB,UAAa,kBAAkB,cACnD,OAAO;CAGT,IAAI,CAAC,YAAY,eAAe,YAAY,GAAG,GAC7C,OAAO;CAGT,OAAO,QAAQ,cAAc,YAAY,oBAAoB;AAC/D;AAEA,SAAS,8BAA8B,MAAe,YAA+C;CACnG,MAAM,aAAa,aACjB,OACA,WAAU,OAAO,WAAA,MAA2B,OAAO,WAAA,KAA+B,OAAO,WAAA,EAC3F;CACA,IAAI,eAAe,MACjB,OAAO;CAGT,MAAM,eAAe,WAAW,SAAS,WAAW,SAAS,SAAS;CACtE,IAAI,cAAc,WAAW,QAAQ,SAAS,SAAS,cACrD,OAAO;CAGT,IAAI,WAAW,MAAM,WAAW,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,SAAS,GAClD,OAAO;CAGT,IAAI,WAAW,SAAS,SAAS,GAC/B,OAAO;CAGT,MAAM,YAAY,WAAW,SAAS;CACtC,IAAI,UAAU,WAAW,QAAQ,SAAS,gBAAgB,SAAS,GACjE,OAAO;CAGT,OAAO,QAAQ,cAAc,YAAY,oBAAoB;AAC/D;AAEA,SAAS,+BAA+B,MAAe,YAA+C;CACpG,MAAM,cAAc,aAAa,OAAM,WAAU,OAAO,WAAA,EAAkB;CAC1E,IAAI,gBAAgB,MAClB,OAAO;CAGT,MAAM,eAAe,yBAAyB,aAAa,UAAU;CACrE,IAAI,iBAAiB,QAAQ,SAAS,cACpC,OAAO;CAGT,IAAI,CAAC,qBAAqB,YAAY,YAAY,EAAE,GAClD,OAAO;CAGT,OAAO,QAAQ,cAAc,YAAY,oBAAoB;AAC/D;AAEA,SAAS,yBAAyB,MAAe,YAA+C;CAC9F,MAAM,WAAW,aAAa,OAAM,WAAU,OAAO,WAAA,CAAyB;CAC9E,IAAI,aAAa,QAAQ,CAAC,yBAAyB,UAAU,UAAU,GACrE,OAAO;CAGT,MAAM,aAAa,sBAAsB,UAAU,UAAU;CAC7D,IAAI,eAAe,QAAQ,SAAS,cAAc,CAAC,qBAAqB,YAAY,SAAS,EAAE,GAC7F,OAAO;CAGT,OAAO,QAAQ,YAAY,YAAY,gBAAgB;AACzD;AAEA,SAAS,yBAAyB,WAAoB,YAAoC;CACxF,KAAK,IAAI,QAAQ,UAAU,SAAS,SAAS,GAAG,SAAS,GAAG,SAAS;EACnE,MAAM,QAAQ,UAAU,SAAS;EACjC,IAAI,yBAAyB,OAAO,UAAU,GAC5C;EAEF,OAAO,oBAAoB,KAAK;CAClC;CACA,OAAO;AACT;AAEA,SAAS,sBAAsB,UAAmB,YAAoC;CACpF,KAAK,MAAM,SAAS,SAAS,UAAU;EACrC,IAAI,YAAY,OAAO,YAAY,GAAG,GACpC;EAEF,MAAM,YAAY,oBAAoB,KAAK;EAC3C,IAAI,cAAc,MAChB,OAAO;CAEX;CACA,OAAO;AACT;AAEA,SAAS,yBAAyB,MAAe,YAA6B;CAC5E,MAAM,OAAO,UAAU,MAAM,UAAU;CACvC,OAAO,SAAS,OAAO,SAAS,OAAO,SAAS;AAClD;AAEA,SAAS,yBAAyB,UAAmB,YAA6B;CAChF,OAAO,2BAA2B,UAAU,UAAU,MAAM;AAC9D;AAEA,SAAS,2BAA2B,UAAmB,YAAoC;CACzF,IAAI,UAA0B,SAAS;CACvC,OAAO,YAAY,MAAM;EACvB,KAAK,MAAM,SAAS,QAAQ,UAAU;GACpC,IAAI,CAAC,eAAe,KAAK,KAAK,CAAC,gBAAgB,KAAK,KAAK,CAAC,aAAa,KAAK,GAC1E;GAEF,IAAI,qBAAqB,UAAU,OAAO,UAAU,GAClD,OAAO;EAEX;EACA,UAAU,QAAQ;CACpB;CACA,OAAO;AACT;AAEA,SAAS,qBAAqB,UAAmB,UAAmB,YAA6B;CAC/F,MAAM,OAAO,WAAW,MAAM,SAAS,EAAE;CACzC,MAAM,QAAQ,SAAS,KAAK,IAAI;CAChC,IAAI,UAAU,MACZ,OAAO;CAGT,MAAM,UAAU,SAAS,KAAK,MAAM,QAAQ,MAAM,EAAE,CAAC,QAAQ,GAAG;CAChE,MAAM,WAAW,yBAAyB,YAAY,OAAO;CAC7D,IAAI,WAAW,GACb,OAAO;CAGT,OAAO,SAAS,OAAO,WAAW,SAAS,OAAO;AACpD;;;ACtKA,MAAM,0BAA6C;CACjD;CACA;CACA,oBAAoB,0BAA0B;CAC9C,oBAAoB,0BAA0B;CAC9C;CACA;AACF;;AAGA,SAAgB,mBACd,MACA,YACA,SAC2B;CAC3B,KAAK,MAAM,cAAc,yBAAyB;EAChD,MAAM,QAAQ,WAAW,MAAM,YAAY,OAAO;EAClD,IAAI,UAAU,MACZ,OAAO;CAEX;CACA,OAAO;AACT;;AAGA,SAAgB,sBACd,MACA,qBACuD;CACvD,MAAM,SAAS,KAAK;CACpB,IAAI,WAAW,MACb,OAAO,sBACH,OACA;EAAE,OAAO;GAAE,MAAM,YAAY;GAAe,MAAM,KAAK;GAAM,IAAI,KAAK;EAAG;EAAG,QAAQ;CAAK;CAG/F,IAAI,OAAO,WAAA,GACT,OAAO;EACL,OAAO;GAAE,MAAM,YAAY;GAAe,MAAM,OAAO;GAAM,IAAI,OAAO;EAAG;EAC3E,QAAQ;CACV;CAGF,IAAI,qBACF,OAAO;CAGT,MAAM,SAAS,KAAK,SAAS,KAAK,KAAK,SAAS;CAChD,OAAO;EACL,OAAO;GAAE,MAAM,YAAY;GAAe,MAAM,OAAO;GAAM,IAAI,OAAO;EAAG;EAC3E;CACF;AACF;;;;;;ACvDA,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,SAAgB,gCAAgC,YAA0C;CACxF,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,SAAgB,qBAAqB,YAA+C;CAClF,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,SAAgB,kBAAkB,QAAoD;CACpF,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;CAIhF,OAAO,gCAHU,OAAO,QACtB,UAAS,MAAM,SAAS,YAAY,iBAAiB,CAAC,SAAS,MAAK,SAAQ,cAAc,OAAO,IAAI,CAAC,CAEjE,CAAQ;AACjD;AAEA,SAAS,gCAAgC,QAAoD;CAC3F,MAAM,WAAW,OAAO,QAAO,UAAS,MAAM,SAAS,YAAY,aAAa;CAChF,IAAI,SAAS,UAAU,GACrB,OAAO;CAGT,MAAM,SAAS,OAAO,QAAO,UAAS,MAAM,SAAS,YAAY,aAAa;CAC9E,MAAM,QAAQ,CAAC,GAAG,QAAQ,CAAC,CAAC,MAAM,MAAM,UAAU,KAAK,OAAO,MAAM,IAAI,CAAC,CAAC;CAC1E,OAAO,CAAC,GAAG,QAAQ,KAAK;AAC1B;AAEA,SAAS,cAAc,GAAuB,GAAgC;CAC5E,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE;AACrC;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;;;;;;;;;;;;;;;;;;;;AC3MA,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;AAEA,SAAS,gBACP,MACA,YACA,SACA,kBACA,SACA;CACA,IAAI,KAAK,WAAW,QAAQ,OAC1B;CAGF,MAAM,aAAa,mBAAmB,MAAM,YAAY;EAAE;EAAkB,UAAU,SAAS;CAAS,CAAC;CACzG,IAAI,eAAe,MAAM;EACvB,QAAQ,YAAY,IAAI;EACxB;CACF;CAEA,MAAM,WAAW,sBAAsB,MAAM,gBAAgB;CAC7D,IAAI,aAAa,MACf,QAAQ,SAAS,OAAO,SAAS,MAAM;AAE3C"}