Tree Sitter Based Code Definition Extraction With Language Specific Query Files

via “pattern-based code scanning with tree-sitter ast parsing”

Static analysis — custom rules for bugs and security, 30+ languages, AI-powered triage.

Unique: Uses tree-sitter AST parsing with OCaml-based structural pattern matching engine instead of regex or simple text matching, enabling language-aware detection that understands code semantics and structure across 30+ languages without requiring language-specific implementations

vs others: More precise and language-aware than regex-based tools like grep; faster and more maintainable than writing custom AST visitors for each language like SonarQube requires

via “multi-language ast parsing and entity extraction with tree-sitter”

High-performance code intelligence MCP server. Indexes codebases into a persistent knowledge graph — average repo in milliseconds. 66 languages, sub-ms queries, 99% fewer tokens. Single static binary, zero dependencies.

Unique: Uses vendored tree-sitter C bindings compiled into a single static binary, enabling 66-language support without external dependencies or grammar downloads. Integrates incremental parsing to avoid re-parsing unchanged regions during content-hash-based reindexing, achieving ~4× faster incremental updates than full-scan approaches.

vs others: Supports 66 languages in a single binary with zero external dependencies, whereas LSP-based approaches require per-language server installations and Regex-based tools are limited to 5-10 languages with poor structural accuracy.

via “multi-language code parsing with tree-sitter ast extraction”

An MCP server plus a CLI tool that indexes local code into a graph database to provide context to AI assistants.

Unique: Uses Tree-sitter's incremental parsing with language-specific grammars for 14 languages, enabling structural awareness of code relationships rather than text-based pattern matching. Normalizes heterogeneous syntax into a unified graph schema through a language-agnostic entity extraction layer.

vs others: Faster and more accurate than regex-based indexing (Sourcegraph, Ctags) because it understands code structure; broader language support than LSP-only solutions while remaining lightweight and offline-capable.

via “tree-sitter ast parsing with language-specific symbol extraction”

A Model Context Protocol (MCP) server that helps large language models index, search, and analyze code repositories with minimal setup

Unique: Uses tree-sitter for structural parsing across 50+ languages with intelligent fallback to regex heuristics for unsupported languages. Caches parsed results in SQLite, enabling fast symbol lookups without re-parsing on every query.

vs others: More accurate than regex-only parsing because tree-sitter understands syntax trees; more practical than language-specific compilers because it requires no build tools or dependencies beyond Python bindings.

via “polyglot-language-support-via-tree-sitter”

Bugzi: Multi-Agent AI and Code Scanning. Your AI Partner for Development. Bugzi is a powerful AI assistant that seamlessly integrates into your VS Code workflow, designed to enhance productivity and streamline your entire development process. While Bugzi includes a realtime security scanner to prote

Unique: Leverages tree-sitter's language-agnostic parser infrastructure to provide consistent code completion, analysis, and generation across 40+ languages without maintaining separate language-specific implementations. Enables syntax-aware features (completion, security scanning) that understand language grammar and nesting depth.

vs others: More comprehensive language support than Copilot (which focuses on popular languages) or Cursor (limited to major languages); more consistent across languages than tools requiring separate plugins per language.

via “tree-sitter-based incremental codebase parsing with sha-256 change tracking”

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.

Unique: Uses Tree-sitter AST parsing with SHA-256 incremental tracking instead of regex or line-based analysis, enabling structural awareness across 40+ languages while avoiding redundant re-parsing of unchanged files. The incremental update system (diagram 4) tracks file hashes to determine which entities need re-extraction, reducing indexing time from O(n) to O(delta) for large codebases.

vs others: Faster and more accurate than LSP-based indexing for offline analysis because it maintains a persistent graph that survives session boundaries and doesn't require a running language server per language.

via “multi-language-ast-parsing-via-tree-sitter”

** - Progressive code-intelligence server: lets AI assistants map structure, fuzzy-find symbols, and assess change-impact across Python, JS/TS, and Go codebases (powered by `ast-grep`)

Unique: Delegates AST parsing to ast-grep (a Rust binary wrapping tree-sitter), avoiding the need to maintain language-specific parsers in Python. This design trades a binary dependency for simplicity and performance—tree-sitter parsing is significantly faster than pure Python AST modules and supports more languages.

vs others: More performant and maintainable than language-specific parser libraries (e.g., ast for Python, @babel/parser for JS) because it uses a single unified tool; more flexible than LSP-based solutions because it doesn't require language servers to be installed for each language.

via “tree-sitter-based code definition extraction with language-specific query files”

** -🐧 🪟 🍎 - An MCP server (and command-line tool) to provide a dynamic map of chat-related files from the repository with their function prototypes and related files in order of relevance. Based on the "Repo Map" functionality in Aider.chat

Unique: Uses Tree-sitter AST parsing with language-specific query files (get_tags_raw method in repomap_class.py) instead of regex or heuristic-based extraction, enabling structurally-aware definition and reference extraction across 40+ languages with consistent semantics. The Tag namedtuple structure preserves full context (relative filename, absolute filename, line number, entity name, entity kind) for downstream processing.

vs others: More accurate than regex-based code extraction and faster than LSP-based approaches because it parses locally without network overhead; more portable than language-specific parsers because Tree-sitter provides unified interface across languages.

via “tree-sitter based code parsing and semantic chunking”

** - MCP for semantic code search & navigation that reduces token waste

Unique: Uses Tree-sitter AST parsing instead of regex or simple text splitting, enabling structurally-aware chunking that respects language syntax boundaries and extracts semantic units (functions, classes) with full context preservation

vs others: More accurate than line-based or regex-based chunking because it understands actual code structure; more maintainable than custom parsers because Tree-sitter grammars are community-maintained and battle-tested

via “multi-language source code parsing with ast extraction”

** - Scaffold is a Retrieval-Augmented Generation (RAG) system designed to structural understanding of large codebases. It transforms your source code into a living knowledge graph, allowing for precise, context-aware interactions that go far beyond simple file retrieval.

Unique: Uses tree-sitter-based language-agnostic parsing with fallback strategies for unsupported languages, enabling consistent AST extraction across 15+ languages without custom parser implementation per language. Caches parsed ASTs in memory to avoid re-parsing during incremental updates.

vs others: More accurate than regex-based code analysis and faster than full semantic analysis tools like Roslyn or LLVM, while supporting more languages than language-specific solutions like Jedi (Python-only)

via “language-agnostic code understanding via tree-sitter ast parsing”