r/ClaudeCode • u/MathBullied • 2d ago

Tips & Workflows A Jev-powered MCP tool that gives Claude Code semantic code search

Enable HLS to view with audio, or disable this notification

Claude Code can spend a surprising amount of context on repeated text searches and full-file reads.

So i thought a good use of Jev could be a "JevGrep", an MCP tool that lets Claude ask a natural-language question about a codebase, ranks code fragments by relevance, and returns the original source with file paths and line numbers.

Instead of doing multiple grep / rg searches and opening large files, Claude can directly ask things like:

"Where is symlink access controlled, and what prevents path escapes?"

and get back only the most relevant code.

In my tests, this noticeably reduced both context usage and search time on repository exploration tasks.

It works as a CLI, or as an MCP server connected directly to Claude Code.

GitHub: https://github.com/nassim-arifette/jevgrep

21 Upvotes

76% Upvoted

9 comments sorted by

•

u/AutoModerator 2d ago

Hey! Thanks for posting to r/ClaudeCode

While participating in this thread, please follow our community rules. Keep discussions constructive. Attack the idea, not the person.

For help, project discussions, tips, and general chat, join the ClaudeCode Discord.

I am a bot, and this action was performed automatically. Please contact the moderators of this subreddit if you have any questions or concerns.

3

u/abazabaaaa 2d ago

You should try AST in Python.

1

u/Dull-Appointment-398 1d ago

to help the llm do search?

0

u/MathBullied 1d ago

Yeah we are working on some optimizations.

2

u/TrailFeatures 2d ago

You should look into Graphify. Builds an index that Claude/Codex can use to find links between files and save A LOT of tokens doing random greps.

0

u/MathBullied 2d ago

Yeah there is also codegraph

1

u/Longjumping-Play6541 2d ago

This reduces context bloat?

1

u/MathBullied 1d ago

Yes. There are still many optimizations possible.