deps: import acorn@5.2.1
Imported from the tarball published on npm (https://registry.npmjs.org/acorn/-/acorn-5.2.1.tgz). PR-URL: https://github.com/nodejs/node/pull/15566 Reviewed-By: Stephen Belanger <admin@stephenbelanger.com> Reviewed-By: Ben Noordhuis <info@bnoordhuis.nl>
This commit is contained in:
Timothy Gu
parent
61567299e7
commit
e38570fe56
23
LICENSE
23
LICENSE
@ -51,6 +51,29 @@ maintained libraries.
|
|||||||
|
|
||||||
The externally maintained libraries used by Node.js are:
|
The externally maintained libraries used by Node.js are:
|
||||||
|
|
||||||
|
- Acorn, located at deps/acorn, is licensed as follows:
|
||||||
|
"""
|
||||||
|
Copyright (C) 2012-2017 by various contributors (see AUTHORS)
|
||||||
|
|
||||||
|
Permission is hereby granted, free of charge, to any person obtaining a copy
|
||||||
|
of this software and associated documentation files (the "Software"), to deal
|
||||||
|
in the Software without restriction, including without limitation the rights
|
||||||
|
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||||||
|
copies of the Software, and to permit persons to whom the Software is
|
||||||
|
furnished to do so, subject to the following conditions:
|
||||||
|
|
||||||
|
The above copyright notice and this permission notice shall be included in
|
||||||
|
all copies or substantial portions of the Software.
|
||||||
|
|
||||||
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||||||
|
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||||||
|
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
||||||
|
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
||||||
|
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
||||||
|
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
||||||
|
THE SOFTWARE.
|
||||||
|
"""
|
||||||
|
|
||||||
- c-ares, located at deps/cares, is licensed as follows:
|
- c-ares, located at deps/cares, is licensed as follows:
|
||||||
"""
|
"""
|
||||||
Copyright (c) 2007 - 2016, Daniel Stenberg with many contributors, see AUTHORS
|
Copyright (c) 2007 - 2016, Daniel Stenberg with many contributors, see AUTHORS
|
||||||
|
|||||||
69
deps/acorn/AUTHORS
vendored
Normal file
69
deps/acorn/AUTHORS
vendored
Normal file
@ -0,0 +1,69 @@
|
|||||||
|
List of Acorn contributors. Updated before every release.
|
||||||
|
|
||||||
|
Adrian Rakovsky
|
||||||
|
Alistair Braidwood
|
||||||
|
Amila Welihinda
|
||||||
|
Andres Suarez
|
||||||
|
Angelo
|
||||||
|
Aparajita Fishman
|
||||||
|
Arian Stolwijk
|
||||||
|
Artem Govorov
|
||||||
|
Bradley Heinz
|
||||||
|
Brandon Mills
|
||||||
|
Charles Hughes
|
||||||
|
Conrad Irwin
|
||||||
|
Daniel Tschinder
|
||||||
|
David Bonnet
|
||||||
|
Domenico Matteo
|
||||||
|
ehmicky
|
||||||
|
Forbes Lindesay
|
||||||
|
Gilad Peleg
|
||||||
|
impinball
|
||||||
|
Ingvar Stepanyan
|
||||||
|
Jackson Ray Hamilton
|
||||||
|
Jesse McCarthy
|
||||||
|
Jiaxing Wang
|
||||||
|
Joel Kemp
|
||||||
|
Johannes Herr
|
||||||
|
John-David Dalton
|
||||||
|
Jordan Klassen
|
||||||
|
Jürg Lehni
|
||||||
|
Kai Cataldo
|
||||||
|
keeyipchan
|
||||||
|
Keheliya Gallaba
|
||||||
|
Kevin Irish
|
||||||
|
Kevin Kwok
|
||||||
|
krator
|
||||||
|
Marek
|
||||||
|
Marijn Haverbeke
|
||||||
|
Martin Carlberg
|
||||||
|
Mat Garcia
|
||||||
|
Mathias Bynens
|
||||||
|
Mathieu 'p01' Henri
|
||||||
|
Matthew Bastien
|
||||||
|
Max Schaefer
|
||||||
|
Max Zerzouri
|
||||||
|
Mihai Bazon
|
||||||
|
Mike Rennie
|
||||||
|
naoh
|
||||||
|
Nicholas C. Zakas
|
||||||
|
Nick Fitzgerald
|
||||||
|
Olivier Thomann
|
||||||
|
Oskar Schöldström
|
||||||
|
Paul Harper
|
||||||
|
Peter Rust
|
||||||
|
PlNG
|
||||||
|
Prayag Verma
|
||||||
|
ReadmeCritic
|
||||||
|
r-e-d
|
||||||
|
Richard Gibson
|
||||||
|
Rich Harris
|
||||||
|
Sebastian McKenzie
|
||||||
|
Shahar Soel
|
||||||
|
Simen Bekkhus
|
||||||
|
Teddy Katz
|
||||||
|
Timothy Gu
|
||||||
|
Toru Nagashima
|
||||||
|
Victor Homyakov
|
||||||
|
Wexpo Lyu
|
||||||
|
zsjforcn
|
||||||
374
deps/acorn/CHANGELOG.md
vendored
Normal file
374
deps/acorn/CHANGELOG.md
vendored
Normal file
@ -0,0 +1,374 @@
|
|||||||
|
## 5.2.1 (2017-10-30)
|
||||||
|
|
||||||
|
### Bug fixes
|
||||||
|
|
||||||
|
Fix a token context corruption bug.
|
||||||
|
|
||||||
|
## 5.2.0 (2017-10-30)
|
||||||
|
|
||||||
|
### Bug fixes
|
||||||
|
|
||||||
|
Fix token context tracking for `class` and `function` in property-name position.
|
||||||
|
|
||||||
|
Make sure `%*` isn't parsed as a valid operator.
|
||||||
|
|
||||||
|
The `full` and `fullAncestor` walkers no longer visit nodes multiple times.
|
||||||
|
|
||||||
|
Allow shorthand properties `get` and `set` to be followed by default values.
|
||||||
|
|
||||||
|
Disallow `super` when not in callee or object position.
|
||||||
|
|
||||||
|
### New features
|
||||||
|
|
||||||
|
Support [`directive` property](https://github.com/estree/estree/compare/b3de58c9997504d6fba04b72f76e6dd1619ee4eb...1da8e603237144f44710360f8feb7a9977e905e0) on directive expression statements.
|
||||||
|
|
||||||
|
## 5.1.2 (2017-09-04)
|
||||||
|
|
||||||
|
### Bug fixes
|
||||||
|
|
||||||
|
Disable parsing of legacy HTML-style comments in modules.
|
||||||
|
|
||||||
|
Fix parsing of async methods whose names are keywords.
|
||||||
|
|
||||||
|
## 5.1.1 (2017-07-06)
|
||||||
|
|
||||||
|
### Bug fixes
|
||||||
|
|
||||||
|
Fix problem with disambiguating regexp and division after a class.
|
||||||
|
|
||||||
|
## 5.1.0 (2017-07-05)
|
||||||
|
|
||||||
|
### Bug fixes
|
||||||
|
|
||||||
|
Fix tokenizing of regexps in an object-desctructuring `for`/`of` loop and after `yield`.
|
||||||
|
|
||||||
|
Parse zero-prefixed numbers with non-octal digits as decimal.
|
||||||
|
|
||||||
|
Allow object/array patterns in rest parameters.
|
||||||
|
|
||||||
|
Don't error when `yield` is used as a property name.
|
||||||
|
|
||||||
|
Allow `async` as a shorthand object property.
|
||||||
|
|
||||||
|
Make the ES module version of the loose parser actually work.
|
||||||
|
|
||||||
|
### New features
|
||||||
|
|
||||||
|
Implement the [template literal revision proposal](https://github.com/tc39/proposal-template-literal-revision) for ES9.
|
||||||
|
|
||||||
|
New walker functions `full` and `fullAncestor`.
|
||||||
|
|
||||||
|
## 5.0.3 (2017-04-01)
|
||||||
|
|
||||||
|
### Bug fixes
|
||||||
|
|
||||||
|
Fix spurious duplicate variable definition errors for named functions.
|
||||||
|
|
||||||
|
## 5.0.2 (2017-03-30)
|
||||||
|
|
||||||
|
### Bug fixes
|
||||||
|
|
||||||
|
A binary operator after a parenthesized arrow expression is no longer incorrectly treated as an error.
|
||||||
|
|
||||||
|
## 5.0.0 (2017-03-28)
|
||||||
|
|
||||||
|
### Bug fixes
|
||||||
|
|
||||||
|
Raise an error for duplicated lexical bindings.
|
||||||
|
|
||||||
|
Fix spurious error when an assignement expression occurred after a spread expression.
|
||||||
|
|
||||||
|
Accept regular expressions after `of` (in `for`/`of`), `yield` (in a generator), and braced arrow functions.
|
||||||
|
|
||||||
|
Allow labels in front or `var` declarations, even in strict mode.
|
||||||
|
|
||||||
|
### Breaking changes
|
||||||
|
|
||||||
|
Parse declarations following `export default` as declaration nodes, not expressions. This means that class and function declarations nodes can now have `null` as their `id`.
|
||||||
|
|
||||||
|
## 4.0.11 (2017-02-07)
|
||||||
|
|
||||||
|
### Bug fixes
|
||||||
|
|
||||||
|
Allow all forms of member expressions to be parenthesized as lvalue.
|
||||||
|
|
||||||
|
## 4.0.10 (2017-02-07)
|
||||||
|
|
||||||
|
### Bug fixes
|
||||||
|
|
||||||
|
Don't expect semicolons after default-exported functions or classes,
|
||||||
|
even when they are expressions.
|
||||||
|
|
||||||
|
Check for use of `'use strict'` directives in non-simple parameter
|
||||||
|
functions, even when already in strict mode.
|
||||||
|
|
||||||
|
## 4.0.9 (2017-02-06)
|
||||||
|
|
||||||
|
### Bug fixes
|
||||||
|
|
||||||
|
Fix incorrect error raised for parenthesized simple assignment
|
||||||
|
targets, so that `(x) = 1` parses again.
|
||||||
|
|
||||||
|
## 4.0.8 (2017-02-03)
|
||||||
|
|
||||||
|
### Bug fixes
|
||||||
|
|
||||||
|
Solve spurious parenthesized pattern errors by temporarily erring on
|
||||||
|
the side of accepting programs that our delayed errors don't handle
|
||||||
|
correctly yet.
|
||||||
|
|
||||||
|
## 4.0.7 (2017-02-02)
|
||||||
|
|
||||||
|
### Bug fixes
|
||||||
|
|
||||||
|
Accept invalidly rejected code like `(x).y = 2` again.
|
||||||
|
|
||||||
|
Don't raise an error when a function _inside_ strict code has a
|
||||||
|
non-simple parameter list.
|
||||||
|
|
||||||
|
## 4.0.6 (2017-02-02)
|
||||||
|
|
||||||
|
### Bug fixes
|
||||||
|
|
||||||
|
Fix exponential behavior (manifesting itself as a complete hang for
|
||||||
|
even relatively small source files) introduced by the new 'use strict'
|
||||||
|
check.
|
||||||
|
|
||||||
|
## 4.0.5 (2017-02-02)
|
||||||
|
|
||||||
|
### Bug fixes
|
||||||
|
|
||||||
|
Disallow parenthesized pattern expressions.
|
||||||
|
|
||||||
|
Allow keywords as export names.
|
||||||
|
|
||||||
|
Don't allow the `async` keyword to be parenthesized.
|
||||||
|
|
||||||
|
Properly raise an error when a keyword contains a character escape.
|
||||||
|
|
||||||
|
Allow `"use strict"` to appear after other string literal expressions.
|
||||||
|
|
||||||
|
Disallow labeled declarations.
|
||||||
|
|
||||||
|
## 4.0.4 (2016-12-19)
|
||||||
|
|
||||||
|
### Bug fixes
|
||||||
|
|
||||||
|
Fix issue with loading acorn_loose.js with an AMD loader.
|
||||||
|
|
||||||
|
Fix crash when `export` was followed by a keyword that can't be
|
||||||
|
exported.
|
||||||
|
|
||||||
|
## 4.0.3 (2016-08-16)
|
||||||
|
|
||||||
|
### Bug fixes
|
||||||
|
|
||||||
|
Allow regular function declarations inside single-statement `if`
|
||||||
|
branches in loose mode. Forbid them entirely in strict mode.
|
||||||
|
|
||||||
|
Properly parse properties named `async` in ES2017 mode.
|
||||||
|
|
||||||
|
Fix bug where reserved words were broken in ES2017 mode.
|
||||||
|
|
||||||
|
## 4.0.2 (2016-08-11)
|
||||||
|
|
||||||
|
### Bug fixes
|
||||||
|
|
||||||
|
Don't ignore period or 'e' characters after octal numbers.
|
||||||
|
|
||||||
|
Fix broken parsing for call expressions in default parameter values
|
||||||
|
of arrow functions.
|
||||||
|
|
||||||
|
## 4.0.1 (2016-08-08)
|
||||||
|
|
||||||
|
### Bug fixes
|
||||||
|
|
||||||
|
Fix false positives in duplicated export name errors.
|
||||||
|
|
||||||
|
## 4.0.0 (2016-08-07)
|
||||||
|
|
||||||
|
### Breaking changes
|
||||||
|
|
||||||
|
The default `ecmaVersion` option value is now 7.
|
||||||
|
|
||||||
|
A number of internal method signatures changed, so plugins might need
|
||||||
|
to be updated.
|
||||||
|
|
||||||
|
### Bug fixes
|
||||||
|
|
||||||
|
The parser now raises errors on duplicated export names.
|
||||||
|
|
||||||
|
`arguments` and `eval` can now be used in shorthand properties.
|
||||||
|
|
||||||
|
Duplicate parameter names in non-simple argument lists now always
|
||||||
|
produce an error.
|
||||||
|
|
||||||
|
### New features
|
||||||
|
|
||||||
|
The `ecmaVersion` option now also accepts year-style version numbers
|
||||||
|
(2015, etc).
|
||||||
|
|
||||||
|
Support for `async`/`await` syntax when `ecmaVersion` is >= 8.
|
||||||
|
|
||||||
|
Support for trailing commas in call expressions when `ecmaVersion`
|
||||||
|
is >= 8.
|
||||||
|
|
||||||
|
## 3.3.0 (2016-07-25)
|
||||||
|
|
||||||
|
### Bug fixes
|
||||||
|
|
||||||
|
Fix bug in tokenizing of regexp operator after a function declaration.
|
||||||
|
|
||||||
|
Fix parser crash when parsing an array pattern with a hole.
|
||||||
|
|
||||||
|
### New features
|
||||||
|
|
||||||
|
Implement check against complex argument lists in functions that
|
||||||
|
enable strict mode in ES7.
|
||||||
|
|
||||||
|
## 3.2.0 (2016-06-07)
|
||||||
|
|
||||||
|
### Bug fixes
|
||||||
|
|
||||||
|
Improve handling of lack of unicode regexp support in host
|
||||||
|
environment.
|
||||||
|
|
||||||
|
Properly reject shorthand properties whose name is a keyword.
|
||||||
|
|
||||||
|
Don't crash when the loose parser is called without options object.
|
||||||
|
|
||||||
|
### New features
|
||||||
|
|
||||||
|
Visitors created with `visit.make` now have their base as _prototype_,
|
||||||
|
rather than copying properties into a fresh object.
|
||||||
|
|
||||||
|
Make it possible to use `visit.ancestor` with a walk state.
|
||||||
|
|
||||||
|
## 3.1.0 (2016-04-18)
|
||||||
|
|
||||||
|
### Bug fixes
|
||||||
|
|
||||||
|
Fix issue where the loose parser created invalid TemplateElement nodes
|
||||||
|
for unclosed template literals.
|
||||||
|
|
||||||
|
Properly tokenize the division operator directly after a function
|
||||||
|
expression.
|
||||||
|
|
||||||
|
Allow trailing comma in destructuring arrays.
|
||||||
|
|
||||||
|
### New features
|
||||||
|
|
||||||
|
The walker now allows defining handlers for `CatchClause` nodes.
|
||||||
|
|
||||||
|
## 3.0.4 (2016-02-25)
|
||||||
|
|
||||||
|
### Fixes
|
||||||
|
|
||||||
|
Allow update expressions as left-hand-side of the ES7 exponential
|
||||||
|
operator.
|
||||||
|
|
||||||
|
## 3.0.2 (2016-02-10)
|
||||||
|
|
||||||
|
### Fixes
|
||||||
|
|
||||||
|
Fix bug that accidentally made `undefined` a reserved word when
|
||||||
|
parsing ES7.
|
||||||
|
|
||||||
|
## 3.0.0 (2016-02-10)
|
||||||
|
|
||||||
|
### Breaking changes
|
||||||
|
|
||||||
|
The default value of the `ecmaVersion` option is now 6 (used to be 5).
|
||||||
|
|
||||||
|
Support for comprehension syntax (which was dropped from the draft
|
||||||
|
spec) has been removed.
|
||||||
|
|
||||||
|
### Fixes
|
||||||
|
|
||||||
|
`let` and `yield` are now “contextual keywords”, meaning you can
|
||||||
|
mostly use them as identifiers in ES5 non-strict code.
|
||||||
|
|
||||||
|
A parenthesized class or function expression after `export default` is
|
||||||
|
now parsed correctly.
|
||||||
|
|
||||||
|
### New features
|
||||||
|
|
||||||
|
When `ecmaVersion` is set to 7, Acorn will parse the exponentiation
|
||||||
|
operator (`**`).
|
||||||
|
|
||||||
|
The identifier character ranges are now based on Unicode 8.0.0.
|
||||||
|
|
||||||
|
Plugins can now override the `raiseRecoverable` method to override the
|
||||||
|
way non-critical errors are handled.
|
||||||
|
|
||||||
|
## 2.7.0 (2016-01-04)
|
||||||
|
|
||||||
|
### Fixes
|
||||||
|
|
||||||
|
Stop allowing rest parameters in setters.
|
||||||
|
|
||||||
|
Make sure the loose parser always attaches a `local` property to
|
||||||
|
`ImportNamespaceSpecifier` nodes.
|
||||||
|
|
||||||
|
Disallow `y` rexexp flag in ES5.
|
||||||
|
|
||||||
|
Disallow `\00` and `\000` escapes in strict mode.
|
||||||
|
|
||||||
|
Raise an error when an import name is a reserved word.
|
||||||
|
|
||||||
|
## 2.6.4 (2015-11-12)
|
||||||
|
|
||||||
|
### Fixes
|
||||||
|
|
||||||
|
Fix crash in loose parser when parsing invalid object pattern.
|
||||||
|
|
||||||
|
### New features
|
||||||
|
|
||||||
|
Support plugins in the loose parser.
|
||||||
|
|
||||||
|
## 2.6.2 (2015-11-10)
|
||||||
|
|
||||||
|
### Fixes
|
||||||
|
|
||||||
|
Don't crash when no options object is passed.
|
||||||
|
|
||||||
|
## 2.6.0 (2015-11-09)
|
||||||
|
|
||||||
|
### Fixes
|
||||||
|
|
||||||
|
Add `await` as a reserved word in module sources.
|
||||||
|
|
||||||
|
Disallow `yield` in a parameter default value for a generator.
|
||||||
|
|
||||||
|
Forbid using a comma after a rest pattern in an array destructuring.
|
||||||
|
|
||||||
|
### New features
|
||||||
|
|
||||||
|
Support parsing stdin in command-line tool.
|
||||||
|
|
||||||
|
## 2.5.2 (2015-10-27)
|
||||||
|
|
||||||
|
### Fixes
|
||||||
|
|
||||||
|
Fix bug where the walker walked an exported `let` statement as an
|
||||||
|
expression.
|
||||||
|
|
||||||
|
## 2.5.0 (2015-10-27)
|
||||||
|
|
||||||
|
### Fixes
|
||||||
|
|
||||||
|
Fix tokenizer support in the command-line tool.
|
||||||
|
|
||||||
|
In the loose parser, don't allow non-string-literals as import
|
||||||
|
sources.
|
||||||
|
|
||||||
|
Stop allowing `new.target` outside of functions.
|
||||||
|
|
||||||
|
Remove legacy `guard` and `guardedHandler` properties from try nodes.
|
||||||
|
|
||||||
|
Stop allowing multiple `__proto__` properties on an object literal in
|
||||||
|
strict mode.
|
||||||
|
|
||||||
|
Don't allow rest parameters to be non-identifier patterns.
|
||||||
|
|
||||||
|
Check for duplicate paramter names in arrow functions.
|
||||||
19
deps/acorn/LICENSE
vendored
Normal file
19
deps/acorn/LICENSE
vendored
Normal file
@ -0,0 +1,19 @@
|
|||||||
|
Copyright (C) 2012-2017 by various contributors (see AUTHORS)
|
||||||
|
|
||||||
|
Permission is hereby granted, free of charge, to any person obtaining a copy
|
||||||
|
of this software and associated documentation files (the "Software"), to deal
|
||||||
|
in the Software without restriction, including without limitation the rights
|
||||||
|
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||||||
|
copies of the Software, and to permit persons to whom the Software is
|
||||||
|
furnished to do so, subject to the following conditions:
|
||||||
|
|
||||||
|
The above copyright notice and this permission notice shall be included in
|
||||||
|
all copies or substantial portions of the Software.
|
||||||
|
|
||||||
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||||||
|
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||||||
|
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
||||||
|
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
||||||
|
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
||||||
|
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
||||||
|
THE SOFTWARE.
|
||||||
452
deps/acorn/README.md
vendored
Normal file
452
deps/acorn/README.md
vendored
Normal file
@ -0,0 +1,452 @@
|
|||||||
|
# Acorn
|
||||||
|
|
||||||
|
[](https://travis-ci.org/ternjs/acorn)
|
||||||
|
[](https://www.npmjs.com/package/acorn)
|
||||||
|
[](https://cdnjs.com/libraries/acorn)
|
||||||
|
[Author funding status: ](https://marijnhaverbeke.nl/fund/)
|
||||||
|
|
||||||
|
A tiny, fast JavaScript parser, written completely in JavaScript.
|
||||||
|
|
||||||
|
## Community
|
||||||
|
|
||||||
|
Acorn is open source software released under an
|
||||||
|
[MIT license](https://github.com/ternjs/acorn/blob/master/LICENSE).
|
||||||
|
|
||||||
|
You are welcome to
|
||||||
|
[report bugs](https://github.com/ternjs/acorn/issues) or create pull
|
||||||
|
requests on [github](https://github.com/ternjs/acorn). For questions
|
||||||
|
and discussion, please use the
|
||||||
|
[Tern discussion forum](https://discuss.ternjs.net).
|
||||||
|
|
||||||
|
## Installation
|
||||||
|
|
||||||
|
The easiest way to install acorn is with [`npm`][npm].
|
||||||
|
|
||||||
|
[npm]: https://www.npmjs.com/
|
||||||
|
|
||||||
|
```sh
|
||||||
|
npm install acorn
|
||||||
|
```
|
||||||
|
|
||||||
|
Alternately, download the source.
|
||||||
|
|
||||||
|
```sh
|
||||||
|
git clone https://github.com/ternjs/acorn.git
|
||||||
|
```
|
||||||
|
|
||||||
|
## Components
|
||||||
|
|
||||||
|
When run in a CommonJS (node.js) or AMD environment, exported values
|
||||||
|
appear in the interfaces exposed by the individual files, as usual.
|
||||||
|
When loaded in the browser (Acorn works in any JS-enabled browser more
|
||||||
|
recent than IE5) without any kind of module management, a single
|
||||||
|
global object `acorn` will be defined, and all the exported properties
|
||||||
|
will be added to that.
|
||||||
|
|
||||||
|
### Main parser
|
||||||
|
|
||||||
|
This is implemented in `dist/acorn.js`, and is what you get when you
|
||||||
|
`require("acorn")` in node.js.
|
||||||
|
|
||||||
|
**parse**`(input, options)` is used to parse a JavaScript program.
|
||||||
|
The `input` parameter is a string, `options` can be undefined or an
|
||||||
|
object setting some of the options listed below. The return value will
|
||||||
|
be an abstract syntax tree object as specified by the
|
||||||
|
[ESTree spec][estree].
|
||||||
|
|
||||||
|
When encountering a syntax error, the parser will raise a
|
||||||
|
`SyntaxError` object with a meaningful message. The error object will
|
||||||
|
have a `pos` property that indicates the character offset at which the
|
||||||
|
error occurred, and a `loc` object that contains a `{line, column}`
|
||||||
|
object referring to that same position.
|
||||||
|
|
||||||
|
[estree]: https://github.com/estree/estree
|
||||||
|
|
||||||
|
- **ecmaVersion**: Indicates the ECMAScript version to parse. Must be
|
||||||
|
either 3, 5, 6 (2015), 7 (2016), 8 (2017), or 9 (2018, partial
|
||||||
|
support). This influences support for strict mode, the set of
|
||||||
|
reserved words, and support for new syntax features. Default is 7.
|
||||||
|
|
||||||
|
**NOTE**: Only 'stage 4' (finalized) ECMAScript features are being
|
||||||
|
implemented by Acorn.
|
||||||
|
|
||||||
|
- **sourceType**: Indicate the mode the code should be parsed in. Can be
|
||||||
|
either `"script"` or `"module"`. This influences global strict mode
|
||||||
|
and parsing of `import` and `export` declarations.
|
||||||
|
|
||||||
|
- **onInsertedSemicolon**: If given a callback, that callback will be
|
||||||
|
called whenever a missing semicolon is inserted by the parser. The
|
||||||
|
callback will be given the character offset of the point where the
|
||||||
|
semicolon is inserted as argument, and if `locations` is on, also a
|
||||||
|
`{line, column}` object representing this position.
|
||||||
|
|
||||||
|
- **onTrailingComma**: Like `onInsertedSemicolon`, but for trailing
|
||||||
|
commas.
|
||||||
|
|
||||||
|
- **allowReserved**: If `false`, using a reserved word will generate
|
||||||
|
an error. Defaults to `true` for `ecmaVersion` 3, `false` for higher
|
||||||
|
versions. When given the value `"never"`, reserved words and
|
||||||
|
keywords can also not be used as property names (as in Internet
|
||||||
|
Explorer's old parser).
|
||||||
|
|
||||||
|
- **allowReturnOutsideFunction**: By default, a return statement at
|
||||||
|
the top level raises an error. Set this to `true` to accept such
|
||||||
|
code.
|
||||||
|
|
||||||
|
- **allowImportExportEverywhere**: By default, `import` and `export`
|
||||||
|
declarations can only appear at a program's top level. Setting this
|
||||||
|
option to `true` allows them anywhere where a statement is allowed.
|
||||||
|
|
||||||
|
- **allowHashBang**: When this is enabled (off by default), if the
|
||||||
|
code starts with the characters `#!` (as in a shellscript), the
|
||||||
|
first line will be treated as a comment.
|
||||||
|
|
||||||
|
- **locations**: When `true`, each node has a `loc` object attached
|
||||||
|
with `start` and `end` subobjects, each of which contains the
|
||||||
|
one-based line and zero-based column numbers in `{line, column}`
|
||||||
|
form. Default is `false`.
|
||||||
|
|
||||||
|
- **onToken**: If a function is passed for this option, each found
|
||||||
|
token will be passed in same format as tokens returned from
|
||||||
|
`tokenizer().getToken()`.
|
||||||
|
|
||||||
|
If array is passed, each found token is pushed to it.
|
||||||
|
|
||||||
|
Note that you are not allowed to call the parser from the
|
||||||
|
callback—that will corrupt its internal state.
|
||||||
|
|
||||||
|
- **onComment**: If a function is passed for this option, whenever a
|
||||||
|
comment is encountered the function will be called with the
|
||||||
|
following parameters:
|
||||||
|
|
||||||
|
- `block`: `true` if the comment is a block comment, false if it
|
||||||
|
is a line comment.
|
||||||
|
- `text`: The content of the comment.
|
||||||
|
- `start`: Character offset of the start of the comment.
|
||||||
|
- `end`: Character offset of the end of the comment.
|
||||||
|
|
||||||
|
When the `locations` options is on, the `{line, column}` locations
|
||||||
|
of the comment’s start and end are passed as two additional
|
||||||
|
parameters.
|
||||||
|
|
||||||
|
If array is passed for this option, each found comment is pushed
|
||||||
|
to it as object in Esprima format:
|
||||||
|
|
||||||
|
```javascript
|
||||||
|
{
|
||||||
|
"type": "Line" | "Block",
|
||||||
|
"value": "comment text",
|
||||||
|
"start": Number,
|
||||||
|
"end": Number,
|
||||||
|
// If `locations` option is on:
|
||||||
|
"loc": {
|
||||||
|
"start": {line: Number, column: Number}
|
||||||
|
"end": {line: Number, column: Number}
|
||||||
|
},
|
||||||
|
// If `ranges` option is on:
|
||||||
|
"range": [Number, Number]
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
Note that you are not allowed to call the parser from the
|
||||||
|
callback—that will corrupt its internal state.
|
||||||
|
|
||||||
|
- **ranges**: Nodes have their start and end characters offsets
|
||||||
|
recorded in `start` and `end` properties (directly on the node,
|
||||||
|
rather than the `loc` object, which holds line/column data. To also
|
||||||
|
add a [semi-standardized][range] `range` property holding a
|
||||||
|
`[start, end]` array with the same numbers, set the `ranges` option
|
||||||
|
to `true`.
|
||||||
|
|
||||||
|
- **program**: It is possible to parse multiple files into a single
|
||||||
|
AST by passing the tree produced by parsing the first file as the
|
||||||
|
`program` option in subsequent parses. This will add the toplevel
|
||||||
|
forms of the parsed file to the "Program" (top) node of an existing
|
||||||
|
parse tree.
|
||||||
|
|
||||||
|
- **sourceFile**: When the `locations` option is `true`, you can pass
|
||||||
|
this option to add a `source` attribute in every node’s `loc`
|
||||||
|
object. Note that the contents of this option are not examined or
|
||||||
|
processed in any way; you are free to use whatever format you
|
||||||
|
choose.
|
||||||
|
|
||||||
|
- **directSourceFile**: Like `sourceFile`, but a `sourceFile` property
|
||||||
|
will be added (regardless of the `location` option) directly to the
|
||||||
|
nodes, rather than the `loc` object.
|
||||||
|
|
||||||
|
- **preserveParens**: If this option is `true`, parenthesized expressions
|
||||||
|
are represented by (non-standard) `ParenthesizedExpression` nodes
|
||||||
|
that have a single `expression` property containing the expression
|
||||||
|
inside parentheses.
|
||||||
|
|
||||||
|
[range]: https://bugzilla.mozilla.org/show_bug.cgi?id=745678
|
||||||
|
|
||||||
|
**parseExpressionAt**`(input, offset, options)` will parse a single
|
||||||
|
expression in a string, and return its AST. It will not complain if
|
||||||
|
there is more of the string left after the expression.
|
||||||
|
|
||||||
|
**getLineInfo**`(input, offset)` can be used to get a `{line,
|
||||||
|
column}` object for a given program string and character offset.
|
||||||
|
|
||||||
|
**tokenizer**`(input, options)` returns an object with a `getToken`
|
||||||
|
method that can be called repeatedly to get the next token, a `{start,
|
||||||
|
end, type, value}` object (with added `loc` property when the
|
||||||
|
`locations` option is enabled and `range` property when the `ranges`
|
||||||
|
option is enabled). When the token's type is `tokTypes.eof`, you
|
||||||
|
should stop calling the method, since it will keep returning that same
|
||||||
|
token forever.
|
||||||
|
|
||||||
|
In ES6 environment, returned result can be used as any other
|
||||||
|
protocol-compliant iterable:
|
||||||
|
|
||||||
|
```javascript
|
||||||
|
for (let token of acorn.tokenizer(str)) {
|
||||||
|
// iterate over the tokens
|
||||||
|
}
|
||||||
|
|
||||||
|
// transform code to array of tokens:
|
||||||
|
var tokens = [...acorn.tokenizer(str)];
|
||||||
|
```
|
||||||
|
|
||||||
|
**tokTypes** holds an object mapping names to the token type objects
|
||||||
|
that end up in the `type` properties of tokens.
|
||||||
|
|
||||||
|
#### Note on using with [Escodegen][escodegen]
|
||||||
|
|
||||||
|
Escodegen supports generating comments from AST, attached in
|
||||||
|
Esprima-specific format. In order to simulate same format in
|
||||||
|
Acorn, consider following example:
|
||||||
|
|
||||||
|
```javascript
|
||||||
|
var comments = [], tokens = [];
|
||||||
|
|
||||||
|
var ast = acorn.parse('var x = 42; // answer', {
|
||||||
|
// collect ranges for each node
|
||||||
|
ranges: true,
|
||||||
|
// collect comments in Esprima's format
|
||||||
|
onComment: comments,
|
||||||
|
// collect token ranges
|
||||||
|
onToken: tokens
|
||||||
|
});
|
||||||
|
|
||||||
|
// attach comments using collected information
|
||||||
|
escodegen.attachComments(ast, comments, tokens);
|
||||||
|
|
||||||
|
// generate code
|
||||||
|
console.log(escodegen.generate(ast, {comment: true}));
|
||||||
|
// > 'var x = 42; // answer'
|
||||||
|
```
|
||||||
|
|
||||||
|
[escodegen]: https://github.com/estools/escodegen
|
||||||
|
|
||||||
|
### dist/acorn_loose.js ###
|
||||||
|
|
||||||
|
This file implements an error-tolerant parser. It exposes a single
|
||||||
|
function. The loose parser is accessible in node.js via `require("acorn/dist/acorn_loose")`.
|
||||||
|
|
||||||
|
**parse_dammit**`(input, options)` takes the same arguments and
|
||||||
|
returns the same syntax tree as the `parse` function in `acorn.js`,
|
||||||
|
but never raises an error, and will do its best to parse syntactically
|
||||||
|
invalid code in as meaningful a way as it can. It'll insert identifier
|
||||||
|
nodes with name `"✖"` as placeholders in places where it can't make
|
||||||
|
sense of the input. Depends on `acorn.js`, because it uses the same
|
||||||
|
tokenizer.
|
||||||
|
|
||||||
|
### dist/walk.js ###
|
||||||
|
|
||||||
|
Implements an abstract syntax tree walker. Will store its interface in
|
||||||
|
`acorn.walk` when loaded without a module system.
|
||||||
|
|
||||||
|
**simple**`(node, visitors, base, state)` does a 'simple' walk over
|
||||||
|
a tree. `node` should be the AST node to walk, and `visitors` an
|
||||||
|
object with properties whose names correspond to node types in the
|
||||||
|
[ESTree spec][estree]. The properties should contain functions
|
||||||
|
that will be called with the node object and, if applicable the state
|
||||||
|
at that point. The last two arguments are optional. `base` is a walker
|
||||||
|
algorithm, and `state` is a start state. The default walker will
|
||||||
|
simply visit all statements and expressions and not produce a
|
||||||
|
meaningful state. (An example of a use of state is to track scope at
|
||||||
|
each point in the tree.)
|
||||||
|
|
||||||
|
```js
|
||||||
|
const acorn = require("acorn")
|
||||||
|
const walk = require("acorn/dist/walk")
|
||||||
|
|
||||||
|
walk.simple(acorn.parse("let x = 10"), {
|
||||||
|
Literal(node) {
|
||||||
|
console.log(`Found a literal: ${node.value}`)
|
||||||
|
}
|
||||||
|
})
|
||||||
|
```
|
||||||
|
|
||||||
|
**ancestor**`(node, visitors, base, state)` does a 'simple' walk over
|
||||||
|
a tree, building up an array of ancestor nodes (including the current node)
|
||||||
|
and passing the array to the callbacks as a third parameter.
|
||||||
|
|
||||||
|
```js
|
||||||
|
const acorn = require("acorn")
|
||||||
|
const walk = require("acorn/dist/walk")
|
||||||
|
|
||||||
|
walk.ancestor(acorn.parse("foo('hi')"), {
|
||||||
|
Literal(_, ancestors) {
|
||||||
|
console.log("This literal's ancestors are:",
|
||||||
|
ancestors.map(n => n.type))
|
||||||
|
}
|
||||||
|
})
|
||||||
|
```
|
||||||
|
|
||||||
|
**recursive**`(node, state, functions, base)` does a 'recursive'
|
||||||
|
walk, where the walker functions are responsible for continuing the
|
||||||
|
walk on the child nodes of their target node. `state` is the start
|
||||||
|
state, and `functions` should contain an object that maps node types
|
||||||
|
to walker functions. Such functions are called with `(node, state, c)`
|
||||||
|
arguments, and can cause the walk to continue on a sub-node by calling
|
||||||
|
the `c` argument on it with `(node, state)` arguments. The optional
|
||||||
|
`base` argument provides the fallback walker functions for node types
|
||||||
|
that aren't handled in the `functions` object. If not given, the
|
||||||
|
default walkers will be used.
|
||||||
|
|
||||||
|
**make**`(functions, base)` builds a new walker object by using the
|
||||||
|
walker functions in `functions` and filling in the missing ones by
|
||||||
|
taking defaults from `base`.
|
||||||
|
|
||||||
|
**full**`(node, callback, base, state)` does a 'full'
|
||||||
|
walk over a tree, calling the callback with the arguments (node, state, type)
|
||||||
|
for each node
|
||||||
|
|
||||||
|
**fullAncestor**`(node, callback, base, state)` does a 'full' walk over
|
||||||
|
a tree, building up an array of ancestor nodes (including the current node)
|
||||||
|
and passing the array to the callbacks as a third parameter.
|
||||||
|
|
||||||
|
```js
|
||||||
|
const acorn = require("acorn")
|
||||||
|
const walk = require("acorn/dist/walk")
|
||||||
|
|
||||||
|
walk.full(acorn.parse("1 + 1"), node => {
|
||||||
|
console.log(`There's a ${node.type} node at ${node.ch}`)
|
||||||
|
})
|
||||||
|
```
|
||||||
|
|
||||||
|
**findNodeAt**`(node, start, end, test, base, state)` tries to
|
||||||
|
locate a node in a tree at the given start and/or end offsets, which
|
||||||
|
satisfies the predicate `test`. `start` and `end` can be either `null`
|
||||||
|
(as wildcard) or a number. `test` may be a string (indicating a node
|
||||||
|
type) or a function that takes `(nodeType, node)` arguments and
|
||||||
|
returns a boolean indicating whether this node is interesting. `base`
|
||||||
|
and `state` are optional, and can be used to specify a custom walker.
|
||||||
|
Nodes are tested from inner to outer, so if two nodes match the
|
||||||
|
boundaries, the inner one will be preferred.
|
||||||
|
|
||||||
|
**findNodeAround**`(node, pos, test, base, state)` is a lot like
|
||||||
|
`findNodeAt`, but will match any node that exists 'around' (spanning)
|
||||||
|
the given position.
|
||||||
|
|
||||||
|
**findNodeAfter**`(node, pos, test, base, state)` is similar to
|
||||||
|
`findNodeAround`, but will match all nodes *after* the given position
|
||||||
|
(testing outer nodes before inner nodes).
|
||||||
|
|
||||||
|
## Command line interface
|
||||||
|
|
||||||
|
The `bin/acorn` utility can be used to parse a file from the command
|
||||||
|
line. It accepts as arguments its input file and the following
|
||||||
|
options:
|
||||||
|
|
||||||
|
- `--ecma3|--ecma5|--ecma6|--ecma7|--ecma8|--ecma9`: Sets the ECMAScript version
|
||||||
|
to parse. Default is version 7.
|
||||||
|
|
||||||
|
- `--module`: Sets the parsing mode to `"module"`. Is set to `"script"` otherwise.
|
||||||
|
|
||||||
|
- `--locations`: Attaches a "loc" object to each node with "start" and
|
||||||
|
"end" subobjects, each of which contains the one-based line and
|
||||||
|
zero-based column numbers in `{line, column}` form.
|
||||||
|
|
||||||
|
- `--allow-hash-bang`: If the code starts with the characters #! (as in a shellscript), the first line will be treated as a comment.
|
||||||
|
|
||||||
|
- `--compact`: No whitespace is used in the AST output.
|
||||||
|
|
||||||
|
- `--silent`: Do not output the AST, just return the exit status.
|
||||||
|
|
||||||
|
- `--help`: Print the usage information and quit.
|
||||||
|
|
||||||
|
The utility spits out the syntax tree as JSON data.
|
||||||
|
|
||||||
|
## Build system
|
||||||
|
|
||||||
|
Acorn is written in ECMAScript 6, as a set of small modules, in the
|
||||||
|
project's `src` directory, and compiled down to bigger ECMAScript 3
|
||||||
|
files in `dist` using [Browserify](http://browserify.org) and
|
||||||
|
[Babel](http://babeljs.io/). If you are already using Babel, you can
|
||||||
|
consider including the modules directly.
|
||||||
|
|
||||||
|
The command-line test runner (`npm test`) uses the ES6 modules. The
|
||||||
|
browser-based test page (`test/index.html`) uses the compiled modules.
|
||||||
|
The `bin/build-acorn.js` script builds the latter from the former.
|
||||||
|
|
||||||
|
If you are working on Acorn, you'll probably want to try the code out
|
||||||
|
directly, without an intermediate build step. In your scripts, you can
|
||||||
|
register the Babel require shim like this:
|
||||||
|
|
||||||
|
require("babel-core/register")
|
||||||
|
|
||||||
|
That will allow you to directly `require` the ES6 modules.
|
||||||
|
|
||||||
|
## Plugins
|
||||||
|
|
||||||
|
Acorn is designed support allow plugins which, within reasonable
|
||||||
|
bounds, redefine the way the parser works. Plugins can add new token
|
||||||
|
types and new tokenizer contexts (if necessary), and extend methods in
|
||||||
|
the parser object. This is not a clean, elegant API—using it requires
|
||||||
|
an understanding of Acorn's internals, and plugins are likely to break
|
||||||
|
whenever those internals are significantly changed. But still, it is
|
||||||
|
_possible_, in this way, to create parsers for JavaScript dialects
|
||||||
|
without forking all of Acorn. And in principle it is even possible to
|
||||||
|
combine such plugins, so that if you have, for example, a plugin for
|
||||||
|
parsing types and a plugin for parsing JSX-style XML literals, you
|
||||||
|
could load them both and parse code with both JSX tags and types.
|
||||||
|
|
||||||
|
A plugin should register itself by adding a property to
|
||||||
|
`acorn.plugins`, which holds a function. Calling `acorn.parse`, a
|
||||||
|
`plugins` option can be passed, holding an object mapping plugin names
|
||||||
|
to configuration values (or just `true` for plugins that don't take
|
||||||
|
options). After the parser object has been created, the initialization
|
||||||
|
functions for the chosen plugins are called with `(parser,
|
||||||
|
configValue)` arguments. They are expected to use the `parser.extend`
|
||||||
|
method to extend parser methods. For example, the `readToken` method
|
||||||
|
could be extended like this:
|
||||||
|
|
||||||
|
```javascript
|
||||||
|
parser.extend("readToken", function(nextMethod) {
|
||||||
|
return function(code) {
|
||||||
|
console.log("Reading a token!")
|
||||||
|
return nextMethod.call(this, code)
|
||||||
|
}
|
||||||
|
})
|
||||||
|
```
|
||||||
|
|
||||||
|
The `nextMethod` argument passed to `extend`'s second argument is the
|
||||||
|
previous value of this method, and should usually be called through to
|
||||||
|
whenever the extended method does not handle the call itself.
|
||||||
|
|
||||||
|
Similarly, the loose parser allows plugins to register themselves via
|
||||||
|
`acorn.pluginsLoose`. The extension mechanism is the same as for the
|
||||||
|
normal parser:
|
||||||
|
|
||||||
|
```javascript
|
||||||
|
looseParser.extend("readToken", function(nextMethod) {
|
||||||
|
return function() {
|
||||||
|
console.log("Reading a token in the loose parser!")
|
||||||
|
return nextMethod.call(this)
|
||||||
|
}
|
||||||
|
})
|
||||||
|
```
|
||||||
|
|
||||||
|
### Existing plugins
|
||||||
|
|
||||||
|
- [`acorn-jsx`](https://github.com/RReverser/acorn-jsx): Parse [Facebook JSX syntax extensions](https://github.com/facebook/jsx)
|
||||||
|
- [`acorn-es7-plugin`](https://github.com/MatAtBread/acorn-es7-plugin/): Parse [async/await syntax proposal](https://github.com/tc39/ecmascript-asyncawait)
|
||||||
|
- [`acorn-object-spread`](https://github.com/UXtemple/acorn-object-spread): Parse [object spread syntax proposal](https://github.com/sebmarkbage/ecmascript-rest-spread)
|
||||||
|
- [`acorn-es7`](https://www.npmjs.com/package/acorn-es7): Parse [decorator syntax proposal](https://github.com/wycats/javascript-decorators)
|
||||||
|
- [`acorn-objj`](https://www.npmjs.com/package/acorn-objj): [Objective-J](http://www.cappuccino-project.org/learn/objective-j.html) language parser built as Acorn plugin
|
||||||
|
- [`acorn-object-rest-spread`](https://github.com/victor-homyakov/acorn-object-rest-spread) Parse [Object Rest/Spread Properties proposal](https://github.com/tc39/proposal-object-rest-spread), works with latest Acorn version (5.0.3)
|
||||||
|
- [`acorn-static-class-property-initializer`](https://github.com/victor-homyakov/acorn-static-class-property-initializer) Partial support for static class properties from [ES Class Fields & Static Properties Proposal](https://github.com/tc39/proposal-class-public-fields) to support static property initializers in [React components written as ES6+ classes](https://babeljs.io/blog/2015/06/07/react-on-es6-plus)
|
||||||
|
|
||||||
69
deps/acorn/bin/acorn
vendored
Executable file
69
deps/acorn/bin/acorn
vendored
Executable file
@ -0,0 +1,69 @@
|
|||||||
|
#!/usr/bin/env node
|
||||||
|
'use strict';
|
||||||
|
|
||||||
|
var path = require('path');
|
||||||
|
var fs = require('fs');
|
||||||
|
var acorn = require('../dist/acorn.js');
|
||||||
|
|
||||||
|
var infile;
|
||||||
|
var forceFile;
|
||||||
|
var silent = false;
|
||||||
|
var compact = false;
|
||||||
|
var tokenize = false;
|
||||||
|
var options = {};
|
||||||
|
|
||||||
|
function help(status) {
|
||||||
|
var print = (status == 0) ? console.log : console.error;
|
||||||
|
print("usage: " + path.basename(process.argv[1]) + " [--ecma3|--ecma5|--ecma6|--ecma7|--ecma8|--ecma9|...|--ecma2015|--ecma2016|--ecma2017|--ecma2018|...]");
|
||||||
|
print(" [--tokenize] [--locations] [---allow-hash-bang] [--compact] [--silent] [--module] [--help] [--] [infile]");
|
||||||
|
process.exit(status);
|
||||||
|
}
|
||||||
|
|
||||||
|
for (var i = 2; i < process.argv.length; ++i) {
|
||||||
|
var arg = process.argv[i];
|
||||||
|
if ((arg == "-" || arg[0] != "-") && !infile) { infile = arg; }
|
||||||
|
else if (arg == "--" && !infile && i + 2 == process.argv.length) { forceFile = infile = process.argv[++i]; }
|
||||||
|
else if (arg == "--locations") { options.locations = true; }
|
||||||
|
else if (arg == "--allow-hash-bang") { options.allowHashBang = true; }
|
||||||
|
else if (arg == "--silent") { silent = true; }
|
||||||
|
else if (arg == "--compact") { compact = true; }
|
||||||
|
else if (arg == "--help") { help(0); }
|
||||||
|
else if (arg == "--tokenize") { tokenize = true; }
|
||||||
|
else if (arg == "--module") { options.sourceType = "module"; }
|
||||||
|
else {
|
||||||
|
var match = arg.match(/^--ecma(\d+)$/);
|
||||||
|
if (match)
|
||||||
|
{ options.ecmaVersion = +match[1]; }
|
||||||
|
else
|
||||||
|
{ help(1); }
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
function run(code) {
|
||||||
|
var result;
|
||||||
|
try {
|
||||||
|
if (!tokenize) {
|
||||||
|
result = acorn.parse(code, options);
|
||||||
|
} else {
|
||||||
|
result = [];
|
||||||
|
var tokenizer$$1 = acorn.tokenizer(code, options), token;
|
||||||
|
do {
|
||||||
|
token = tokenizer$$1.getToken();
|
||||||
|
result.push(token);
|
||||||
|
} while (token.type != acorn.tokTypes.eof)
|
||||||
|
}
|
||||||
|
} catch (e) {
|
||||||
|
console.error(e.message);
|
||||||
|
process.exit(1);
|
||||||
|
}
|
||||||
|
if (!silent) { console.log(JSON.stringify(result, null, compact ? null : 2)); }
|
||||||
|
}
|
||||||
|
|
||||||
|
if (forceFile || infile && infile != "-") {
|
||||||
|
run(fs.readFileSync(infile, "utf8"));
|
||||||
|
} else {
|
||||||
|
var code = "";
|
||||||
|
process.stdin.resume();
|
||||||
|
process.stdin.on("data", function (chunk) { return code += chunk; });
|
||||||
|
process.stdin.on("end", function () { return run(code); });
|
||||||
|
}
|
||||||
0
deps/acorn/dist/.keep
vendored
Normal file
0
deps/acorn/dist/.keep
vendored
Normal file
3734
deps/acorn/dist/acorn.es.js
vendored
Normal file
3734
deps/acorn/dist/acorn.es.js
vendored
Normal file
File diff suppressed because it is too large
Load Diff
3765
deps/acorn/dist/acorn.js
vendored
Normal file
3765
deps/acorn/dist/acorn.js
vendored
Normal file
File diff suppressed because it is too large
Load Diff
1390
deps/acorn/dist/acorn_loose.es.js
vendored
Normal file
1390
deps/acorn/dist/acorn_loose.es.js
vendored
Normal file
File diff suppressed because it is too large
Load Diff
1400
deps/acorn/dist/acorn_loose.js
vendored
Normal file
1400
deps/acorn/dist/acorn_loose.js
vendored
Normal file
File diff suppressed because it is too large
Load Diff
407
deps/acorn/dist/walk.es.js
vendored
Normal file
407
deps/acorn/dist/walk.es.js
vendored
Normal file
@ -0,0 +1,407 @@
|
|||||||
|
// AST walker module for Mozilla Parser API compatible trees
|
||||||
|
|
||||||
|
// A simple walk is one where you simply specify callbacks to be
|
||||||
|
// called on specific nodes. The last two arguments are optional. A
|
||||||
|
// simple use would be
|
||||||
|
//
|
||||||
|
// walk.simple(myTree, {
|
||||||
|
// Expression: function(node) { ... }
|
||||||
|
// });
|
||||||
|
//
|
||||||
|
// to do something with all expressions. All Parser API node types
|
||||||
|
// can be used to identify node types, as well as Expression,
|
||||||
|
// Statement, and ScopeBody, which denote categories of nodes.
|
||||||
|
//
|
||||||
|
// The base argument can be used to pass a custom (recursive)
|
||||||
|
// walker, and state can be used to give this walked an initial
|
||||||
|
// state.
|
||||||
|
|
||||||
|
function simple(node, visitors, base, state, override) {
|
||||||
|
if (!base) { base = exports.base
|
||||||
|
; }(function c(node, st, override) {
|
||||||
|
var type = override || node.type, found = visitors[type];
|
||||||
|
base[type](node, st, c);
|
||||||
|
if (found) { found(node, st); }
|
||||||
|
})(node, state, override);
|
||||||
|
}
|
||||||
|
|
||||||
|
// An ancestor walk keeps an array of ancestor nodes (including the
|
||||||
|
// current node) and passes them to the callback as third parameter
|
||||||
|
// (and also as state parameter when no other state is present).
|
||||||
|
function ancestor(node, visitors, base, state) {
|
||||||
|
if (!base) { base = exports.base; }
|
||||||
|
var ancestors = [];(function c(node, st, override) {
|
||||||
|
var type = override || node.type, found = visitors[type];
|
||||||
|
var isNew = node != ancestors[ancestors.length - 1];
|
||||||
|
if (isNew) { ancestors.push(node); }
|
||||||
|
base[type](node, st, c);
|
||||||
|
if (found) { found(node, st || ancestors, ancestors); }
|
||||||
|
if (isNew) { ancestors.pop(); }
|
||||||
|
})(node, state);
|
||||||
|
}
|
||||||
|
|
||||||
|
// A recursive walk is one where your functions override the default
|
||||||
|
// walkers. They can modify and replace the state parameter that's
|
||||||
|
// threaded through the walk, and can opt how and whether to walk
|
||||||
|
// their child nodes (by calling their third argument on these
|
||||||
|
// nodes).
|
||||||
|
function recursive(node, state, funcs, base, override) {
|
||||||
|
var visitor = funcs ? exports.make(funcs, base) : base;(function c(node, st, override) {
|
||||||
|
visitor[override || node.type](node, st, c);
|
||||||
|
})(node, state, override);
|
||||||
|
}
|
||||||
|
|
||||||
|
function makeTest(test) {
|
||||||
|
if (typeof test == "string")
|
||||||
|
{ return function (type) { return type == test; } }
|
||||||
|
else if (!test)
|
||||||
|
{ return function () { return true; } }
|
||||||
|
else
|
||||||
|
{ return test }
|
||||||
|
}
|
||||||
|
|
||||||
|
var Found = function Found(node, state) { this.node = node; this.state = state; };
|
||||||
|
|
||||||
|
// A full walk triggers the callback on each node
|
||||||
|
function full(node, callback, base, state, override) {
|
||||||
|
if (!base) { base = exports.base
|
||||||
|
; }(function c(node, st, override) {
|
||||||
|
var type = override || node.type;
|
||||||
|
base[type](node, st, c);
|
||||||
|
if (!override) { callback(node, st, type); }
|
||||||
|
})(node, state, override);
|
||||||
|
}
|
||||||
|
|
||||||
|
// An fullAncestor walk is like an ancestor walk, but triggers
|
||||||
|
// the callback on each node
|
||||||
|
function fullAncestor(node, callback, base, state) {
|
||||||
|
if (!base) { base = exports.base; }
|
||||||
|
var ancestors = [];(function c(node, st, override) {
|
||||||
|
var type = override || node.type;
|
||||||
|
var isNew = node != ancestors[ancestors.length - 1];
|
||||||
|
if (isNew) { ancestors.push(node); }
|
||||||
|
base[type](node, st, c);
|
||||||
|
if (!override) { callback(node, st || ancestors, ancestors, type); }
|
||||||
|
if (isNew) { ancestors.pop(); }
|
||||||
|
})(node, state);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Find a node with a given start, end, and type (all are optional,
|
||||||
|
// null can be used as wildcard). Returns a {node, state} object, or
|
||||||
|
// undefined when it doesn't find a matching node.
|
||||||
|
function findNodeAt(node, start, end, test, base, state) {
|
||||||
|
test = makeTest(test);
|
||||||
|
if (!base) { base = exports.base; }
|
||||||
|
try {
|
||||||
|
(function c(node, st, override) {
|
||||||
|
var type = override || node.type;
|
||||||
|
if ((start == null || node.start <= start) &&
|
||||||
|
(end == null || node.end >= end))
|
||||||
|
{ base[type](node, st, c); }
|
||||||
|
if ((start == null || node.start == start) &&
|
||||||
|
(end == null || node.end == end) &&
|
||||||
|
test(type, node))
|
||||||
|
{ throw new Found(node, st) }
|
||||||
|
})(node, state);
|
||||||
|
} catch (e) {
|
||||||
|
if (e instanceof Found) { return e }
|
||||||
|
throw e
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Find the innermost node of a given type that contains the given
|
||||||
|
// position. Interface similar to findNodeAt.
|
||||||
|
function findNodeAround(node, pos, test, base, state) {
|
||||||
|
test = makeTest(test);
|
||||||
|
if (!base) { base = exports.base; }
|
||||||
|
try {
|
||||||
|
(function c(node, st, override) {
|
||||||
|
var type = override || node.type;
|
||||||
|
if (node.start > pos || node.end < pos) { return }
|
||||||
|
base[type](node, st, c);
|
||||||
|
if (test(type, node)) { throw new Found(node, st) }
|
||||||
|
})(node, state);
|
||||||
|
} catch (e) {
|
||||||
|
if (e instanceof Found) { return e }
|
||||||
|
throw e
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Find the outermost matching node after a given position.
|
||||||
|
function findNodeAfter(node, pos, test, base, state) {
|
||||||
|
test = makeTest(test);
|
||||||
|
if (!base) { base = exports.base; }
|
||||||
|
try {
|
||||||
|
(function c(node, st, override) {
|
||||||
|
if (node.end < pos) { return }
|
||||||
|
var type = override || node.type;
|
||||||
|
if (node.start >= pos && test(type, node)) { throw new Found(node, st) }
|
||||||
|
base[type](node, st, c);
|
||||||
|
})(node, state);
|
||||||
|
} catch (e) {
|
||||||
|
if (e instanceof Found) { return e }
|
||||||
|
throw e
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Find the outermost matching node before a given position.
|
||||||
|
function findNodeBefore(node, pos, test, base, state) {
|
||||||
|
test = makeTest(test);
|
||||||
|
if (!base) { base = exports.base; }
|
||||||
|
var max;(function c(node, st, override) {
|
||||||
|
if (node.start > pos) { return }
|
||||||
|
var type = override || node.type;
|
||||||
|
if (node.end <= pos && (!max || max.node.end < node.end) && test(type, node))
|
||||||
|
{ max = new Found(node, st); }
|
||||||
|
base[type](node, st, c);
|
||||||
|
})(node, state);
|
||||||
|
return max
|
||||||
|
}
|
||||||
|
|
||||||
|
// Fallback to an Object.create polyfill for older environments.
|
||||||
|
var create = Object.create || function(proto) {
|
||||||
|
function Ctor() {}
|
||||||
|
Ctor.prototype = proto;
|
||||||
|
return new Ctor
|
||||||
|
};
|
||||||
|
|
||||||
|
// Used to create a custom walker. Will fill in all missing node
|
||||||
|
// type properties with the defaults.
|
||||||
|
function make(funcs, base) {
|
||||||
|
if (!base) { base = exports.base; }
|
||||||
|
var visitor = create(base);
|
||||||
|
for (var type in funcs) { visitor[type] = funcs[type]; }
|
||||||
|
return visitor
|
||||||
|
}
|
||||||
|
|
||||||
|
function skipThrough(node, st, c) { c(node, st); }
|
||||||
|
function ignore(_node, _st, _c) {}
|
||||||
|
|
||||||
|
// Node walkers.
|
||||||
|
|
||||||
|
var base = {};
|
||||||
|
|
||||||
|
base.Program = base.BlockStatement = function (node, st, c) {
|
||||||
|
for (var i = 0, list = node.body; i < list.length; i += 1)
|
||||||
|
{
|
||||||
|
var stmt = list[i];
|
||||||
|
|
||||||
|
c(stmt, st, "Statement");
|
||||||
|
}
|
||||||
|
};
|
||||||
|
base.Statement = skipThrough;
|
||||||
|
base.EmptyStatement = ignore;
|
||||||
|
base.ExpressionStatement = base.ParenthesizedExpression =
|
||||||
|
function (node, st, c) { return c(node.expression, st, "Expression"); };
|
||||||
|
base.IfStatement = function (node, st, c) {
|
||||||
|
c(node.test, st, "Expression");
|
||||||
|
c(node.consequent, st, "Statement");
|
||||||
|
if (node.alternate) { c(node.alternate, st, "Statement"); }
|
||||||
|
};
|
||||||
|
base.LabeledStatement = function (node, st, c) { return c(node.body, st, "Statement"); };
|
||||||
|
base.BreakStatement = base.ContinueStatement = ignore;
|
||||||
|
base.WithStatement = function (node, st, c) {
|
||||||
|
c(node.object, st, "Expression");
|
||||||
|
c(node.body, st, "Statement");
|
||||||
|
};
|
||||||
|
base.SwitchStatement = function (node, st, c) {
|
||||||
|
c(node.discriminant, st, "Expression");
|
||||||
|
for (var i = 0, list = node.cases; i < list.length; i += 1) {
|
||||||
|
var cs = list[i];
|
||||||
|
|
||||||
|
if (cs.test) { c(cs.test, st, "Expression"); }
|
||||||
|
for (var i$1 = 0, list$1 = cs.consequent; i$1 < list$1.length; i$1 += 1)
|
||||||
|
{
|
||||||
|
var cons = list$1[i$1];
|
||||||
|
|
||||||
|
c(cons, st, "Statement");
|
||||||
|
}
|
||||||
|
}
|
||||||
|
};
|
||||||
|
base.ReturnStatement = base.YieldExpression = base.AwaitExpression = function (node, st, c) {
|
||||||
|
if (node.argument) { c(node.argument, st, "Expression"); }
|
||||||
|
};
|
||||||
|
base.ThrowStatement = base.SpreadElement =
|
||||||
|
function (node, st, c) { return c(node.argument, st, "Expression"); };
|
||||||
|
base.TryStatement = function (node, st, c) {
|
||||||
|
c(node.block, st, "Statement");
|
||||||
|
if (node.handler) { c(node.handler, st); }
|
||||||
|
if (node.finalizer) { c(node.finalizer, st, "Statement"); }
|
||||||
|
};
|
||||||
|
base.CatchClause = function (node, st, c) {
|
||||||
|
c(node.param, st, "Pattern");
|
||||||
|
c(node.body, st, "ScopeBody");
|
||||||
|
};
|
||||||
|
base.WhileStatement = base.DoWhileStatement = function (node, st, c) {
|
||||||
|
c(node.test, st, "Expression");
|
||||||
|
c(node.body, st, "Statement");
|
||||||
|
};
|
||||||
|
base.ForStatement = function (node, st, c) {
|
||||||
|
if (node.init) { c(node.init, st, "ForInit"); }
|
||||||
|
if (node.test) { c(node.test, st, "Expression"); }
|
||||||
|
if (node.update) { c(node.update, st, "Expression"); }
|
||||||
|
c(node.body, st, "Statement");
|
||||||
|
};
|
||||||
|
base.ForInStatement = base.ForOfStatement = function (node, st, c) {
|
||||||
|
c(node.left, st, "ForInit");
|
||||||
|
c(node.right, st, "Expression");
|
||||||
|
c(node.body, st, "Statement");
|
||||||
|
};
|
||||||
|
base.ForInit = function (node, st, c) {
|
||||||
|
if (node.type == "VariableDeclaration") { c(node, st); }
|
||||||
|
else { c(node, st, "Expression"); }
|
||||||
|
};
|
||||||
|
base.DebuggerStatement = ignore;
|
||||||
|
|
||||||
|
base.FunctionDeclaration = function (node, st, c) { return c(node, st, "Function"); };
|
||||||
|
base.VariableDeclaration = function (node, st, c) {
|
||||||
|
for (var i = 0, list = node.declarations; i < list.length; i += 1)
|
||||||
|
{
|
||||||
|
var decl = list[i];
|
||||||
|
|
||||||
|
c(decl, st);
|
||||||
|
}
|
||||||
|
};
|
||||||
|
base.VariableDeclarator = function (node, st, c) {
|
||||||
|
c(node.id, st, "Pattern");
|
||||||
|
if (node.init) { c(node.init, st, "Expression"); }
|
||||||
|
};
|
||||||
|
|
||||||
|
base.Function = function (node, st, c) {
|
||||||
|
if (node.id) { c(node.id, st, "Pattern"); }
|
||||||
|
for (var i = 0, list = node.params; i < list.length; i += 1)
|
||||||
|
{
|
||||||
|
var param = list[i];
|
||||||
|
|
||||||
|
c(param, st, "Pattern");
|
||||||
|
}
|
||||||
|
c(node.body, st, node.expression ? "ScopeExpression" : "ScopeBody");
|
||||||
|
};
|
||||||
|
// FIXME drop these node types in next major version
|
||||||
|
// (They are awkward, and in ES6 every block can be a scope.)
|
||||||
|
base.ScopeBody = function (node, st, c) { return c(node, st, "Statement"); };
|
||||||
|
base.ScopeExpression = function (node, st, c) { return c(node, st, "Expression"); };
|
||||||
|
|
||||||
|
base.Pattern = function (node, st, c) {
|
||||||
|
if (node.type == "Identifier")
|
||||||
|
{ c(node, st, "VariablePattern"); }
|
||||||
|
else if (node.type == "MemberExpression")
|
||||||
|
{ c(node, st, "MemberPattern"); }
|
||||||
|
else
|
||||||
|
{ c(node, st); }
|
||||||
|
};
|
||||||
|
base.VariablePattern = ignore;
|
||||||
|
base.MemberPattern = skipThrough;
|
||||||
|
base.RestElement = function (node, st, c) { return c(node.argument, st, "Pattern"); };
|
||||||
|
base.ArrayPattern = function (node, st, c) {
|
||||||
|
for (var i = 0, list = node.elements; i < list.length; i += 1) {
|
||||||
|
var elt = list[i];
|
||||||
|
|
||||||
|
if (elt) { c(elt, st, "Pattern"); }
|
||||||
|
}
|
||||||
|
};
|
||||||
|
base.ObjectPattern = function (node, st, c) {
|
||||||
|
for (var i = 0, list = node.properties; i < list.length; i += 1)
|
||||||
|
{
|
||||||
|
var prop = list[i];
|
||||||
|
|
||||||
|
c(prop.value, st, "Pattern");
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
base.Expression = skipThrough;
|
||||||
|
base.ThisExpression = base.Super = base.MetaProperty = ignore;
|
||||||
|
base.ArrayExpression = function (node, st, c) {
|
||||||
|
for (var i = 0, list = node.elements; i < list.length; i += 1) {
|
||||||
|
var elt = list[i];
|
||||||
|
|
||||||
|
if (elt) { c(elt, st, "Expression"); }
|
||||||
|
}
|
||||||
|
};
|
||||||
|
base.ObjectExpression = function (node, st, c) {
|
||||||
|
for (var i = 0, list = node.properties; i < list.length; i += 1)
|
||||||
|
{
|
||||||
|
var prop = list[i];
|
||||||
|
|
||||||
|
c(prop, st);
|
||||||
|
}
|
||||||
|
};
|
||||||
|
base.FunctionExpression = base.ArrowFunctionExpression = base.FunctionDeclaration;
|
||||||
|
base.SequenceExpression = base.TemplateLiteral = function (node, st, c) {
|
||||||
|
for (var i = 0, list = node.expressions; i < list.length; i += 1)
|
||||||
|
{
|
||||||
|
var expr = list[i];
|
||||||
|
|
||||||
|
c(expr, st, "Expression");
|
||||||
|
}
|
||||||
|
};
|
||||||
|
base.UnaryExpression = base.UpdateExpression = function (node, st, c) {
|
||||||
|
c(node.argument, st, "Expression");
|
||||||
|
};
|
||||||
|
base.BinaryExpression = base.LogicalExpression = function (node, st, c) {
|
||||||
|
c(node.left, st, "Expression");
|
||||||
|
c(node.right, st, "Expression");
|
||||||
|
};
|
||||||
|
base.AssignmentExpression = base.AssignmentPattern = function (node, st, c) {
|
||||||
|
c(node.left, st, "Pattern");
|
||||||
|
c(node.right, st, "Expression");
|
||||||
|
};
|
||||||
|
base.ConditionalExpression = function (node, st, c) {
|
||||||
|
c(node.test, st, "Expression");
|
||||||
|
c(node.consequent, st, "Expression");
|
||||||
|
c(node.alternate, st, "Expression");
|
||||||
|
};
|
||||||
|
base.NewExpression = base.CallExpression = function (node, st, c) {
|
||||||
|
c(node.callee, st, "Expression");
|
||||||
|
if (node.arguments)
|
||||||
|
{ for (var i = 0, list = node.arguments; i < list.length; i += 1)
|
||||||
|
{
|
||||||
|
var arg = list[i];
|
||||||
|
|
||||||
|
c(arg, st, "Expression");
|
||||||
|
} }
|
||||||
|
};
|
||||||
|
base.MemberExpression = function (node, st, c) {
|
||||||
|
c(node.object, st, "Expression");
|
||||||
|
if (node.computed) { c(node.property, st, "Expression"); }
|
||||||
|
};
|
||||||
|
base.ExportNamedDeclaration = base.ExportDefaultDeclaration = function (node, st, c) {
|
||||||
|
if (node.declaration)
|
||||||
|
{ c(node.declaration, st, node.type == "ExportNamedDeclaration" || node.declaration.id ? "Statement" : "Expression"); }
|
||||||
|
if (node.source) { c(node.source, st, "Expression"); }
|
||||||
|
};
|
||||||
|
base.ExportAllDeclaration = function (node, st, c) {
|
||||||
|
c(node.source, st, "Expression");
|
||||||
|
};
|
||||||
|
base.ImportDeclaration = function (node, st, c) {
|
||||||
|
for (var i = 0, list = node.specifiers; i < list.length; i += 1)
|
||||||
|
{
|
||||||
|
var spec = list[i];
|
||||||
|
|
||||||
|
c(spec, st);
|
||||||
|
}
|
||||||
|
c(node.source, st, "Expression");
|
||||||
|
};
|
||||||
|
base.ImportSpecifier = base.ImportDefaultSpecifier = base.ImportNamespaceSpecifier = base.Identifier = base.Literal = ignore;
|
||||||
|
|
||||||
|
base.TaggedTemplateExpression = function (node, st, c) {
|
||||||
|
c(node.tag, st, "Expression");
|
||||||
|
c(node.quasi, st);
|
||||||
|
};
|
||||||
|
base.ClassDeclaration = base.ClassExpression = function (node, st, c) { return c(node, st, "Class"); };
|
||||||
|
base.Class = function (node, st, c) {
|
||||||
|
if (node.id) { c(node.id, st, "Pattern"); }
|
||||||
|
if (node.superClass) { c(node.superClass, st, "Expression"); }
|
||||||
|
for (var i = 0, list = node.body.body; i < list.length; i += 1)
|
||||||
|
{
|
||||||
|
var item = list[i];
|
||||||
|
|
||||||
|
c(item, st);
|
||||||
|
}
|
||||||
|
};
|
||||||
|
base.MethodDefinition = base.Property = function (node, st, c) {
|
||||||
|
if (node.computed) { c(node.key, st, "Expression"); }
|
||||||
|
c(node.value, st, "Expression");
|
||||||
|
};
|
||||||
|
|
||||||
|
export { simple, ancestor, recursive, full, fullAncestor, findNodeAt, findNodeAround, findNodeAfter, findNodeBefore, make, base };
|
||||||
427
deps/acorn/dist/walk.js
vendored
Normal file
427
deps/acorn/dist/walk.js
vendored
Normal file
@ -0,0 +1,427 @@
|
|||||||
|
(function (global, factory) {
|
||||||
|
typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :
|
||||||
|
typeof define === 'function' && define.amd ? define(['exports'], factory) :
|
||||||
|
(factory((global.acorn = global.acorn || {}, global.acorn.walk = global.acorn.walk || {})));
|
||||||
|
}(this, (function (exports) { 'use strict';
|
||||||
|
|
||||||
|
// AST walker module for Mozilla Parser API compatible trees
|
||||||
|
|
||||||
|
// A simple walk is one where you simply specify callbacks to be
|
||||||
|
// called on specific nodes. The last two arguments are optional. A
|
||||||
|
// simple use would be
|
||||||
|
//
|
||||||
|
// walk.simple(myTree, {
|
||||||
|
// Expression: function(node) { ... }
|
||||||
|
// });
|
||||||
|
//
|
||||||
|
// to do something with all expressions. All Parser API node types
|
||||||
|
// can be used to identify node types, as well as Expression,
|
||||||
|
// Statement, and ScopeBody, which denote categories of nodes.
|
||||||
|
//
|
||||||
|
// The base argument can be used to pass a custom (recursive)
|
||||||
|
// walker, and state can be used to give this walked an initial
|
||||||
|
// state.
|
||||||
|
|
||||||
|
function simple(node, visitors, base, state, override) {
|
||||||
|
if (!base) { base = exports.base
|
||||||
|
; }(function c(node, st, override) {
|
||||||
|
var type = override || node.type, found = visitors[type];
|
||||||
|
base[type](node, st, c);
|
||||||
|
if (found) { found(node, st); }
|
||||||
|
})(node, state, override);
|
||||||
|
}
|
||||||
|
|
||||||
|
// An ancestor walk keeps an array of ancestor nodes (including the
|
||||||
|
// current node) and passes them to the callback as third parameter
|
||||||
|
// (and also as state parameter when no other state is present).
|
||||||
|
function ancestor(node, visitors, base, state) {
|
||||||
|
if (!base) { base = exports.base; }
|
||||||
|
var ancestors = [];(function c(node, st, override) {
|
||||||
|
var type = override || node.type, found = visitors[type];
|
||||||
|
var isNew = node != ancestors[ancestors.length - 1];
|
||||||
|
if (isNew) { ancestors.push(node); }
|
||||||
|
base[type](node, st, c);
|
||||||
|
if (found) { found(node, st || ancestors, ancestors); }
|
||||||
|
if (isNew) { ancestors.pop(); }
|
||||||
|
})(node, state);
|
||||||
|
}
|
||||||
|
|
||||||
|
// A recursive walk is one where your functions override the default
|
||||||
|
// walkers. They can modify and replace the state parameter that's
|
||||||
|
// threaded through the walk, and can opt how and whether to walk
|
||||||
|
// their child nodes (by calling their third argument on these
|
||||||
|
// nodes).
|
||||||
|
function recursive(node, state, funcs, base, override) {
|
||||||
|
var visitor = funcs ? exports.make(funcs, base) : base;(function c(node, st, override) {
|
||||||
|
visitor[override || node.type](node, st, c);
|
||||||
|
})(node, state, override);
|
||||||
|
}
|
||||||
|
|
||||||
|
function makeTest(test) {
|
||||||
|
if (typeof test == "string")
|
||||||
|
{ return function (type) { return type == test; } }
|
||||||
|
else if (!test)
|
||||||
|
{ return function () { return true; } }
|
||||||
|
else
|
||||||
|
{ return test }
|
||||||
|
}
|
||||||
|
|
||||||
|
var Found = function Found(node, state) { this.node = node; this.state = state; };
|
||||||
|
|
||||||
|
// A full walk triggers the callback on each node
|
||||||
|
function full(node, callback, base, state, override) {
|
||||||
|
if (!base) { base = exports.base
|
||||||
|
; }(function c(node, st, override) {
|
||||||
|
var type = override || node.type;
|
||||||
|
base[type](node, st, c);
|
||||||
|
if (!override) { callback(node, st, type); }
|
||||||
|
})(node, state, override);
|
||||||
|
}
|
||||||
|
|
||||||
|
// An fullAncestor walk is like an ancestor walk, but triggers
|
||||||
|
// the callback on each node
|
||||||
|
function fullAncestor(node, callback, base, state) {
|
||||||
|
if (!base) { base = exports.base; }
|
||||||
|
var ancestors = [];(function c(node, st, override) {
|
||||||
|
var type = override || node.type;
|
||||||
|
var isNew = node != ancestors[ancestors.length - 1];
|
||||||
|
if (isNew) { ancestors.push(node); }
|
||||||
|
base[type](node, st, c);
|
||||||
|
if (!override) { callback(node, st || ancestors, ancestors, type); }
|
||||||
|
if (isNew) { ancestors.pop(); }
|
||||||
|
})(node, state);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Find a node with a given start, end, and type (all are optional,
|
||||||
|
// null can be used as wildcard). Returns a {node, state} object, or
|
||||||
|
// undefined when it doesn't find a matching node.
|
||||||
|
function findNodeAt(node, start, end, test, base, state) {
|
||||||
|
test = makeTest(test);
|
||||||
|
if (!base) { base = exports.base; }
|
||||||
|
try {
|
||||||
|
(function c(node, st, override) {
|
||||||
|
var type = override || node.type;
|
||||||
|
if ((start == null || node.start <= start) &&
|
||||||
|
(end == null || node.end >= end))
|
||||||
|
{ base[type](node, st, c); }
|
||||||
|
if ((start == null || node.start == start) &&
|
||||||
|
(end == null || node.end == end) &&
|
||||||
|
test(type, node))
|
||||||
|
{ throw new Found(node, st) }
|
||||||
|
})(node, state);
|
||||||
|
} catch (e) {
|
||||||
|
if (e instanceof Found) { return e }
|
||||||
|
throw e
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Find the innermost node of a given type that contains the given
|
||||||
|
// position. Interface similar to findNodeAt.
|
||||||
|
function findNodeAround(node, pos, test, base, state) {
|
||||||
|
test = makeTest(test);
|
||||||
|
if (!base) { base = exports.base; }
|
||||||
|
try {
|
||||||
|
(function c(node, st, override) {
|
||||||
|
var type = override || node.type;
|
||||||
|
if (node.start > pos || node.end < pos) { return }
|
||||||
|
base[type](node, st, c);
|
||||||
|
if (test(type, node)) { throw new Found(node, st) }
|
||||||
|
})(node, state);
|
||||||
|
} catch (e) {
|
||||||
|
if (e instanceof Found) { return e }
|
||||||
|
throw e
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Find the outermost matching node after a given position.
|
||||||
|
function findNodeAfter(node, pos, test, base, state) {
|
||||||
|
test = makeTest(test);
|
||||||
|
if (!base) { base = exports.base; }
|
||||||
|
try {
|
||||||
|
(function c(node, st, override) {
|
||||||
|
if (node.end < pos) { return }
|
||||||
|
var type = override || node.type;
|
||||||
|
if (node.start >= pos && test(type, node)) { throw new Found(node, st) }
|
||||||
|
base[type](node, st, c);
|
||||||
|
})(node, state);
|
||||||
|
} catch (e) {
|
||||||
|
if (e instanceof Found) { return e }
|
||||||
|
throw e
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Find the outermost matching node before a given position.
|
||||||
|
function findNodeBefore(node, pos, test, base, state) {
|
||||||
|
test = makeTest(test);
|
||||||
|
if (!base) { base = exports.base; }
|
||||||
|
var max;(function c(node, st, override) {
|
||||||
|
if (node.start > pos) { return }
|
||||||
|
var type = override || node.type;
|
||||||
|
if (node.end <= pos && (!max || max.node.end < node.end) && test(type, node))
|
||||||
|
{ max = new Found(node, st); }
|
||||||
|
base[type](node, st, c);
|
||||||
|
})(node, state);
|
||||||
|
return max
|
||||||
|
}
|
||||||
|
|
||||||
|
// Fallback to an Object.create polyfill for older environments.
|
||||||
|
var create = Object.create || function(proto) {
|
||||||
|
function Ctor() {}
|
||||||
|
Ctor.prototype = proto;
|
||||||
|
return new Ctor
|
||||||
|
};
|
||||||
|
|
||||||
|
// Used to create a custom walker. Will fill in all missing node
|
||||||
|
// type properties with the defaults.
|
||||||
|
function make(funcs, base) {
|
||||||
|
if (!base) { base = exports.base; }
|
||||||
|
var visitor = create(base);
|
||||||
|
for (var type in funcs) { visitor[type] = funcs[type]; }
|
||||||
|
return visitor
|
||||||
|
}
|
||||||
|
|
||||||
|
function skipThrough(node, st, c) { c(node, st); }
|
||||||
|
function ignore(_node, _st, _c) {}
|
||||||
|
|
||||||
|
// Node walkers.
|
||||||
|
|
||||||
|
var base = {};
|
||||||
|
|
||||||
|
base.Program = base.BlockStatement = function (node, st, c) {
|
||||||
|
for (var i = 0, list = node.body; i < list.length; i += 1)
|
||||||
|
{
|
||||||
|
var stmt = list[i];
|
||||||
|
|
||||||
|
c(stmt, st, "Statement");
|
||||||
|
}
|
||||||
|
};
|
||||||
|
base.Statement = skipThrough;
|
||||||
|
base.EmptyStatement = ignore;
|
||||||
|
base.ExpressionStatement = base.ParenthesizedExpression =
|
||||||
|
function (node, st, c) { return c(node.expression, st, "Expression"); };
|
||||||
|
base.IfStatement = function (node, st, c) {
|
||||||
|
c(node.test, st, "Expression");
|
||||||
|
c(node.consequent, st, "Statement");
|
||||||
|
if (node.alternate) { c(node.alternate, st, "Statement"); }
|
||||||
|
};
|
||||||
|
base.LabeledStatement = function (node, st, c) { return c(node.body, st, "Statement"); };
|
||||||
|
base.BreakStatement = base.ContinueStatement = ignore;
|
||||||
|
base.WithStatement = function (node, st, c) {
|
||||||
|
c(node.object, st, "Expression");
|
||||||
|
c(node.body, st, "Statement");
|
||||||
|
};
|
||||||
|
base.SwitchStatement = function (node, st, c) {
|
||||||
|
c(node.discriminant, st, "Expression");
|
||||||
|
for (var i = 0, list = node.cases; i < list.length; i += 1) {
|
||||||
|
var cs = list[i];
|
||||||
|
|
||||||
|
if (cs.test) { c(cs.test, st, "Expression"); }
|
||||||
|
for (var i$1 = 0, list$1 = cs.consequent; i$1 < list$1.length; i$1 += 1)
|
||||||
|
{
|
||||||
|
var cons = list$1[i$1];
|
||||||
|
|
||||||
|
c(cons, st, "Statement");
|
||||||
|
}
|
||||||
|
}
|
||||||
|
};
|
||||||
|
base.ReturnStatement = base.YieldExpression = base.AwaitExpression = function (node, st, c) {
|
||||||
|
if (node.argument) { c(node.argument, st, "Expression"); }
|
||||||
|
};
|
||||||
|
base.ThrowStatement = base.SpreadElement =
|
||||||
|
function (node, st, c) { return c(node.argument, st, "Expression"); };
|
||||||
|
base.TryStatement = function (node, st, c) {
|
||||||
|
c(node.block, st, "Statement");
|
||||||
|
if (node.handler) { c(node.handler, st); }
|
||||||
|
if (node.finalizer) { c(node.finalizer, st, "Statement"); }
|
||||||
|
};
|
||||||
|
base.CatchClause = function (node, st, c) {
|
||||||
|
c(node.param, st, "Pattern");
|
||||||
|
c(node.body, st, "ScopeBody");
|
||||||
|
};
|
||||||
|
base.WhileStatement = base.DoWhileStatement = function (node, st, c) {
|
||||||
|
c(node.test, st, "Expression");
|
||||||
|
c(node.body, st, "Statement");
|
||||||
|
};
|
||||||
|
base.ForStatement = function (node, st, c) {
|
||||||
|
if (node.init) { c(node.init, st, "ForInit"); }
|
||||||
|
if (node.test) { c(node.test, st, "Expression"); }
|
||||||
|
if (node.update) { c(node.update, st, "Expression"); }
|
||||||
|
c(node.body, st, "Statement");
|
||||||
|
};
|
||||||
|
base.ForInStatement = base.ForOfStatement = function (node, st, c) {
|
||||||
|
c(node.left, st, "ForInit");
|
||||||
|
c(node.right, st, "Expression");
|
||||||
|
c(node.body, st, "Statement");
|
||||||
|
};
|
||||||
|
base.ForInit = function (node, st, c) {
|
||||||
|
if (node.type == "VariableDeclaration") { c(node, st); }
|
||||||
|
else { c(node, st, "Expression"); }
|
||||||
|
};
|
||||||
|
base.DebuggerStatement = ignore;
|
||||||
|
|
||||||
|
base.FunctionDeclaration = function (node, st, c) { return c(node, st, "Function"); };
|
||||||
|
base.VariableDeclaration = function (node, st, c) {
|
||||||
|
for (var i = 0, list = node.declarations; i < list.length; i += 1)
|
||||||
|
{
|
||||||
|
var decl = list[i];
|
||||||
|
|
||||||
|
c(decl, st);
|
||||||
|
}
|
||||||
|
};
|
||||||
|
base.VariableDeclarator = function (node, st, c) {
|
||||||
|
c(node.id, st, "Pattern");
|
||||||
|
if (node.init) { c(node.init, st, "Expression"); }
|
||||||
|
};
|
||||||
|
|
||||||
|
base.Function = function (node, st, c) {
|
||||||
|
if (node.id) { c(node.id, st, "Pattern"); }
|
||||||
|
for (var i = 0, list = node.params; i < list.length; i += 1)
|
||||||
|
{
|
||||||
|
var param = list[i];
|
||||||
|
|
||||||
|
c(param, st, "Pattern");
|
||||||
|
}
|
||||||
|
c(node.body, st, node.expression ? "ScopeExpression" : "ScopeBody");
|
||||||
|
};
|
||||||
|
// FIXME drop these node types in next major version
|
||||||
|
// (They are awkward, and in ES6 every block can be a scope.)
|
||||||
|
base.ScopeBody = function (node, st, c) { return c(node, st, "Statement"); };
|
||||||
|
base.ScopeExpression = function (node, st, c) { return c(node, st, "Expression"); };
|
||||||
|
|
||||||
|
base.Pattern = function (node, st, c) {
|
||||||
|
if (node.type == "Identifier")
|
||||||
|
{ c(node, st, "VariablePattern"); }
|
||||||
|
else if (node.type == "MemberExpression")
|
||||||
|
{ c(node, st, "MemberPattern"); }
|
||||||
|
else
|
||||||
|
{ c(node, st); }
|
||||||
|
};
|
||||||
|
base.VariablePattern = ignore;
|
||||||
|
base.MemberPattern = skipThrough;
|
||||||
|
base.RestElement = function (node, st, c) { return c(node.argument, st, "Pattern"); };
|
||||||
|
base.ArrayPattern = function (node, st, c) {
|
||||||
|
for (var i = 0, list = node.elements; i < list.length; i += 1) {
|
||||||
|
var elt = list[i];
|
||||||
|
|
||||||
|
if (elt) { c(elt, st, "Pattern"); }
|
||||||
|
}
|
||||||
|
};
|
||||||
|
base.ObjectPattern = function (node, st, c) {
|
||||||
|
for (var i = 0, list = node.properties; i < list.length; i += 1)
|
||||||
|
{
|
||||||
|
var prop = list[i];
|
||||||
|
|
||||||
|
c(prop.value, st, "Pattern");
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
base.Expression = skipThrough;
|
||||||
|
base.ThisExpression = base.Super = base.MetaProperty = ignore;
|
||||||
|
base.ArrayExpression = function (node, st, c) {
|
||||||
|
for (var i = 0, list = node.elements; i < list.length; i += 1) {
|
||||||
|
var elt = list[i];
|
||||||
|
|
||||||
|
if (elt) { c(elt, st, "Expression"); }
|
||||||
|
}
|
||||||
|
};
|
||||||
|
base.ObjectExpression = function (node, st, c) {
|
||||||
|
for (var i = 0, list = node.properties; i < list.length; i += 1)
|
||||||
|
{
|
||||||
|
var prop = list[i];
|
||||||
|
|
||||||
|
c(prop, st);
|
||||||
|
}
|
||||||
|
};
|
||||||
|
base.FunctionExpression = base.ArrowFunctionExpression = base.FunctionDeclaration;
|
||||||
|
base.SequenceExpression = base.TemplateLiteral = function (node, st, c) {
|
||||||
|
for (var i = 0, list = node.expressions; i < list.length; i += 1)
|
||||||
|
{
|
||||||
|
var expr = list[i];
|
||||||
|
|
||||||
|
c(expr, st, "Expression");
|
||||||
|
}
|
||||||
|
};
|
||||||
|
base.UnaryExpression = base.UpdateExpression = function (node, st, c) {
|
||||||
|
c(node.argument, st, "Expression");
|
||||||
|
};
|
||||||
|
base.BinaryExpression = base.LogicalExpression = function (node, st, c) {
|
||||||
|
c(node.left, st, "Expression");
|
||||||
|
c(node.right, st, "Expression");
|
||||||
|
};
|
||||||
|
base.AssignmentExpression = base.AssignmentPattern = function (node, st, c) {
|
||||||
|
c(node.left, st, "Pattern");
|
||||||
|
c(node.right, st, "Expression");
|
||||||
|
};
|
||||||
|
base.ConditionalExpression = function (node, st, c) {
|
||||||
|
c(node.test, st, "Expression");
|
||||||
|
c(node.consequent, st, "Expression");
|
||||||
|
c(node.alternate, st, "Expression");
|
||||||
|
};
|
||||||
|
base.NewExpression = base.CallExpression = function (node, st, c) {
|
||||||
|
c(node.callee, st, "Expression");
|
||||||
|
if (node.arguments)
|
||||||
|
{ for (var i = 0, list = node.arguments; i < list.length; i += 1)
|
||||||
|
{
|
||||||
|
var arg = list[i];
|
||||||
|
|
||||||
|
c(arg, st, "Expression");
|
||||||
|
} }
|
||||||
|
};
|
||||||
|
base.MemberExpression = function (node, st, c) {
|
||||||
|
c(node.object, st, "Expression");
|
||||||
|
if (node.computed) { c(node.property, st, "Expression"); }
|
||||||
|
};
|
||||||
|
base.ExportNamedDeclaration = base.ExportDefaultDeclaration = function (node, st, c) {
|
||||||
|
if (node.declaration)
|
||||||
|
{ c(node.declaration, st, node.type == "ExportNamedDeclaration" || node.declaration.id ? "Statement" : "Expression"); }
|
||||||
|
if (node.source) { c(node.source, st, "Expression"); }
|
||||||
|
};
|
||||||
|
base.ExportAllDeclaration = function (node, st, c) {
|
||||||
|
c(node.source, st, "Expression");
|
||||||
|
};
|
||||||
|
base.ImportDeclaration = function (node, st, c) {
|
||||||
|
for (var i = 0, list = node.specifiers; i < list.length; i += 1)
|
||||||
|
{
|
||||||
|
var spec = list[i];
|
||||||
|
|
||||||
|
c(spec, st);
|
||||||
|
}
|
||||||
|
c(node.source, st, "Expression");
|
||||||
|
};
|
||||||
|
base.ImportSpecifier = base.ImportDefaultSpecifier = base.ImportNamespaceSpecifier = base.Identifier = base.Literal = ignore;
|
||||||
|
|
||||||
|
base.TaggedTemplateExpression = function (node, st, c) {
|
||||||
|
c(node.tag, st, "Expression");
|
||||||
|
c(node.quasi, st);
|
||||||
|
};
|
||||||
|
base.ClassDeclaration = base.ClassExpression = function (node, st, c) { return c(node, st, "Class"); };
|
||||||
|
base.Class = function (node, st, c) {
|
||||||
|
if (node.id) { c(node.id, st, "Pattern"); }
|
||||||
|
if (node.superClass) { c(node.superClass, st, "Expression"); }
|
||||||
|
for (var i = 0, list = node.body.body; i < list.length; i += 1)
|
||||||
|
{
|
||||||
|
var item = list[i];
|
||||||
|
|
||||||
|
c(item, st);
|
||||||
|
}
|
||||||
|
};
|
||||||
|
base.MethodDefinition = base.Property = function (node, st, c) {
|
||||||
|
if (node.computed) { c(node.key, st, "Expression"); }
|
||||||
|
c(node.value, st, "Expression");
|
||||||
|
};
|
||||||
|
|
||||||
|
exports.simple = simple;
|
||||||
|
exports.ancestor = ancestor;
|
||||||
|
exports.recursive = recursive;
|
||||||
|
exports.full = full;
|
||||||
|
exports.fullAncestor = fullAncestor;
|
||||||
|
exports.findNodeAt = findNodeAt;
|
||||||
|
exports.findNodeAround = findNodeAround;
|
||||||
|
exports.findNodeAfter = findNodeAfter;
|
||||||
|
exports.findNodeBefore = findNodeBefore;
|
||||||
|
exports.make = make;
|
||||||
|
exports.base = base;
|
||||||
|
|
||||||
|
Object.defineProperty(exports, '__esModule', { value: true });
|
||||||
|
|
||||||
|
})));
|
||||||
52
deps/acorn/package.json
vendored
Normal file
52
deps/acorn/package.json
vendored
Normal file
@ -0,0 +1,52 @@
|
|||||||
|
{
|
||||||
|
"name": "acorn",
|
||||||
|
"description": "ECMAScript parser",
|
||||||
|
"homepage": "https://github.com/ternjs/acorn",
|
||||||
|
"main": "dist/acorn.js",
|
||||||
|
"module": "dist/acorn.es.js",
|
||||||
|
"version": "5.2.1",
|
||||||
|
"engines": {
|
||||||
|
"node": ">=0.4.0"
|
||||||
|
},
|
||||||
|
"maintainers": [
|
||||||
|
{
|
||||||
|
"name": "Marijn Haverbeke",
|
||||||
|
"email": "marijnh@gmail.com",
|
||||||
|
"web": "http://marijnhaverbeke.nl"
|
||||||
|
},
|
||||||
|
{
|
||||||
|
"name": "Ingvar Stepanyan",
|
||||||
|
"email": "me@rreverser.com",
|
||||||
|
"web": "http://rreverser.com/"
|
||||||
|
}
|
||||||
|
],
|
||||||
|
"repository": {
|
||||||
|
"type": "git",
|
||||||
|
"url": "https://github.com/ternjs/acorn.git"
|
||||||
|
},
|
||||||
|
"license": "MIT",
|
||||||
|
"scripts": {
|
||||||
|
"prepare": "npm test",
|
||||||
|
"test": "node test/run.js && node test/lint.js",
|
||||||
|
"pretest": "npm run build:main && npm run build:loose",
|
||||||
|
"build": "npm run build:main && npm run build:walk && npm run build:loose && npm run build:bin",
|
||||||
|
"build:main": "rollup -c rollup/config.main.js",
|
||||||
|
"build:walk": "rollup -c rollup/config.walk.js",
|
||||||
|
"build:loose": "rollup -c rollup/config.loose.js && rollup -c rollup/config.loose_es.js",
|
||||||
|
"build:bin": "rollup -c rollup/config.bin.js",
|
||||||
|
"lint": "eslint src/"
|
||||||
|
},
|
||||||
|
"bin": {
|
||||||
|
"acorn": "./bin/acorn"
|
||||||
|
},
|
||||||
|
"devDependencies": {
|
||||||
|
"eslint": "^3.18.0",
|
||||||
|
"eslint-config-standard": "^7.1.0",
|
||||||
|
"eslint-plugin-import": "^2.2.0",
|
||||||
|
"eslint-plugin-promise": "^3.5.0",
|
||||||
|
"eslint-plugin-standard": "^2.1.1",
|
||||||
|
"rollup": "^0.43.0",
|
||||||
|
"rollup-plugin-buble": "^0.15.0",
|
||||||
|
"unicode-9.0.0": "^0.7.0"
|
||||||
|
}
|
||||||
|
}
|
||||||
2
node.gyp
2
node.gyp
@ -149,6 +149,8 @@
|
|||||||
'deps/node-inspect/lib/_inspect.js',
|
'deps/node-inspect/lib/_inspect.js',
|
||||||
'deps/node-inspect/lib/internal/inspect_client.js',
|
'deps/node-inspect/lib/internal/inspect_client.js',
|
||||||
'deps/node-inspect/lib/internal/inspect_repl.js',
|
'deps/node-inspect/lib/internal/inspect_repl.js',
|
||||||
|
'deps/acorn/dist/acorn.js',
|
||||||
|
'deps/acorn/dist/walk.js',
|
||||||
],
|
],
|
||||||
'conditions': [
|
'conditions': [
|
||||||
[ 'node_shared=="true"', {
|
[ 'node_shared=="true"', {
|
||||||
|
|||||||
@ -29,6 +29,7 @@ fi
|
|||||||
|
|
||||||
|
|
||||||
# Dependencies bundled in distributions
|
# Dependencies bundled in distributions
|
||||||
|
addlicense "Acorn" "deps/acorn" "$(cat ${rootdir}/deps/acorn/LICENSE)"
|
||||||
addlicense "c-ares" "deps/cares" "$(tail -n +3 ${rootdir}/deps/cares/LICENSE.md)"
|
addlicense "c-ares" "deps/cares" "$(tail -n +3 ${rootdir}/deps/cares/LICENSE.md)"
|
||||||
addlicense "HTTP Parser" "deps/http_parser" "$(cat deps/http_parser/LICENSE-MIT)"
|
addlicense "HTTP Parser" "deps/http_parser" "$(cat deps/http_parser/LICENSE-MIT)"
|
||||||
if [ -f "${rootdir}/deps/icu/LICENSE" ]; then
|
if [ -f "${rootdir}/deps/icu/LICENSE" ]; then
|
||||||
|
|||||||
Loading…
x
Reference in New Issue
Block a user