Helper functions to verify an AST structure
Match AST nodes using JSON Schema.
Parses well-formed HTML (meaning all tags closed) into an AST and back. quickly.
AST utility module for statically analyzing JSX
A spec-compliant client-side GraphQL implementation
A toolkit for JavaScript codemods
AST utils for webassemblyjs
A toolkit for easy Babel AST generation and manipulation.
AST-aware v8-to-istanbul
A modern CSS parser and stringifier with TypeScript support
Generate regular expressions from regjsparser’s AST.
Transform HAST to Babel AST (JSX)
A library for analysing JS RegExp
Flow types for the Javascript AST
Collection of useful helper functions when trying to determine module type (CommonJS or AMD) properties of an AST node.
Oxc Parser Node API
Search and Rewrite code at large scale using precise AST pattern
A tool set for CSS: fast detailed parser (CSS → AST), walker (AST traversal), generator (AST → CSS) and lexer (validation and matching) based on specs and browser implementations
Match nodes in a unified-latex AST
Esprima-compatible implementation of the Mozilla JS Parser API
Parses well-formed HTML (meaning all tags closed) into an AST and back. quickly.
A JavaScript parser built from the Hermes engine
Tools necessary for parsing stage of ApiDOM, specifically for syntactic analysis.
Emmet standalone abbreviation parser
Machete is a simple tool for matching Rubinius AST nodes against patterns. You can use it if you are writing any kind of tool that processes Ruby code and needs to do some work on specific types of nodes, needs to find patterns in the code, etc.
Pegarus is, broadly, an implementation of LPEG on Rubinius. LPEG implements a Parsing Expression Grammar using a parsing machine rather than the Packrat algorithm. (See "A Text Pattern-Matching Tool based on Parsing Expression Grammars" by Roberto Ierusalimschy.) Pegarus actually implements an abstract syntax tree (AST) for the PEG. There are various options to execute the AST against a subject string. One option is a simple AST-walking evaluator. A second option is an implementation of the LPEG parsing machine. A third option is a compiler that targets Rubinius bytecode.
☯️ Intelligently merge RBS type signature files by parsing and comparing AST structures. Supports freeze blocks to protect customizations, signature-based matching, and configurable merge strategies.
Rockit is a potent parser generator and gives you AST's (Abstract Syntax Tree's) which you can pattern match and pretty-print. Rockit does not distinghuish between lexing and parsing so the generated parsers are scanner-/lexer-less. The vision is to extend Rockit with more advanced compiler-related abilities including back-ends and code generation. However, currently the focus is on parsing and AST-related tasks such as transformation.
Generates highly concise, deterministic Markdown coverage digests tailored for LLMs and autonomous agents by matching coverage deficits to their AST semantic boundaries rather than line numbers.