https://github.com/danielstjules/acorn-bfs
Breadth-first search traversal of an acorn-generated AST
https://github.com/danielstjules/acorn-bfs
Last synced: about 1 year ago
JSON representation
Breadth-first search traversal of an acorn-generated AST
- Host: GitHub
- URL: https://github.com/danielstjules/acorn-bfs
- Owner: danielstjules
- License: mit
- Created: 2015-07-06T04:32:16.000Z (about 11 years ago)
- Default Branch: master
- Last Pushed: 2017-03-12T21:35:01.000Z (over 9 years ago)
- Last Synced: 2025-02-17T03:47:11.813Z (over 1 year ago)
- Language: JavaScript
- Size: 8.79 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# acorn-bfs
``` javascript
/**
* Returns an array of nodes in the passed AST, traversed using BFS. Accepts an
* optional maximum number, n, of nodes to return. The returned array always
* begins with the root node.
*
* @param {Node} node The root node of the AST to traverse
* @param {int} [n] Optional max number of nodes to return
*/
```
[](https://travis-ci.org/danielstjules/acorn-bfs)
#### Installation
```
npm install --save acorn-bfs
```
#### Example
``` javascript
var acorn = require('acorn');
var bfs = require('acorn-bfs');
var ast = acorn.parse('function test() {\n' +
' return true;\n' +
'}\n');
bfs(ast).map(function(node) {
return node.type;
});
// =>
// ['Program', 'FunctionDeclaration', 'BlockStatement',
// 'ReturnStatement', 'Literal']
```