ast-grep

You can write AST-based search rules using YAML syntax to define atomic, relational, and composite constructs that match code by syntax tree structure rather than textual patterns. This enables precise structural queries across supported languages.

AST-based code search matches code by syntax tree structure rather than textual patterns, allowing you to locate specific language constructs or complex structural patterns that text search cannot precisely identify across large codebases.

Yes, tree-sitter static analysis works across languages supported by Tree-sitter, including JavaScript and Python. You can apply YAML-based rules to locate specific language constructs or complex structural patterns across these codebases.

You can translate this natural language query into an AST-based rule to match function declarations containing an await expression. The guided workflow helps you write the YAML rule, test it with sample code, and iterate for precise results.

Yes, this skill translates natural language requests into AST-based rules for structural code analysis. It provides a step-by-step workflow from query understanding to testing rules, enabling precise queries across large codebases.

YAML rules for AST-based static analysis require understanding atomic, relational, and composite constructs to match syntax tree structures. You must test rules with sample code and iterate, as complex structural patterns need precise YAML definitions to avoid mismatches.