@rsconcept/domain 1.6.1 → 1.7.1

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

@@ -1,311 +0,0 @@
-import { annotateError } from "../ast-annotations.js";
-import { RSErrorCode } from "../error.js";
-import { visitAstDFS } from "../../parsing/ast.js";
-import "../../parsing/index.js";
-import { TokenID } from "./token.js";
-import { TypeClass } from "../semantic/typification.js";
-import "./parser.terms.js";
-//#region src/rslang/parser/syntax-errors.ts
-/**
-* Module: Syntactic errors reporting.
-*/
-/** Extracts syntax errors from an AST. */
-function extractSyntaxErrors(ast, expression, reporter, annotateErrors = false, options) {
-	const forbiddenErrors = extractForbiddenCharacterErrors(expression);
-	if (forbiddenErrors.length > 0) {
-		for (const error of forbiddenErrors) {
-			reporter(error);
-			if (annotateErrors) annotateError(ast, error.code, error.params);
-		}
-		return;
-	}
-	const collected = [];
-	const annotationTargets = /* @__PURE__ */ new Map();
-	const collect = (error, target) => {
-		collected.push(error);
-		if (target !== void 0) annotationTargets.set(error, target);
-	};
-	const bracketError = extractBracketErrors(expression);
-	if (bracketError !== null) collect(bracketError, ast);
-	const hasBracketErrors = bracketError !== null;
-	visitAstDFS(ast, (node) => extractInternal(node, expression, collect, hasBracketErrors, options));
-	for (const error of deduplicateErrors(collected)) {
-		reporter(error);
-		if (annotateErrors) {
-			const target = annotationTargets.get(error);
-			if (target !== void 0) annotateError(target, error.code, error.params);
-		}
-	}
-}
-function extractInternal(node, expression, collect, ignoreUnknownErrors, options) {
-	if (node.typeID !== TokenID.ERROR) return;
-	function emit(target, code, params) {
-		collect({
-			code,
-			from: target.from,
-			to: target.to,
-			params
-		}, target);
-	}
-	const classified = classifyParseError(node, expression, options);
-	if (classified !== null) {
-		collect(classified, node);
-		return;
-	}
-	const parent = node.parent;
-	if (parent === null) {
-		if (!ignoreUnknownErrors) return emit(node, RSErrorCode.unknownSyntax);
-		return;
-	}
-	if (parent.typeID === 4) return emit(parent, RSErrorCode.expectedLocal);
-	if (!ignoreUnknownErrors) emit(node.from === node.to ? parent : node, RSErrorCode.unknownSyntax);
-}
-function classifyParseError(node, expression, options) {
-	const incompleteFunctionDecl = detectIncompleteFunctionDecl(node, expression, options?.expected);
-	if (incompleteFunctionDecl !== null) return incompleteFunctionDecl;
-	const filterParen = detectFilterParenMismatch(node, expression);
-	if (filterParen !== null) return filterParen;
-	return detectGlobalFuncWithoutArgs(node, expression);
-}
-function detectIncompleteFunctionDecl(node, expression, expected) {
-	const funcDecl = findAncestor(node, isFunctionDeclNode);
-	if (funcDecl === null) return null;
-	const bodyChild = funcDecl.children[funcDecl.children.length - 1];
-	if (bodyChild?.typeID !== TokenID.ERROR || node !== bodyChild) return null;
-	const argsNode = funcDecl.children.find((child) => child.typeID === 77 || child.typeID === TokenID.NT_ARGUMENTS);
-	if (argsNode === void 0 || subtreeHasError(argsNode)) return null;
-	if (expression.slice(funcDecl.to).trim().length > 0) return null;
-	return {
-		code: incompleteFormalExpressionCode(expected),
-		from: bodyChild.from,
-		to: bodyChild.to
-	};
-}
-function incompleteFormalExpressionCode(expected) {
-	switch (expected) {
-		case TypeClass.function: return RSErrorCode.expectedExpressionBody;
-		case TypeClass.predicate:
-		case TypeClass.logic: return RSErrorCode.expectedLogicBody;
-		default: return RSErrorCode.expectedFunctionBody;
-	}
-}
-function subtreeHasError(node) {
-	if (node.typeID === TokenID.ERROR) return true;
-	return node.children.some(subtreeHasError);
-}
-function detectFilterParenMismatch(node, expression) {
-	const filterNode = findAncestor(node, isFilterNode) ?? findRelatedNode(node, isFilterNode);
-	if (filterNode === null) return null;
-	if (expression[filterNode.to] === "(") return {
-		code: RSErrorCode.invalidFilterSyntax,
-		from: filterNode.from,
-		to: filterNode.to + 1
-	};
-	return null;
-}
-function detectGlobalFuncWithoutArgs(node, expression) {
-	const funcNode = findAncestor(node, (n) => isFunctionNode(n) || isPredicateNode(n)) ?? findRelatedNode(node, (n) => isFunctionNode(n) || isPredicateNode(n));
-	if (funcNode === null) return null;
-	return classifyFuncWithoutArgs(funcNode, expression);
-}
-function findRelatedNode(node, predicate) {
-	let current = node.parent;
-	while (current !== null) {
-		for (const child of current.children) if (predicate(child)) return child;
-		current = current.parent;
-	}
-	return null;
-}
-function classifyFuncWithoutArgs(funcNode, expression) {
-	const name = expression.slice(funcNode.from, funcNode.to);
-	const rest = expression.slice(funcNode.to);
-	const withoutArgs = {
-		code: RSErrorCode.globalFuncWithoutArgs,
-		from: funcNode.from,
-		to: funcNode.to,
-		params: [name]
-	};
-	if (/^\s*$/.test(rest)) return withoutArgs;
-	const openBracket = /^\s*\[/.exec(rest);
-	if (openBracket === null) return null;
-	const closeIdx = findMatchingCloseBracket(rest, openBracket[0].length - 1);
-	if (closeIdx >= 0) {
-		if (rest.slice(openBracket[0].length, closeIdx).trim().length === 0) return withoutArgs;
-	}
-	return null;
-}
-function findAncestor(node, predicate) {
-	let current = node;
-	while (current !== null) {
-		if (predicate(current)) return current;
-		current = current.parent;
-	}
-	return null;
-}
-function isFunctionDeclNode(node) {
-	return node.typeID === 76 || node.typeID === TokenID.NT_FUNC_DEFINITION;
-}
-function isFunctionNode(node) {
-	return node.typeID === 69 || node.typeID === TokenID.ID_FUNCTION;
-}
-function isPredicateNode(node) {
-	return node.typeID === 26 || node.typeID === TokenID.ID_PREDICATE;
-}
-function isFilterNode(node) {
-	return node.typeID === 59 || node.typeID === TokenID.FILTER;
-}
-function findMatchingCloseBracket(expression, openPos) {
-	if (expression[openPos] !== "[") return -1;
-	let depth = 0;
-	for (let index = openPos; index < expression.length; index++) {
-		const symbol = expression[index];
-		if (symbol === "[") depth++;
-		else if (symbol === "]") {
-			depth--;
-			if (depth === 0) return index;
-		}
-	}
-	return -1;
-}
-function deduplicateErrors(errors) {
-	const result = [];
-	for (const error of errors) {
-		if (result.some((existing) => existing.code === error.code && existing.from === error.from && existing.to === error.to)) continue;
-		if (error.code !== RSErrorCode.unknownSyntax) {
-			for (let index = result.length - 1; index >= 0; index--) if (result[index].code === RSErrorCode.unknownSyntax && rangesOverlap(error, result[index])) result.splice(index, 1);
-		}
-		result.push(error);
-	}
-	const specific = result.filter((error) => error.code !== RSErrorCode.unknownSyntax);
-	return result.filter((error) => error.code !== RSErrorCode.unknownSyntax || !specific.some((item) => rangesOverlap(error, item)));
-}
-function rangesOverlap(a, b) {
-	return a.from < b.to && b.from < a.to;
-}
-const ALLOWED_EXPRESSION_CHARS = buildAllowedExpressionChars();
-function buildAllowedExpressionChars() {
-	const chars = /* @__PURE__ */ new Set();
-	for (const chunk of [
-		"0123456789",
-		"abcdefghijklmnopqrstuvwxyz",
-		"ABCDEFGHIJKLMNOPQRSTUVWXYZ",
-		"_",
-		"∅¬∀∃⇔⇒∨&ℬ+-*∪\\∆∩×∈∉⊆⊄⊂<>≥≤≠=,:;|[]{}()"
-	]) for (const symbol of chunk) chars.add(symbol);
-	for (let codePoint = 945; codePoint <= 969; codePoint++) chars.add(String.fromCodePoint(codePoint));
-	return chars;
-}
-function isAllowedExpressionChar(symbol) {
-	return /\s/u.test(symbol) || ALLOWED_EXPRESSION_CHARS.has(symbol);
-}
-function extractForbiddenCharacterErrors(expression) {
-	const errors = [];
-	let pos = 0;
-	while (pos < expression.length) {
-		const symbol = expression[pos];
-		if (isAllowedExpressionChar(symbol)) {
-			pos++;
-			continue;
-		}
-		const start = pos;
-		while (pos < expression.length && !isAllowedExpressionChar(expression[pos])) pos++;
-		errors.push({
-			code: RSErrorCode.forbiddenCharacter,
-			from: start,
-			to: pos,
-			params: [expression.slice(start, pos)]
-		});
-	}
-	return errors;
-}
-function extractBracketErrors(expression) {
-	const stack = [];
-	for (let pos = 0; pos < expression.length; pos++) {
-		const symbol = expression[pos];
-		if (isOpenBracket(symbol)) {
-			if (isDoubleParenthesis(expression, pos)) return {
-				code: RSErrorCode.doubleParenthesis,
-				from: pos,
-				to: pos + 2
-			};
-			stack.push({
-				bracket: symbol,
-				index: pos
-			});
-			continue;
-		}
-		if (!isCloseBracket(symbol)) continue;
-		const expectedOpen = closeToOpen(symbol);
-		const top = stack[stack.length - 1];
-		if (top === void 0) return {
-			code: RSErrorCode.missingOpenBracket,
-			from: pos,
-			to: pos + 1,
-			params: [symbol]
-		};
-		if (top.bracket !== expectedOpen) return {
-			code: RSErrorCode.bracketMismatch,
-			from: pos,
-			to: pos + 1,
-			params: [openToClose(top.bracket), symbol]
-		};
-		stack.pop();
-	}
-	if (stack.length > 0) {
-		const unclosed = stack[0];
-		return {
-			code: RSErrorCode.missingCloseBracket,
-			from: unclosed.index,
-			to: unclosed.index + 1,
-			params: [unclosed.bracket]
-		};
-	}
-	return null;
-}
-function isOpenBracket(symbol) {
-	return symbol === "(" || symbol === "[" || symbol === "{";
-}
-function isCloseBracket(symbol) {
-	return symbol === ")" || symbol === "]" || symbol === "}";
-}
-function openToClose(symbol) {
-	switch (symbol) {
-		case "(": return ")";
-		case "[": return "]";
-		case "{": return "}";
-	}
-}
-function closeToOpen(symbol) {
-	switch (symbol) {
-		case ")": return "(";
-		case "]": return "[";
-		case "}": return "{";
-	}
-}
-function isDoubleParenthesis(expression, pos) {
-	if (!(expression[pos] === "(" && expression[pos + 1] === "(")) return false;
-	const outerClose = findMatchingCloseParen(expression, pos);
-	const innerClose = findMatchingCloseParen(expression, pos + 1);
-	if (outerClose < 0 || innerClose < 0) return false;
-	return outerClose === innerClose + 1;
-}
-function findMatchingCloseParen(expression, openPos) {
-	if (expression[openPos] !== "(") return -1;
-	const stack = [];
-	for (let index = openPos; index < expression.length; index++) {
-		const symbol = expression[index];
-		if (isOpenBracket(symbol)) {
-			stack.push(symbol);
-			continue;
-		}
-		if (!isCloseBracket(symbol)) continue;
-		const top = stack.pop();
-		if (top === void 0 || top !== closeToOpen(symbol)) return -1;
-		if (stack.length === 0) return index;
-	}
-	return -1;
-}
-//#endregion
-export { extractSyntaxErrors };
-
-//# sourceMappingURL=syntax-errors.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"syntax-errors.js","names":["TypeClassEnum"],"sources":["../../../src/rslang/parser/syntax-errors.ts"],"sourcesContent":["/**\n * Module: Syntactic errors reporting.\n */\n\nimport { type AstNode, visitAstDFS } from '../../parsing';\nimport { annotateError } from '../ast-annotations';\nimport { type ErrorReporter, RSErrorCode, type RSErrorDescription } from '../error';\nimport { type TypeClass, TypeClass as TypeClassEnum } from '../semantic/typification';\n\nimport { Arguments, Filter, Function, Function_decl, Predicate, Variable } from './parser.terms';\nimport { TokenID } from './token';\n\n/** Options for syntax error extraction. */\nexport interface SyntaxErrorOptions {\n  expected?: TypeClass;\n}\n\n/** Extracts syntax errors from an AST. */\nexport function extractSyntaxErrors(\n  ast: AstNode,\n  expression: string,\n  reporter: ErrorReporter,\n  annotateErrors: boolean = false,\n  options?: SyntaxErrorOptions\n) {\n  const forbiddenErrors = extractForbiddenCharacterErrors(expression);\n  if (forbiddenErrors.length > 0) {\n    for (const error of forbiddenErrors) {\n      reporter(error);\n      if (annotateErrors) {\n        annotateError(ast, error.code, error.params);\n      }\n    }\n    return;\n  }\n\n  const collected: RSErrorDescription[] = [];\n  const annotationTargets = new Map<RSErrorDescription, AstNode>();\n  const collect = (error: RSErrorDescription, target?: AstNode) => {\n    collected.push(error);\n    if (target !== undefined) {\n      annotationTargets.set(error, target);\n    }\n  };\n\n  const bracketError = extractBracketErrors(expression);\n  if (bracketError !== null) {\n    collect(bracketError, ast);\n  }\n  const hasBracketErrors = bracketError !== null;\n  visitAstDFS(ast, node => extractInternal(node, expression, collect, hasBracketErrors, options));\n\n  for (const error of deduplicateErrors(collected)) {\n    reporter(error);\n    if (annotateErrors) {\n      const target = annotationTargets.get(error);\n      if (target !== undefined) {\n        annotateError(target, error.code, error.params);\n      }\n    }\n  }\n}\n\n// ====== Internals =========\nfunction extractInternal(\n  node: AstNode,\n  expression: string,\n  collect: (error: RSErrorDescription, target: AstNode) => void,\n  ignoreUnknownErrors: boolean,\n  options?: SyntaxErrorOptions\n) {\n  if (node.typeID !== TokenID.ERROR) {\n    return;\n  }\n\n  function emit(target: AstNode, code: RSErrorCode, params?: readonly string[]) {\n    collect({ code: code, from: target.from, to: target.to, params }, target);\n  }\n\n  const classified = classifyParseError(node, expression, options);\n  if (classified !== null) {\n    collect(classified, node);\n    return;\n  }\n\n  const parent = node.parent;\n  if (parent === null) {\n    if (!ignoreUnknownErrors) {\n      return emit(node, RSErrorCode.unknownSyntax);\n    }\n    return;\n  }\n\n  if (parent.typeID === Variable) {\n    return emit(parent, RSErrorCode.expectedLocal);\n  }\n\n  if (!ignoreUnknownErrors) {\n    emit(node.from === node.to ? parent : node, RSErrorCode.unknownSyntax);\n  }\n}\n\nfunction classifyParseError(\n  node: AstNode,\n  expression: string,\n  options?: SyntaxErrorOptions\n): RSErrorDescription | null {\n  const incompleteFunctionDecl = detectIncompleteFunctionDecl(node, expression, options?.expected);\n  if (incompleteFunctionDecl !== null) {\n    return incompleteFunctionDecl;\n  }\n\n  const filterParen = detectFilterParenMismatch(node, expression);\n  if (filterParen !== null) {\n    return filterParen;\n  }\n\n  return detectGlobalFuncWithoutArgs(node, expression);\n}\n\nfunction detectIncompleteFunctionDecl(\n  node: AstNode,\n  expression: string,\n  expected?: TypeClass\n): RSErrorDescription | null {\n  const funcDecl = findAncestor(node, isFunctionDeclNode);\n  if (funcDecl === null) {\n    return null;\n  }\n\n  const bodyChild = funcDecl.children[funcDecl.children.length - 1];\n  if (bodyChild?.typeID !== TokenID.ERROR || node !== bodyChild) {\n    return null;\n  }\n\n  const argsNode = funcDecl.children.find(child => child.typeID === Arguments || child.typeID === TokenID.NT_ARGUMENTS);\n  if (argsNode === undefined || subtreeHasError(argsNode)) {\n    return null;\n  }\n\n  if (expression.slice(funcDecl.to).trim().length > 0) {\n    return null;\n  }\n\n  return {\n    code: incompleteFormalExpressionCode(expected),\n    from: bodyChild.from,\n    to: bodyChild.to\n  };\n}\n\nfunction incompleteFormalExpressionCode(expected?: TypeClass): RSErrorCode {\n  switch (expected) {\n    case TypeClassEnum.function:\n      return RSErrorCode.expectedExpressionBody;\n    case TypeClassEnum.predicate:\n    case TypeClassEnum.logic:\n      return RSErrorCode.expectedLogicBody;\n    default:\n      return RSErrorCode.expectedFunctionBody;\n  }\n}\n\nfunction subtreeHasError(node: AstNode): boolean {\n  if (node.typeID === TokenID.ERROR) {\n    return true;\n  }\n  return node.children.some(subtreeHasError);\n}\n\nfunction detectFilterParenMismatch(node: AstNode, expression: string): RSErrorDescription | null {\n  const filterNode = findAncestor(node, isFilterNode) ?? findRelatedNode(node, isFilterNode);\n  if (filterNode === null) {\n    return null;\n  }\n\n  const nextChar = expression[filterNode.to];\n  if (nextChar === '(') {\n    return {\n      code: RSErrorCode.invalidFilterSyntax,\n      from: filterNode.from,\n      to: filterNode.to + 1\n    };\n  }\n  return null;\n}\n\nfunction detectGlobalFuncWithoutArgs(node: AstNode, expression: string): RSErrorDescription | null {\n  const funcNode =\n    findAncestor(node, n => isFunctionNode(n) || isPredicateNode(n)) ??\n    findRelatedNode(node, n => isFunctionNode(n) || isPredicateNode(n));\n  if (funcNode === null) {\n    return null;\n  }\n  return classifyFuncWithoutArgs(funcNode, expression);\n}\n\nfunction findRelatedNode(node: AstNode, predicate: (target: AstNode) => boolean): AstNode | null {\n  let current: AstNode | null = node.parent;\n  while (current !== null) {\n    for (const child of current.children) {\n      if (predicate(child)) {\n        return child;\n      }\n    }\n    current = current.parent;\n  }\n  return null;\n}\n\nfunction classifyFuncWithoutArgs(funcNode: AstNode, expression: string): RSErrorDescription | null {\n  const name = expression.slice(funcNode.from, funcNode.to);\n  const rest = expression.slice(funcNode.to);\n\n  const withoutArgs: RSErrorDescription = {\n    code: RSErrorCode.globalFuncWithoutArgs,\n    from: funcNode.from,\n    to: funcNode.to,\n    params: [name]\n  };\n\n  // Function with nothing (or only whitespace) after it is genuinely called without arguments.\n  if (/^\\s*$/.test(rest)) {\n    return withoutArgs;\n  }\n\n  // Anything other than a bracketed argument form (e.g. parentheses or braces) is malformed call\n  // syntax: defer to the bracket/syntax error handling instead of reporting a missing-arguments error.\n  const openBracket = /^\\s*\\[/.exec(rest);\n  if (openBracket === null) {\n    return null;\n  }\n\n  const closeIdx = findMatchingCloseBracket(rest, openBracket[0].length - 1);\n  if (closeIdx >= 0) {\n    const inner = rest.slice(openBracket[0].length, closeIdx).trim();\n    if (inner.length === 0) {\n      return withoutArgs;\n    }\n  }\n\n  return null;\n}\n\nfunction findAncestor(node: AstNode, predicate: (node: AstNode) => boolean): AstNode | null {\n  let current: AstNode | null = node;\n  while (current !== null) {\n    if (predicate(current)) {\n      return current;\n    }\n    current = current.parent;\n  }\n  return null;\n}\n\nfunction isFunctionDeclNode(node: AstNode): boolean {\n  return node.typeID === Function_decl || node.typeID === TokenID.NT_FUNC_DEFINITION;\n}\n\nfunction isFunctionNode(node: AstNode): boolean {\n  return node.typeID === Function || node.typeID === TokenID.ID_FUNCTION;\n}\n\nfunction isPredicateNode(node: AstNode): boolean {\n  return node.typeID === Predicate || node.typeID === TokenID.ID_PREDICATE;\n}\n\nfunction isFilterNode(node: AstNode): boolean {\n  return node.typeID === Filter || node.typeID === TokenID.FILTER;\n}\n\nfunction findMatchingCloseBracket(expression: string, openPos: number): number {\n  const open = expression[openPos];\n  if (open !== '[') {\n    return -1;\n  }\n\n  let depth = 0;\n  for (let index = openPos; index < expression.length; index++) {\n    const symbol = expression[index];\n    if (symbol === '[') {\n      depth++;\n    } else if (symbol === ']') {\n      depth--;\n      if (depth === 0) {\n        return index;\n      }\n    }\n  }\n  return -1;\n}\n\nfunction deduplicateErrors(errors: RSErrorDescription[]): RSErrorDescription[] {\n  const result: RSErrorDescription[] = [];\n\n  for (const error of errors) {\n    const duplicate = result.some(\n      existing => existing.code === error.code && existing.from === error.from && existing.to === error.to\n    );\n    if (duplicate) {\n      continue;\n    }\n\n    if (error.code !== RSErrorCode.unknownSyntax) {\n      for (let index = result.length - 1; index >= 0; index--) {\n        if (result[index].code === RSErrorCode.unknownSyntax && rangesOverlap(error, result[index])) {\n          result.splice(index, 1);\n        }\n      }\n    }\n\n    result.push(error);\n  }\n\n  const specific = result.filter(error => error.code !== RSErrorCode.unknownSyntax);\n  return result.filter(\n    error => error.code !== RSErrorCode.unknownSyntax || !specific.some(item => rangesOverlap(error, item))\n  );\n}\n\nfunction rangesOverlap(a: RSErrorDescription, b: RSErrorDescription): boolean {\n  return a.from < b.to && b.from < a.to;\n}\n\ntype OpenBracket = '(' | '[' | '{';\ntype CloseBracket = ')' | ']' | '}';\n\ninterface BracketFrame {\n  bracket: OpenBracket;\n  index: number;\n}\n\nconst ALLOWED_EXPRESSION_CHARS = buildAllowedExpressionChars();\n\nfunction buildAllowedExpressionChars(): Set<string> {\n  const chars = new Set<string>();\n  for (const chunk of [\n    '0123456789',\n    'abcdefghijklmnopqrstuvwxyz',\n    'ABCDEFGHIJKLMNOPQRSTUVWXYZ',\n    '_',\n    '∅¬∀∃⇔⇒∨&ℬ+-*∪\\\\∆∩×∈∉⊆⊄⊂<>≥≤≠=,:;|[]{}()'\n  ]) {\n    for (const symbol of chunk) {\n      chars.add(symbol);\n    }\n  }\n  for (let codePoint = 0x03b1; codePoint <= 0x03c9; codePoint++) {\n    chars.add(String.fromCodePoint(codePoint));\n  }\n  return chars;\n}\n\nfunction isAllowedExpressionChar(symbol: string): boolean {\n  return /\\s/u.test(symbol) || ALLOWED_EXPRESSION_CHARS.has(symbol);\n}\n\nfunction extractForbiddenCharacterErrors(expression: string): RSErrorDescription[] {\n  const errors: RSErrorDescription[] = [];\n  let pos = 0;\n\n  while (pos < expression.length) {\n    const symbol = expression[pos];\n    if (isAllowedExpressionChar(symbol)) {\n      pos++;\n      continue;\n    }\n\n    const start = pos;\n    while (pos < expression.length && !isAllowedExpressionChar(expression[pos])) {\n      pos++;\n    }\n\n    errors.push({\n      code: RSErrorCode.forbiddenCharacter,\n      from: start,\n      to: pos,\n      params: [expression.slice(start, pos)]\n    });\n  }\n\n  return errors;\n}\n\nfunction extractBracketErrors(expression: string): RSErrorDescription | null {\n  const stack: BracketFrame[] = [];\n\n  for (let pos = 0; pos < expression.length; pos++) {\n    const symbol = expression[pos];\n    if (isOpenBracket(symbol)) {\n      if (isDoubleParenthesis(expression, pos)) {\n        return {\n          code: RSErrorCode.doubleParenthesis,\n          from: pos,\n          to: pos + 2\n        };\n      }\n      stack.push({ bracket: symbol, index: pos });\n      continue;\n    }\n    if (!isCloseBracket(symbol)) {\n      continue;\n    }\n\n    const expectedOpen = closeToOpen(symbol);\n    const top = stack[stack.length - 1];\n    if (top === undefined) {\n      return {\n        code: RSErrorCode.missingOpenBracket,\n        from: pos,\n        to: pos + 1,\n        params: [symbol]\n      };\n    }\n\n    if (top.bracket !== expectedOpen) {\n      return {\n        code: RSErrorCode.bracketMismatch,\n        from: pos,\n        to: pos + 1,\n        params: [openToClose(top.bracket), symbol]\n      };\n    }\n\n    stack.pop();\n  }\n\n  if (stack.length > 0) {\n    const unclosed = stack[0];\n    return {\n      code: RSErrorCode.missingCloseBracket,\n      from: unclosed.index,\n      to: unclosed.index + 1,\n      params: [unclosed.bracket]\n    };\n  }\n\n  return null;\n}\n\nfunction isOpenBracket(symbol: string): symbol is OpenBracket {\n  return symbol === '(' || symbol === '[' || symbol === '{';\n}\n\nfunction isCloseBracket(symbol: string): symbol is CloseBracket {\n  return symbol === ')' || symbol === ']' || symbol === '}';\n}\n\nfunction openToClose(symbol: OpenBracket): CloseBracket {\n  switch (symbol) {\n    case '(':\n      return ')';\n    case '[':\n      return ']';\n    case '{':\n      return '}';\n  }\n}\n\nfunction closeToOpen(symbol: CloseBracket): OpenBracket {\n  switch (symbol) {\n    case ')':\n      return '(';\n    case ']':\n      return '[';\n    case '}':\n      return '{';\n  }\n}\n\nfunction isDoubleParenthesis(expression: string, pos: number): boolean {\n  const isOpenDoubleParenthesis = expression[pos] === '(' && expression[pos + 1] === '(';\n  if (!isOpenDoubleParenthesis) {\n    return false;\n  }\n\n  const outerClose = findMatchingCloseParen(expression, pos);\n  const innerClose = findMatchingCloseParen(expression, pos + 1);\n  if (outerClose < 0 || innerClose < 0) {\n    return false;\n  }\n\n  return outerClose === innerClose + 1;\n}\n\nfunction findMatchingCloseParen(expression: string, openPos: number): number {\n  if (expression[openPos] !== '(') {\n    return -1;\n  }\n\n  const stack: OpenBracket[] = [];\n  for (let index = openPos; index < expression.length; index++) {\n    const symbol = expression[index];\n    if (isOpenBracket(symbol)) {\n      stack.push(symbol);\n      continue;\n    }\n    if (!isCloseBracket(symbol)) {\n      continue;\n    }\n    const top = stack.pop();\n    if (top === undefined || top !== closeToOpen(symbol)) {\n      return -1;\n    }\n    if (stack.length === 0) {\n      return index;\n    }\n  }\n\n  return -1;\n}\n"],"mappings":";;;;;;;;;;;;AAkBA,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,IAAI,iBAAiB,MACnB,QAAQ,cAAc,GAAG;CAE3B,MAAM,mBAAmB,iBAAiB;CAC1C,YAAY,MAAK,SAAQ,gBAAgB,MAAM,YAAY,SAAS,kBAAkB,OAAO,CAAC;CAE9F,KAAK,MAAM,SAAS,kBAAkB,SAAS,GAAG;EAChD,SAAS,KAAK;EACd,IAAI,gBAAgB;GAClB,MAAM,SAAS,kBAAkB,IAAI,KAAK;GAC1C,IAAI,WAAW,QACb,cAAc,QAAQ,MAAM,MAAM,MAAM,MAAM;EAElD;CACF;AACF;AAGA,SAAS,gBACP,MACA,YACA,SACA,qBACA,SACA;CACA,IAAI,KAAK,WAAW,QAAQ,OAC1B;CAGF,SAAS,KAAK,QAAiB,MAAmB,QAA4B;EAC5E,QAAQ;GAAQ;GAAM,MAAM,OAAO;GAAM,IAAI,OAAO;GAAI;EAAO,GAAG,MAAM;CAC1E;CAEA,MAAM,aAAa,mBAAmB,MAAM,YAAY,OAAO;CAC/D,IAAI,eAAe,MAAM;EACvB,QAAQ,YAAY,IAAI;EACxB;CACF;CAEA,MAAM,SAAS,KAAK;CACpB,IAAI,WAAW,MAAM;EACnB,IAAI,CAAC,qBACH,OAAO,KAAK,MAAM,YAAY,aAAa;EAE7C;CACF;CAEA,IAAI,OAAO,WAAA,GACT,OAAO,KAAK,QAAQ,YAAY,aAAa;CAG/C,IAAI,CAAC,qBACH,KAAK,KAAK,SAAS,KAAK,KAAK,SAAS,MAAM,YAAY,aAAa;AAEzE;AAEA,SAAS,mBACP,MACA,YACA,SAC2B;CAC3B,MAAM,yBAAyB,6BAA6B,MAAM,YAAY,SAAS,QAAQ;CAC/F,IAAI,2BAA2B,MAC7B,OAAO;CAGT,MAAM,cAAc,0BAA0B,MAAM,UAAU;CAC9D,IAAI,gBAAgB,MAClB,OAAO;CAGT,OAAO,4BAA4B,MAAM,UAAU;AACrD;AAEA,SAAS,6BACP,MACA,YACA,UAC2B;CAC3B,MAAM,WAAW,aAAa,MAAM,kBAAkB;CACtD,IAAI,aAAa,MACf,OAAO;CAGT,MAAM,YAAY,SAAS,SAAS,SAAS,SAAS,SAAS;CAC/D,IAAI,WAAW,WAAW,QAAQ,SAAS,SAAS,WAClD,OAAO;CAGT,MAAM,WAAW,SAAS,SAAS,MAAK,UAAS,MAAM,WAAA,MAAwB,MAAM,WAAW,QAAQ,YAAY;CACpH,IAAI,aAAa,UAAa,gBAAgB,QAAQ,GACpD,OAAO;CAGT,IAAI,WAAW,MAAM,SAAS,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,SAAS,GAChD,OAAO;CAGT,OAAO;EACL,MAAM,+BAA+B,QAAQ;EAC7C,MAAM,UAAU;EAChB,IAAI,UAAU;CAChB;AACF;AAEA,SAAS,+BAA+B,UAAmC;CACzE,QAAQ,UAAR;EACE,KAAKA,UAAc,UACjB,OAAO,YAAY;EACrB,KAAKA,UAAc;EACnB,KAAKA,UAAc,OACjB,OAAO,YAAY;EACrB,SACE,OAAO,YAAY;CACvB;AACF;AAEA,SAAS,gBAAgB,MAAwB;CAC/C,IAAI,KAAK,WAAW,QAAQ,OAC1B,OAAO;CAET,OAAO,KAAK,SAAS,KAAK,eAAe;AAC3C;AAEA,SAAS,0BAA0B,MAAe,YAA+C;CAC/F,MAAM,aAAa,aAAa,MAAM,YAAY,KAAK,gBAAgB,MAAM,YAAY;CACzF,IAAI,eAAe,MACjB,OAAO;CAIT,IADiB,WAAW,WAAW,QACtB,KACf,OAAO;EACL,MAAM,YAAY;EAClB,MAAM,WAAW;EACjB,IAAI,WAAW,KAAK;CACtB;CAEF,OAAO;AACT;AAEA,SAAS,4BAA4B,MAAe,YAA+C;CACjG,MAAM,WACJ,aAAa,OAAM,MAAK,eAAe,CAAC,KAAK,gBAAgB,CAAC,CAAC,KAC/D,gBAAgB,OAAM,MAAK,eAAe,CAAC,KAAK,gBAAgB,CAAC,CAAC;CACpE,IAAI,aAAa,MACf,OAAO;CAET,OAAO,wBAAwB,UAAU,UAAU;AACrD;AAEA,SAAS,gBAAgB,MAAe,WAAyD;CAC/F,IAAI,UAA0B,KAAK;CACnC,OAAO,YAAY,MAAM;EACvB,KAAK,MAAM,SAAS,QAAQ,UAC1B,IAAI,UAAU,KAAK,GACjB,OAAO;EAGX,UAAU,QAAQ;CACpB;CACA,OAAO;AACT;AAEA,SAAS,wBAAwB,UAAmB,YAA+C;CACjG,MAAM,OAAO,WAAW,MAAM,SAAS,MAAM,SAAS,EAAE;CACxD,MAAM,OAAO,WAAW,MAAM,SAAS,EAAE;CAEzC,MAAM,cAAkC;EACtC,MAAM,YAAY;EAClB,MAAM,SAAS;EACf,IAAI,SAAS;EACb,QAAQ,CAAC,IAAI;CACf;CAGA,IAAI,QAAQ,KAAK,IAAI,GACnB,OAAO;CAKT,MAAM,cAAc,SAAS,KAAK,IAAI;CACtC,IAAI,gBAAgB,MAClB,OAAO;CAGT,MAAM,WAAW,yBAAyB,MAAM,YAAY,EAAE,CAAC,SAAS,CAAC;CACzE,IAAI,YAAY,GAEd;MADc,KAAK,MAAM,YAAY,EAAE,CAAC,QAAQ,QAAQ,CAAC,CAAC,KACtD,CAAA,CAAM,WAAW,GACnB,OAAO;CACT;CAGF,OAAO;AACT;AAEA,SAAS,aAAa,MAAe,WAAuD;CAC1F,IAAI,UAA0B;CAC9B,OAAO,YAAY,MAAM;EACvB,IAAI,UAAU,OAAO,GACnB,OAAO;EAET,UAAU,QAAQ;CACpB;CACA,OAAO;AACT;AAEA,SAAS,mBAAmB,MAAwB;CAClD,OAAO,KAAK,WAAA,MAA4B,KAAK,WAAW,QAAQ;AAClE;AAEA,SAAS,eAAe,MAAwB;CAC9C,OAAO,KAAK,WAAA,MAAuB,KAAK,WAAW,QAAQ;AAC7D;AAEA,SAAS,gBAAgB,MAAwB;CAC/C,OAAO,KAAK,WAAA,MAAwB,KAAK,WAAW,QAAQ;AAC9D;AAEA,SAAS,aAAa,MAAwB;CAC5C,OAAO,KAAK,WAAA,MAAqB,KAAK,WAAW,QAAQ;AAC3D;AAEA,SAAS,yBAAyB,YAAoB,SAAyB;CAE7E,IADa,WAAW,aACX,KACX,OAAO;CAGT,IAAI,QAAQ;CACZ,KAAK,IAAI,QAAQ,SAAS,QAAQ,WAAW,QAAQ,SAAS;EAC5D,MAAM,SAAS,WAAW;EAC1B,IAAI,WAAW,KACb;OACK,IAAI,WAAW,KAAK;GACzB;GACA,IAAI,UAAU,GACZ,OAAO;EAEX;CACF;CACA,OAAO;AACT;AAEA,SAAS,kBAAkB,QAAoD;CAC7E,MAAM,SAA+B,CAAC;CAEtC,KAAK,MAAM,SAAS,QAAQ;EAI1B,IAHkB,OAAO,MACvB,aAAY,SAAS,SAAS,MAAM,QAAQ,SAAS,SAAS,MAAM,QAAQ,SAAS,OAAO,MAAM,EAEhG,GACF;EAGF,IAAI,MAAM,SAAS,YAAY,eAC7B;QAAK,IAAI,QAAQ,OAAO,SAAS,GAAG,SAAS,GAAG,SAC9C,IAAI,OAAO,MAAM,CAAC,SAAS,YAAY,iBAAiB,cAAc,OAAO,OAAO,MAAM,GACxF,OAAO,OAAO,OAAO,CAAC;EAE1B;EAGF,OAAO,KAAK,KAAK;CACnB;CAEA,MAAM,WAAW,OAAO,QAAO,UAAS,MAAM,SAAS,YAAY,aAAa;CAChF,OAAO,OAAO,QACZ,UAAS,MAAM,SAAS,YAAY,iBAAiB,CAAC,SAAS,MAAK,SAAQ,cAAc,OAAO,IAAI,CAAC,CACxG;AACF;AAEA,SAAS,cAAc,GAAuB,GAAgC;CAC5E,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE;AACrC;AAUA,MAAM,2BAA2B,4BAA4B;AAE7D,SAAS,8BAA2C;CAClD,MAAM,wBAAQ,IAAI,IAAY;CAC9B,KAAK,MAAM,SAAS;EAClB;EACA;EACA;EACA;EACA;CACF,GACE,KAAK,MAAM,UAAU,OACnB,MAAM,IAAI,MAAM;CAGpB,KAAK,IAAI,YAAY,KAAQ,aAAa,KAAQ,aAChD,MAAM,IAAI,OAAO,cAAc,SAAS,CAAC;CAE3C,OAAO;AACT;AAEA,SAAS,wBAAwB,QAAyB;CACxD,OAAO,MAAM,KAAK,MAAM,KAAK,yBAAyB,IAAI,MAAM;AAClE;AAEA,SAAS,gCAAgC,YAA0C;CACjF,MAAM,SAA+B,CAAC;CACtC,IAAI,MAAM;CAEV,OAAO,MAAM,WAAW,QAAQ;EAC9B,MAAM,SAAS,WAAW;EAC1B,IAAI,wBAAwB,MAAM,GAAG;GACnC;GACA;EACF;EAEA,MAAM,QAAQ;EACd,OAAO,MAAM,WAAW,UAAU,CAAC,wBAAwB,WAAW,IAAI,GACxE;EAGF,OAAO,KAAK;GACV,MAAM,YAAY;GAClB,MAAM;GACN,IAAI;GACJ,QAAQ,CAAC,WAAW,MAAM,OAAO,GAAG,CAAC;EACvC,CAAC;CACH;CAEA,OAAO;AACT;AAEA,SAAS,qBAAqB,YAA+C;CAC3E,MAAM,QAAwB,CAAC;CAE/B,KAAK,IAAI,MAAM,GAAG,MAAM,WAAW,QAAQ,OAAO;EAChD,MAAM,SAAS,WAAW;EAC1B,IAAI,cAAc,MAAM,GAAG;GACzB,IAAI,oBAAoB,YAAY,GAAG,GACrC,OAAO;IACL,MAAM,YAAY;IAClB,MAAM;IACN,IAAI,MAAM;GACZ;GAEF,MAAM,KAAK;IAAE,SAAS;IAAQ,OAAO;GAAI,CAAC;GAC1C;EACF;EACA,IAAI,CAAC,eAAe,MAAM,GACxB;EAGF,MAAM,eAAe,YAAY,MAAM;EACvC,MAAM,MAAM,MAAM,MAAM,SAAS;EACjC,IAAI,QAAQ,QACV,OAAO;GACL,MAAM,YAAY;GAClB,MAAM;GACN,IAAI,MAAM;GACV,QAAQ,CAAC,MAAM;EACjB;EAGF,IAAI,IAAI,YAAY,cAClB,OAAO;GACL,MAAM,YAAY;GAClB,MAAM;GACN,IAAI,MAAM;GACV,QAAQ,CAAC,YAAY,IAAI,OAAO,GAAG,MAAM;EAC3C;EAGF,MAAM,IAAI;CACZ;CAEA,IAAI,MAAM,SAAS,GAAG;EACpB,MAAM,WAAW,MAAM;EACvB,OAAO;GACL,MAAM,YAAY;GAClB,MAAM,SAAS;GACf,IAAI,SAAS,QAAQ;GACrB,QAAQ,CAAC,SAAS,OAAO;EAC3B;CACF;CAEA,OAAO;AACT;AAEA,SAAS,cAAc,QAAuC;CAC5D,OAAO,WAAW,OAAO,WAAW,OAAO,WAAW;AACxD;AAEA,SAAS,eAAe,QAAwC;CAC9D,OAAO,WAAW,OAAO,WAAW,OAAO,WAAW;AACxD;AAEA,SAAS,YAAY,QAAmC;CACtD,QAAQ,QAAR;EACE,KAAK,KACH,OAAO;EACT,KAAK,KACH,OAAO;EACT,KAAK,KACH,OAAO;CACX;AACF;AAEA,SAAS,YAAY,QAAmC;CACtD,QAAQ,QAAR;EACE,KAAK,KACH,OAAO;EACT,KAAK,KACH,OAAO;EACT,KAAK,KACH,OAAO;CACX;AACF;AAEA,SAAS,oBAAoB,YAAoB,KAAsB;CAErE,IAAI,EAD4B,WAAW,SAAS,OAAO,WAAW,MAAM,OAAO,MAEjF,OAAO;CAGT,MAAM,aAAa,uBAAuB,YAAY,GAAG;CACzD,MAAM,aAAa,uBAAuB,YAAY,MAAM,CAAC;CAC7D,IAAI,aAAa,KAAK,aAAa,GACjC,OAAO;CAGT,OAAO,eAAe,aAAa;AACrC;AAEA,SAAS,uBAAuB,YAAoB,SAAyB;CAC3E,IAAI,WAAW,aAAa,KAC1B,OAAO;CAGT,MAAM,QAAuB,CAAC;CAC9B,KAAK,IAAI,QAAQ,SAAS,QAAQ,WAAW,QAAQ,SAAS;EAC5D,MAAM,SAAS,WAAW;EAC1B,IAAI,cAAc,MAAM,GAAG;GACzB,MAAM,KAAK,MAAM;GACjB;EACF;EACA,IAAI,CAAC,eAAe,MAAM,GACxB;EAEF,MAAM,MAAM,MAAM,IAAI;EACtB,IAAI,QAAQ,UAAa,QAAQ,YAAY,MAAM,GACjD,OAAO;EAET,IAAI,MAAM,WAAW,GACnB,OAAO;CAEX;CAEA,OAAO;AACT"}