"Methods for Reading PDF Files" matching MCP servers:

Provides AI agents with ground-truth knowledge of Strapi projects by reading real schema files, enabling accurate queries and safe refactoring operations.

Turns a codebase into a persistent knowledge graph so AI coding agents can answer structural questions about functions, call chains, routes, and cross-service links through graph queries instead of reading files one by one.

Enables automatic generation of explicit boilerplate methods (getter/setter/equals/hashCode/toString/constructors) for Java entity classes, replacing Lombok dependencies with visible, reviewable code.

Serves token-efficient code context for AI coding assistants by exposing Python signatures, call graphs, and budget-packed task context as MCP tools, enabling precise codebase queries without reading entire files.

A local AST and type-aware Go repository context indexer that uses CHA to map symbols, call graphs, dependencies, and architecture patterns. Built for AI coding agents that need to navigate and reason about large Go codebases without reading raw files.

A deterministic structural code map server for AI agents, giving them the shape of a codebase (imports, exports, classes, functions, signatures, comments, TODO-markers) without reading whole files into context. Powered by tree-sitter WASM grammars, it runs anywhere Node 18+ works.

MCP server that indexes your codebase's public API at startup and serves it via compact tool responses, saving tokens vs reading source files.

Integrates Google's Gemini AI models into Claude Code and other MCP clients to provide second opinions, code comparisons, and token counting. It supports streaming responses and multi-turn conversations directly within your existing AI development workflow.

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.

Enables querying Odoo's model registry (fields, inheritance, methods) without a database connection by loading the registry in-memory.

An MCP server for interacting with the Rell Language Server Protocol interface. It enables LLMs to query LSP Hover and Completion providers for Rell projects.

Token-efficient skim-then-expand I/O for agentic models, enabling lossless reading of large files via skeletons and exact expansion with anchor IDs.

An MCP server for intelligently reading Java source code, supporting extraction from Maven dependencies and local projects with dual decompilers.

Standard coding agents waste 70% of context tokens re-reading raw files with shell grep. Synapse-MCP indexes your codebase into a sub-millisecond local AST graph—giving Claude Code, Cursor, and Windsurf exact caller trees, 60% lower token spend, and zero-hallucination refactoring.

Provides Python refactoring capabilities via the Rope library, enabling AI agents to perform safe, project-wide code transformations such as renaming symbols, moving modules, and extracting methods.

Enables AI assistants to directly invoke higpertext-cli capabilities as validated MCP tools, covering grep search, git diff and ls-files, smart reading, code skeletonization, knowledge lookup, memory management, committing, secret scanning, and quality resolution without routing through Bash.

MCP server connecting Claude Code to LM Studio, delegating token-expensive tasks to a local model while keeping the cloud model in control. It reduces cloud context usage by reading files locally and returning only the processed results.

Enables building MCP servers in TypeScript where tool schemas, descriptions, and validation are automatically generated from class methods, their TypeScript types, and JSDoc comments at compile time.

High-performance code understanding toolkit that enables batch reading of multiple files with dependency context, structural outline extraction with Java annotation awareness, and precise location of classes/methods across large codebases.

Enables efficient code navigation and retrieval through natural language search, BM25 ranking, and fuzzy matching across multiple programming languages. It drastically reduces token usage by allowing Claude to query specific code symbols and logic instead of reading entire files.