@optave/codegraph 3.2.0 → 3.3.0

package/dist/ast-analysis/visitor-utils.js

@@ -0,0 +1,180 @@
+/**
+ * Shared AST helper functions used by multiple visitors (dataflow, etc.).
+ *
+ * Extracted from dataflow.js to be reusable across the visitor framework.
+ */
+/**
+ * Truncate a string to a maximum length.
+ */
+export function truncate(str, max = 120) {
+    if (!str)
+        return '';
+    return str.length > max ? `${str.slice(0, max)}…` : str;
+}
+/**
+ * Get the name of a function node from the AST using rules.
+ */
+export function functionName(fnNode, rules) {
+    if (!fnNode)
+        return null;
+    const nameNode = fnNode.childForFieldName(rules.nameField);
+    if (nameNode)
+        return nameNode.text;
+    const parent = fnNode.parent;
+    if (parent) {
+        if (rules.varAssignedFnParent && parent.type === rules.varAssignedFnParent) {
+            const n = parent.childForFieldName('name');
+            return n ? n.text : null;
+        }
+        if (rules.pairFnParent && parent.type === rules.pairFnParent) {
+            const keyNode = parent.childForFieldName('key');
+            return keyNode ? keyNode.text : null;
+        }
+        if (rules.assignmentFnParent && parent.type === rules.assignmentFnParent) {
+            const left = parent.childForFieldName(rules.assignLeftField);
+            return left ? left.text : null;
+        }
+    }
+    return null;
+}
+/**
+ * Extract parameter names and indices from a formal_parameters node.
+ */
+export function extractParams(paramsNode, rules) {
+    if (!paramsNode)
+        return [];
+    const result = [];
+    let index = 0;
+    for (const child of paramsNode.namedChildren) {
+        const names = extractParamNames(child, rules);
+        for (const name of names) {
+            result.push({ name, index });
+        }
+        index++;
+    }
+    return result;
+}
+/**
+ * Extract parameter names from a single parameter node.
+ */
+export function extractParamNames(node, rules) {
+    if (!node)
+        return [];
+    const t = node.type;
+    if (rules.extractParamName) {
+        const result = rules.extractParamName(node);
+        if (result)
+            return result;
+    }
+    if (t === rules.paramIdentifier)
+        return [node.text];
+    if (rules.paramWrapperTypes.has(t)) {
+        const pattern = node.childForFieldName('pattern') || node.childForFieldName('name');
+        return pattern ? extractParamNames(pattern, rules) : [];
+    }
+    if (rules.defaultParamType && t === rules.defaultParamType) {
+        const left = node.childForFieldName('left') || node.childForFieldName('name');
+        return left ? extractParamNames(left, rules) : [];
+    }
+    if (rules.restParamType && t === rules.restParamType) {
+        const nameNode = node.childForFieldName('name');
+        if (nameNode)
+            return [nameNode.text];
+        for (const child of node.namedChildren) {
+            if (child.type === rules.paramIdentifier)
+                return [child.text];
+        }
+        return [];
+    }
+    if (rules.objectDestructType && t === rules.objectDestructType) {
+        const names = [];
+        for (const child of node.namedChildren) {
+            if (rules.shorthandPropPattern && child.type === rules.shorthandPropPattern) {
+                names.push(child.text);
+            }
+            else if (rules.pairPatternType && child.type === rules.pairPatternType) {
+                const value = child.childForFieldName('value');
+                if (value)
+                    names.push(...extractParamNames(value, rules));
+            }
+            else if (rules.restParamType && child.type === rules.restParamType) {
+                names.push(...extractParamNames(child, rules));
+            }
+        }
+        return names;
+    }
+    if (rules.arrayDestructType && t === rules.arrayDestructType) {
+        const names = [];
+        for (const child of node.namedChildren) {
+            names.push(...extractParamNames(child, rules));
+        }
+        return names;
+    }
+    return [];
+}
+/**
+ * Check if a node type is identifier-like for this language.
+ */
+export function isIdent(nodeType, rules) {
+    if (nodeType === 'identifier' || nodeType === rules.paramIdentifier)
+        return true;
+    return rules.extraIdentifierTypes ? rules.extraIdentifierTypes.has(nodeType) : false;
+}
+/**
+ * Resolve the name a call expression is calling using rules.
+ */
+export function resolveCalleeName(callNode, rules) {
+    const fn = callNode.childForFieldName(rules.callFunctionField);
+    if (!fn) {
+        const nameNode = callNode.childForFieldName('name') || callNode.childForFieldName('method');
+        return nameNode ? nameNode.text : null;
+    }
+    if (isIdent(fn.type, rules))
+        return fn.text;
+    if (fn.type === rules.memberNode) {
+        const prop = fn.childForFieldName(rules.memberPropertyField);
+        return prop ? prop.text : null;
+    }
+    if (rules.optionalChainNode && fn.type === rules.optionalChainNode) {
+        const target = fn.namedChildren[0];
+        if (!target)
+            return null;
+        if (target.type === rules.memberNode) {
+            const prop = target.childForFieldName(rules.memberPropertyField);
+            return prop ? prop.text : null;
+        }
+        if (target.type === 'identifier')
+            return target.text;
+        const prop = fn.childForFieldName(rules.memberPropertyField);
+        return prop ? prop.text : null;
+    }
+    return null;
+}
+/**
+ * Get the receiver (object) of a member expression using rules.
+ */
+export function memberReceiver(memberExpr, rules) {
+    const obj = memberExpr.childForFieldName(rules.memberObjectField);
+    if (!obj)
+        return null;
+    if (isIdent(obj.type, rules))
+        return obj.text;
+    if (obj.type === rules.memberNode)
+        return memberReceiver(obj, rules);
+    return null;
+}
+/**
+ * Collect all identifier names referenced within a node.
+ */
+export function collectIdentifiers(node, out, rules) {
+    if (!node)
+        return;
+    if (isIdent(node.type, rules)) {
+        out.push(node.text);
+        return;
+    }
+    for (const child of node.namedChildren) {
+        collectIdentifiers(child, out, rules);
+    }
+}
+//# sourceMappingURL=visitor-utils.js.map

package/dist/ast-analysis/visitor-utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"visitor-utils.js","sourceRoot":"","sources":["../../src/ast-analysis/visitor-utils.js"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;GAEG;AACH,MAAM,UAAU,QAAQ,CAAC,GAAG,EAAE,GAAG,GAAG,GAAG;IACrC,IAAI,CAAC,GAAG;QAAE,OAAO,EAAE,CAAC;IACpB,OAAO,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;AAC1D,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,MAAM,EAAE,KAAK;IACxC,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IACzB,MAAM,QAAQ,GAAG,MAAM,CAAC,iBAAiB,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IAC3D,IAAI,QAAQ;QAAE,OAAO,QAAQ,CAAC,IAAI,CAAC;IAEnC,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;IAC7B,IAAI,MAAM,EAAE,CAAC;QACX,IAAI,KAAK,CAAC,mBAAmB,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,CAAC,mBAAmB,EAAE,CAAC;YAC3E,MAAM,CAAC,GAAG,MAAM,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;YAC3C,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QAC3B,CAAC;QACD,IAAI,KAAK,CAAC,YAAY,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,CAAC,YAAY,EAAE,CAAC;YAC7D,MAAM,OAAO,GAAG,MAAM,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;YAChD,OAAO,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QACvC,CAAC;QACD,IAAI,KAAK,CAAC,kBAAkB,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,CAAC,kBAAkB,EAAE,CAAC;YACzE,MAAM,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;YAC7D,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QACjC,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,UAAU,EAAE,KAAK;IAC7C,IAAI,CAAC,UAAU;QAAE,OAAO,EAAE,CAAC;IAC3B,MAAM,MAAM,GAAG,EAAE,CAAC;IAClB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,aAAa,EAAE,CAAC;QAC7C,MAAM,KAAK,GAAG,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC9C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;QAC/B,CAAC;QACD,KAAK,EAAE,CAAC;IACV,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAI,EAAE,KAAK;IAC3C,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,CAAC;IACrB,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;IAEpB,IAAI,KAAK,CAAC,gBAAgB,EAAE,CAAC;QAC3B,MAAM,MAAM,GAAG,KAAK,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;QAC5C,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC;IAC5B,CAAC;IAED,IAAI,CAAC,KAAK,KAAK,CAAC,eAAe;QAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAEpD,IAAI,KAAK,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,IAAI,CAAC,iBAAiB,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QACpF,OAAO,OAAO,CAAC,CAAC,CAAC,iBAAiB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC1D,CAAC;IAED,IAAI,KAAK,CAAC,gBAAgB,IAAI,CAAC,KAAK,KAAK,CAAC,gBAAgB,EAAE,CAAC;QAC3D,MAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAC9E,OAAO,IAAI,CAAC,CAAC,CAAC,iBAAiB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACpD,CAAC;IAED,IAAI,KAAK,CAAC,aAAa,IAAI,CAAC,KAAK,KAAK,CAAC,aAAa,EAAE,CAAC;QACrD,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAChD,IAAI,QAAQ;YAAE,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACrC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvC,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,eAAe;gBAAE,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAChE,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,IAAI,KAAK,CAAC,kBAAkB,IAAI,CAAC,KAAK,KAAK,CAAC,kBAAkB,EAAE,CAAC;QAC/D,MAAM,KAAK,GAAG,EAAE,CAAC;QACjB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvC,IAAI,KAAK,CAAC,oBAAoB,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,oBAAoB,EAAE,CAAC;gBAC5E,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACzB,CAAC;iBAAM,IAAI,KAAK,CAAC,eAAe,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,eAAe,EAAE,CAAC;gBACzE,MAAM,KAAK,GAAG,KAAK,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;gBAC/C,IAAI,KAAK;oBAAE,KAAK,CAAC,IAAI,CAAC,GAAG,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;YAC5D,CAAC;iBAAM,IAAI,KAAK,CAAC,aAAa,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,aAAa,EAAE,CAAC;gBACrE,KAAK,CAAC,IAAI,CAAC,GAAG,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;YACjD,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,IAAI,KAAK,CAAC,iBAAiB,IAAI,CAAC,KAAK,KAAK,CAAC,iBAAiB,EAAE,CAAC;QAC7D,MAAM,KAAK,GAAG,EAAE,CAAC;QACjB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvC,KAAK,CAAC,IAAI,CAAC,GAAG,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;QACjD,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,OAAO,CAAC,QAAQ,EAAE,KAAK;IACrC,IAAI,QAAQ,KAAK,YAAY,IAAI,QAAQ,KAAK,KAAK,CAAC,eAAe;QAAE,OAAO,IAAI,CAAC;IACjF,OAAO,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,KAAK,CAAC,oBAAoB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;AACvF,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,QAAQ,EAAE,KAAK;IAC/C,MAAM,EAAE,GAAG,QAAQ,CAAC,iBAAiB,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC;IAC/D,IAAI,CAAC,EAAE,EAAE,CAAC;QACR,MAAM,QAAQ,GAAG,QAAQ,CAAC,iBAAiB,CAAC,MAAM,CAAC,IAAI,QAAQ,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC;QAC5F,OAAO,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IACzC,CAAC;IACD,IAAI,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC,IAAI,CAAC;IAC5C,IAAI,EAAE,CAAC,IAAI,KAAK,KAAK,CAAC,UAAU,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,EAAE,CAAC,iBAAiB,CAAC,KAAK,CAAC,mBAAmB,CAAC,CAAC;QAC7D,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IACjC,CAAC;IACD,IAAI,KAAK,CAAC,iBAAiB,IAAI,EAAE,CAAC,IAAI,KAAK,KAAK,CAAC,iBAAiB,EAAE,CAAC;QACnE,MAAM,MAAM,GAAG,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QACnC,IAAI,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC;QACzB,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,CAAC,UAAU,EAAE,CAAC;YACrC,MAAM,IAAI,GAAG,MAAM,CAAC,iBAAiB,CAAC,KAAK,CAAC,mBAAmB,CAAC,CAAC;YACjE,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QACjC,CAAC;QACD,IAAI,MAAM,CAAC,IAAI,KAAK,YAAY;YAAE,OAAO,MAAM,CAAC,IAAI,CAAC;QACrD,MAAM,IAAI,GAAG,EAAE,CAAC,iBAAiB,CAAC,KAAK,CAAC,mBAAmB,CAAC,CAAC;QAC7D,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IACjC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,UAAU,EAAE,KAAK;IAC9C,MAAM,GAAG,GAAG,UAAU,CAAC,iBAAiB,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC;IAClE,IAAI,CAAC,GAAG;QAAE,OAAO,IAAI,CAAC;IACtB,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC,IAAI,CAAC;IAC9C,IAAI,GAAG,CAAC,IAAI,KAAK,KAAK,CAAC,UAAU;QAAE,OAAO,cAAc,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACrE,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK;IACjD,IAAI,CAAC,IAAI;QAAE,OAAO;IAClB,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QAC9B,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,OAAO;IACT,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;QACvC,kBAAkB,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;IACxC,CAAC;AACH,CAAC"}

package/dist/ast-analysis/visitor.d.ts

@@ -0,0 +1,119 @@
+/**
+ * Shared DFS walker with pluggable visitors for AST analysis.
+ *
+ * Provides a single tree traversal that multiple analysis visitors can hook into,
+ * avoiding redundant walks over the same AST. Two hook styles:
+ *
+ *  - Node-level: enterNode / exitNode (called for every node)
+ *  - Function-level: enterFunction / exitFunction (called at function boundaries)
+ *
+ * The walker maintains shared context (nestingLevel, scopeStack, currentFunction)
+ * so individual visitors don't need to track traversal state themselves.
+ *
+ * @typedef {object} VisitorContext
+ * @property {number}  nestingLevel    - Current nesting depth (for complexity)
+ * @property {object}  currentFunction - Enclosing function node (or null)
+ * @property {string}  langId          - Language ID
+ * @property {Array}   scopeStack      - Function scope stack [{funcName, funcNode, params, locals}]
+ *
+ * @typedef {object} Visitor
+ * @property {string}   name
+ * @property {function} [init](langId, rules)         - Called once before the walk
+ * @property {function} [enterNode](node, context)     - Called entering each node; return { skipChildren: true } to skip this visitor's hooks for descendants
+ * @property {function} [exitNode](node, context)      - Called leaving each node
+ * @property {function} [enterFunction](funcNode, funcName, context) - Called entering a function
+ * @property {function} [exitFunction](funcNode, funcName, context)  - Called leaving a function
+ * @property {function} [finish]()                     - Called after the walk; return collected data
+ * @property {Set}      [functionNodeTypes]            - Extra function node types this visitor cares about
+ */
+/**
+ * Walk an AST root with multiple visitors in a single DFS pass.
+ *
+ * @param {object} rootNode   - tree-sitter root node to walk
+ * @param {Visitor[]} visitors - array of visitor objects
+ * @param {string} langId     - language identifier
+ * @param {object} [options]
+ * @param {Set}    [options.functionNodeTypes] - set of node types that are function boundaries
+ * @param {Set}    [options.nestingNodeTypes]  - set of node types that increase nesting depth
+ * @param {function} [options.getFunctionName] - (funcNode) => string|null
+ * @returns {object} Map of visitor.name → finish() result
+ */
+export function walkWithVisitors(rootNode: object, visitors: Visitor[], langId: string, options?: {
+    functionNodeTypes?: Set<any> | undefined;
+    nestingNodeTypes?: Set<any> | undefined;
+    getFunctionName?: Function | undefined;
+}): object;
+/**
+ * Shared DFS walker with pluggable visitors for AST analysis.
+ *
+ * Provides a single tree traversal that multiple analysis visitors can hook into,
+ * avoiding redundant walks over the same AST. Two hook styles:
+ *
+ *  - Node-level: enterNode / exitNode (called for every node)
+ *  - Function-level: enterFunction / exitFunction (called at function boundaries)
+ *
+ * The walker maintains shared context (nestingLevel, scopeStack, currentFunction)
+ * so individual visitors don't need to track traversal state themselves.
+ */
+export type VisitorContext = {
+    /**
+     * - Current nesting depth (for complexity)
+     */
+    nestingLevel: number;
+    /**
+     * - Enclosing function node (or null)
+     */
+    currentFunction: object;
+    /**
+     * - Language ID
+     */
+    langId: string;
+    /**
+     * - Function scope stack [{funcName, funcNode, params, locals}]
+     */
+    scopeStack: any[];
+};
+/**
+ * Shared DFS walker with pluggable visitors for AST analysis.
+ *
+ * Provides a single tree traversal that multiple analysis visitors can hook into,
+ * avoiding redundant walks over the same AST. Two hook styles:
+ *
+ *  - Node-level: enterNode / exitNode (called for every node)
+ *  - Function-level: enterFunction / exitFunction (called at function boundaries)
+ *
+ * The walker maintains shared context (nestingLevel, scopeStack, currentFunction)
+ * so individual visitors don't need to track traversal state themselves.
+ */
+export type Visitor = {
+    name: string;
+    /**
+     * (langId, rules)         - Called once before the walk
+     */
+    init?: Function | undefined;
+    /**
+     * (node, context)     - Called entering each node; return { skipChildren: true } to skip this visitor's hooks for descendants
+     */
+    enterNode?: Function | undefined;
+    /**
+     * (node, context)      - Called leaving each node
+     */
+    exitNode?: Function | undefined;
+    /**
+     * (funcNode, funcName, context) - Called entering a function
+     */
+    enterFunction?: Function | undefined;
+    /**
+     * (funcNode, funcName, context)  - Called leaving a function
+     */
+    exitFunction?: Function | undefined;
+    /**
+     * ()                     - Called after the walk; return collected data
+     */
+    finish?: Function | undefined;
+    /**
+     * - Extra function node types this visitor cares about
+     */
+    functionNodeTypes?: Set<any> | undefined;
+};
+//# sourceMappingURL=visitor.d.ts.map

package/dist/ast-analysis/visitor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"visitor.d.ts","sourceRoot":"","sources":["../../src/ast-analysis/visitor.js"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AAEH;;;;;;;;;;;GAWG;AACH,2CATW,MAAM,YACN,OAAO,EAAE,UACT,MAAM,YAEd;IAAyB,iBAAiB;IACjB,gBAAgB;IACd,eAAe;CAC1C,GAAU,MAAM,CA0HlB;;;;;;;;;;;;;;;;;kBApJa,MAAM;;;;qBACN,MAAM;;;;YACN,MAAM;;;;;;;;;;;;;;;;;;;UAIN,MAAM"}

package/dist/ast-analysis/visitor.js

@@ -0,0 +1,146 @@
+/**
+ * Shared DFS walker with pluggable visitors for AST analysis.
+ *
+ * Provides a single tree traversal that multiple analysis visitors can hook into,
+ * avoiding redundant walks over the same AST. Two hook styles:
+ *
+ *  - Node-level: enterNode / exitNode (called for every node)
+ *  - Function-level: enterFunction / exitFunction (called at function boundaries)
+ *
+ * The walker maintains shared context (nestingLevel, scopeStack, currentFunction)
+ * so individual visitors don't need to track traversal state themselves.
+ *
+ * @typedef {object} VisitorContext
+ * @property {number}  nestingLevel    - Current nesting depth (for complexity)
+ * @property {object}  currentFunction - Enclosing function node (or null)
+ * @property {string}  langId          - Language ID
+ * @property {Array}   scopeStack      - Function scope stack [{funcName, funcNode, params, locals}]
+ *
+ * @typedef {object} Visitor
+ * @property {string}   name
+ * @property {function} [init](langId, rules)         - Called once before the walk
+ * @property {function} [enterNode](node, context)     - Called entering each node; return { skipChildren: true } to skip this visitor's hooks for descendants
+ * @property {function} [exitNode](node, context)      - Called leaving each node
+ * @property {function} [enterFunction](funcNode, funcName, context) - Called entering a function
+ * @property {function} [exitFunction](funcNode, funcName, context)  - Called leaving a function
+ * @property {function} [finish]()                     - Called after the walk; return collected data
+ * @property {Set}      [functionNodeTypes]            - Extra function node types this visitor cares about
+ */
+/**
+ * Walk an AST root with multiple visitors in a single DFS pass.
+ *
+ * @param {object} rootNode   - tree-sitter root node to walk
+ * @param {Visitor[]} visitors - array of visitor objects
+ * @param {string} langId     - language identifier
+ * @param {object} [options]
+ * @param {Set}    [options.functionNodeTypes] - set of node types that are function boundaries
+ * @param {Set}    [options.nestingNodeTypes]  - set of node types that increase nesting depth
+ * @param {function} [options.getFunctionName] - (funcNode) => string|null
+ * @returns {object} Map of visitor.name → finish() result
+ */
+export function walkWithVisitors(rootNode, visitors, langId, options = {}) {
+    const { functionNodeTypes = new Set(), nestingNodeTypes = new Set(), getFunctionName = () => null, } = options;
+    // Merge all visitors' functionNodeTypes into the master set
+    const allFuncTypes = new Set(functionNodeTypes);
+    for (const v of visitors) {
+        if (v.functionNodeTypes) {
+            for (const t of v.functionNodeTypes)
+                allFuncTypes.add(t);
+        }
+    }
+    // Initialize visitors
+    for (const v of visitors) {
+        if (v.init)
+            v.init(langId);
+    }
+    // Shared context object (mutated during walk)
+    const scopeStack = [];
+    const context = {
+        nestingLevel: 0,
+        currentFunction: null,
+        langId,
+        scopeStack,
+    };
+    // Track which visitors have requested skipChildren at each depth
+    // Key: visitor index, Value: depth at which skip was requested
+    const skipDepths = new Map();
+    function walk(node, depth) {
+        if (!node)
+            return;
+        const type = node.type;
+        const isFunction = allFuncTypes.has(type);
+        let funcName = null;
+        // Function boundary: enter
+        if (isFunction) {
+            funcName = getFunctionName(node);
+            context.currentFunction = node;
+            scopeStack.push({ funcName, funcNode: node, params: new Map(), locals: new Map() });
+            for (let i = 0; i < visitors.length; i++) {
+                const v = visitors[i];
+                if (v.enterFunction && !isSkipped(i, depth)) {
+                    v.enterFunction(node, funcName, context);
+                }
+            }
+        }
+        // enterNode hooks
+        for (let i = 0; i < visitors.length; i++) {
+            const v = visitors[i];
+            if (v.enterNode && !isSkipped(i, depth)) {
+                const result = v.enterNode(node, context);
+                if (result?.skipChildren) {
+                    skipDepths.set(i, depth);
+                }
+            }
+        }
+        // Nesting tracking
+        const addsNesting = nestingNodeTypes.has(type);
+        if (addsNesting)
+            context.nestingLevel++;
+        // Recurse children using node.child(i) (all children, not just named)
+        for (let i = 0; i < node.childCount; i++) {
+            walk(node.child(i), depth + 1);
+        }
+        // Undo nesting
+        if (addsNesting)
+            context.nestingLevel--;
+        // exitNode hooks
+        for (let i = 0; i < visitors.length; i++) {
+            const v = visitors[i];
+            if (v.exitNode && !isSkipped(i, depth)) {
+                v.exitNode(node, context);
+            }
+        }
+        // Clear skip for any visitor that started skipping at this depth
+        for (let i = 0; i < visitors.length; i++) {
+            if (skipDepths.get(i) === depth) {
+                skipDepths.delete(i);
+            }
+        }
+        // Function boundary: exit
+        if (isFunction) {
+            for (let i = 0; i < visitors.length; i++) {
+                const v = visitors[i];
+                if (v.exitFunction && !isSkipped(i, depth)) {
+                    v.exitFunction(node, funcName, context);
+                }
+            }
+            scopeStack.pop();
+            context.currentFunction =
+                scopeStack.length > 0 ? scopeStack[scopeStack.length - 1].funcNode : null;
+        }
+    }
+    function isSkipped(visitorIndex, currentDepth) {
+        const skipAt = skipDepths.get(visitorIndex);
+        // Skipped if skip was requested at a shallower (or equal) depth
+        // We skip descendants, not the node itself, so skip when currentDepth > skipAt
+        return skipAt !== undefined && currentDepth > skipAt;
+    }
+    walk(rootNode, 0);
+    // Collect results
+    const results = {};
+    for (const v of visitors) {
+        results[v.name] = v.finish ? v.finish() : undefined;
+    }
+    return results;
+}
+//# sourceMappingURL=visitor.js.map

package/dist/ast-analysis/visitor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"visitor.js","sourceRoot":"","sources":["../../src/ast-analysis/visitor.js"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AAEH;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,GAAG,EAAE;IACvE,MAAM,EACJ,iBAAiB,GAAG,IAAI,GAAG,EAAE,EAC7B,gBAAgB,GAAG,IAAI,GAAG,EAAE,EAC5B,eAAe,GAAG,GAAG,EAAE,CAAC,IAAI,GAC7B,GAAG,OAAO,CAAC;IAEZ,4DAA4D;IAC5D,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,iBAAiB,CAAC,CAAC;IAChD,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,CAAC,iBAAiB,EAAE,CAAC;YACxB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,iBAAiB;gBAAE,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3D,CAAC;IACH,CAAC;IAED,sBAAsB;IACtB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,CAAC,IAAI;YAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC7B,CAAC;IAED,8CAA8C;IAC9C,MAAM,UAAU,GAAG,EAAE,CAAC;IACtB,MAAM,OAAO,GAAG;QACd,YAAY,EAAE,CAAC;QACf,eAAe,EAAE,IAAI;QACrB,MAAM;QACN,UAAU;KACX,CAAC;IAEF,iEAAiE;IACjE,+DAA+D;IAC/D,MAAM,UAAU,GAAG,IAAI,GAAG,EAAE,CAAC;IAE7B,SAAS,IAAI,CAAC,IAAI,EAAE,KAAK;QACvB,IAAI,CAAC,IAAI;YAAE,OAAO;QAElB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,MAAM,UAAU,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,QAAQ,GAAG,IAAI,CAAC;QAEpB,2BAA2B;QAC3B,IAAI,UAAU,EAAE,CAAC;YACf,QAAQ,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;YACjC,OAAO,CAAC,eAAe,GAAG,IAAI,CAAC;YAC/B,UAAU,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC,CAAC;YACpF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACtB,IAAI,CAAC,CAAC,aAAa,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;oBAC5C,CAAC,CAAC,aAAa,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;gBAC3C,CAAC;YACH,CAAC;QACH,CAAC;QAED,kBAAkB;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC,CAAC,SAAS,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;gBACxC,MAAM,MAAM,GAAG,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;gBAC1C,IAAI,MAAM,EAAE,YAAY,EAAE,CAAC;oBACzB,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;gBAC3B,CAAC;YACH,CAAC;QACH,CAAC;QAED,mBAAmB;QACnB,MAAM,WAAW,GAAG,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAI,WAAW;YAAE,OAAO,CAAC,YAAY,EAAE,CAAC;QAExC,sEAAsE;QACtE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QACjC,CAAC;QAED,eAAe;QACf,IAAI,WAAW;YAAE,OAAO,CAAC,YAAY,EAAE,CAAC;QAExC,iBAAiB;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC,CAAC,QAAQ,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;gBACvC,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,iEAAiE;QACjE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;gBAChC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QAED,0BAA0B;QAC1B,IAAI,UAAU,EAAE,CAAC;YACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACtB,IAAI,CAAC,CAAC,YAAY,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;oBAC3C,CAAC,CAAC,YAAY,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;gBAC1C,CAAC;YACH,CAAC;YACD,UAAU,CAAC,GAAG,EAAE,CAAC;YACjB,OAAO,CAAC,eAAe;gBACrB,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC;QAC9E,CAAC;IACH,CAAC;IAED,SAAS,SAAS,CAAC,YAAY,EAAE,YAAY;QAC3C,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QAC5C,gEAAgE;QAChE,+EAA+E;QAC/E,OAAO,MAAM,KAAK,SAAS,IAAI,YAAY,GAAG,MAAM,CAAC;IACvD,CAAC;IAED,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;IAElB,kBAAkB;IAClB,MAAM,OAAO,GAAG,EAAE,CAAC;IACnB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;IACtD,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/dist/ast-analysis/visitors/ast-store-visitor.d.ts

@@ -0,0 +1,11 @@
+/**
+ * Create an AST-store visitor for use with walkWithVisitors.
+ *
+ * @param {object} astTypeMap - node type → kind mapping (e.g. JS_TS_AST_TYPES)
+ * @param {object[]} defs     - symbol definitions for parent lookup
+ * @param {string} relPath    - relative file path
+ * @param {Map} nodeIdMap     - def key → node ID mapping
+ * @returns {Visitor}
+ */
+export function createAstStoreVisitor(astTypeMap: object, defs: object[], relPath: string, nodeIdMap: Map<any, any>): Visitor;
+//# sourceMappingURL=ast-store-visitor.d.ts.map

package/dist/ast-analysis/visitors/ast-store-visitor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast-store-visitor.d.ts","sourceRoot":"","sources":["../../../src/ast-analysis/visitors/ast-store-visitor.js"],"names":[],"mappings":"AA+DA;;;;;;;;GAQG;AACH,kDANW,MAAM,QACN,MAAM,EAAE,WACR,MAAM,6BAEJ,OAAO,CA+EnB"}

package/dist/ast-analysis/visitors/ast-store-visitor.js

@@ -0,0 +1,147 @@
+/**
+ * Visitor: Extract new/throw/await/string/regex AST nodes during a shared walk.
+ *
+ * Replaces the standalone walkAst() DFS in ast.js with a visitor that plugs
+ * into the unified walkWithVisitors framework.
+ */
+/** Max length for the `text` column. */
+const TEXT_MAX = 200;
+function truncate(s, max = TEXT_MAX) {
+    if (!s)
+        return null;
+    return s.length <= max ? s : `${s.slice(0, max - 1)}\u2026`;
+}
+function extractNewName(node) {
+    for (let i = 0; i < node.childCount; i++) {
+        const child = node.child(i);
+        if (child.type === 'identifier')
+            return child.text;
+        if (child.type === 'member_expression')
+            return child.text;
+    }
+    return node.text?.split('(')[0]?.replace('new ', '').trim() || '?';
+}
+function extractExpressionText(node) {
+    for (let i = 0; i < node.childCount; i++) {
+        const child = node.child(i);
+        if (child.type !== 'throw' && child.type !== 'await') {
+            return truncate(child.text);
+        }
+    }
+    return truncate(node.text);
+}
+function extractName(kind, node) {
+    if (kind === 'throw') {
+        for (let i = 0; i < node.childCount; i++) {
+            const child = node.child(i);
+            if (child.type === 'new_expression')
+                return extractNewName(child);
+            if (child.type === 'call_expression') {
+                const fn = child.childForFieldName('function');
+                return fn ? fn.text : child.text?.split('(')[0] || '?';
+            }
+            if (child.type === 'identifier')
+                return child.text;
+        }
+        return truncate(node.text);
+    }
+    if (kind === 'await') {
+        for (let i = 0; i < node.childCount; i++) {
+            const child = node.child(i);
+            if (child.type === 'call_expression') {
+                const fn = child.childForFieldName('function');
+                return fn ? fn.text : child.text?.split('(')[0] || '?';
+            }
+            if (child.type === 'identifier' || child.type === 'member_expression') {
+                return child.text;
+            }
+        }
+        return truncate(node.text);
+    }
+    return truncate(node.text);
+}
+/**
+ * Create an AST-store visitor for use with walkWithVisitors.
+ *
+ * @param {object} astTypeMap - node type → kind mapping (e.g. JS_TS_AST_TYPES)
+ * @param {object[]} defs     - symbol definitions for parent lookup
+ * @param {string} relPath    - relative file path
+ * @param {Map} nodeIdMap     - def key → node ID mapping
+ * @returns {Visitor}
+ */
+export function createAstStoreVisitor(astTypeMap, defs, relPath, nodeIdMap) {
+    const rows = [];
+    // Track which nodes we've already matched to avoid duplicates in recursive walk
+    const matched = new Set();
+    function findParentDef(line) {
+        let best = null;
+        for (const def of defs) {
+            if (def.line <= line && (def.endLine == null || def.endLine >= line)) {
+                if (!best || def.endLine - def.line < best.endLine - best.line) {
+                    best = def;
+                }
+            }
+        }
+        return best;
+    }
+    function resolveParentNodeId(line) {
+        const parentDef = findParentDef(line);
+        if (!parentDef)
+            return null;
+        return nodeIdMap.get(`${parentDef.name}|${parentDef.kind}|${parentDef.line}`) || null;
+    }
+    return {
+        name: 'ast-store',
+        enterNode(node, _context) {
+            if (matched.has(node.id))
+                return;
+            const kind = astTypeMap[node.type];
+            if (!kind)
+                return;
+            const line = node.startPosition.row + 1;
+            let name;
+            let text = null;
+            if (kind === 'new') {
+                name = extractNewName(node);
+                text = truncate(node.text);
+            }
+            else if (kind === 'throw') {
+                name = extractName('throw', node);
+                text = extractExpressionText(node);
+            }
+            else if (kind === 'await') {
+                name = extractName('await', node);
+                text = extractExpressionText(node);
+            }
+            else if (kind === 'string') {
+                const content = node.text?.replace(/^['"`]|['"`]$/g, '') || '';
+                if (content.length < 2)
+                    return; // skip trivial strings, walker still descends
+                name = truncate(content, 100);
+                text = truncate(node.text);
+            }
+            else if (kind === 'regex') {
+                name = node.text || '?';
+                text = truncate(node.text);
+            }
+            rows.push({
+                file: relPath,
+                line,
+                kind,
+                name,
+                text,
+                receiver: null,
+                parentNodeId: resolveParentNodeId(line),
+            });
+            matched.add(node.id);
+            // Don't recurse into children for new/throw/await (same as original walkAst)
+            if (kind !== 'string' && kind !== 'regex') {
+                return { skipChildren: true };
+            }
+        },
+        finish() {
+            return rows;
+        },
+    };
+}
+//# sourceMappingURL=ast-store-visitor.js.map

package/dist/ast-analysis/visitors/ast-store-visitor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast-store-visitor.js","sourceRoot":"","sources":["../../../src/ast-analysis/visitors/ast-store-visitor.js"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,wCAAwC;AACxC,MAAM,QAAQ,GAAG,GAAG,CAAC;AAErB,SAAS,QAAQ,CAAC,CAAC,EAAE,GAAG,GAAG,QAAQ;IACjC,IAAI,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IACpB,OAAO,CAAC,CAAC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC;AAC9D,CAAC;AAED,SAAS,cAAc,CAAC,IAAI;IAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY;YAAE,OAAO,KAAK,CAAC,IAAI,CAAC;QACnD,IAAI,KAAK,CAAC,IAAI,KAAK,mBAAmB;YAAE,OAAO,KAAK,CAAC,IAAI,CAAC;IAC5D,CAAC;IACD,OAAO,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC;AACrE,CAAC;AAED,SAAS,qBAAqB,CAAC,IAAI;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YACrD,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IACD,OAAO,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC7B,CAAC;AAED,SAAS,WAAW,CAAC,IAAI,EAAE,IAAI;IAC7B,IAAI,IAAI,KAAK,OAAO,EAAE,CAAC;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,KAAK,CAAC,IAAI,KAAK,gBAAgB;gBAAE,OAAO,cAAc,CAAC,KAAK,CAAC,CAAC;YAClE,IAAI,KAAK,CAAC,IAAI,KAAK,iBAAiB,EAAE,CAAC;gBACrC,MAAM,EAAE,GAAG,KAAK,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC;gBAC/C,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;YACzD,CAAC;YACD,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY;gBAAE,OAAO,KAAK,CAAC,IAAI,CAAC;QACrD,CAAC;QACD,OAAO,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC;IACD,IAAI,IAAI,KAAK,OAAO,EAAE,CAAC;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,KAAK,CAAC,IAAI,KAAK,iBAAiB,EAAE,CAAC;gBACrC,MAAM,EAAE,GAAG,KAAK,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC;gBAC/C,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;YACzD,CAAC;YACD,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY,IAAI,KAAK,CAAC,IAAI,KAAK,mBAAmB,EAAE,CAAC;gBACtE,OAAO,KAAK,CAAC,IAAI,CAAC;YACpB,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC;IACD,OAAO,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC7B,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,qBAAqB,CAAC,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,SAAS;IACxE,MAAM,IAAI,GAAG,EAAE,CAAC;IAChB,gFAAgF;IAChF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;IAE1B,SAAS,aAAa,CAAC,IAAI;QACzB,IAAI,IAAI,GAAG,IAAI,CAAC;QAChB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,GAAG,CAAC,IAAI,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,IAAI,IAAI,IAAI,GAAG,CAAC,OAAO,IAAI,IAAI,CAAC,EAAE,CAAC;gBACrE,IAAI,CAAC,IAAI,IAAI,GAAG,CAAC,OAAO,GAAG,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;oBAC/D,IAAI,GAAG,GAAG,CAAC;gBACb,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,SAAS,mBAAmB,CAAC,IAAI;QAC/B,MAAM,SAAS,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,CAAC,SAAS;YAAE,OAAO,IAAI,CAAC;QAC5B,OAAO,SAAS,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,IAAI,IAAI,SAAS,CAAC,IAAI,IAAI,SAAS,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC;IACxF,CAAC;IAED,OAAO;QACL,IAAI,EAAE,WAAW;QAEjB,SAAS,CAAC,IAAI,EAAE,QAAQ;YACtB,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,OAAO;YAEjC,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnC,IAAI,CAAC,IAAI;gBAAE,OAAO;YAElB,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC,CAAC;YACxC,IAAI,IAAI,CAAC;YACT,IAAI,IAAI,GAAG,IAAI,CAAC;YAEhB,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC;gBACnB,IAAI,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;gBAC5B,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC7B,CAAC;iBAAM,IAAI,IAAI,KAAK,OAAO,EAAE,CAAC;gBAC5B,IAAI,GAAG,WAAW,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;gBAClC,IAAI,GAAG,qBAAqB,CAAC,IAAI,CAAC,CAAC;YACrC,CAAC;iBAAM,IAAI,IAAI,KAAK,OAAO,EAAE,CAAC;gBAC5B,IAAI,GAAG,WAAW,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;gBAClC,IAAI,GAAG,qBAAqB,CAAC,IAAI,CAAC,CAAC;YACrC,CAAC;iBAAM,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;gBAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,gBAAgB,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC;gBAC/D,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;oBAAE,OAAO,CAAC,8CAA8C;gBAC9E,IAAI,GAAG,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;gBAC9B,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC7B,CAAC;iBAAM,IAAI,IAAI,KAAK,OAAO,EAAE,CAAC;gBAC5B,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,GAAG,CAAC;gBACxB,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC7B,CAAC;YAED,IAAI,CAAC,IAAI,CAAC;gBACR,IAAI,EAAE,OAAO;gBACb,IAAI;gBACJ,IAAI;gBACJ,IAAI;gBACJ,IAAI;gBACJ,QAAQ,EAAE,IAAI;gBACd,YAAY,EAAE,mBAAmB,CAAC,IAAI,CAAC;aACxC,CAAC,CAAC;YAEH,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAErB,6EAA6E;YAC7E,IAAI,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,OAAO,EAAE,CAAC;gBAC1C,OAAO,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC;YAChC,CAAC;QACH,CAAC;QAED,MAAM;YACJ,OAAO,IAAI,CAAC;QACd,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/ast-analysis/visitors/cfg-visitor.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Create a CFG visitor for use with walkWithVisitors.
+ *
+ * @param {object} cfgRules - CFG_RULES for the language
+ * @returns {Visitor}
+ */
+export function createCfgVisitor(cfgRules: object): Visitor;
+//# sourceMappingURL=cfg-visitor.d.ts.map

package/dist/ast-analysis/visitors/cfg-visitor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cfg-visitor.d.ts","sourceRoot":"","sources":["../../../src/ast-analysis/visitors/cfg-visitor.js"],"names":[],"mappings":"AAwtBA;;;;;GAKG;AACH,2CAHW,MAAM,GACJ,OAAO,CA6CnB"}