Control callback flow through a finite state machine with functions that do just one thing each.
ECMAScript (ESTree) AST walker
A library for efficiently walking a directory recursively
Execute a callback on every node of a source code's AST and stop walking when you see fit
Nested/recursive `.gitignore`/`.npmignore` parsing and filtering.
Lightweight Babel AST traversal
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
A 1.75kB library for enhancing `html`. `ultrahtml` has zero dependencies and is compatible with any JavaScript runtime.
iteratively walk a DOM node
Walk up the directory tree until the specified path is found.
A node port of python's os.walk
Traverse an ESTree-compliant AST
unist utility to visit nodes
[![npm version][npm-version-src]][npm-version-href] [![npm downloads][npm-downloads-src]][npm-downloads-href] [![Github Actions][github-actions-src]][github-actions-href] [![Codecov][codecov-src]][codecov-href]
Walk an AST from SWC and visit each node type.
walk directory for esm and cjs modules
JSX support for Acorn Walk
Lightweight Babylon AST traversal
JSON without touching any globals
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.
Yet Another Linked List
fs.walk for node (as a port of Go's filepath.Walk)
A pure and intutive way to walk through the current running processes on Linux machine
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.