Skip to main content
Glama
78,411 servers. Updated

Matching MCP tools:

Matching MCP Connectors:

"How to use Claude AI Pro 3.7 for reading and editing VS Code files" matching MCP servers:

  • A
    license
    Not graded
    quality
    C
    maintenance
    Enables LLMs to query documents using semantic search, supporting PDFs, Word, Excel, and more. Organizes documents by topics from folder structure and provides advanced search features like phrase matching and date filtering.
    1
    MIT
  • F
    license
    A
    quality
    C
    maintenance
    An installable MCP server that reviews diffs/PRs against a target repository's own coding conventions, learned via RAG over its code, docs, and lint config, citing specific file:line sources.
    6
  • A
    license
    A
    quality
    C
    maintenance
    Converts AI Skills (following Claude Skills format) into MCP server resources, enabling LLM applications to discover, access, and utilize self-contained skill directories through the Model Context Protocol. Provides tools to list available skills, retrieve skill details and content, and read supporting files with security protections.
    3
    27
    Apache 2.0
  • A
    license
    A
    quality
    B
    maintenance
    Provides a read-only interface to audit and continue coding agent sessions by extracting plans, intents, and edit authorship from history across multiple agents (Claude, Codex, OpenCode, Antigravity, Pi) via MCP, CLI, and Python SDK.
    18
    3
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    An MCP server that indexes a repository locally and provides keyword, semantic, hybrid, and SQL search tools, enabling coding agents to answer questions about the codebase efficiently without reading files one by one.
    250
    25
    Apache 2.0
  • A
    license
    A
    quality
    D
    maintenance
    Enables semantic search over codebases using natural language queries, returning relevant code snippets with source locations. Integrates with Claude Code for automatic codebase exploration.
    1
    1
    MIT
  • A
    license
    A
    quality
    C
    maintenance
    An MCP server that provides dynamic codebase context to Claude Code through tools like hybrid search, recent changes, and symbol definitions, enhancing AI-assisted coding with local RAG.
    8
    MIT
  • A
    license
    A
    quality
    B
    maintenance
    Enables AI coding assistants to semantically search codebases by meaning rather than exact text, with zero external daemons and fully local embeddings. Works out-of-the-box with Claude Code, Gemini CLI, Antigravity, and Cursor.
    4
    MIT
  • A
    license
    A
    quality
    D
    maintenance
    A persistent semantic memory system for Claude Code that provides a structured, versioned document store with semantic search and graph visualization. It acts as a memoization layer to store and retrieve research, design decisions, and codebase insights across different work sessions.
    10
    Apache 2.0
  • A
    license
    A
    quality
    C
    maintenance
    A full-featured long-term memory system for Claude Code that persistently stores and retrieves preferences, decisions, and project context across sessions using hybrid search and LLM-powered extraction.
    14
    8
    MIT
  • A
    license
    B
    quality
    D
    maintenance
    An MCP server that enables multi-provider AI collaboration using models like DeepSeek, OpenAI, and Anthropic through strategies such as parallel execution and consensus building. It provides specialized tools for side-by-side content comparison, quality review, and iterative refinement across different AI providers.
    4
    1
    MIT
  • A
    license
    Not graded
    quality
    D
    maintenance
    A comprehensive MCP server that provides intelligent access to Perplexity AI's search and reasoning models with automatic model selection, conversation management, and project-aware storage. Supports real-time search, deep research, chat sessions, and async operations for complex queries.
    24
    3
    MIT