An experiment in parentheses-free lisp (in JavaScript)
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 

125 lines
3.0 KiB

import typ from "./representation.js";
import parse from "./parse.js";
import tokenizer from "./tokenize.js";
import pprint from "./pprint.js";
import env from "./environments.js";
function cons(x) {
return function(xs) {
if (xs.exprType == "Nil") {
return [x];
}
xs.unshift(x);
return xs;
};
}
function car(xs) {
return xs[0];
}
function cdr(xs) {
return xs.slice(1);
}
var testenv = env.makeEnv("toplevel",
[
["car", car],
["cdr", cdr],
["len", function(xs) { return xs.length; }],
["+", function(a) { return function(b) { return a + b; } }],
["*", function(a) { return function(b) { return a * b; } }],
["-", function(a) { return function(b) { return a - b; } }],
["/", function(a) { return function(b) { return a / b; } }],
[":", cons],
["a", 2],
["b", 3]]);
function lookup(ident, env) {
var value = env.bindings[ident];
if (value.exprType !== undefined) {
var result = evaluate(value, env);
return result;
}
return value;
}
function evaluateString(input) {
var ast = parse.parseFull(tokenizer.tokenize(input));
return evaluateAll(ast.ast, testenv);
}
function apply(func, p) {
return func(p);
}
function evaluateAll(ast, environment) {
var l = ast.length;
var evaled = [];
for (var i = 0; i < l; i++) {
// should look for closures?
evaled.push(evaluate(ast[i], environment));
}
return evaled[evaled.length-1];
}
function evaluateClosure(ast) {
var bound_vars = ast.bound_vars;
var found = ast.env
}
function extend(def, env) {
env.bindings[def.ident.val] = evaluate(def.val, env);
return;
}
function evaluate(ast, environment) {
if (ast.exprType == "Application") {
var func = evaluate(ast.func, environment);
return apply(
func,
evaluate(ast.p, environment));
}
else if (ast.exprType === "Unary") {
/* Unary function application */
var func = evaluate(ast.op, environment);
return apply(
func,
evaluate(ast.val, environment));
}
else if (ast.exprType === "Name") {
return lookup(ast.ident, environment);
}
else if (ast.exprType === "Bool") {
return ast.val;
}
else if (ast.exprType === "If") {
if (evaluate(ast.condition, environment)) {
return evaluate(ast.thenexp, environment);
}
else {
return evaluate(ast.elseexp, environment);
}
}
else if (ast.exprType === "Definition") {
extend(ast, environment);
return;
}
else if (ast.exprType === "Integer" ||
ast.exprType === "Float" ||
ast.exprType === "String") {
/* Return an atom */
return ast.val;
}
else if (ast.exprType === "Closure") {
return ast;
}
else {
return ast;
}
}
export default {
evaluateString : evaluateString,
env : testenv
};