870 lines
31 KiB
Plaintext
870 lines
31 KiB
Plaintext
// A recursive descent parser operates by defining functions for all
|
|
// syntactic elements, and recursively calling those, each function
|
|
// advancing the input stream and returning an AST node. Precedence
|
|
// of constructs (for example, the fact that `!x[1]` means `!(x[1])`
|
|
// instead of `(!x)[1]` is handled by the fact that the parser
|
|
// function that parses unary prefix operators is called first, and
|
|
// in turn calls the function that parses `[]` subscripts — that
|
|
// way, it'll receive the node for `x[1]` already parsed, and wraps
|
|
// *that* in the unary operator node.
|
|
//
|
|
// Acorn uses an [operator precedence parser][opp] to handle binary
|
|
// operator precedence, because it is much more compact than using
|
|
// the technique outlined above, which uses different, nesting
|
|
// functions to specify precedence, for all of the ten binary
|
|
// precedence levels that JavaScript defines.
|
|
//
|
|
// [opp]: http://en.wikipedia.org/wiki/Operator-precedence_parser
|
|
|
|
"use strict";
|
|
|
|
// istanbul ignore next
|
|
|
|
function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; }
|
|
|
|
var _tokenizerTypes = require("../tokenizer/types");
|
|
|
|
var _index = require("./index");
|
|
|
|
var _index2 = _interopRequireDefault(_index);
|
|
|
|
var _utilIdentifier = require("../util/identifier");
|
|
|
|
var pp = _index2["default"].prototype;
|
|
|
|
// Check if property name clashes with already added.
|
|
// Object/class getters and setters are not allowed to clash —
|
|
// either with each other or with an init property — and in
|
|
// strict mode, init properties are also not allowed to be repeated.
|
|
|
|
pp.checkPropClash = function (prop, propHash) {
|
|
if (prop.computed || prop.method || prop.shorthand) return;
|
|
|
|
var key = prop.key,
|
|
name = undefined;
|
|
switch (key.type) {
|
|
case "Identifier":
|
|
name = key.name;break;
|
|
case "Literal":
|
|
name = String(key.value);break;
|
|
default:
|
|
return;
|
|
}
|
|
|
|
var kind = prop.kind;
|
|
if (name === "__proto__" && kind === "init") {
|
|
if (propHash.proto) this.raise(key.start, "Redefinition of __proto__ property");
|
|
propHash.proto = true;
|
|
}
|
|
};
|
|
|
|
// ### Expression parsing
|
|
|
|
// These nest, from the most general expression type at the top to
|
|
// 'atomic', nondivisible expression types at the bottom. Most of
|
|
// the functions will simply let the function (s) below them parse,
|
|
// and, *if* the syntactic construct they handle is present, wrap
|
|
// the AST node that the inner parser gave them in another node.
|
|
|
|
// Parse a full expression. The optional arguments are used to
|
|
// forbid the `in` operator (in for loops initalization expressions)
|
|
// and provide reference for storing '=' operator inside shorthand
|
|
// property assignment in contexts where both object expression
|
|
// and object pattern might appear (so it's possible to raise
|
|
// delayed syntax error at correct position).
|
|
|
|
pp.parseExpression = function (noIn, refShorthandDefaultPos) {
|
|
var startPos = this.state.start,
|
|
startLoc = this.state.startLoc;
|
|
var expr = this.parseMaybeAssign(noIn, refShorthandDefaultPos);
|
|
if (this.match(_tokenizerTypes.types.comma)) {
|
|
var node = this.startNodeAt(startPos, startLoc);
|
|
node.expressions = [expr];
|
|
while (this.eat(_tokenizerTypes.types.comma)) {
|
|
node.expressions.push(this.parseMaybeAssign(noIn, refShorthandDefaultPos));
|
|
}
|
|
this.toReferencedList(node.expressions);
|
|
return this.finishNode(node, "SequenceExpression");
|
|
}
|
|
return expr;
|
|
};
|
|
|
|
// Parse an assignment expression. This includes applications of
|
|
// operators like `+=`.
|
|
|
|
pp.parseMaybeAssign = function (noIn, refShorthandDefaultPos, afterLeftParse) {
|
|
if (this.match(_tokenizerTypes.types._yield) && this.state.inGenerator) {
|
|
return this.parseYield();
|
|
}
|
|
|
|
var failOnShorthandAssign = undefined;
|
|
if (!refShorthandDefaultPos) {
|
|
refShorthandDefaultPos = { start: 0 };
|
|
failOnShorthandAssign = true;
|
|
} else {
|
|
failOnShorthandAssign = false;
|
|
}
|
|
var startPos = this.state.start,
|
|
startLoc = this.state.startLoc;
|
|
if (this.match(_tokenizerTypes.types.parenL) || this.match(_tokenizerTypes.types.name)) {
|
|
this.state.potentialArrowAt = this.state.start;
|
|
}
|
|
var left = this.parseMaybeConditional(noIn, refShorthandDefaultPos);
|
|
if (afterLeftParse) left = afterLeftParse.call(this, left, startPos, startLoc);
|
|
if (this.state.type.isAssign) {
|
|
var node = this.startNodeAt(startPos, startLoc);
|
|
node.operator = this.state.value;
|
|
node.left = this.match(_tokenizerTypes.types.eq) ? this.toAssignable(left) : left;
|
|
refShorthandDefaultPos.start = 0; // reset because shorthand default was used correctly
|
|
this.checkLVal(left);
|
|
if (left.parenthesizedExpression) {
|
|
var errorMsg = undefined;
|
|
if (left.type === "ObjectPattern") {
|
|
errorMsg = "`({a}) = 0` use `({a} = 0)`";
|
|
} else if (left.type === "ArrayPattern") {
|
|
errorMsg = "`([a]) = 0` use `([a] = 0)`";
|
|
}
|
|
if (errorMsg) {
|
|
this.raise(left.start, "You're trying to assign to a parenthesized expression, eg. instead of " + errorMsg);
|
|
}
|
|
}
|
|
this.next();
|
|
node.right = this.parseMaybeAssign(noIn);
|
|
return this.finishNode(node, "AssignmentExpression");
|
|
} else if (failOnShorthandAssign && refShorthandDefaultPos.start) {
|
|
this.unexpected(refShorthandDefaultPos.start);
|
|
}
|
|
return left;
|
|
};
|
|
|
|
// Parse a ternary conditional (`?:`) operator.
|
|
|
|
pp.parseMaybeConditional = function (noIn, refShorthandDefaultPos) {
|
|
var startPos = this.state.start,
|
|
startLoc = this.state.startLoc;
|
|
var expr = this.parseExprOps(noIn, refShorthandDefaultPos);
|
|
if (refShorthandDefaultPos && refShorthandDefaultPos.start) return expr;
|
|
if (this.eat(_tokenizerTypes.types.question)) {
|
|
var node = this.startNodeAt(startPos, startLoc);
|
|
node.test = expr;
|
|
node.consequent = this.parseMaybeAssign();
|
|
this.expect(_tokenizerTypes.types.colon);
|
|
node.alternate = this.parseMaybeAssign(noIn);
|
|
return this.finishNode(node, "ConditionalExpression");
|
|
}
|
|
return expr;
|
|
};
|
|
|
|
// Start the precedence parser.
|
|
|
|
pp.parseExprOps = function (noIn, refShorthandDefaultPos) {
|
|
var startPos = this.state.start,
|
|
startLoc = this.state.startLoc;
|
|
var expr = this.parseMaybeUnary(refShorthandDefaultPos);
|
|
if (refShorthandDefaultPos && refShorthandDefaultPos.start) {
|
|
return expr;
|
|
} else {
|
|
return this.parseExprOp(expr, startPos, startLoc, -1, noIn);
|
|
}
|
|
};
|
|
|
|
// Parse binary operators with the operator precedence parsing
|
|
// algorithm. `left` is the left-hand side of the operator.
|
|
// `minPrec` provides context that allows the function to stop and
|
|
// defer further parser to one of its callers when it encounters an
|
|
// operator that has a lower precedence than the set it is parsing.
|
|
|
|
pp.parseExprOp = function (left, leftStartPos, leftStartLoc, minPrec, noIn) {
|
|
var prec = this.state.type.binop;
|
|
if (prec != null && (!noIn || !this.match(_tokenizerTypes.types._in))) {
|
|
if (prec > minPrec) {
|
|
var node = this.startNodeAt(leftStartPos, leftStartLoc);
|
|
node.left = left;
|
|
node.operator = this.state.value;
|
|
var op = this.state.type;
|
|
this.next();
|
|
var startPos = this.state.start,
|
|
startLoc = this.state.startLoc;
|
|
node.right = this.parseExprOp(this.parseMaybeUnary(), startPos, startLoc, op.rightAssociative ? prec - 1 : prec, noIn);
|
|
this.finishNode(node, op === _tokenizerTypes.types.logicalOR || op === _tokenizerTypes.types.logicalAND ? "LogicalExpression" : "BinaryExpression");
|
|
return this.parseExprOp(node, leftStartPos, leftStartLoc, minPrec, noIn);
|
|
}
|
|
}
|
|
return left;
|
|
};
|
|
|
|
// Parse unary operators, both prefix and postfix.
|
|
|
|
pp.parseMaybeUnary = function (refShorthandDefaultPos) {
|
|
if (this.state.type.prefix) {
|
|
var node = this.startNode(),
|
|
update = this.match(_tokenizerTypes.types.incDec);
|
|
node.operator = this.state.value;
|
|
node.prefix = true;
|
|
this.next();
|
|
node.argument = this.parseMaybeUnary();
|
|
if (refShorthandDefaultPos && refShorthandDefaultPos.start) this.unexpected(refShorthandDefaultPos.start);
|
|
if (update) {
|
|
this.checkLVal(node.argument);
|
|
} else if (this.strict && node.operator === "delete" && node.argument.type === "Identifier") {
|
|
this.raise(node.start, "Deleting local variable in strict mode");
|
|
}
|
|
return this.finishNode(node, update ? "UpdateExpression" : "UnaryExpression");
|
|
}
|
|
|
|
var startPos = this.state.start,
|
|
startLoc = this.state.startLoc;
|
|
var expr = this.parseExprSubscripts(refShorthandDefaultPos);
|
|
if (refShorthandDefaultPos && refShorthandDefaultPos.start) return expr;
|
|
while (this.state.type.postfix && !this.canInsertSemicolon()) {
|
|
var node = this.startNodeAt(startPos, startLoc);
|
|
node.operator = this.state.value;
|
|
node.prefix = false;
|
|
node.argument = expr;
|
|
this.checkLVal(expr);
|
|
this.next();
|
|
expr = this.finishNode(node, "UpdateExpression");
|
|
}
|
|
return expr;
|
|
};
|
|
|
|
// Parse call, dot, and `[]`-subscript expressions.
|
|
|
|
pp.parseExprSubscripts = function (refShorthandDefaultPos) {
|
|
var startPos = this.state.start,
|
|
startLoc = this.state.startLoc;
|
|
var expr = this.parseExprAtom(refShorthandDefaultPos);
|
|
if (refShorthandDefaultPos && refShorthandDefaultPos.start) {
|
|
return expr;
|
|
} else {
|
|
return this.parseSubscripts(expr, startPos, startLoc);
|
|
}
|
|
};
|
|
|
|
pp.parseSubscripts = function (base, startPos, startLoc, noCalls) {
|
|
for (;;) {
|
|
if (!noCalls && this.eat(_tokenizerTypes.types.doubleColon)) {
|
|
var node = this.startNodeAt(startPos, startLoc);
|
|
node.object = base;
|
|
node.callee = this.parseNoCallExpr();
|
|
return this.parseSubscripts(this.finishNode(node, "BindExpression"), startPos, startLoc, noCalls);
|
|
} else if (this.eat(_tokenizerTypes.types.dot)) {
|
|
var node = this.startNodeAt(startPos, startLoc);
|
|
node.object = base;
|
|
node.property = this.parseIdent(true);
|
|
node.computed = false;
|
|
base = this.finishNode(node, "MemberExpression");
|
|
} else if (this.eat(_tokenizerTypes.types.bracketL)) {
|
|
var node = this.startNodeAt(startPos, startLoc);
|
|
node.object = base;
|
|
node.property = this.parseExpression();
|
|
node.computed = true;
|
|
this.expect(_tokenizerTypes.types.bracketR);
|
|
base = this.finishNode(node, "MemberExpression");
|
|
} else if (!noCalls && this.match(_tokenizerTypes.types.parenL)) {
|
|
var possibleAsync = base.type === "Identifier" && base.name === "async" && !this.canInsertSemicolon();
|
|
this.next();
|
|
|
|
var node = this.startNodeAt(startPos, startLoc);
|
|
node.callee = base;
|
|
node.arguments = this.parseExprList(_tokenizerTypes.types.parenR, this.options.features["es7.trailingFunctionCommas"]);
|
|
base = this.finishNode(node, "CallExpression");
|
|
|
|
if (possibleAsync && (this.match(_tokenizerTypes.types.colon) || this.match(_tokenizerTypes.types.arrow))) {
|
|
base = this.parseAsyncArrowFromCallExpression(this.startNodeAt(startPos, startLoc), node);
|
|
} else {
|
|
this.toReferencedList(node.arguments);
|
|
}
|
|
} else if (this.match(_tokenizerTypes.types.backQuote)) {
|
|
var node = this.startNodeAt(startPos, startLoc);
|
|
node.tag = base;
|
|
node.quasi = this.parseTemplate();
|
|
base = this.finishNode(node, "TaggedTemplateExpression");
|
|
} else {
|
|
return base;
|
|
}
|
|
}
|
|
};
|
|
|
|
pp.parseAsyncArrowFromCallExpression = function (node, call) {
|
|
if (!this.options.features["es7.asyncFunctions"]) this.unexpected();
|
|
this.expect(_tokenizerTypes.types.arrow);
|
|
return this.parseArrowExpression(node, call.arguments, true);
|
|
};
|
|
|
|
// Parse a no-call expression (like argument of `new` or `::` operators).
|
|
|
|
pp.parseNoCallExpr = function () {
|
|
var startPos = this.state.start,
|
|
startLoc = this.state.startLoc;
|
|
return this.parseSubscripts(this.parseExprAtom(), startPos, startLoc, true);
|
|
};
|
|
|
|
// Parse an atomic expression — either a single token that is an
|
|
// expression, an expression started by a keyword like `function` or
|
|
// `new`, or an expression wrapped in punctuation like `()`, `[]`,
|
|
// or `{}`.
|
|
|
|
pp.parseExprAtom = function (refShorthandDefaultPos) {
|
|
var node = undefined,
|
|
canBeArrow = this.state.potentialArrowAt === this.state.start;
|
|
switch (this.state.type) {
|
|
case _tokenizerTypes.types._super:
|
|
if (!this.state.inFunction) this.raise(this.state.start, "'super' outside of function or class");
|
|
case _tokenizerTypes.types._this:
|
|
var type = this.match(_tokenizerTypes.types._this) ? "ThisExpression" : "Super";
|
|
node = this.startNode();
|
|
this.next();
|
|
return this.finishNode(node, type);
|
|
|
|
case _tokenizerTypes.types._yield:
|
|
if (this.state.inGenerator) this.unexpected();
|
|
|
|
case _tokenizerTypes.types._do:
|
|
if (this.options.features["es7.doExpressions"]) {
|
|
var _node = this.startNode();
|
|
this.next();
|
|
var oldInFunction = this.state.inFunction;
|
|
var oldLabels = this.state.labels;
|
|
this.state.labels = [];
|
|
this.state.inFunction = false;
|
|
_node.body = this.parseBlock();
|
|
this.state.inFunction = oldInFunction;
|
|
this.state.labels = oldLabels;
|
|
return this.finishNode(_node, "DoExpression");
|
|
}
|
|
|
|
case _tokenizerTypes.types.name:
|
|
node = this.startNode();
|
|
var id = this.parseIdent(true);
|
|
|
|
if (this.options.features["es7.asyncFunctions"]) {
|
|
if (id.name === "await") {
|
|
if (this.inAsync) return this.parseAwait(node);
|
|
} else if (id.name === "async" && this.match(_tokenizerTypes.types._function) && !this.canInsertSemicolon()) {
|
|
this.next();
|
|
return this.parseFunction(node, false, false, true);
|
|
} else if (canBeArrow && id.name === "async" && this.match(_tokenizerTypes.types.name)) {
|
|
var params = [this.parseIdent()];
|
|
this.expect(_tokenizerTypes.types.arrow);
|
|
// var foo = bar => {};
|
|
return this.parseArrowExpression(node, params, true);
|
|
}
|
|
}
|
|
|
|
if (canBeArrow && !this.canInsertSemicolon() && this.eat(_tokenizerTypes.types.arrow)) {
|
|
return this.parseArrowExpression(node, [id]);
|
|
}
|
|
|
|
return id;
|
|
|
|
case _tokenizerTypes.types.regexp:
|
|
var value = this.state.value;
|
|
node = this.parseLiteral(value.value);
|
|
node.regex = { pattern: value.pattern, flags: value.flags };
|
|
return node;
|
|
|
|
case _tokenizerTypes.types.num:case _tokenizerTypes.types.string:
|
|
return this.parseLiteral(this.state.value);
|
|
|
|
case _tokenizerTypes.types._null:case _tokenizerTypes.types._true:case _tokenizerTypes.types._false:
|
|
node = this.startNode();
|
|
node.rawValue = node.value = this.match(_tokenizerTypes.types._null) ? null : this.match(_tokenizerTypes.types._true);
|
|
node.raw = this.state.type.keyword;
|
|
this.next();
|
|
return this.finishNode(node, "Literal");
|
|
|
|
case _tokenizerTypes.types.parenL:
|
|
return this.parseParenAndDistinguishExpression(null, null, canBeArrow);
|
|
|
|
case _tokenizerTypes.types.bracketL:
|
|
node = this.startNode();
|
|
this.next();
|
|
// check whether this is array comprehension or regular array
|
|
if (this.options.features["es7.comprehensions"] && this.match(_tokenizerTypes.types._for)) {
|
|
return this.parseComprehension(node, false);
|
|
}
|
|
node.elements = this.parseExprList(_tokenizerTypes.types.bracketR, true, true, refShorthandDefaultPos);
|
|
this.toReferencedList(node.elements);
|
|
return this.finishNode(node, "ArrayExpression");
|
|
|
|
case _tokenizerTypes.types.braceL:
|
|
return this.parseObj(false, refShorthandDefaultPos);
|
|
|
|
case _tokenizerTypes.types._function:
|
|
node = this.startNode();
|
|
this.next();
|
|
return this.parseFunction(node, false);
|
|
|
|
case _tokenizerTypes.types.at:
|
|
this.parseDecorators();
|
|
|
|
case _tokenizerTypes.types._class:
|
|
node = this.startNode();
|
|
this.takeDecorators(node);
|
|
return this.parseClass(node, false);
|
|
|
|
case _tokenizerTypes.types._new:
|
|
return this.parseNew();
|
|
|
|
case _tokenizerTypes.types.backQuote:
|
|
return this.parseTemplate();
|
|
|
|
case _tokenizerTypes.types.doubleColon:
|
|
node = this.startNode();
|
|
this.next();
|
|
node.object = null;
|
|
var callee = node.callee = this.parseNoCallExpr();
|
|
if (callee.type === "MemberExpression") {
|
|
return this.finishNode(node, "BindExpression");
|
|
} else {
|
|
this.raise(callee.start, "Binding should be performed on object property.");
|
|
}
|
|
|
|
default:
|
|
this.unexpected();
|
|
}
|
|
};
|
|
|
|
pp.parseLiteral = function (value) {
|
|
var node = this.startNode();
|
|
node.rawValue = node.value = value;
|
|
node.raw = this.input.slice(this.state.start, this.state.end);
|
|
this.next();
|
|
return this.finishNode(node, "Literal");
|
|
};
|
|
|
|
pp.parseParenExpression = function () {
|
|
this.expect(_tokenizerTypes.types.parenL);
|
|
var val = this.parseExpression();
|
|
this.expect(_tokenizerTypes.types.parenR);
|
|
return val;
|
|
};
|
|
|
|
pp.parseParenAndDistinguishExpression = function (startPos, startLoc, canBeArrow, isAsync) {
|
|
startPos = startPos || this.state.start;
|
|
startLoc = startLoc || this.state.startLoc;
|
|
var val = undefined;
|
|
this.next();
|
|
|
|
if (this.options.features["es7.comprehensions"] && this.match(_tokenizerTypes.types._for)) {
|
|
return this.parseComprehension(this.startNodeAt(startPos, startLoc), true);
|
|
}
|
|
|
|
var innerStartPos = this.state.start,
|
|
innerStartLoc = this.state.startLoc;
|
|
var exprList = [],
|
|
first = true;
|
|
var refShorthandDefaultPos = { start: 0 },
|
|
spreadStart = undefined,
|
|
innerParenStart = undefined,
|
|
optionalCommaStart = undefined;
|
|
while (!this.match(_tokenizerTypes.types.parenR)) {
|
|
if (first) {
|
|
first = false;
|
|
} else {
|
|
this.expect(_tokenizerTypes.types.comma);
|
|
if (this.match(_tokenizerTypes.types.parenR) && this.options.features["es7.trailingFunctionCommas"]) {
|
|
optionalCommaStart = this.state.start;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (this.match(_tokenizerTypes.types.ellipsis)) {
|
|
var spreadNodeStartPos = this.state.start,
|
|
spreadNodeStartLoc = this.state.startLoc;
|
|
spreadStart = this.state.start;
|
|
exprList.push(this.parseParenItem(this.parseRest(), spreadNodeStartLoc, spreadNodeStartPos));
|
|
break;
|
|
} else {
|
|
if (this.match(_tokenizerTypes.types.parenL) && !innerParenStart) {
|
|
innerParenStart = this.state.start;
|
|
}
|
|
exprList.push(this.parseMaybeAssign(false, refShorthandDefaultPos, this.parseParenItem));
|
|
}
|
|
}
|
|
var innerEndPos = this.state.start;
|
|
var innerEndLoc = this.state.startLoc;
|
|
this.expect(_tokenizerTypes.types.parenR);
|
|
|
|
if (canBeArrow && !this.canInsertSemicolon() && this.eat(_tokenizerTypes.types.arrow)) {
|
|
if (innerParenStart) this.unexpected(innerParenStart);
|
|
return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), exprList, isAsync);
|
|
}
|
|
|
|
if (!exprList.length) {
|
|
if (isAsync) {
|
|
return;
|
|
} else {
|
|
this.unexpected(this.state.lastTokStart);
|
|
}
|
|
}
|
|
if (optionalCommaStart) this.unexpected(optionalCommaStart);
|
|
if (spreadStart) this.unexpected(spreadStart);
|
|
if (refShorthandDefaultPos.start) this.unexpected(refShorthandDefaultPos.start);
|
|
|
|
if (exprList.length > 1) {
|
|
val = this.startNodeAt(innerStartPos, innerStartLoc);
|
|
val.expressions = exprList;
|
|
this.toReferencedList(val.expressions);
|
|
this.finishNodeAt(val, "SequenceExpression", innerEndPos, innerEndLoc);
|
|
} else {
|
|
val = exprList[0];
|
|
}
|
|
|
|
val.parenthesizedExpression = true;
|
|
return val;
|
|
};
|
|
|
|
pp.parseParenItem = function (node) {
|
|
return node;
|
|
};
|
|
|
|
// New's precedence is slightly tricky. It must allow its argument
|
|
// to be a `[]` or dot subscript expression, but not a call — at
|
|
// least, not without wrapping it in parentheses. Thus, it uses the
|
|
|
|
pp.parseNew = function () {
|
|
var node = this.startNode();
|
|
var meta = this.parseIdent(true);
|
|
|
|
if (this.eat(_tokenizerTypes.types.dot)) {
|
|
node.meta = meta;
|
|
node.property = this.parseIdent(true);
|
|
|
|
if (node.property.name !== "target") {
|
|
this.raise(node.property.start, "The only valid meta property for new is new.target");
|
|
}
|
|
|
|
return this.finishNode(node, "MetaProperty");
|
|
}
|
|
|
|
node.callee = this.parseNoCallExpr();
|
|
|
|
if (this.eat(_tokenizerTypes.types.parenL)) {
|
|
node.arguments = this.parseExprList(_tokenizerTypes.types.parenR, this.options.features["es7.trailingFunctionCommas"]);
|
|
this.toReferencedList(node.arguments);
|
|
} else {
|
|
node.arguments = [];
|
|
}
|
|
|
|
return this.finishNode(node, "NewExpression");
|
|
};
|
|
|
|
// Parse template expression.
|
|
|
|
pp.parseTemplateElement = function () {
|
|
var elem = this.startNode();
|
|
elem.value = {
|
|
raw: this.input.slice(this.state.start, this.state.end).replace(/\r\n?/g, "\n"),
|
|
cooked: this.state.value
|
|
};
|
|
this.next();
|
|
elem.tail = this.match(_tokenizerTypes.types.backQuote);
|
|
return this.finishNode(elem, "TemplateElement");
|
|
};
|
|
|
|
pp.parseTemplate = function () {
|
|
var node = this.startNode();
|
|
this.next();
|
|
node.expressions = [];
|
|
var curElt = this.parseTemplateElement();
|
|
node.quasis = [curElt];
|
|
while (!curElt.tail) {
|
|
this.expect(_tokenizerTypes.types.dollarBraceL);
|
|
node.expressions.push(this.parseExpression());
|
|
this.expect(_tokenizerTypes.types.braceR);
|
|
node.quasis.push(curElt = this.parseTemplateElement());
|
|
}
|
|
this.next();
|
|
return this.finishNode(node, "TemplateLiteral");
|
|
};
|
|
|
|
// Parse an object literal or binding pattern.
|
|
|
|
pp.parseObj = function (isPattern, refShorthandDefaultPos) {
|
|
var node = this.startNode(),
|
|
first = true,
|
|
propHash = Object.create(null);
|
|
node.properties = [];
|
|
var decorators = [];
|
|
this.next();
|
|
while (!this.eat(_tokenizerTypes.types.braceR)) {
|
|
if (first) {
|
|
first = false;
|
|
} else {
|
|
this.expect(_tokenizerTypes.types.comma);
|
|
if (this.eat(_tokenizerTypes.types.braceR)) break;
|
|
}
|
|
|
|
while (this.match(_tokenizerTypes.types.at)) {
|
|
decorators.push(this.parseDecorator());
|
|
}
|
|
|
|
var prop = this.startNode(),
|
|
isGenerator = false,
|
|
isAsync = false,
|
|
startPos = undefined,
|
|
startLoc = undefined;
|
|
if (decorators.length) {
|
|
prop.decorators = decorators;
|
|
decorators = [];
|
|
}
|
|
if (this.options.features["es7.objectRestSpread"] && this.match(_tokenizerTypes.types.ellipsis)) {
|
|
prop = this.parseSpread();
|
|
prop.type = "SpreadProperty";
|
|
node.properties.push(prop);
|
|
continue;
|
|
}
|
|
prop.method = false;
|
|
prop.shorthand = false;
|
|
if (isPattern || refShorthandDefaultPos) {
|
|
startPos = this.state.start;
|
|
startLoc = this.state.startLoc;
|
|
}
|
|
if (!isPattern) {
|
|
isGenerator = this.eat(_tokenizerTypes.types.star);
|
|
}
|
|
if (!isPattern && this.options.features["es7.asyncFunctions"] && this.isContextual("async")) {
|
|
if (isGenerator) this.unexpected();
|
|
var asyncId = this.parseIdent();
|
|
if (this.match(_tokenizerTypes.types.colon) || this.match(_tokenizerTypes.types.parenL) || this.match(_tokenizerTypes.types.braceR)) {
|
|
prop.key = asyncId;
|
|
} else {
|
|
isAsync = true;
|
|
this.parsePropertyName(prop);
|
|
}
|
|
} else {
|
|
this.parsePropertyName(prop);
|
|
}
|
|
this.parseObjPropValue(prop, startPos, startLoc, isGenerator, isAsync, isPattern, refShorthandDefaultPos);
|
|
this.checkPropClash(prop, propHash);
|
|
node.properties.push(this.finishNode(prop, "Property"));
|
|
}
|
|
if (decorators.length) {
|
|
this.raise(this.state.start, "You have trailing decorators with no property");
|
|
}
|
|
return this.finishNode(node, isPattern ? "ObjectPattern" : "ObjectExpression");
|
|
};
|
|
|
|
pp.parseObjPropValue = function (prop, startPos, startLoc, isGenerator, isAsync, isPattern, refShorthandDefaultPos) {
|
|
if (this.eat(_tokenizerTypes.types.colon)) {
|
|
prop.value = isPattern ? this.parseMaybeDefault(this.state.start, this.state.startLoc) : this.parseMaybeAssign(false, refShorthandDefaultPos);
|
|
prop.kind = "init";
|
|
} else if (this.match(_tokenizerTypes.types.parenL)) {
|
|
if (isPattern) this.unexpected();
|
|
prop.kind = "init";
|
|
prop.method = true;
|
|
prop.value = this.parseMethod(isGenerator, isAsync);
|
|
} else if (!prop.computed && prop.key.type === "Identifier" && (prop.key.name === "get" || prop.key.name === "set") && !this.match(_tokenizerTypes.types.comma) && !this.match(_tokenizerTypes.types.braceR)) {
|
|
if (isGenerator || isAsync || isPattern) this.unexpected();
|
|
prop.kind = prop.key.name;
|
|
this.parsePropertyName(prop);
|
|
prop.value = this.parseMethod(false);
|
|
var paramCount = prop.kind === "get" ? 0 : 1;
|
|
if (prop.value.params.length !== paramCount) {
|
|
var start = prop.value.start;
|
|
if (prop.kind === "get") this.raise(start, "getter should have no params");else this.raise(start, "setter should have exactly one param");
|
|
}
|
|
} else if (!prop.computed && prop.key.type === "Identifier") {
|
|
prop.kind = "init";
|
|
if (isPattern) {
|
|
if (this.isKeyword(prop.key.name) || this.strict && (_utilIdentifier.reservedWords.strictBind(prop.key.name) || _utilIdentifier.reservedWords.strict(prop.key.name)) || !this.options.allowReserved && this.isReservedWord(prop.key.name)) this.raise(prop.key.start, "Binding " + prop.key.name);
|
|
prop.value = this.parseMaybeDefault(startPos, startLoc, prop.key.__clone());
|
|
} else if (this.match(_tokenizerTypes.types.eq) && refShorthandDefaultPos) {
|
|
if (!refShorthandDefaultPos.start) refShorthandDefaultPos.start = this.state.start;
|
|
prop.value = this.parseMaybeDefault(startPos, startLoc, prop.key.__clone());
|
|
} else {
|
|
prop.value = prop.key.__clone();
|
|
}
|
|
prop.shorthand = true;
|
|
} else {
|
|
this.unexpected();
|
|
}
|
|
};
|
|
|
|
pp.parsePropertyName = function (prop) {
|
|
if (this.eat(_tokenizerTypes.types.bracketL)) {
|
|
prop.computed = true;
|
|
prop.key = this.parseMaybeAssign();
|
|
this.expect(_tokenizerTypes.types.bracketR);
|
|
return prop.key;
|
|
} else {
|
|
prop.computed = false;
|
|
return prop.key = this.match(_tokenizerTypes.types.num) || this.match(_tokenizerTypes.types.string) ? this.parseExprAtom() : this.parseIdent(true);
|
|
}
|
|
};
|
|
|
|
// Initialize empty function node.
|
|
|
|
pp.initFunction = function (node, isAsync) {
|
|
node.id = null;
|
|
node.generator = false;
|
|
node.expression = false;
|
|
if (this.options.features["es7.asyncFunctions"]) {
|
|
node.async = !!isAsync;
|
|
}
|
|
};
|
|
|
|
// Parse object or class method.
|
|
|
|
pp.parseMethod = function (isGenerator, isAsync) {
|
|
var node = this.startNode();
|
|
this.initFunction(node, isAsync);
|
|
this.expect(_tokenizerTypes.types.parenL);
|
|
node.params = this.parseBindingList(_tokenizerTypes.types.parenR, false, this.options.features["es7.trailingFunctionCommas"]);
|
|
node.generator = isGenerator;
|
|
this.parseFunctionBody(node);
|
|
return this.finishNode(node, "FunctionExpression");
|
|
};
|
|
|
|
// Parse arrow function expression with given parameters.
|
|
|
|
pp.parseArrowExpression = function (node, params, isAsync) {
|
|
this.initFunction(node, isAsync);
|
|
node.params = this.toAssignableList(params, true);
|
|
this.parseFunctionBody(node, true);
|
|
return this.finishNode(node, "ArrowFunctionExpression");
|
|
};
|
|
|
|
// Parse function body and check parameters.
|
|
|
|
pp.parseFunctionBody = function (node, allowExpression) {
|
|
var isExpression = allowExpression && !this.match(_tokenizerTypes.types.braceL);
|
|
|
|
var oldInAsync = this.inAsync;
|
|
this.inAsync = node.async;
|
|
if (isExpression) {
|
|
node.body = this.parseMaybeAssign();
|
|
node.expression = true;
|
|
} else {
|
|
// Start a new scope with regard to labels and the `inFunction`
|
|
// flag (restore them to their old value afterwards).
|
|
var oldInFunc = this.state.inFunction,
|
|
oldInGen = this.state.inGenerator,
|
|
oldLabels = this.state.labels;
|
|
this.state.inFunction = true;this.state.inGenerator = node.generator;this.state.labels = [];
|
|
node.body = this.parseBlock(true);
|
|
node.expression = false;
|
|
this.state.inFunction = oldInFunc;this.state.inGenerator = oldInGen;this.state.labels = oldLabels;
|
|
}
|
|
this.inAsync = oldInAsync;
|
|
|
|
// If this is a strict mode function, verify that argument names
|
|
// are not repeated, and it does not try to bind the words `eval`
|
|
// or `arguments`.
|
|
if (this.strict || !isExpression && node.body.body.length && this.isUseStrict(node.body.body[0])) {
|
|
var nameHash = Object.create(null),
|
|
oldStrict = this.strict;
|
|
this.strict = true;
|
|
if (node.id) {
|
|
this.checkLVal(node.id, true);
|
|
}
|
|
var _arr = node.params;
|
|
for (var _i = 0; _i < _arr.length; _i++) {
|
|
var param = _arr[_i];
|
|
this.checkLVal(param, true, nameHash);
|
|
}
|
|
this.strict = oldStrict;
|
|
}
|
|
};
|
|
|
|
// Parses a comma-separated list of expressions, and returns them as
|
|
// an array. `close` is the token type that ends the list, and
|
|
// `allowEmpty` can be turned on to allow subsequent commas with
|
|
// nothing in between them to be parsed as `null` (which is needed
|
|
// for array literals).
|
|
|
|
pp.parseExprList = function (close, allowTrailingComma, allowEmpty, refShorthandDefaultPos) {
|
|
var elts = [],
|
|
first = true;
|
|
while (!this.eat(close)) {
|
|
if (first) {
|
|
first = false;
|
|
} else {
|
|
this.expect(_tokenizerTypes.types.comma);
|
|
if (allowTrailingComma && this.eat(close)) break;
|
|
}
|
|
|
|
elts.push(this.parseExprListItem(allowEmpty, refShorthandDefaultPos));
|
|
}
|
|
return elts;
|
|
};
|
|
|
|
pp.parseExprListItem = function (allowEmpty, refShorthandDefaultPos) {
|
|
var elt = undefined;
|
|
if (allowEmpty && this.match(_tokenizerTypes.types.comma)) {
|
|
elt = null;
|
|
} else if (this.match(_tokenizerTypes.types.ellipsis)) {
|
|
elt = this.parseSpread(refShorthandDefaultPos);
|
|
} else {
|
|
elt = this.parseMaybeAssign(false, refShorthandDefaultPos);
|
|
}
|
|
return elt;
|
|
};
|
|
|
|
// Parse the next token as an identifier. If `liberal` is true (used
|
|
// when parsing properties), it will also convert keywords into
|
|
// identifiers.
|
|
|
|
pp.parseIdent = function (liberal) {
|
|
var node = this.startNode();
|
|
if (this.match(_tokenizerTypes.types.name)) {
|
|
if (!liberal && (!this.options.allowReserved && this.isReservedWord(this.state.value) || this.strict && _utilIdentifier.reservedWords.strict(this.state.value))) this.raise(this.state.start, "The keyword '" + this.state.value + "' is reserved");
|
|
node.name = this.state.value;
|
|
} else if (liberal && this.state.type.keyword) {
|
|
node.name = this.state.type.keyword;
|
|
} else {
|
|
this.unexpected();
|
|
}
|
|
this.next();
|
|
return this.finishNode(node, "Identifier");
|
|
};
|
|
|
|
// Parses await expression inside async function.
|
|
|
|
pp.parseAwait = function (node) {
|
|
if (this.eat(_tokenizerTypes.types.semi) || this.canInsertSemicolon()) {
|
|
this.unexpected();
|
|
}
|
|
node.all = this.eat(_tokenizerTypes.types.star);
|
|
node.argument = this.parseMaybeUnary();
|
|
return this.finishNode(node, "AwaitExpression");
|
|
};
|
|
|
|
// Parses yield expression inside generator.
|
|
|
|
pp.parseYield = function () {
|
|
var node = this.startNode();
|
|
this.next();
|
|
if (this.match(_tokenizerTypes.types.semi) || this.canInsertSemicolon() || !this.match(_tokenizerTypes.types.star) && !this.state.type.startsExpr) {
|
|
node.delegate = false;
|
|
node.argument = null;
|
|
} else {
|
|
node.delegate = this.eat(_tokenizerTypes.types.star);
|
|
node.argument = this.parseMaybeAssign();
|
|
}
|
|
return this.finishNode(node, "YieldExpression");
|
|
};
|
|
|
|
// Parses array and generator comprehensions.
|
|
|
|
pp.parseComprehension = function (node, isGenerator) {
|
|
node.blocks = [];
|
|
while (this.match(_tokenizerTypes.types._for)) {
|
|
var block = this.startNode();
|
|
this.next();
|
|
this.expect(_tokenizerTypes.types.parenL);
|
|
block.left = this.parseBindingAtom();
|
|
this.checkLVal(block.left, true);
|
|
this.expectContextual("of");
|
|
block.right = this.parseExpression();
|
|
this.expect(_tokenizerTypes.types.parenR);
|
|
node.blocks.push(this.finishNode(block, "ComprehensionBlock"));
|
|
}
|
|
node.filter = this.eat(_tokenizerTypes.types._if) ? this.parseParenExpression() : null;
|
|
node.body = this.parseExpression();
|
|
this.expect(isGenerator ? _tokenizerTypes.types.parenR : _tokenizerTypes.types.bracketR);
|
|
node.generator = isGenerator;
|
|
return this.finishNode(node, "ComprehensionExpression");
|
|
}; |