<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
    <title>tree-sitter</title>
    <link rel="self" type="application/atom+xml" href="https://links.biapy.com/guest/tags/1146/feed"/>
    <updated>2026-10-21T06:52:58+00:00</updated>
    <id>https://links.biapy.com/guest/tags/1146/feed</id>
            <entry>
            <id>https://links.biapy.com/links/13988</id>
            <title type="text"><![CDATA[Gortex]]></title>
            <link rel="alternate" href="https://gortex.dev/" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/13988"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[One call. not ten reads. code intelligence for your AI coding agent.

Gortex indexes your repository into an in-memory knowledge graph and serves it to your coding agent over MCP, HTTP, and a web UI. One graph query replaces a stack of file reads — up to 50× fewer tokens per response. 257 languages, a 21-tool MCP surface, live editor-buffer overlays, speculative edits, dataflow, clone detection, graph-grounded PR review, and a 17-server LSP bridge.
Built for 19 AI coding agents on macOS, Linux &amp;amp; Windows — one binary, zero services.

- [Gortex @ GitHub](https://github.com/zzet/gortex).]]>
            </summary>
            <updated>2026-09-22T12:05:03+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/13618</id>
            <title type="text"><![CDATA[Code-Graph-RAG]]></title>
            <link rel="alternate" href="https://code-graph-rag.com/" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/13618"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[AI-Powered Codebase Analysis.

The ultimate RAG for your monorepo. Query, understand, and edit multi-language codebases with the power of AI and knowledge graphs.

Code-Graph-RAG parses a multi-language codebase with Tree-sitter, builds a knowledge graph of its structure in Memgraph, and lets you query, edit, and optimise that code in plain English. It works across a monorepo of mixed languages under one unified graph schema.

- [Code-Graph-RAG  @ GitHub](https://github.com/vitali87/code-graph-rag).]]>
            </summary>
            <updated>2026-08-12T12:14:17+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/13483</id>
            <title type="text"><![CDATA[jCodeMunch MCP]]></title>
            <link rel="alternate" href="https://jcodemunch.com/" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/13483"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[AI Code Retrieval with 95% Token Reduction.

 Model-agnostic MCP server indexes your repo and hands any AI agent — Claude, GPT, Gemini — the exact function, class, or constant. No more 200K-token file dumps. More wins, fewer timeouts, lower bill.

Cut AI token costs 95%+ on code exploration. The leading MCP server for precise, symbol-level GitHub code retrieval via tree-sitter AST. Works with Claude Code, Cursor &amp;amp; any MCP client. 313B+ tokens saved.

- [jCodeMunch MCP @ GitHub](https://github.com/jgravelle/jcodemunch-mcp).

Related contents:

- [My Favorite AI MCP Servers for the Home Lab in 2026 @ VirtualizationHowto&amp;#039;s YouTube](https://www.youtube.com/watch?v=NgAglRc_ccs).]]>
            </summary>
            <updated>2026-07-31T13:02:09+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/12966</id>
            <title type="text"><![CDATA[sem]]></title>
            <link rel="alternate" href="https://ataraxy-labs.github.io/sem/" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/12966"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[Semantic understanding on top of Git.
Diff, blame, impact, log. Functions, not lines. 

 Semantic version control =&amp;gt; entity-level diffs, blame, and impact analysis on top of git. 26 languages via tree-sitter. Built for coding agents. 

- [sem @ GitHub](https://github.com/Ataraxy-Labs/sem).]]>
            </summary>
            <updated>2026-06-08T11:44:36+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/12660</id>
            <title type="text"><![CDATA[Trailmark]]></title>
            <link rel="alternate" href="https://github.com/trailofbits/trailmark" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/12660"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[Build and query a graph database representation of source code.

Parse source code into queryable graphs of functions, classes, calls, and semantic annotations for security analysis.

Trailmark uses tree-sitter for language-agnostic AST parsing and rustworkx for high-performance graph traversal. The long-term vision is to combine this graph with mutation testing and coverage-guided fuzzing to identify gaps between assumptions and test coverage that are reachable from user input.]]>
            </summary>
            <updated>2026-04-30T11:24:45+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/12326</id>
            <title type="text"><![CDATA[code-review-graph]]></title>
            <link rel="alternate" href="https://github.com/tirth8205/code-review-graph" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/12326"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[Stop burning tokens. Start reviewing smarter.

 Local knowledge graph for Claude Code. Builds a persistent map of your codebase so Claude reads only what matters — 6.8× fewer tokens on reviews and up to 49× on daily coding tasks. 

Claude Code re-reads your entire codebase on every task. code-review-graph fixes that. It builds a structural map of your code with Tree-sitter, tracks changes incrementally, and gives Claude precise context so it reads only what matters.]]>
            </summary>
            <updated>2026-03-28T08:24:25+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/1365</id>
            <title type="text"><![CDATA[Globstar]]></title>
            <link rel="alternate" href="https://globstar.dev/" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/1365"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[The Open-Source Static Analysis Toolkit.

Write SAST checkers with Globstar and run them in your CI with a single binary. It&amp;#039;s fast, easy to write, and MIT-licensed.
Globstar is a fast, feature-rich, and open-source static analysis toolkit for writing and running code checkers. Based on tree-sitter. 

- [Globstar @ GitHub](https://github.com/DeepSourceCorp/globstar).]]>
            </summary>
            <updated>2025-08-28T19:43:15+00:00</updated>
        </entry>
    </feed>
