@opensip-cli/tree-sitter 0.1.0

package/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/NOTICE

@@ -0,0 +1,8 @@
+OpenSIP CLI
+Copyright 2026 opensip-ai
+
+Licensed under the Apache License, Version 2.0 (the "License"); you may not use
+this software except in compliance with the License. A copy of the License is
+included in the LICENSE file and is also available at:
+
+    http://www.apache.org/licenses/LICENSE-2.0

package/README.md

@@ -0,0 +1,31 @@
+<!-- Generated by scripts/build-package-readmes.mjs — do not edit by hand.
+     Change the package's "description" (or the generator template) and run
+     `pnpm docs:readmes`. CI enforces sync via `pnpm docs:readmes:check`. -->
+
+# @opensip-cli/tree-sitter
+
+> Grammar-agnostic tree-sitter substrate (parser lifecycle + node accessors) shared by lang-* and the graph adapters
+
+This is an **internal library** of the opensip-cli toolkit. It is published so the CLI and tools can depend on it; most users will not install it directly.
+
+Part of [**opensip-cli**](https://github.com/opensip-ai/opensip-cli) — an open-source codebase-analysis toolkit: fitness checks (`fit`), static call-graph analysis (`graph`), and simulation (`sim`).
+
+## Install
+
+Most users install the CLI, which bundles the first-party tools:
+
+```bash
+curl -fsSL https://opensip.ai/cli/install.sh | bash
+```
+
+This package is published for the CLI and advanced plugin authors; most users should not install `@opensip-cli/tree-sitter` directly.
+
+## Documentation
+
+- 📚 Project docs: https://opensip.ai/docs/opensip-cli/
+- 🧭 Package catalog (what every package does): https://github.com/opensip-ai/opensip-cli/blob/v0.1.0/docs/public/70-reference/02-package-catalog.md
+- 📦 Source: https://github.com/opensip-ai/opensip-cli/tree/v0.1.0/packages/tree-sitter
+
+## License
+
+Apache-2.0 © opensip-ai

package/dist/__tests__/lifecycle.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=lifecycle.test.d.ts.map

package/dist/__tests__/lifecycle.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lifecycle.test.d.ts","sourceRoot":"","sources":["../../src/__tests__/lifecycle.test.ts"],"names":[],"mappings":""}

package/dist/__tests__/lifecycle.test.js

@@ -0,0 +1,26 @@
+import { fileURLToPath } from 'node:url';
+import { beforeAll, describe, expect, it } from 'vitest';
+import { loadGrammar, createParser, parseToTree } from '../index.js';
+// The substrate is grammar-agnostic, so its tests parse with *some* grammar:
+// the vendored python wasm from the sibling lang-python package, referenced by
+// filesystem path (not a package import — that would add a forbidden lang-*
+// dependency and is unnecessary for a file the test only needs to read).
+const WASM = fileURLToPath(new URL('../../../languages/lang-python/wasm/tree-sitter-python.wasm', import.meta.url));
+let parser;
+beforeAll(async () => {
+    parser = createParser(await loadGrammar(WASM));
+});
+describe('parseToTree', () => {
+    it('returns a tree for valid source', () => {
+        const tree = parseToTree(parser, 'x = 1\n');
+        expect(tree).not.toBeNull();
+        expect(tree?.rootNode.type).toBe('module');
+        expect(tree?.rootNode.hasError).toBe(false);
+    });
+    it('returns a partial (non-null) tree with hasError for malformed source', () => {
+        const tree = parseToTree(parser, 'def (:\n');
+        expect(tree).not.toBeNull();
+        expect(tree?.rootNode.hasError).toBe(true);
+    });
+});
+//# sourceMappingURL=lifecycle.test.js.map

package/dist/__tests__/lifecycle.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lifecycle.test.js","sourceRoot":"","sources":["../../src/__tests__/lifecycle.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AAEzC,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAC;AAEzD,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAIrE,6EAA6E;AAC7E,+EAA+E;AAC/E,4EAA4E;AAC5E,yEAAyE;AACzE,MAAM,IAAI,GAAG,aAAa,CACxB,IAAI,GAAG,CAAC,6DAA6D,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CACxF,CAAC;AAEF,IAAI,MAAc,CAAC;AACnB,SAAS,CAAC,KAAK,IAAI,EAAE;IACnB,MAAM,GAAG,YAAY,CAAC,MAAM,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;AACjD,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;IAC3B,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,IAAI,GAAG,WAAW,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAC5C,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC5B,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC3C,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sEAAsE,EAAE,GAAG,EAAE;QAC9E,MAAM,IAAI,GAAG,WAAW,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QAC7C,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC5B,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/__tests__/nodes.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=nodes.test.d.ts.map

package/dist/__tests__/nodes.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"nodes.test.d.ts","sourceRoot":"","sources":["../../src/__tests__/nodes.test.ts"],"names":[],"mappings":""}

package/dist/__tests__/nodes.test.js

@@ -0,0 +1,57 @@
+import { fileURLToPath } from 'node:url';
+import { beforeAll, describe, expect, it } from 'vitest';
+import { loadGrammar, createParser, parseToTree, nameOf, childrenOf, namedChildrenOf, nodeText, getLineNumber, getColumn, walkNodes, findEnclosing, } from '../index.js';
+const WASM = fileURLToPath(new URL('../../../languages/lang-python/wasm/tree-sitter-python.wasm', import.meta.url));
+let parse;
+beforeAll(async () => {
+    const parser = createParser(await loadGrammar(WASM));
+    parse = (src) => {
+        const tree = parseToTree(parser, src);
+        if (!tree)
+            throw new Error('no tree');
+        return tree;
+    };
+});
+describe('node accessors', () => {
+    it('nameOf reads the name field, null when absent', () => {
+        const root = parse('def foo():\n    pass\n').rootNode;
+        const fn = namedChildrenOf(root)[0];
+        expect(fn.type).toBe('function_definition');
+        expect(nameOf(fn)).toBe('foo');
+        expect(nameOf(root)).toBeNull();
+    });
+    it('childrenOf / namedChildrenOf return only non-null nodes', () => {
+        const root = parse('x = 1\n').rootNode;
+        expect(childrenOf(root).every((n) => n !== null)).toBe(true);
+        expect(namedChildrenOf(root).length).toBeGreaterThan(0);
+    });
+    it('getLineNumber is 1-based, getColumn 0-based, nodeText returns source', () => {
+        const root = parse('a = 1\nb = 2\n').rootNode;
+        const second = namedChildrenOf(root)[1];
+        expect(getLineNumber(second)).toBe(2);
+        expect(getColumn(second)).toBe(0);
+        expect(nodeText(second)).toContain('b = 2');
+    });
+    it('walkNodes visits named descendants (function + nested return)', () => {
+        const root = parse('def f():\n    return 1\n').rootNode;
+        const types = [];
+        walkNodes(root, (n) => types.push(n.type));
+        expect(types).toContain('function_definition');
+        expect(types).toContain('return_statement');
+    });
+    it('findEnclosing returns the nearest matching ancestor, null at root', () => {
+        const root = parse('def f():\n    return 1\n').rootNode;
+        const returns = [];
+        walkNodes(root, (n) => {
+            if (n.type === 'return_statement')
+                returns.push(n);
+        });
+        expect(returns[0]).toBeDefined();
+        const fn = findEnclosing(returns[0], (n) => n.type === 'function_definition');
+        expect(fn).not.toBeNull();
+        expect(nameOf(fn)).toBe('f');
+        // root has no parent → no enclosing match
+        expect(findEnclosing(root, () => true)).toBeNull();
+    });
+});
+//# sourceMappingURL=nodes.test.js.map

package/dist/__tests__/nodes.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nodes.test.js","sourceRoot":"","sources":["../../src/__tests__/nodes.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AAEzC,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAC;AAEzD,OAAO,EACL,WAAW,EACX,YAAY,EACZ,WAAW,EACX,MAAM,EACN,UAAU,EACV,eAAe,EACf,QAAQ,EACR,aAAa,EACb,SAAS,EACT,SAAS,EACT,aAAa,GACd,MAAM,aAAa,CAAC;AAIrB,MAAM,IAAI,GAAG,aAAa,CACxB,IAAI,GAAG,CAAC,6DAA6D,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CACxF,CAAC;AAEF,IAAI,KAA4B,CAAC;AACjC,SAAS,CAAC,KAAK,IAAI,EAAE;IACnB,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;IACrD,KAAK,GAAG,CAAC,GAAG,EAAE,EAAE;QACd,MAAM,IAAI,GAAG,WAAW,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QACtC,IAAI,CAAC,IAAI;YAAE,MAAM,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC;QACtC,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;IAC9B,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,IAAI,GAAG,KAAK,CAAC,wBAAwB,CAAC,CAAC,QAAQ,CAAC;QACtD,MAAM,EAAE,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;QAC5C,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/B,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,IAAI,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,QAAQ,CAAC;QACvC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAO,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnE,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sEAAsE,EAAE,GAAG,EAAE;QAC9E,MAAM,IAAI,GAAG,KAAK,CAAC,gBAAgB,CAAC,CAAC,QAAQ,CAAC;QAC9C,MAAM,MAAM,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+DAA+D,EAAE,GAAG,EAAE;QACvE,MAAM,IAAI,GAAG,KAAK,CAAC,0BAA0B,CAAC,CAAC,QAAQ,CAAC;QACxD,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,qBAAqB,CAAC,CAAC;QAC/C,MAAM,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,kBAAkB,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mEAAmE,EAAE,GAAG,EAAE;QAC3E,MAAM,IAAI,GAAG,KAAK,CAAC,0BAA0B,CAAC,CAAC,QAAQ,CAAC;QACxD,MAAM,OAAO,GAAW,EAAE,CAAC;QAC3B,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE;YACpB,IAAI,CAAC,CAAC,IAAI,KAAK,kBAAkB;gBAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrD,CAAC,CAAC,CAAC;QACH,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;QACjC,MAAM,EAAE,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,qBAAqB,CAAC,CAAC;QAC9E,MAAM,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC1B,MAAM,CAAC,MAAM,CAAC,EAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC9B,0CAA0C;QAC1C,MAAM,CAAC,aAAa,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACrD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,16 @@
+/**
+ * @opensip-cli/tree-sitter — the grammar-agnostic tree-sitter substrate
+ * (ADR-0010). Sits between `@opensip-cli/core` and the `lang-*` / graph
+ * adapters; depends on `web-tree-sitter` only, never on `@opensip-cli/graph`.
+ *
+ *   core → tree-sitter → { lang-*, graph-adapter-common }
+ *
+ * Provides: the parser lifecycle (`Parser.init` once, `loadGrammar`,
+ * `createParser`, `parseToTree`), the neutral `ParsedFile` shape, and the
+ * generic node accessors / AST helpers. Per-language grammars + node-kind
+ * predicates live in each `lang-*` package.
+ */
+export * from './types.js';
+export * from './lifecycle.js';
+export * from './nodes.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,cAAc,YAAY,CAAC;AAC3B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,YAAY,CAAC"}

package/dist/index.js

@@ -0,0 +1,16 @@
+/**
+ * @opensip-cli/tree-sitter — the grammar-agnostic tree-sitter substrate
+ * (ADR-0010). Sits between `@opensip-cli/core` and the `lang-*` / graph
+ * adapters; depends on `web-tree-sitter` only, never on `@opensip-cli/graph`.
+ *
+ *   core → tree-sitter → { lang-*, graph-adapter-common }
+ *
+ * Provides: the parser lifecycle (`Parser.init` once, `loadGrammar`,
+ * `createParser`, `parseToTree`), the neutral `ParsedFile` shape, and the
+ * generic node accessors / AST helpers. Per-language grammars + node-kind
+ * predicates live in each `lang-*` package.
+ */
+export * from './types.js';
+export * from './lifecycle.js';
+export * from './nodes.js';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,cAAc,YAAY,CAAC;AAC3B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,YAAY,CAAC"}

package/dist/lifecycle.d.ts

@@ -0,0 +1,36 @@
+/**
+ * web-tree-sitter lifecycle — the grammar-agnostic half lifted out of
+ * `graph-adapter-common/parse.ts` (ADR-0010). No `@opensip-cli/graph`
+ * coupling: this layer knows nothing of `ParseInput`/`ParseOutput`. The
+ * per-project parse driver (which owns those graph types) stays in
+ * graph-adapter-common; `lang-*` adapters call `parseToTree` per file.
+ *
+ * ## Sync parse over an async runtime (the load-bearing seam)
+ *
+ * `web-tree-sitter` needs a one-time async init (`Parser.init()`) and a
+ * one-time async grammar load (`Language.load(<wasm>)`), but
+ * `parser.parse(source)` is synchronous once a language is set. We confine
+ * the async to module top-level `await Parser.init()` here — every consumer
+ * statically imports this module, so the WASM runtime is ready before any
+ * adapter's own top-level `await loadGrammar(<wasm>)`.
+ */
+import { Parser, Language, type Tree } from 'web-tree-sitter';
+/** Load a tree-sitter grammar from a `.wasm` path (adapter module top level). */
+export declare function loadGrammar(wasmPath: string): Promise<Language>;
+/**
+ * Create a parser bound to `grammar`. Adapters create one per grammar at
+ * module load and reuse it across every `parseToTree` call — tree-sitter
+ * parsers are reusable and stateless per parse, so reuse yields identical
+ * trees with no per-call allocation.
+ */
+export declare function createParser(grammar: Language): Parser;
+/**
+ * Parse `source` into a tree. Returns the tree (possibly with
+ * `rootNode.hasError` — tree-sitter recovers with MISSING nodes; the partial
+ * tree is retained, matching the graph parse contract). Returns `null` only
+ * when web-tree-sitter yields no tree (no language set / aborted callback —
+ * neither applies here). Never swallows a thrown error: a throwing parse
+ * propagates to the caller's project loop, which records a `ParseError`.
+ */
+export declare function parseToTree(parser: Parser, source: string): Tree | null;
+//# sourceMappingURL=lifecycle.d.ts.map

package/dist/lifecycle.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lifecycle.d.ts","sourceRoot":"","sources":["../src/lifecycle.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,IAAI,EAAE,MAAM,iBAAiB,CAAC;AAO9D,iFAAiF;AACjF,wBAAsB,WAAW,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,CAAC,CAErE;AAED;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,OAAO,EAAE,QAAQ,GAAG,MAAM,CAItD;AAED;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,GAAG,IAAI,CAEvE"}

package/dist/lifecycle.js

@@ -0,0 +1,48 @@
+/**
+ * web-tree-sitter lifecycle — the grammar-agnostic half lifted out of
+ * `graph-adapter-common/parse.ts` (ADR-0010). No `@opensip-cli/graph`
+ * coupling: this layer knows nothing of `ParseInput`/`ParseOutput`. The
+ * per-project parse driver (which owns those graph types) stays in
+ * graph-adapter-common; `lang-*` adapters call `parseToTree` per file.
+ *
+ * ## Sync parse over an async runtime (the load-bearing seam)
+ *
+ * `web-tree-sitter` needs a one-time async init (`Parser.init()`) and a
+ * one-time async grammar load (`Language.load(<wasm>)`), but
+ * `parser.parse(source)` is synchronous once a language is set. We confine
+ * the async to module top-level `await Parser.init()` here — every consumer
+ * statically imports this module, so the WASM runtime is ready before any
+ * adapter's own top-level `await loadGrammar(<wasm>)`.
+ */
+import { Parser, Language } from 'web-tree-sitter';
+// One-time WASM runtime init. Top-level await — every consumer statically
+// imports this module — guarantees the runtime is ready before any adapter's
+// `loadGrammar(<wasm>)` (which also runs at module top level).
+await Parser.init();
+/** Load a tree-sitter grammar from a `.wasm` path (adapter module top level). */
+export async function loadGrammar(wasmPath) {
+    return Language.load(wasmPath);
+}
+/**
+ * Create a parser bound to `grammar`. Adapters create one per grammar at
+ * module load and reuse it across every `parseToTree` call — tree-sitter
+ * parsers are reusable and stateless per parse, so reuse yields identical
+ * trees with no per-call allocation.
+ */
+export function createParser(grammar) {
+    const parser = new Parser();
+    parser.setLanguage(grammar);
+    return parser;
+}
+/**
+ * Parse `source` into a tree. Returns the tree (possibly with
+ * `rootNode.hasError` — tree-sitter recovers with MISSING nodes; the partial
+ * tree is retained, matching the graph parse contract). Returns `null` only
+ * when web-tree-sitter yields no tree (no language set / aborted callback —
+ * neither applies here). Never swallows a thrown error: a throwing parse
+ * propagates to the caller's project loop, which records a `ParseError`.
+ */
+export function parseToTree(parser, source) {
+    return parser.parse(source);
+}
+//# sourceMappingURL=lifecycle.js.map

package/dist/lifecycle.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lifecycle.js","sourceRoot":"","sources":["../src/lifecycle.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAa,MAAM,iBAAiB,CAAC;AAE9D,0EAA0E;AAC1E,6EAA6E;AAC7E,+DAA+D;AAC/D,MAAM,MAAM,CAAC,IAAI,EAAE,CAAC;AAEpB,iFAAiF;AACjF,MAAM,CAAC,KAAK,UAAU,WAAW,CAAC,QAAgB;IAChD,OAAO,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;AACjC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAAC,OAAiB;IAC5C,MAAM,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;IAC5B,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;IAC5B,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,WAAW,CAAC,MAAc,EAAE,MAAc;IACxD,OAAO,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;AAC9B,CAAC"}

package/dist/nodes.d.ts

@@ -0,0 +1,45 @@
+/**
+ * Generic, grammar-agnostic node accessors + AST helpers (ADR-0010 v1
+ * vocabulary). `nameOf`/`childrenOf`/`namedChildrenOf` are lifted verbatim
+ * from `graph-adapter-common/walk.ts` (they operate on `Node` only, no graph
+ * types). `walkNodes`/`findEnclosing` mirror the `lang-typescript` precedents
+ * (`ast-utilities.walkNodes`, `function-scope.findEnclosingFunction`) over
+ * tree-sitter nodes. Per-language node-kind predicates layer on top in each
+ * `lang-*` package.
+ */
+import type { Node } from 'web-tree-sitter';
+/**
+ * Read the text of a node's `name` field, or `null` when absent. Every
+ * grammar exposes the declared name via a `name` field on function / method /
+ * class / impl nodes.
+ */
+export declare function nameOf(node: Node): string | null;
+/**
+ * `node.children` with the nulls removed. web-tree-sitter types `.children`
+ * as `(Node | null)[]` (a null slot is theoretically possible mid-iteration
+ * during an incremental re-parse); for our one-shot parse the slots are
+ * always populated, but we filter once here so consumers get a clean `Node[]`.
+ */
+export declare function childrenOf(node: Node): Node[];
+/** `node.namedChildren` with the nulls removed. See {@link childrenOf}. */
+export declare function namedChildrenOf(node: Node): Node[];
+/** The node's source text. */
+export declare function nodeText(node: Node): string;
+/** 1-based line number of the node's start. */
+export declare function getLineNumber(node: Node): number;
+/** 0-based column of the node's start. */
+export declare function getColumn(node: Node): number;
+/**
+ * Pre-order visit of every named descendant of `root` (not `root` itself) —
+ * the tree-sitter analog of `lang-typescript`'s `walkNodes`. Named children
+ * are the meaningful AST nodes (punctuation/anonymous tokens excluded).
+ */
+export declare function walkNodes(root: Node, visitor: (node: Node) => void): void;
+/**
+ * Walk ancestors of `node` (excluding `node`) and return the nearest one
+ * matching `predicate`, or `null` at the root — the tree-sitter analog of
+ * `lang-typescript`'s `findEnclosingFunction`. Per-language helpers compose
+ * this with a node-kind predicate.
+ */
+export declare function findEnclosing(node: Node, predicate: (n: Node) => boolean): Node | null;
+//# sourceMappingURL=nodes.d.ts.map

package/dist/nodes.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"nodes.d.ts","sourceRoot":"","sources":["../src/nodes.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,iBAAiB,CAAC;AAE5C;;;;GAIG;AACH,wBAAgB,MAAM,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM,GAAG,IAAI,CAGhD;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,EAAE,CAE7C;AAED,2EAA2E;AAC3E,wBAAgB,eAAe,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,EAAE,CAElD;AAED,8BAA8B;AAC9B,wBAAgB,QAAQ,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM,CAE3C;AAED,+CAA+C;AAC/C,wBAAgB,aAAa,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM,CAEhD;AAED,0CAA0C;AAC1C,wBAAgB,SAAS,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM,CAE5C;AAED;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,KAAK,IAAI,GAAG,IAAI,CAKzE;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC,EAAE,IAAI,KAAK,OAAO,GAAG,IAAI,GAAG,IAAI,CAOtF"}

package/dist/nodes.js

@@ -0,0 +1,70 @@
+/**
+ * Generic, grammar-agnostic node accessors + AST helpers (ADR-0010 v1
+ * vocabulary). `nameOf`/`childrenOf`/`namedChildrenOf` are lifted verbatim
+ * from `graph-adapter-common/walk.ts` (they operate on `Node` only, no graph
+ * types). `walkNodes`/`findEnclosing` mirror the `lang-typescript` precedents
+ * (`ast-utilities.walkNodes`, `function-scope.findEnclosingFunction`) over
+ * tree-sitter nodes. Per-language node-kind predicates layer on top in each
+ * `lang-*` package.
+ */
+/**
+ * Read the text of a node's `name` field, or `null` when absent. Every
+ * grammar exposes the declared name via a `name` field on function / method /
+ * class / impl nodes.
+ */
+export function nameOf(node) {
+    const name = node.childForFieldName('name');
+    return name ? name.text : null;
+}
+/**
+ * `node.children` with the nulls removed. web-tree-sitter types `.children`
+ * as `(Node | null)[]` (a null slot is theoretically possible mid-iteration
+ * during an incremental re-parse); for our one-shot parse the slots are
+ * always populated, but we filter once here so consumers get a clean `Node[]`.
+ */
+export function childrenOf(node) {
+    return node.children.filter((c) => c !== null);
+}
+/** `node.namedChildren` with the nulls removed. See {@link childrenOf}. */
+export function namedChildrenOf(node) {
+    return node.namedChildren.filter((c) => c !== null);
+}
+/** The node's source text. */
+export function nodeText(node) {
+    return node.text;
+}
+/** 1-based line number of the node's start. */
+export function getLineNumber(node) {
+    return node.startPosition.row + 1;
+}
+/** 0-based column of the node's start. */
+export function getColumn(node) {
+    return node.startPosition.column;
+}
+/**
+ * Pre-order visit of every named descendant of `root` (not `root` itself) —
+ * the tree-sitter analog of `lang-typescript`'s `walkNodes`. Named children
+ * are the meaningful AST nodes (punctuation/anonymous tokens excluded).
+ */
+export function walkNodes(root, visitor) {
+    for (const child of namedChildrenOf(root)) {
+        visitor(child);
+        walkNodes(child, visitor);
+    }
+}
+/**
+ * Walk ancestors of `node` (excluding `node`) and return the nearest one
+ * matching `predicate`, or `null` at the root — the tree-sitter analog of
+ * `lang-typescript`'s `findEnclosingFunction`. Per-language helpers compose
+ * this with a node-kind predicate.
+ */
+export function findEnclosing(node, predicate) {
+    let current = node.parent;
+    while (current) {
+        if (predicate(current))
+            return current;
+        current = current.parent;
+    }
+    return null;
+}
+//# sourceMappingURL=nodes.js.map

package/dist/nodes.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nodes.js","sourceRoot":"","sources":["../src/nodes.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH;;;;GAIG;AACH,MAAM,UAAU,MAAM,CAAC,IAAU;IAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;IAC5C,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;AACjC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,IAAU;IACnC,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAa,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;AAC5D,CAAC;AAED,2EAA2E;AAC3E,MAAM,UAAU,eAAe,CAAC,IAAU;IACxC,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAa,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;AACjE,CAAC;AAED,8BAA8B;AAC9B,MAAM,UAAU,QAAQ,CAAC,IAAU;IACjC,OAAO,IAAI,CAAC,IAAI,CAAC;AACnB,CAAC;AAED,+CAA+C;AAC/C,MAAM,UAAU,aAAa,CAAC,IAAU;IACtC,OAAO,IAAI,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC,CAAC;AACpC,CAAC;AAED,0CAA0C;AAC1C,MAAM,UAAU,SAAS,CAAC,IAAU;IAClC,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC;AACnC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,SAAS,CAAC,IAAU,EAAE,OAA6B;IACjE,KAAK,MAAM,KAAK,IAAI,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1C,OAAO,CAAC,KAAK,CAAC,CAAC;QACf,SAAS,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAC5B,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAAC,IAAU,EAAE,SAA+B;IACvE,IAAI,OAAO,GAAgB,IAAI,CAAC,MAAM,CAAC;IACvC,OAAO,OAAO,EAAE,CAAC;QACf,IAAI,SAAS,CAAC,OAAO,CAAC;YAAE,OAAO,OAAO,CAAC;QACvC,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC;IAC3B,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/types.d.ts

@@ -0,0 +1,18 @@
+/**
+ * Neutral tree-sitter types — the grammar-agnostic surface both `lang-*`
+ * adapters and the graph adapters consume. Deliberately free of any
+ * `@opensip-cli/graph` coupling (the reason this package exists, ADR-0010).
+ */
+import type { Tree } from 'web-tree-sitter';
+export type { Node, Tree, Language } from 'web-tree-sitter';
+/**
+ * The parsed-file shape every tree-sitter consumer uses: the parse tree
+ * plus the original source text (held so body slices can be extracted for
+ * hashing without re-parsing). Matches the graph adapters' historical
+ * `{ tree, source }` record exactly.
+ */
+export interface ParsedFile {
+    readonly tree: Tree;
+    readonly source: string;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,iBAAiB,CAAC;AAE5C,YAAY,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAE5D;;;;;GAKG;AACH,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IACpB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB"}

package/dist/types.js

@@ -0,0 +1,7 @@
+/**
+ * Neutral tree-sitter types — the grammar-agnostic surface both `lang-*`
+ * adapters and the graph adapters consume. Deliberately free of any
+ * `@opensip-cli/graph` coupling (the reason this package exists, ADR-0010).
+ */
+export {};
+//# sourceMappingURL=types.js.map

package/dist/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;;;GAIG"}

package/package.json

@@ -0,0 +1,47 @@
+{
+  "name": "@opensip-cli/tree-sitter",
+  "version": "0.1.0",
+  "license": "Apache-2.0",
+  "description": "Grammar-agnostic tree-sitter substrate (parser lifecycle + node accessors) shared by lang-* and the graph adapters",
+  "keywords": [
+    "opensip-cli",
+    "static-analysis",
+    "code-quality",
+    "tree-sitter",
+    "ast",
+    "parser"
+  ],
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/opensip-ai/opensip-cli.git",
+    "directory": "packages/tree-sitter"
+  },
+  "homepage": "https://github.com/opensip-ai/opensip-cli",
+  "bugs": {
+    "url": "https://github.com/opensip-ai/opensip-cli/issues"
+  },
+  "type": "module",
+  "main": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "exports": {
+    ".": "./dist/index.js"
+  },
+  "files": [
+    "dist",
+    "LICENSE",
+    "NOTICE"
+  ],
+  "dependencies": {
+    "web-tree-sitter": "0.26.9"
+  },
+  "devDependencies": {
+    "@types/node": "^24.13.2",
+    "vitest": "^4.1.8"
+  },
+  "scripts": {
+    "build": "tsc",
+    "test": "vitest run --passWithNoTests",
+    "typecheck": "tsc --noEmit",
+    "clean": "rm -rf dist"
+  }
+}