Helpers for traversing, inspecting, and transforming arbitrary trees.
ECMAScript (ESTree) AST walker
An extensible tree walk(..) framework...
unist utility to visit nodes
A 1.75kB library for enhancing `html`. `ultrahtml` has zero dependencies and is compatible with any JavaScript runtime.
Walk up the directory tree until the specified path is found.
A library for efficiently walking a directory recursively
Nested/recursive `.gitignore`/`.npmignore` parsing and filtering.
Execute a callback on every node of a source code's AST and stop walking when you see fit
Tree data walker.
Lightweight Babel AST traversal
unist utility to recursively walk over nodes, with ancestral information
Walk and transform a pug AST
Given a path string, return a generator that walks up the path, emitting each dirname.
Get an array of recursive directory contents
iteratively walk a DOM node
A node port of python's os.walk
Walk an AST from SWC and visit each node type.
esast (and estree) utility to visit nodes
Find files simply. Walks a directory tree emitting events based on what it finds. Presents a familiar callback/emitter/a+sync interface. Walk a tree of any depth.
Walks your node_modules tree
TypeScript definitions for ignore-walk
Reducible tree walk for an arbitrary data structures
Get started with the {@link ASTQuery} class.
A ground-up ES6 JavaScript engine with tree-walking interpreter, bytecode VMs, and Cranelift JIT compiler
IR-accelerated evaluation for clojurust (tier-1 IR interpreter + lowering)
Rust implementation of Crafting Interpreters' Lox Language.
Tree-walking interpreter and macro expansion engine for the Maat programming language
Simple tree-walking interpreter for executing the Swamp Abstract Semantic Graph (ASG) from `swamp-semantic`. Primarily for debugging/testing, not performance.
Untyped lambda calculus interpreter built on comp-cat-rs. Lex, parse, and tree-walk evaluation expressed as Io effects with static dispatch and no panics.
A experimental Scala interpreter written in Rust: lexer, parser, type inference, and tree-walking evaluation with a REPL.
Build Abstract Syntax Trees and tree-walking models quickly in Rust.
PEPL tree-walking evaluator: reference implementation for execution semantics
A tree-walking interpreter for the Lox programming language.
Tree-walking interpreter for clojurust (special forms, macros, destructuring)
TinyLang is a template language build as a simple tree-walk interpreter using PEST.
Installs 5 commands that process a git directory tree. Directories containing a file called .ignore are ignored. The git-commitAll command commits all changes to each repository in the tree. The git-evars command writes a script that defines environment variables pointing to git repos. The git-exec command executes a bash expression on children of a directory, or a list of directories. The git-replicate command writes a script that clones the repos in the tree, and adds any defined remotes. The git-update command updates each repository in the tree.
Ruby implementation of JsonLogic. JsonLogic rules are JSON trees. The engine walks that tree and returns a Ruby value. Full compliance with both core and community-extended specifications.
ANTLR, ANother Tool for Language Recognition, is a language tool that provides a framework for constructing recognizers, interpreters, compilers, and translators from grammatical descriptions containing actions in a variety of target languages. ANTLR provides excellent support for tree construction, tree walking, translation, error recovery, and error reporting. There are currently about 5,000 ANTLR source downloads a month.
Circuit is a rack application middleware that enables dynamic request mapping. Modeled after [Rack::Builder](https://github.com/rack/rack/blob/master/lib/rack/builder.rb), Circuit provides for a tree of url-mappings that is walked at request time. If you are interested in dynamically loading middleware and functionality into requests, circuit is a viable solution to do that in a maintainable way.
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.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.