smart-explore

Structural code search uses tree-sitter AST parsing to locate functions and classes without reading entire files. It navigates the abstract syntax tree to find specific symbols, significantly reducing token consumption compared to traditional file reading methods.

The best way to navigate large codebases is using structural code search to find relevant symbols, followed by targeted symbol unfolding to view specific implementations. This approach reveals how features are implemented across a project while optimizing token usage.

Yes, tree-sitter AST parsing replaces traditional grep and glob for code exploration. It provides structural understanding of the codebase by parsing the syntax tree, enabling efficient symbol discovery and code navigation with significant token savings.

Token-optimized code search reduces the context window size needed for AI code navigation. By parsing ASTs to extract only relevant symbols and targeted implementations instead of full files, it minimizes token consumption during code exploration and structural analysis.

Yes, structural code search works for finding symbol implementations by searching the AST for functions and classes. You can then use targeted symbol unfolding to view the detailed implementation of only the most critical symbols discovered.

You should use AST parsing for code exploration when navigating large codebases or when token efficiency is critical. It replaces full file reads by unfolding only targeted symbols, making it ideal for understanding complex code structures without exhausting token limits.