use only jshint in javascript worker
This commit is contained in:
nightwing
parent
ec524419ce
commit
5016cc3305
8 changed files with 126 additions and 9817 deletions
|
|
@ -123,25 +123,9 @@ oop.inherits(Mode, TextMode);
|
||||||
this.createWorker = function(session) {
|
this.createWorker = function(session) {
|
||||||
var worker = new WorkerClient(["ace"], "ace/mode/javascript_worker", "JavaScriptWorker");
|
var worker = new WorkerClient(["ace"], "ace/mode/javascript_worker", "JavaScriptWorker");
|
||||||
worker.attachToDocument(session.getDocument());
|
worker.attachToDocument(session.getDocument());
|
||||||
|
|
||||||
worker.on("jslint", function(results) {
|
worker.on("jslint", function(results) {
|
||||||
var errors = [];
|
session.setAnnotations(results.data);
|
||||||
for (var i=0; i<results.data.length; i++) {
|
|
||||||
var error = results.data[i];
|
|
||||||
if (error)
|
|
||||||
errors.push({
|
|
||||||
row: error.line-1,
|
|
||||||
column: error.character-1,
|
|
||||||
text: error.reason,
|
|
||||||
type: "warning",
|
|
||||||
lint: error
|
|
||||||
});
|
|
||||||
}
|
|
||||||
session.setAnnotations(errors);
|
|
||||||
});
|
|
||||||
|
|
||||||
worker.on("narcissus", function(e) {
|
|
||||||
session.setAnnotations([e.data]);
|
|
||||||
});
|
});
|
||||||
|
|
||||||
worker.on("terminate", function() {
|
worker.on("terminate", function() {
|
||||||
|
|
|
||||||
|
|
@ -27,55 +27,148 @@
|
||||||
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||||
*
|
*
|
||||||
* ***** END LICENSE BLOCK ***** */
|
* ***** END LICENSE BLOCK ***** */
|
||||||
|
|
||||||
define(function(require, exports, module) {
|
define(function(require, exports, module) {
|
||||||
"use strict";
|
"use strict";
|
||||||
|
|
||||||
var oop = require("../lib/oop");
|
var oop = require("../lib/oop");
|
||||||
var Mirror = require("../worker/mirror").Mirror;
|
var Mirror = require("../worker/mirror").Mirror;
|
||||||
var lint = require("../worker/jshint").JSHINT;
|
var lint = require("./javascript/jshint").JSHINT;
|
||||||
var parser = require("../narcissus/parser");
|
|
||||||
|
function startRegex(arr) {
|
||||||
|
return RegExp("^(" + arr.join("|") + ")");
|
||||||
|
}
|
||||||
|
|
||||||
|
var disabledWarningsRe = startRegex([
|
||||||
|
"Bad for in variable '(.+)'.",
|
||||||
|
'Missing "use strict"'
|
||||||
|
]);
|
||||||
|
var errorsRe = startRegex([
|
||||||
|
"Unexpected",
|
||||||
|
"Expected ",
|
||||||
|
"Confusing (plus|minus)",
|
||||||
|
"{a} unterminated regular expression",
|
||||||
|
"Unclosed ",
|
||||||
|
"Unmatched ",
|
||||||
|
"Unbegun comment",
|
||||||
|
"Bad invocation",
|
||||||
|
"Missing space after",
|
||||||
|
"Missing operator at"
|
||||||
|
]);
|
||||||
|
var infoRe = startRegex([
|
||||||
|
"Expected an assignment",
|
||||||
|
"Bad escapement of EOL",
|
||||||
|
"Unexpected comma",
|
||||||
|
"Unexpected space",
|
||||||
|
"Missing radix parameter.",
|
||||||
|
]);
|
||||||
|
|
||||||
var JavaScriptWorker = exports.JavaScriptWorker = function(sender) {
|
var JavaScriptWorker = exports.JavaScriptWorker = function(sender) {
|
||||||
Mirror.call(this, sender);
|
Mirror.call(this, sender);
|
||||||
this.setTimeout(500);
|
this.setTimeout(500);
|
||||||
|
this.setOptions();
|
||||||
};
|
};
|
||||||
|
|
||||||
oop.inherits(JavaScriptWorker, Mirror);
|
oop.inherits(JavaScriptWorker, Mirror);
|
||||||
|
|
||||||
(function() {
|
(function() {
|
||||||
|
this.setOptions = function(options) {
|
||||||
|
this.options = options || {
|
||||||
|
// undef: true,
|
||||||
|
// unused: true,
|
||||||
|
devel: true,
|
||||||
|
browser: true,
|
||||||
|
node: true,
|
||||||
|
laxcomma: true,
|
||||||
|
laxbreak: true,
|
||||||
|
onevar: false,
|
||||||
|
passfail: false,
|
||||||
|
maxerr: 100,
|
||||||
|
expr: true
|
||||||
|
};
|
||||||
|
this.doc.getValue() && this.deferredUpdate.schedule(100);
|
||||||
|
};
|
||||||
|
|
||||||
|
this.changeOptions = function(newOptions) {
|
||||||
|
oop.mixin(this.options, newOptions);
|
||||||
|
this.doc.getValue() && this.deferredUpdate.schedule(100);
|
||||||
|
};
|
||||||
|
|
||||||
this.onUpdate = function() {
|
this.onUpdate = function() {
|
||||||
var value = this.doc.getValue();
|
var value = this.doc.getValue();
|
||||||
value = value.replace(/^#!.*\n/, "\n");
|
value = value.replace(/^#!.*\n/, "\n");
|
||||||
|
if (!value) {
|
||||||
// var start = new Date();
|
this.sender.emit("jslint", []);
|
||||||
try {
|
|
||||||
parser.parse(value);
|
|
||||||
} catch(e) {
|
|
||||||
// console.log("narcissus")
|
|
||||||
// console.log(e);
|
|
||||||
var chunks = e.message.split(":")
|
|
||||||
var message = chunks.pop().trim();
|
|
||||||
var lineNumber = parseInt(chunks.pop().trim()) - 1;
|
|
||||||
this.sender.emit("narcissus", {
|
|
||||||
row: lineNumber,
|
|
||||||
column: null, // TODO convert e.cursor
|
|
||||||
text: message,
|
|
||||||
type: "error"
|
|
||||||
});
|
|
||||||
return;
|
return;
|
||||||
} finally {
|
|
||||||
// console.log("parse time: " + (new Date() - start));
|
|
||||||
}
|
}
|
||||||
|
var errors = [];
|
||||||
// var start = new Date();
|
var ranges = [];
|
||||||
// console.log("jslint")
|
|
||||||
lint(value, {undef: false, onevar: false, passfail: false});
|
// jshint reports many false errors
|
||||||
this.sender.emit("jslint", lint.errors);
|
// report them as error only if code is actually invalid
|
||||||
// console.log("lint time: " + (new Date() - start));
|
var maxErrorLevel = "warning";
|
||||||
}
|
try {
|
||||||
|
eval("throw 0;" + value);
|
||||||
|
} catch(e) {
|
||||||
|
if (e != 0) {
|
||||||
|
errors.push({
|
||||||
|
row: e.lineNumber,
|
||||||
|
type: "error",
|
||||||
|
text: e.message
|
||||||
|
});
|
||||||
|
maxErrorLevel = "error";
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// var start = new Date();
|
||||||
|
lint(value, this.options);
|
||||||
|
var results = lint.errors;
|
||||||
|
|
||||||
|
var errorAdded = false
|
||||||
|
for (var i = 0; i < results.length; i++) {
|
||||||
|
var error = results[i];
|
||||||
|
if (!error)
|
||||||
|
continue;
|
||||||
|
var raw = error.raw;
|
||||||
|
var type = "warning";
|
||||||
|
|
||||||
|
if (raw == "Missing semicolon.") {
|
||||||
|
type = "info";
|
||||||
|
}
|
||||||
|
else if (disabledWarningsRe.test(raw)) {
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
else if (infoRe.test(raw)) {
|
||||||
|
type = "info"
|
||||||
|
}
|
||||||
|
else if (errorsRe.test(raw)) {
|
||||||
|
errorAdded = true;
|
||||||
|
type = maxErrorLevel;
|
||||||
|
}
|
||||||
|
else if (raw == "'{a}' is not defined.") {
|
||||||
|
type = "warning";
|
||||||
|
}
|
||||||
|
else if (raw == "'{a}' is defined but never used.") {
|
||||||
|
type = "info";
|
||||||
|
}
|
||||||
|
|
||||||
|
errors.push({
|
||||||
|
row: error.line-1,
|
||||||
|
column: error.character-1,
|
||||||
|
text: error.reason,
|
||||||
|
type: type,
|
||||||
|
raw: raw
|
||||||
|
});
|
||||||
|
|
||||||
|
if (errorAdded) {
|
||||||
|
// break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
// console.log("lint time: " + (new Date() - start));
|
||||||
|
|
||||||
|
this.sender.emit("jslint", errors);
|
||||||
|
};
|
||||||
|
|
||||||
}).call(JavaScriptWorker.prototype);
|
}).call(JavaScriptWorker.prototype);
|
||||||
|
|
||||||
});
|
});
|
||||||
|
|
|
||||||
|
|
@ -1,683 +0,0 @@
|
||||||
/* ***** BEGIN LICENSE BLOCK *****
|
|
||||||
* Distributed under the BSD license:
|
|
||||||
*
|
|
||||||
* Copyright (c) 2010, Ajax.org B.V.
|
|
||||||
* All rights reserved.
|
|
||||||
*
|
|
||||||
* Redistribution and use in source and binary forms, with or without
|
|
||||||
* modification, are permitted provided that the following conditions are met:
|
|
||||||
* * Redistributions of source code must retain the above copyright
|
|
||||||
* notice, this list of conditions and the following disclaimer.
|
|
||||||
* * Redistributions in binary form must reproduce the above copyright
|
|
||||||
* notice, this list of conditions and the following disclaimer in the
|
|
||||||
* documentation and/or other materials provided with the distribution.
|
|
||||||
* * Neither the name of Ajax.org B.V. nor the
|
|
||||||
* names of its contributors may be used to endorse or promote products
|
|
||||||
* derived from this software without specific prior written permission.
|
|
||||||
*
|
|
||||||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
|
||||||
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
||||||
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
||||||
* DISCLAIMED. IN NO EVENT SHALL AJAX.ORG B.V. BE LIABLE FOR ANY
|
|
||||||
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|
||||||
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
||||||
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
|
||||||
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
||||||
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
||||||
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
||||||
*
|
|
||||||
* ***** END LICENSE BLOCK ***** */
|
|
||||||
|
|
||||||
/*
|
|
||||||
* Narcissus - JS implemented in JS.
|
|
||||||
*
|
|
||||||
* Well-known constants and lookup tables. Many consts are generated from the
|
|
||||||
* tokens table via eval to minimize redundancy, so consumers must be compiled
|
|
||||||
* separately to take advantage of the simple switch-case constant propagation
|
|
||||||
* done by SpiderMonkey.
|
|
||||||
*/
|
|
||||||
|
|
||||||
define(function(require, exports, module) {
|
|
||||||
|
|
||||||
var tokens = [
|
|
||||||
// End of source.
|
|
||||||
"END",
|
|
||||||
|
|
||||||
// Operators and punctuators. Some pair-wise order matters, e.g. (+, -)
|
|
||||||
// and (UNARY_PLUS, UNARY_MINUS).
|
|
||||||
"\n", ";",
|
|
||||||
",",
|
|
||||||
"=",
|
|
||||||
"?", ":", "CONDITIONAL",
|
|
||||||
"||",
|
|
||||||
"&&",
|
|
||||||
"|",
|
|
||||||
"^",
|
|
||||||
"&",
|
|
||||||
"==", "!=", "===", "!==",
|
|
||||||
"<", "<=", ">=", ">",
|
|
||||||
"<<", ">>", ">>>",
|
|
||||||
"+", "-",
|
|
||||||
"*", "/", "%",
|
|
||||||
"!", "~", "UNARY_PLUS", "UNARY_MINUS",
|
|
||||||
"++", "--",
|
|
||||||
".",
|
|
||||||
"[", "]",
|
|
||||||
"{", "}",
|
|
||||||
"(", ")",
|
|
||||||
|
|
||||||
// Nonterminal tree node type codes.
|
|
||||||
"SCRIPT", "BLOCK", "LABEL", "FOR_IN", "CALL", "NEW_WITH_ARGS", "INDEX",
|
|
||||||
"ARRAY_INIT", "OBJECT_INIT", "PROPERTY_INIT", "GETTER", "SETTER",
|
|
||||||
"GROUP", "LIST", "LET_BLOCK", "ARRAY_COMP", "GENERATOR", "COMP_TAIL",
|
|
||||||
|
|
||||||
// Contextual keywords.
|
|
||||||
"IMPLEMENTS", "INTERFACE", "LET", "MODULE", "PACKAGE", "PRIVATE",
|
|
||||||
"PROTECTED", "PUBLIC", "STATIC", "USE", "YIELD",
|
|
||||||
|
|
||||||
// Terminals.
|
|
||||||
"IDENTIFIER", "NUMBER", "STRING", "REGEXP",
|
|
||||||
|
|
||||||
// Keywords.
|
|
||||||
"break",
|
|
||||||
"case", "catch", "const", "continue",
|
|
||||||
"debugger", "default", "delete", "do",
|
|
||||||
"else", "export",
|
|
||||||
"false", "finally", "for", "function",
|
|
||||||
"if", "import", "in", "instanceof",
|
|
||||||
"new", "null",
|
|
||||||
"return",
|
|
||||||
"switch",
|
|
||||||
"this", "throw", "true", "try", "typeof",
|
|
||||||
"var", "void",
|
|
||||||
"while", "with",
|
|
||||||
];
|
|
||||||
|
|
||||||
var strictKeywords = {
|
|
||||||
__proto__: null,
|
|
||||||
"implements": true,
|
|
||||||
"interface": true,
|
|
||||||
"let": true,
|
|
||||||
//"module": true,
|
|
||||||
"package": true,
|
|
||||||
"private": true,
|
|
||||||
"protected": true,
|
|
||||||
"public": true,
|
|
||||||
"static": true,
|
|
||||||
"use": true,
|
|
||||||
"yield": true
|
|
||||||
};
|
|
||||||
|
|
||||||
var statementStartTokens = [
|
|
||||||
"break",
|
|
||||||
"const", "continue",
|
|
||||||
"debugger", "do",
|
|
||||||
"for",
|
|
||||||
"if",
|
|
||||||
"let",
|
|
||||||
"return",
|
|
||||||
"switch",
|
|
||||||
"throw", "try",
|
|
||||||
"var",
|
|
||||||
"yield",
|
|
||||||
"while", "with",
|
|
||||||
];
|
|
||||||
|
|
||||||
// Whitespace characters (see ECMA-262 7.2)
|
|
||||||
var whitespaceChars = [
|
|
||||||
// normal whitespace:
|
|
||||||
"\u0009", "\u000B", "\u000C", "\u0020", "\u00A0", "\uFEFF",
|
|
||||||
|
|
||||||
// high-Unicode whitespace:
|
|
||||||
"\u1680", "\u180E",
|
|
||||||
"\u2000", "\u2001", "\u2002", "\u2003", "\u2004", "\u2005", "\u2006",
|
|
||||||
"\u2007", "\u2008", "\u2009", "\u200A",
|
|
||||||
"\u202F", "\u205F", "\u3000"
|
|
||||||
];
|
|
||||||
|
|
||||||
var whitespace = {};
|
|
||||||
for (var i = 0; i < whitespaceChars.length; i++) {
|
|
||||||
whitespace[whitespaceChars[i]] = true;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Operator and punctuator mapping from token to tree node type name.
|
|
||||||
// NB: because the lexer doesn't backtrack, all token prefixes must themselves
|
|
||||||
// be valid tokens (e.g. !== is acceptable because its prefixes are the valid
|
|
||||||
// tokens != and !).
|
|
||||||
var opTypeNames = {
|
|
||||||
'\n': "NEWLINE",
|
|
||||||
';': "SEMICOLON",
|
|
||||||
',': "COMMA",
|
|
||||||
'?': "HOOK",
|
|
||||||
':': "COLON",
|
|
||||||
'||': "OR",
|
|
||||||
'&&': "AND",
|
|
||||||
'|': "BITWISE_OR",
|
|
||||||
'^': "BITWISE_XOR",
|
|
||||||
'&': "BITWISE_AND",
|
|
||||||
'===': "STRICT_EQ",
|
|
||||||
'==': "EQ",
|
|
||||||
'=': "ASSIGN",
|
|
||||||
'!==': "STRICT_NE",
|
|
||||||
'!=': "NE",
|
|
||||||
'<<': "LSH",
|
|
||||||
'<=': "LE",
|
|
||||||
'<': "LT",
|
|
||||||
'>>>': "URSH",
|
|
||||||
'>>': "RSH",
|
|
||||||
'>=': "GE",
|
|
||||||
'>': "GT",
|
|
||||||
'++': "INCREMENT",
|
|
||||||
'--': "DECREMENT",
|
|
||||||
'+': "PLUS",
|
|
||||||
'-': "MINUS",
|
|
||||||
'*': "MUL",
|
|
||||||
'/': "DIV",
|
|
||||||
'%': "MOD",
|
|
||||||
'!': "NOT",
|
|
||||||
'~': "BITWISE_NOT",
|
|
||||||
'.': "DOT",
|
|
||||||
'[': "LEFT_BRACKET",
|
|
||||||
']': "RIGHT_BRACKET",
|
|
||||||
'{': "LEFT_CURLY",
|
|
||||||
'}': "RIGHT_CURLY",
|
|
||||||
'(': "LEFT_PAREN",
|
|
||||||
')': "RIGHT_PAREN"
|
|
||||||
};
|
|
||||||
|
|
||||||
// Hash of keyword identifier to tokens index. NB: we must null __proto__ to
|
|
||||||
// avoid toString, etc. namespace pollution.
|
|
||||||
var keywords = {__proto__: null};
|
|
||||||
var mozillaKeywords = {__proto__: null};
|
|
||||||
|
|
||||||
// Define const END, etc., based on the token names. Also map name to index.
|
|
||||||
var tokenIds = {};
|
|
||||||
|
|
||||||
var hostSupportsEvalConst = (function() {
|
|
||||||
try {
|
|
||||||
return eval("(function(s) { eval(s); return x })('const x = true;')");
|
|
||||||
} catch (e) {
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
})();
|
|
||||||
|
|
||||||
// Building up a string to be eval'd in different contexts.
|
|
||||||
var consts = hostSupportsEvalConst ? "const " : "var ";
|
|
||||||
for (var i = 0, j = tokens.length; i < j; i++) {
|
|
||||||
if (i > 0)
|
|
||||||
consts += ", ";
|
|
||||||
var t = tokens[i];
|
|
||||||
var name;
|
|
||||||
if (/^[a-z]/.test(t)) {
|
|
||||||
name = t.toUpperCase();
|
|
||||||
if (name === "LET" || name === "YIELD")
|
|
||||||
mozillaKeywords[name] = i;
|
|
||||||
if (strictKeywords[name])
|
|
||||||
strictKeywords[name] = i;
|
|
||||||
keywords[t] = i;
|
|
||||||
} else {
|
|
||||||
name = (/^\W/.test(t) ? opTypeNames[t] : t);
|
|
||||||
}
|
|
||||||
consts += name + " = " + i;
|
|
||||||
tokenIds[name] = i;
|
|
||||||
tokens[t] = i;
|
|
||||||
}
|
|
||||||
consts += ";";
|
|
||||||
|
|
||||||
var isStatementStartCode = {__proto__: null};
|
|
||||||
for (i = 0, j = statementStartTokens.length; i < j; i++)
|
|
||||||
isStatementStartCode[keywords[statementStartTokens[i]]] = true;
|
|
||||||
|
|
||||||
// Map assignment operators to their indexes in the tokens array.
|
|
||||||
var assignOps = ['|', '^', '&', '<<', '>>', '>>>', '+', '-', '*', '/', '%'];
|
|
||||||
|
|
||||||
for (i = 0, j = assignOps.length; i < j; i++) {
|
|
||||||
t = assignOps[i];
|
|
||||||
assignOps[t] = tokens[t];
|
|
||||||
}
|
|
||||||
|
|
||||||
function defineGetter(obj, prop, fn, dontDelete, dontEnum) {
|
|
||||||
Object.defineProperty(obj, prop,
|
|
||||||
{ get: fn, configurable: !dontDelete, enumerable: !dontEnum });
|
|
||||||
}
|
|
||||||
|
|
||||||
function defineGetterSetter(obj, prop, getter, setter, dontDelete, dontEnum) {
|
|
||||||
Object.defineProperty(obj, prop, {
|
|
||||||
get: getter,
|
|
||||||
set: setter,
|
|
||||||
configurable: !dontDelete,
|
|
||||||
enumerable: !dontEnum
|
|
||||||
});
|
|
||||||
}
|
|
||||||
|
|
||||||
function defineMemoGetter(obj, prop, fn, dontDelete, dontEnum) {
|
|
||||||
Object.defineProperty(obj, prop, {
|
|
||||||
get: function() {
|
|
||||||
var val = fn();
|
|
||||||
defineProperty(obj, prop, val, dontDelete, true, dontEnum);
|
|
||||||
return val;
|
|
||||||
},
|
|
||||||
configurable: true,
|
|
||||||
enumerable: !dontEnum
|
|
||||||
});
|
|
||||||
}
|
|
||||||
|
|
||||||
function defineProperty(obj, prop, val, dontDelete, readOnly, dontEnum) {
|
|
||||||
Object.defineProperty(obj, prop,
|
|
||||||
{ value: val, writable: !readOnly, configurable: !dontDelete,
|
|
||||||
enumerable: !dontEnum });
|
|
||||||
}
|
|
||||||
|
|
||||||
// Returns true if fn is a native function. (Note: SpiderMonkey specific.)
|
|
||||||
function isNativeCode(fn) {
|
|
||||||
// Relies on the toString method to identify native code.
|
|
||||||
return ((typeof fn) === "function") && fn.toString().match(/\[native code\]/);
|
|
||||||
}
|
|
||||||
|
|
||||||
var Fpapply = Function.prototype.apply;
|
|
||||||
|
|
||||||
function apply(f, o, a) {
|
|
||||||
return Fpapply.call(f, [o].concat(a));
|
|
||||||
}
|
|
||||||
|
|
||||||
var applyNew;
|
|
||||||
|
|
||||||
// ES5's bind is a simpler way to implement applyNew
|
|
||||||
if (Function.prototype.bind) {
|
|
||||||
applyNew = function applyNew(f, a) {
|
|
||||||
return new (f.bind.apply(f, [,].concat(Array.prototype.slice.call(a))))();
|
|
||||||
};
|
|
||||||
} else {
|
|
||||||
applyNew = function applyNew(f, a) {
|
|
||||||
switch (a.length) {
|
|
||||||
case 0:
|
|
||||||
return new f();
|
|
||||||
case 1:
|
|
||||||
return new f(a[0]);
|
|
||||||
case 2:
|
|
||||||
return new f(a[0], a[1]);
|
|
||||||
case 3:
|
|
||||||
return new f(a[0], a[1], a[2]);
|
|
||||||
default:
|
|
||||||
var argStr = "a[0]";
|
|
||||||
for (var i = 1, n = a.length; i < n; i++)
|
|
||||||
argStr += ",a[" + i + "]";
|
|
||||||
return eval("new f(" + argStr + ")");
|
|
||||||
}
|
|
||||||
};
|
|
||||||
}
|
|
||||||
|
|
||||||
function getPropertyDescriptor(obj, name) {
|
|
||||||
while (obj) {
|
|
||||||
if (({}).hasOwnProperty.call(obj, name))
|
|
||||||
return Object.getOwnPropertyDescriptor(obj, name);
|
|
||||||
obj = Object.getPrototypeOf(obj);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
function getPropertyNames(obj) {
|
|
||||||
var table = Object.create(null, {});
|
|
||||||
while (obj) {
|
|
||||||
var names = Object.getOwnPropertyNames(obj);
|
|
||||||
for (var i = 0, n = names.length; i < n; i++)
|
|
||||||
table[names[i]] = true;
|
|
||||||
obj = Object.getPrototypeOf(obj);
|
|
||||||
}
|
|
||||||
return Object.keys(table);
|
|
||||||
}
|
|
||||||
|
|
||||||
function getOwnProperties(obj) {
|
|
||||||
var map = {};
|
|
||||||
for (var name in Object.getOwnPropertyNames(obj))
|
|
||||||
map[name] = Object.getOwnPropertyDescriptor(obj, name);
|
|
||||||
return map;
|
|
||||||
}
|
|
||||||
|
|
||||||
function blacklistHandler(target, blacklist) {
|
|
||||||
var mask = Object.create(null, {});
|
|
||||||
var redirect = Dict.create(blacklist).mapObject(function(name) { return mask; });
|
|
||||||
return mixinHandler(redirect, target);
|
|
||||||
}
|
|
||||||
|
|
||||||
function whitelistHandler(target, whitelist) {
|
|
||||||
var catchall = Object.create(null, {});
|
|
||||||
var redirect = Dict.create(whitelist).mapObject(function(name) { return target; });
|
|
||||||
return mixinHandler(redirect, catchall);
|
|
||||||
}
|
|
||||||
|
|
||||||
/*
|
|
||||||
* Mixin proxies break the single-inheritance model of prototypes, so
|
|
||||||
* the handler treats all properties as own-properties:
|
|
||||||
*
|
|
||||||
* X
|
|
||||||
* |
|
|
||||||
* +------------+------------+
|
|
||||||
* | O |
|
|
||||||
* | | |
|
|
||||||
* | O O O |
|
|
||||||
* | | | | |
|
|
||||||
* | O O O O |
|
|
||||||
* | | | | | |
|
|
||||||
* | O O O O O |
|
|
||||||
* | | | | | | |
|
|
||||||
* +-(*)--(w)--(x)--(y)--(z)-+
|
|
||||||
*/
|
|
||||||
|
|
||||||
function mixinHandler(redirect, catchall) {
|
|
||||||
function targetFor(name) {
|
|
||||||
return hasOwn(redirect, name) ? redirect[name] : catchall;
|
|
||||||
}
|
|
||||||
|
|
||||||
function getMuxPropertyDescriptor(name) {
|
|
||||||
var desc = getPropertyDescriptor(targetFor(name), name);
|
|
||||||
if (desc)
|
|
||||||
desc.configurable = true;
|
|
||||||
return desc;
|
|
||||||
}
|
|
||||||
|
|
||||||
function getMuxPropertyNames() {
|
|
||||||
var names1 = Object.getOwnPropertyNames(redirect).filter(function(name) {
|
|
||||||
return name in redirect[name];
|
|
||||||
});
|
|
||||||
var names2 = getPropertyNames(catchall).filter(function(name) {
|
|
||||||
return !hasOwn(redirect, name);
|
|
||||||
});
|
|
||||||
return names1.concat(names2);
|
|
||||||
}
|
|
||||||
|
|
||||||
function enumerateMux() {
|
|
||||||
var result = Object.getOwnPropertyNames(redirect).filter(function(name) {
|
|
||||||
return name in redirect[name];
|
|
||||||
});
|
|
||||||
for (name in catchall) {
|
|
||||||
if (!hasOwn(redirect, name))
|
|
||||||
result.push(name);
|
|
||||||
};
|
|
||||||
return result;
|
|
||||||
}
|
|
||||||
|
|
||||||
function hasMux(name) {
|
|
||||||
return name in targetFor(name);
|
|
||||||
}
|
|
||||||
|
|
||||||
return {
|
|
||||||
getOwnPropertyDescriptor: getMuxPropertyDescriptor,
|
|
||||||
getPropertyDescriptor: getMuxPropertyDescriptor,
|
|
||||||
getOwnPropertyNames: getMuxPropertyNames,
|
|
||||||
defineProperty: function(name, desc) {
|
|
||||||
Object.defineProperty(targetFor(name), name, desc);
|
|
||||||
},
|
|
||||||
"delete": function(name) {
|
|
||||||
var target = targetFor(name);
|
|
||||||
return delete target[name];
|
|
||||||
},
|
|
||||||
// FIXME: ha ha ha
|
|
||||||
fix: function() { },
|
|
||||||
has: hasMux,
|
|
||||||
hasOwn: hasMux,
|
|
||||||
get: function(receiver, name) {
|
|
||||||
var target = targetFor(name);
|
|
||||||
return target[name];
|
|
||||||
},
|
|
||||||
set: function(receiver, name, val) {
|
|
||||||
var target = targetFor(name);
|
|
||||||
target[name] = val;
|
|
||||||
return true;
|
|
||||||
},
|
|
||||||
enumerate: enumerateMux,
|
|
||||||
keys: enumerateMux
|
|
||||||
};
|
|
||||||
}
|
|
||||||
|
|
||||||
function makePassthruHandler(obj) {
|
|
||||||
// Handler copied from
|
|
||||||
// http://wiki.ecmascript.org/doku.php?id=harmony:proxies&s=proxy%20object#examplea_no-op_forwarding_proxy
|
|
||||||
return {
|
|
||||||
getOwnPropertyDescriptor: function(name) {
|
|
||||||
var desc = Object.getOwnPropertyDescriptor(obj, name);
|
|
||||||
|
|
||||||
// a trapping proxy's properties must always be configurable
|
|
||||||
desc.configurable = true;
|
|
||||||
return desc;
|
|
||||||
},
|
|
||||||
getPropertyDescriptor: function(name) {
|
|
||||||
var desc = getPropertyDescriptor(obj, name);
|
|
||||||
|
|
||||||
// a trapping proxy's properties must always be configurable
|
|
||||||
desc.configurable = true;
|
|
||||||
return desc;
|
|
||||||
},
|
|
||||||
getOwnPropertyNames: function() {
|
|
||||||
return Object.getOwnPropertyNames(obj);
|
|
||||||
},
|
|
||||||
defineProperty: function(name, desc) {
|
|
||||||
Object.defineProperty(obj, name, desc);
|
|
||||||
},
|
|
||||||
"delete": function(name) { return delete obj[name]; },
|
|
||||||
fix: function() {
|
|
||||||
if (Object.isFrozen(obj)) {
|
|
||||||
return getOwnProperties(obj);
|
|
||||||
}
|
|
||||||
|
|
||||||
// As long as obj is not frozen, the proxy won't allow itself to be fixed.
|
|
||||||
return undefined; // will cause a TypeError to be thrown
|
|
||||||
},
|
|
||||||
|
|
||||||
has: function(name) { return name in obj; },
|
|
||||||
hasOwn: function(name) { return ({}).hasOwnProperty.call(obj, name); },
|
|
||||||
get: function(receiver, name) { return obj[name]; },
|
|
||||||
|
|
||||||
// bad behavior when set fails in non-strict mode
|
|
||||||
set: function(receiver, name, val) { obj[name] = val; return true; },
|
|
||||||
enumerate: function() {
|
|
||||||
var result = [];
|
|
||||||
for (name in obj) { result.push(name); };
|
|
||||||
return result;
|
|
||||||
},
|
|
||||||
keys: function() { return Object.keys(obj); }
|
|
||||||
};
|
|
||||||
}
|
|
||||||
|
|
||||||
var hasOwnProperty = ({}).hasOwnProperty;
|
|
||||||
|
|
||||||
function hasOwn(obj, name) {
|
|
||||||
return hasOwnProperty.call(obj, name);
|
|
||||||
}
|
|
||||||
|
|
||||||
function Dict(table, size) {
|
|
||||||
this.table = table || Object.create(null, {});
|
|
||||||
this.size = size || 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
Dict.create = function(table) {
|
|
||||||
var init = Object.create(null, {});
|
|
||||||
var size = 0;
|
|
||||||
var names = Object.getOwnPropertyNames(table);
|
|
||||||
for (var i = 0, n = names.length; i < n; i++) {
|
|
||||||
var name = names[i];
|
|
||||||
init[name] = table[name];
|
|
||||||
size++;
|
|
||||||
}
|
|
||||||
return new Dict(init, size);
|
|
||||||
};
|
|
||||||
|
|
||||||
Dict.prototype = {
|
|
||||||
has: function(x) { return hasOwnProperty.call(this.table, x); },
|
|
||||||
set: function(x, v) {
|
|
||||||
if (!hasOwnProperty.call(this.table, x))
|
|
||||||
this.size++;
|
|
||||||
this.table[x] = v;
|
|
||||||
},
|
|
||||||
get: function(x) { return this.table[x]; },
|
|
||||||
getDef: function(x, thunk) {
|
|
||||||
if (!hasOwnProperty.call(this.table, x)) {
|
|
||||||
this.size++;
|
|
||||||
this.table[x] = thunk();
|
|
||||||
}
|
|
||||||
return this.table[x];
|
|
||||||
},
|
|
||||||
forEach: function(f) {
|
|
||||||
var table = this.table;
|
|
||||||
for (var key in table)
|
|
||||||
f.call(this, key, table[key]);
|
|
||||||
},
|
|
||||||
map: function(f) {
|
|
||||||
var table1 = this.table;
|
|
||||||
var table2 = Object.create(null, {});
|
|
||||||
this.forEach(function(key, val) {
|
|
||||||
table2[key] = f.call(this, val, key);
|
|
||||||
});
|
|
||||||
return new Dict(table2, this.size);
|
|
||||||
},
|
|
||||||
mapObject: function(f) {
|
|
||||||
var table1 = this.table;
|
|
||||||
var table2 = Object.create(null, {});
|
|
||||||
this.forEach(function(key, val) {
|
|
||||||
table2[key] = f.call(this, val, key);
|
|
||||||
});
|
|
||||||
return table2;
|
|
||||||
},
|
|
||||||
toObject: function() {
|
|
||||||
return this.mapObject(function(val) { return val; });
|
|
||||||
},
|
|
||||||
choose: function() {
|
|
||||||
return Object.getOwnPropertyNames(this.table)[0];
|
|
||||||
},
|
|
||||||
remove: function(x) {
|
|
||||||
if (hasOwnProperty.call(this.table, x)) {
|
|
||||||
this.size--;
|
|
||||||
delete this.table[x];
|
|
||||||
}
|
|
||||||
},
|
|
||||||
copy: function() {
|
|
||||||
var table = Object.create(null, {});
|
|
||||||
for (var key in this.table)
|
|
||||||
table[key] = this.table[key];
|
|
||||||
return new Dict(table, this.size);
|
|
||||||
},
|
|
||||||
keys: function() {
|
|
||||||
return Object.keys(this.table);
|
|
||||||
},
|
|
||||||
toString: function() { return "[object Dict]" }
|
|
||||||
};
|
|
||||||
|
|
||||||
var _WeakMap = typeof WeakMap === "function" ? WeakMap : (function() {
|
|
||||||
// shim for ES6 WeakMap with poor asymptotics
|
|
||||||
function WeakMap(array) {
|
|
||||||
this.array = array || [];
|
|
||||||
}
|
|
||||||
|
|
||||||
function searchMap(map, key, found, notFound) {
|
|
||||||
var a = map.array;
|
|
||||||
for (var i = 0, n = a.length; i < n; i++) {
|
|
||||||
var pair = a[i];
|
|
||||||
if (pair.key === key)
|
|
||||||
return found(pair, i);
|
|
||||||
}
|
|
||||||
return notFound();
|
|
||||||
}
|
|
||||||
|
|
||||||
WeakMap.prototype = {
|
|
||||||
has: function(x) {
|
|
||||||
return searchMap(this, x, function() { return true }, function() { return false });
|
|
||||||
},
|
|
||||||
set: function(x, v) {
|
|
||||||
var a = this.array;
|
|
||||||
searchMap(this, x,
|
|
||||||
function(pair) { pair.value = v },
|
|
||||||
function() { a.push({ key: x, value: v }) });
|
|
||||||
},
|
|
||||||
get: function(x) {
|
|
||||||
return searchMap(this, x,
|
|
||||||
function(pair) { return pair.value },
|
|
||||||
function() { return null });
|
|
||||||
},
|
|
||||||
"delete": function(x) {
|
|
||||||
var a = this.array;
|
|
||||||
searchMap(this, x,
|
|
||||||
function(pair, i) { a.splice(i, 1) },
|
|
||||||
function() { });
|
|
||||||
},
|
|
||||||
toString: function() { return "[object WeakMap]" }
|
|
||||||
};
|
|
||||||
|
|
||||||
return WeakMap;
|
|
||||||
})();
|
|
||||||
|
|
||||||
// non-destructive stack
|
|
||||||
function Stack(elts) {
|
|
||||||
this.elts = elts || null;
|
|
||||||
}
|
|
||||||
|
|
||||||
Stack.prototype = {
|
|
||||||
push: function(x) {
|
|
||||||
return new Stack({ top: x, rest: this.elts });
|
|
||||||
},
|
|
||||||
top: function() {
|
|
||||||
if (!this.elts)
|
|
||||||
throw new Error("empty stack");
|
|
||||||
return this.elts.top;
|
|
||||||
},
|
|
||||||
isEmpty: function() {
|
|
||||||
return this.top === null;
|
|
||||||
},
|
|
||||||
find: function(test) {
|
|
||||||
for (var elts = this.elts; elts; elts = elts.rest) {
|
|
||||||
if (test(elts.top))
|
|
||||||
return elts.top;
|
|
||||||
}
|
|
||||||
return null;
|
|
||||||
},
|
|
||||||
has: function(x) {
|
|
||||||
return Boolean(this.find(function(elt) { return elt === x }));
|
|
||||||
},
|
|
||||||
forEach: function(f) {
|
|
||||||
for (var elts = this.elts; elts; elts = elts.rest) {
|
|
||||||
f(elts.top);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
if (!Array.prototype.copy) {
|
|
||||||
defineProperty(Array.prototype, "copy",
|
|
||||||
function() {
|
|
||||||
var result = [];
|
|
||||||
for (var i = 0, n = this.length; i < n; i++)
|
|
||||||
result[i] = this[i];
|
|
||||||
return result;
|
|
||||||
}, false, false, true);
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!Array.prototype.top) {
|
|
||||||
defineProperty(Array.prototype, "top",
|
|
||||||
function() {
|
|
||||||
return this.length && this[this.length-1];
|
|
||||||
}, false, false, true);
|
|
||||||
}
|
|
||||||
|
|
||||||
exports.tokens = tokens;
|
|
||||||
exports.whitespace = whitespace;
|
|
||||||
exports.opTypeNames = opTypeNames;
|
|
||||||
exports.keywords = keywords;
|
|
||||||
exports.mozillaKeywords = mozillaKeywords;
|
|
||||||
exports.strictKeywords = strictKeywords;
|
|
||||||
exports.isStatementStartCode = isStatementStartCode;
|
|
||||||
exports.tokenIds = tokenIds;
|
|
||||||
exports.consts = consts;
|
|
||||||
exports.assignOps = assignOps;
|
|
||||||
exports.defineGetter = defineGetter;
|
|
||||||
exports.defineGetterSetter = defineGetterSetter;
|
|
||||||
exports.defineMemoGetter = defineMemoGetter;
|
|
||||||
exports.defineProperty = defineProperty;
|
|
||||||
exports.isNativeCode = isNativeCode;
|
|
||||||
exports.apply = apply;
|
|
||||||
exports.applyNew = applyNew;
|
|
||||||
exports.mixinHandler = mixinHandler;
|
|
||||||
exports.whitelistHandler = whitelistHandler;
|
|
||||||
exports.blacklistHandler = blacklistHandler;
|
|
||||||
exports.makePassthruHandler = makePassthruHandler;
|
|
||||||
exports.Dict = Dict;
|
|
||||||
exports.WeakMap = _WeakMap;
|
|
||||||
exports.Stack = Stack;
|
|
||||||
|
|
||||||
});
|
|
||||||
|
|
@ -1,584 +0,0 @@
|
||||||
/* ***** BEGIN LICENSE BLOCK *****
|
|
||||||
* Distributed under the BSD license:
|
|
||||||
*
|
|
||||||
* Copyright (c) 2010, Ajax.org B.V.
|
|
||||||
* All rights reserved.
|
|
||||||
*
|
|
||||||
* Redistribution and use in source and binary forms, with or without
|
|
||||||
* modification, are permitted provided that the following conditions are met:
|
|
||||||
* * Redistributions of source code must retain the above copyright
|
|
||||||
* notice, this list of conditions and the following disclaimer.
|
|
||||||
* * Redistributions in binary form must reproduce the above copyright
|
|
||||||
* notice, this list of conditions and the following disclaimer in the
|
|
||||||
* documentation and/or other materials provided with the distribution.
|
|
||||||
* * Neither the name of Ajax.org B.V. nor the
|
|
||||||
* names of its contributors may be used to endorse or promote products
|
|
||||||
* derived from this software without specific prior written permission.
|
|
||||||
*
|
|
||||||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
|
||||||
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
||||||
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
||||||
* DISCLAIMED. IN NO EVENT SHALL AJAX.ORG B.V. BE LIABLE FOR ANY
|
|
||||||
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|
||||||
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
||||||
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
|
||||||
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
||||||
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
||||||
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
||||||
*
|
|
||||||
* ***** END LICENSE BLOCK ***** */
|
|
||||||
|
|
||||||
/*
|
|
||||||
* Narcissus - JS implemented in JS.
|
|
||||||
*
|
|
||||||
* Lexical scanner.
|
|
||||||
*/
|
|
||||||
|
|
||||||
define(function(require, exports, module) {
|
|
||||||
|
|
||||||
var definitions = require('./definitions');
|
|
||||||
|
|
||||||
// Set constants in the local scope.
|
|
||||||
eval(definitions.consts);
|
|
||||||
|
|
||||||
// Build up a trie of operator tokens.
|
|
||||||
var opTokens = {};
|
|
||||||
for (var op in definitions.opTypeNames) {
|
|
||||||
if (op === '\n' || op === '.')
|
|
||||||
continue;
|
|
||||||
|
|
||||||
var node = opTokens;
|
|
||||||
for (var i = 0; i < op.length; i++) {
|
|
||||||
var ch = op[i];
|
|
||||||
if (!(ch in node))
|
|
||||||
node[ch] = {};
|
|
||||||
node = node[ch];
|
|
||||||
node.op = op;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/*
|
|
||||||
* Since JavaScript provides no convenient way to determine if a
|
|
||||||
* character is in a particular Unicode category, we use
|
|
||||||
* metacircularity to accomplish this (oh yeaaaah!)
|
|
||||||
*/
|
|
||||||
function isValidIdentifierChar(ch, first) {
|
|
||||||
// check directly for ASCII
|
|
||||||
if (ch <= "\u007F") {
|
|
||||||
if ((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z') || ch === '$' || ch === '_' ||
|
|
||||||
(!first && (ch >= '0' && ch <= '9'))) {
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
// create an object to test this in
|
|
||||||
var x = {};
|
|
||||||
x["x"+ch] = true;
|
|
||||||
x[ch] = true;
|
|
||||||
|
|
||||||
// then use eval to determine if it's a valid character
|
|
||||||
var valid = false;
|
|
||||||
try {
|
|
||||||
valid = (Function("x", "return (x." + (first?"":"x") + ch + ");")(x) === true);
|
|
||||||
} catch (ex) {}
|
|
||||||
|
|
||||||
return valid;
|
|
||||||
}
|
|
||||||
|
|
||||||
function isIdentifier(str) {
|
|
||||||
if (typeof str !== "string")
|
|
||||||
return false;
|
|
||||||
|
|
||||||
if (str.length === 0)
|
|
||||||
return false;
|
|
||||||
|
|
||||||
if (!isValidIdentifierChar(str[0], true))
|
|
||||||
return false;
|
|
||||||
|
|
||||||
for (var i = 1; i < str.length; i++) {
|
|
||||||
if (!isValidIdentifierChar(str[i], false))
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
/*
|
|
||||||
* Tokenizer :: (source, filename, line number, boolean) -> Tokenizer
|
|
||||||
*/
|
|
||||||
function Tokenizer(s, f, l, allowHTMLComments) {
|
|
||||||
this.cursor = 0;
|
|
||||||
this.source = String(s);
|
|
||||||
this.tokens = [];
|
|
||||||
this.tokenIndex = 0;
|
|
||||||
this.lookahead = 0;
|
|
||||||
this.scanNewlines = false;
|
|
||||||
this.filename = f || "";
|
|
||||||
this.lineno = l || 1;
|
|
||||||
this.allowHTMLComments = allowHTMLComments;
|
|
||||||
this.blockComments = null;
|
|
||||||
}
|
|
||||||
|
|
||||||
Tokenizer.prototype = {
|
|
||||||
get done() {
|
|
||||||
// We need to set scanOperand to true here because the first thing
|
|
||||||
// might be a regexp.
|
|
||||||
return this.peek(true) === END;
|
|
||||||
},
|
|
||||||
|
|
||||||
get token() {
|
|
||||||
return this.tokens[this.tokenIndex];
|
|
||||||
},
|
|
||||||
|
|
||||||
match: function (tt, scanOperand, keywordIsName) {
|
|
||||||
return this.get(scanOperand, keywordIsName) === tt || this.unget();
|
|
||||||
},
|
|
||||||
|
|
||||||
mustMatch: function (tt, keywordIsName) {
|
|
||||||
if (!this.match(tt, false, keywordIsName)) {
|
|
||||||
throw this.newSyntaxError("Missing " +
|
|
||||||
definitions.tokens[tt].toLowerCase());
|
|
||||||
}
|
|
||||||
return this.token;
|
|
||||||
},
|
|
||||||
|
|
||||||
peek: function (scanOperand) {
|
|
||||||
var tt, next;
|
|
||||||
if (this.lookahead) {
|
|
||||||
next = this.tokens[(this.tokenIndex + this.lookahead) & 3];
|
|
||||||
tt = (this.scanNewlines && next.lineno !== this.lineno)
|
|
||||||
? NEWLINE
|
|
||||||
: next.type;
|
|
||||||
} else {
|
|
||||||
tt = this.get(scanOperand);
|
|
||||||
this.unget();
|
|
||||||
}
|
|
||||||
return tt;
|
|
||||||
},
|
|
||||||
|
|
||||||
peekOnSameLine: function (scanOperand) {
|
|
||||||
this.scanNewlines = true;
|
|
||||||
var tt = this.peek(scanOperand);
|
|
||||||
this.scanNewlines = false;
|
|
||||||
return tt;
|
|
||||||
},
|
|
||||||
|
|
||||||
lastBlockComment: function() {
|
|
||||||
var length = this.blockComments.length;
|
|
||||||
return length ? this.blockComments[length - 1] : null;
|
|
||||||
},
|
|
||||||
|
|
||||||
// Eat comments and whitespace.
|
|
||||||
skip: function () {
|
|
||||||
var input = this.source;
|
|
||||||
this.blockComments = [];
|
|
||||||
for (;;) {
|
|
||||||
var ch = input[this.cursor++];
|
|
||||||
var next = input[this.cursor];
|
|
||||||
// handle \r, \r\n and (always preferable) \n
|
|
||||||
if (ch === '\r') {
|
|
||||||
// if the next character is \n, we don't care about this at all
|
|
||||||
if (next === '\n') continue;
|
|
||||||
|
|
||||||
// otherwise, we want to consider this as a newline
|
|
||||||
ch = '\n';
|
|
||||||
}
|
|
||||||
|
|
||||||
if (ch === '\n' && !this.scanNewlines) {
|
|
||||||
this.lineno++;
|
|
||||||
} else if (ch === '/' && next === '*') {
|
|
||||||
var commentStart = ++this.cursor;
|
|
||||||
for (;;) {
|
|
||||||
ch = input[this.cursor++];
|
|
||||||
if (ch === undefined)
|
|
||||||
throw this.newSyntaxError("Unterminated comment");
|
|
||||||
|
|
||||||
if (ch === '*') {
|
|
||||||
next = input[this.cursor];
|
|
||||||
if (next === '/') {
|
|
||||||
var commentEnd = this.cursor - 1;
|
|
||||||
this.cursor++;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
} else if (ch === '\n') {
|
|
||||||
this.lineno++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
this.blockComments.push(input.substring(commentStart, commentEnd));
|
|
||||||
} else if ((ch === '/' && next === '/') ||
|
|
||||||
(this.allowHTMLComments && ch === '<' && next === '!' &&
|
|
||||||
input[this.cursor + 1] === '-' && input[this.cursor + 2] === '-' &&
|
|
||||||
(this.cursor += 2))) {
|
|
||||||
this.cursor++;
|
|
||||||
for (;;) {
|
|
||||||
ch = input[this.cursor++];
|
|
||||||
next = input[this.cursor];
|
|
||||||
if (ch === undefined)
|
|
||||||
return;
|
|
||||||
|
|
||||||
if (ch === '\r') {
|
|
||||||
// check for \r\n
|
|
||||||
if (next !== '\n') ch = '\n';
|
|
||||||
}
|
|
||||||
|
|
||||||
if (ch === '\n') {
|
|
||||||
if (this.scanNewlines) {
|
|
||||||
this.cursor--;
|
|
||||||
} else {
|
|
||||||
this.lineno++;
|
|
||||||
}
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
} else if (!(ch in definitions.whitespace)) {
|
|
||||||
this.cursor--;
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
},
|
|
||||||
|
|
||||||
// Lex the exponential part of a number, if present. Return true iff an
|
|
||||||
// exponential part was found.
|
|
||||||
lexExponent: function() {
|
|
||||||
var input = this.source;
|
|
||||||
var next = input[this.cursor];
|
|
||||||
if (next === 'e' || next === 'E') {
|
|
||||||
this.cursor++;
|
|
||||||
ch = input[this.cursor++];
|
|
||||||
if (ch === '+' || ch === '-')
|
|
||||||
ch = input[this.cursor++];
|
|
||||||
|
|
||||||
if (ch < '0' || ch > '9')
|
|
||||||
throw this.newSyntaxError("Missing exponent");
|
|
||||||
|
|
||||||
do {
|
|
||||||
ch = input[this.cursor++];
|
|
||||||
} while (ch >= '0' && ch <= '9');
|
|
||||||
this.cursor--;
|
|
||||||
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
return false;
|
|
||||||
},
|
|
||||||
|
|
||||||
lexZeroNumber: function (ch) {
|
|
||||||
var token = this.token, input = this.source;
|
|
||||||
token.type = NUMBER;
|
|
||||||
|
|
||||||
ch = input[this.cursor++];
|
|
||||||
if (ch === '.') {
|
|
||||||
do {
|
|
||||||
ch = input[this.cursor++];
|
|
||||||
} while (ch >= '0' && ch <= '9');
|
|
||||||
this.cursor--;
|
|
||||||
|
|
||||||
this.lexExponent();
|
|
||||||
token.value = parseFloat(
|
|
||||||
input.substring(token.start, this.cursor));
|
|
||||||
} else if (ch === 'x' || ch === 'X') {
|
|
||||||
do {
|
|
||||||
ch = input[this.cursor++];
|
|
||||||
} while ((ch >= '0' && ch <= '9') || (ch >= 'a' && ch <= 'f') ||
|
|
||||||
(ch >= 'A' && ch <= 'F'));
|
|
||||||
this.cursor--;
|
|
||||||
|
|
||||||
token.value = parseInt(input.substring(token.start, this.cursor));
|
|
||||||
} else if (ch >= '0' && ch <= '7') {
|
|
||||||
do {
|
|
||||||
ch = input[this.cursor++];
|
|
||||||
} while (ch >= '0' && ch <= '7');
|
|
||||||
this.cursor--;
|
|
||||||
|
|
||||||
token.value = parseInt(input.substring(token.start, this.cursor));
|
|
||||||
} else {
|
|
||||||
this.cursor--;
|
|
||||||
this.lexExponent(); // 0E1, &c.
|
|
||||||
token.value = 0;
|
|
||||||
}
|
|
||||||
},
|
|
||||||
|
|
||||||
lexNumber: function (ch) {
|
|
||||||
var token = this.token, input = this.source;
|
|
||||||
token.type = NUMBER;
|
|
||||||
|
|
||||||
var floating = false;
|
|
||||||
do {
|
|
||||||
ch = input[this.cursor++];
|
|
||||||
if (ch === '.' && !floating) {
|
|
||||||
floating = true;
|
|
||||||
ch = input[this.cursor++];
|
|
||||||
}
|
|
||||||
} while (ch >= '0' && ch <= '9');
|
|
||||||
|
|
||||||
this.cursor--;
|
|
||||||
|
|
||||||
var exponent = this.lexExponent();
|
|
||||||
floating = floating || exponent;
|
|
||||||
|
|
||||||
var str = input.substring(token.start, this.cursor);
|
|
||||||
token.value = floating ? parseFloat(str) : parseInt(str);
|
|
||||||
},
|
|
||||||
|
|
||||||
lexDot: function (ch) {
|
|
||||||
var token = this.token, input = this.source;
|
|
||||||
var next = input[this.cursor];
|
|
||||||
if (next >= '0' && next <= '9') {
|
|
||||||
do {
|
|
||||||
ch = input[this.cursor++];
|
|
||||||
} while (ch >= '0' && ch <= '9');
|
|
||||||
this.cursor--;
|
|
||||||
|
|
||||||
this.lexExponent();
|
|
||||||
|
|
||||||
token.type = NUMBER;
|
|
||||||
token.value = parseFloat(
|
|
||||||
input.substring(token.start, this.cursor));
|
|
||||||
} else {
|
|
||||||
token.type = DOT;
|
|
||||||
token.assignOp = null;
|
|
||||||
token.value = '.';
|
|
||||||
}
|
|
||||||
},
|
|
||||||
|
|
||||||
lexString: function (ch) {
|
|
||||||
var token = this.token, input = this.source;
|
|
||||||
token.type = STRING;
|
|
||||||
|
|
||||||
var hasEscapes = false;
|
|
||||||
var delim = ch;
|
|
||||||
if (input.length <= this.cursor)
|
|
||||||
throw this.newSyntaxError("Unterminated string literal");
|
|
||||||
while ((ch = input[this.cursor++]) !== delim) {
|
|
||||||
if (ch == '\n' || ch == '\r')
|
|
||||||
throw this.newSyntaxError("Unterminated string literal");
|
|
||||||
if (this.cursor == input.length)
|
|
||||||
throw this.newSyntaxError("Unterminated string literal");
|
|
||||||
if (ch === '\\') {
|
|
||||||
hasEscapes = true;
|
|
||||||
if (++this.cursor == input.length)
|
|
||||||
throw this.newSyntaxError("Unterminated string literal");
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
token.value = hasEscapes
|
|
||||||
? eval(input.substring(token.start, this.cursor))
|
|
||||||
: input.substring(token.start + 1, this.cursor - 1);
|
|
||||||
},
|
|
||||||
|
|
||||||
lexRegExp: function (ch) {
|
|
||||||
var token = this.token, input = this.source;
|
|
||||||
token.type = REGEXP;
|
|
||||||
|
|
||||||
do {
|
|
||||||
ch = input[this.cursor++];
|
|
||||||
if (ch === '\\') {
|
|
||||||
this.cursor++;
|
|
||||||
} else if (ch === '[') {
|
|
||||||
do {
|
|
||||||
if (ch === undefined)
|
|
||||||
throw this.newSyntaxError("Unterminated character class");
|
|
||||||
|
|
||||||
if (ch === '\\')
|
|
||||||
this.cursor++;
|
|
||||||
|
|
||||||
ch = input[this.cursor++];
|
|
||||||
} while (ch !== ']');
|
|
||||||
} else if (ch === undefined) {
|
|
||||||
throw this.newSyntaxError("Unterminated regex");
|
|
||||||
}
|
|
||||||
} while (ch !== '/');
|
|
||||||
|
|
||||||
do {
|
|
||||||
ch = input[this.cursor++];
|
|
||||||
} while (ch >= 'a' && ch <= 'z');
|
|
||||||
|
|
||||||
this.cursor--;
|
|
||||||
|
|
||||||
token.value = eval(input.substring(token.start, this.cursor));
|
|
||||||
},
|
|
||||||
|
|
||||||
lexOp: function (ch) {
|
|
||||||
var token = this.token, input = this.source;
|
|
||||||
|
|
||||||
// A bit ugly, but it seems wasteful to write a trie lookup routine
|
|
||||||
// for only 3 characters...
|
|
||||||
var node = opTokens[ch];
|
|
||||||
var next = input[this.cursor];
|
|
||||||
if (next in node) {
|
|
||||||
node = node[next];
|
|
||||||
this.cursor++;
|
|
||||||
next = input[this.cursor];
|
|
||||||
if (next in node) {
|
|
||||||
node = node[next];
|
|
||||||
this.cursor++;
|
|
||||||
next = input[this.cursor];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
var op = node.op;
|
|
||||||
if (definitions.assignOps[op] && input[this.cursor] === '=') {
|
|
||||||
this.cursor++;
|
|
||||||
token.type = ASSIGN;
|
|
||||||
token.assignOp = definitions.tokenIds[definitions.opTypeNames[op]];
|
|
||||||
op += '=';
|
|
||||||
} else {
|
|
||||||
token.type = definitions.tokenIds[definitions.opTypeNames[op]];
|
|
||||||
token.assignOp = null;
|
|
||||||
}
|
|
||||||
|
|
||||||
token.value = op;
|
|
||||||
},
|
|
||||||
|
|
||||||
// FIXME: Unicode escape sequences
|
|
||||||
lexIdent: function (ch, keywordIsName) {
|
|
||||||
var token = this.token;
|
|
||||||
var id = ch;
|
|
||||||
|
|
||||||
while ((ch = this.getValidIdentifierChar(false)) !== null) {
|
|
||||||
id += ch;
|
|
||||||
}
|
|
||||||
|
|
||||||
token.type = IDENTIFIER;
|
|
||||||
token.value = id;
|
|
||||||
|
|
||||||
if (keywordIsName)
|
|
||||||
return;
|
|
||||||
|
|
||||||
var kw;
|
|
||||||
|
|
||||||
if (this.parser.mozillaMode) {
|
|
||||||
kw = definitions.mozillaKeywords[id];
|
|
||||||
if (kw) {
|
|
||||||
token.type = kw;
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (this.parser.x.strictMode) {
|
|
||||||
kw = definitions.strictKeywords[id];
|
|
||||||
if (kw) {
|
|
||||||
token.type = kw;
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
kw = definitions.keywords[id];
|
|
||||||
if (kw)
|
|
||||||
token.type = kw;
|
|
||||||
},
|
|
||||||
|
|
||||||
/*
|
|
||||||
* Tokenizer.get :: ([boolean[, boolean]]) -> token type
|
|
||||||
*
|
|
||||||
* Consume input *only* if there is no lookahead.
|
|
||||||
* Dispatch to the appropriate lexing function depending on the input.
|
|
||||||
*/
|
|
||||||
get: function (scanOperand, keywordIsName) {
|
|
||||||
var token;
|
|
||||||
while (this.lookahead) {
|
|
||||||
--this.lookahead;
|
|
||||||
this.tokenIndex = (this.tokenIndex + 1) & 3;
|
|
||||||
token = this.tokens[this.tokenIndex];
|
|
||||||
if (token.type !== NEWLINE || this.scanNewlines)
|
|
||||||
return token.type;
|
|
||||||
}
|
|
||||||
|
|
||||||
this.skip();
|
|
||||||
|
|
||||||
this.tokenIndex = (this.tokenIndex + 1) & 3;
|
|
||||||
token = this.tokens[this.tokenIndex];
|
|
||||||
if (!token)
|
|
||||||
this.tokens[this.tokenIndex] = token = {};
|
|
||||||
|
|
||||||
var input = this.source;
|
|
||||||
if (this.cursor >= input.length)
|
|
||||||
return token.type = END;
|
|
||||||
|
|
||||||
token.start = this.cursor;
|
|
||||||
token.lineno = this.lineno;
|
|
||||||
|
|
||||||
var ich = this.getValidIdentifierChar(true);
|
|
||||||
var ch = (ich === null) ? input[this.cursor++] : null;
|
|
||||||
if (ich !== null) {
|
|
||||||
this.lexIdent(ich, keywordIsName);
|
|
||||||
} else if (scanOperand && ch === '/') {
|
|
||||||
this.lexRegExp(ch);
|
|
||||||
} else if (ch in opTokens) {
|
|
||||||
this.lexOp(ch);
|
|
||||||
} else if (ch === '.') {
|
|
||||||
this.lexDot(ch);
|
|
||||||
} else if (ch >= '1' && ch <= '9') {
|
|
||||||
this.lexNumber(ch);
|
|
||||||
} else if (ch === '0') {
|
|
||||||
this.lexZeroNumber(ch);
|
|
||||||
} else if (ch === '"' || ch === "'") {
|
|
||||||
this.lexString(ch);
|
|
||||||
} else if (this.scanNewlines && (ch === '\n' || ch === '\r')) {
|
|
||||||
// if this was a \r, look for \r\n
|
|
||||||
if (ch === '\r' && input[this.cursor] === '\n') this.cursor++;
|
|
||||||
token.type = NEWLINE;
|
|
||||||
token.value = '\n';
|
|
||||||
this.lineno++;
|
|
||||||
} else {
|
|
||||||
throw this.newSyntaxError("Illegal token");
|
|
||||||
}
|
|
||||||
|
|
||||||
token.end = this.cursor;
|
|
||||||
return token.type;
|
|
||||||
},
|
|
||||||
|
|
||||||
/*
|
|
||||||
* Tokenizer.unget :: void -> undefined
|
|
||||||
*
|
|
||||||
* Match depends on unget returning undefined.
|
|
||||||
*/
|
|
||||||
unget: function () {
|
|
||||||
if (++this.lookahead === 4) throw "PANIC: too much lookahead!";
|
|
||||||
this.tokenIndex = (this.tokenIndex - 1) & 3;
|
|
||||||
},
|
|
||||||
|
|
||||||
newSyntaxError: function (m) {
|
|
||||||
m = (this.filename ? this.filename + ":" : "") + this.lineno + ": " + m;
|
|
||||||
var e = new SyntaxError(m, this.filename, this.lineno);
|
|
||||||
e.source = this.source;
|
|
||||||
e.cursor = this.lookahead
|
|
||||||
? this.tokens[(this.tokenIndex + this.lookahead) & 3].start
|
|
||||||
: this.cursor;
|
|
||||||
return e;
|
|
||||||
},
|
|
||||||
|
|
||||||
|
|
||||||
/* Gets a single valid identifier char from the input stream, or null
|
|
||||||
* if there is none.
|
|
||||||
*/
|
|
||||||
getValidIdentifierChar: function(first) {
|
|
||||||
var input = this.source;
|
|
||||||
if (this.cursor >= input.length) return null;
|
|
||||||
var ch = input[this.cursor];
|
|
||||||
|
|
||||||
// first check for \u escapes
|
|
||||||
if (ch === '\\' && input[this.cursor+1] === 'u') {
|
|
||||||
// get the character value
|
|
||||||
try {
|
|
||||||
ch = String.fromCharCode(parseInt(
|
|
||||||
input.substring(this.cursor + 2, this.cursor + 6),
|
|
||||||
16));
|
|
||||||
} catch (ex) {
|
|
||||||
return null;
|
|
||||||
}
|
|
||||||
this.cursor += 5;
|
|
||||||
}
|
|
||||||
|
|
||||||
var valid = isValidIdentifierChar(ch, first);
|
|
||||||
if (valid) this.cursor++;
|
|
||||||
return (valid ? ch : null);
|
|
||||||
},
|
|
||||||
};
|
|
||||||
|
|
||||||
|
|
||||||
exports.isIdentifier = isIdentifier;
|
|
||||||
exports.Tokenizer = Tokenizer;
|
|
||||||
|
|
||||||
});
|
|
||||||
|
|
@ -1,48 +0,0 @@
|
||||||
/* ***** BEGIN LICENSE BLOCK *****
|
|
||||||
* Distributed under the BSD license:
|
|
||||||
*
|
|
||||||
* Copyright (c) 2010, Ajax.org B.V.
|
|
||||||
* All rights reserved.
|
|
||||||
*
|
|
||||||
* Redistribution and use in source and binary forms, with or without
|
|
||||||
* modification, are permitted provided that the following conditions are met:
|
|
||||||
* * Redistributions of source code must retain the above copyright
|
|
||||||
* notice, this list of conditions and the following disclaimer.
|
|
||||||
* * Redistributions in binary form must reproduce the above copyright
|
|
||||||
* notice, this list of conditions and the following disclaimer in the
|
|
||||||
* documentation and/or other materials provided with the distribution.
|
|
||||||
* * Neither the name of Ajax.org B.V. nor the
|
|
||||||
* names of its contributors may be used to endorse or promote products
|
|
||||||
* derived from this software without specific prior written permission.
|
|
||||||
*
|
|
||||||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
|
||||||
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
||||||
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
||||||
* DISCLAIMED. IN NO EVENT SHALL AJAX.ORG B.V. BE LIABLE FOR ANY
|
|
||||||
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|
||||||
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
||||||
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
|
||||||
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
||||||
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
||||||
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
||||||
*
|
|
||||||
* ***** END LICENSE BLOCK ***** */
|
|
||||||
|
|
||||||
define(function(require, exports, module) {
|
|
||||||
|
|
||||||
// Global variables to hide from the interpreter
|
|
||||||
exports.hiddenHostGlobals = { Narcissus: true };
|
|
||||||
|
|
||||||
// Desugar SpiderMonkey language extensions?
|
|
||||||
exports.desugarExtensions = false;
|
|
||||||
|
|
||||||
// Allow HTML comments?
|
|
||||||
exports.allowHTMLComments = false;
|
|
||||||
|
|
||||||
// Allow non-standard Mozilla extensions?
|
|
||||||
exports.mozillaMode = true;
|
|
||||||
|
|
||||||
// Allow experimental paren-free mode?
|
|
||||||
exports.parenFreeMode = false;
|
|
||||||
|
|
||||||
});
|
|
||||||
File diff suppressed because it is too large
Load diff
File diff suppressed because it is too large
Load diff
Loading…
Add table
Add a link
Reference in a new issue