mirrors/TiddlyWiki5
1
Fork 0
mirror of https://github.com/Jermolene/TiddlyWiki5.git synced 2026-01-13 12:50:54 -08:00
Code Issues Projects Releases Packages Wiki Activity

Replace pegs parser with Esprima

Browse source 
It preserves comments and text positions, enabling us to do syntax
highlighting. Hopefully.
This commit is contained in:
Jeremy Ruston 2012-03-01 22:47:31 +00:00
parent 470b622bb1
commit f6338d9109
68 changed files with 109553 additions and 8077 deletions
Download patch file Download diff file Expand all files Collapse all files

125
js/JavaScriptParseTree.js
View file

@ -18,7 +18,8 @@ This simplifies coalescing adjacent constants into a single string.
/*jslint node: true */
"use strict";
var utils = require("./Utils.js");
var esprima = require("esprima"),
utils = require("./Utils.js");
// Create a new JavaScript tree object
var JavaScriptParseTree = function(tree) {
@ -42,127 +43,7 @@ JavaScriptParseTree.prototype.toString = function() {
// Compile the entire JavaScript tree object to a renderer object
JavaScriptParseTree.prototype.compileJS = function() {
/*jslint evil: true */
var output = [];
if(this.tree instanceof Array) {
this.compileSubTree(output,this.tree);
} else {
this.compileNode(output,this.tree);
}
var r = output.join("");
return {render: eval(r)};
};
// Compile a subtree of the parse tree to an array of fragments of JavaScript source code
JavaScriptParseTree.prototype.compileSubTree = function(output,tree) {
for(var t=0; t<tree.length; t++) {
if(t) {
this.output.push(";\n");
}
this.compileNode(output,tree[t]);
}
};
/*
Compile a JavaScript node to an array of fragments of JavaScript source code
The code currently inserts some unneeded parenthesis because it doesn't look
at the binding order of operators to determine if they are needed.
*/
JavaScriptParseTree.prototype.compileNode = function(output,node) {
var p;
switch(node.type) {
case "StringLiteral":
output.push('"' + utils.stringify(node.value) + '"');
break;
case "StringLiterals":
output.push('"' + utils.stringify(node.value.join("")) + '"');
break;
case "FunctionCall":
output.push("(");
this.compileNode(output,node.name);
output.push(")(");
for(p=0; p<node["arguments"].length; p++) {
if(p) {
output.push(",");
}
this.compileNode(output,node["arguments"][p]);
}
output.push(")");
break;
case "PropertyAccess":
this.compileNode(output,node.base);
if(typeof node.name === "string") {
output.push("." + node.name);
} else {
output.push("[");
this.compileNode(output,node.name);
output.push("]");
}
break;
case "ArrayLiteral":
output.push("[");
for(p=0; p<node.elements.length; p++) {
if(p) {
output.push(",");
}
this.compileNode(output,node.elements[p]);
}
output.push("]");
break;
case "Variable":
output.push(node.name);
break;
case "ObjectLiteral":
output.push("{");
for(p=0; p<node.properties.length; p++) {
if(p) {
output.push(",");
}
this.compileNode(output,node.properties[p]);
}
output.push("}");
break;
case "PropertyAssignment":
output.push("'");
output.push(node.name);
output.push("':");
this.compileNode(output,node.value);
break;
case "BinaryExpression":
output.push("(");
this.compileNode(output,node.left);
output.push(")");
output.push(node.operator);
output.push("(");
this.compileNode(output,node.right);
output.push(")");
break;
case "NumericLiteral":
output.push(node.value);
break;
case "Function":
output.push("(function ");
if(node.name !== null) {
output.push(node.name);
}
output.push("(");
output.push(node.params.join(","));
output.push("){");
this.compileSubTree(output,node.elements);
output.push("})");
break;
case "ReturnStatement":
output.push("return ");
this.compileNode(output,node.value);
break;
case "This":
output.push("this");
break;
default:
console.log(node);
throw "Unknown JavaScript node type: " + node.type;
//break;
}
return {render: eval(esprima.generate(this.tree))};
};
exports.JavaScriptParseTree = JavaScriptParseTree;