mirror of
https://github.com/kanaka/mal.git
synced 2024-11-11 00:52:44 +03:00
0997015d97
* ASSERT is to check for internal errors * MAL_CHECK / MAL_FAIL is to check mal code errors
258 lines
7.3 KiB
C++
258 lines
7.3 KiB
C++
#include "MAL.h"
|
|
|
|
#include "Environment.h"
|
|
#include "ReadLine.h"
|
|
#include "Types.h"
|
|
|
|
#include <iostream>
|
|
#include <memory>
|
|
|
|
malValuePtr READ(const String& input);
|
|
String PRINT(malValuePtr ast);
|
|
static void installFunctions(malEnvPtr env);
|
|
|
|
static void makeArgv(malEnvPtr env, int argc, char* argv[]);
|
|
static void safeRep(const String& input, malEnvPtr env);
|
|
static malValuePtr quasiquote(malValuePtr obj);
|
|
|
|
static ReadLine s_readLine("~/.mal-history");
|
|
|
|
int main(int argc, char* argv[])
|
|
{
|
|
String prompt = "user> ";
|
|
String input;
|
|
malEnvPtr replEnv(new malEnv);
|
|
installCore(replEnv);
|
|
installFunctions(replEnv);
|
|
makeArgv(replEnv, argc - 2, argv + 2);
|
|
if (argc > 1) {
|
|
String filename = escape(argv[1]);
|
|
safeRep(STRF("(load-file %s)", filename.c_str()), replEnv);
|
|
return 0;
|
|
}
|
|
while (s_readLine.get(prompt, input)) {
|
|
safeRep(input, replEnv);
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
static void safeRep(const String& input, malEnvPtr env)
|
|
{
|
|
String out;
|
|
try {
|
|
out = rep(input, env);
|
|
}
|
|
catch (malEmptyInputException&) {
|
|
return;
|
|
}
|
|
catch (String& s) {
|
|
out = s;
|
|
};
|
|
std::cout << out << "\n";
|
|
}
|
|
|
|
static void makeArgv(malEnvPtr env, int argc, char* argv[])
|
|
{
|
|
malValueVec* args = new malValueVec();
|
|
for (int i = 0; i < argc; i++) {
|
|
args->push_back(mal::string(argv[i]));
|
|
}
|
|
env->set("*ARGV*", mal::list(args));
|
|
}
|
|
|
|
String rep(const String& input, malEnvPtr env)
|
|
{
|
|
return PRINT(EVAL(READ(input), env));
|
|
}
|
|
|
|
malValuePtr READ(const String& input)
|
|
{
|
|
return readStr(input);
|
|
}
|
|
|
|
malValuePtr EVAL(malValuePtr ast, malEnvPtr env)
|
|
{
|
|
while (1) {
|
|
const malList* list = DYNAMIC_CAST(malList, ast);
|
|
if (!list || (list->count() == 0)) {
|
|
return ast->eval(env);
|
|
}
|
|
|
|
// From here on down we are evaluating a non-empty list.
|
|
// First handle the special forms.
|
|
if (const malSymbol* symbol = DYNAMIC_CAST(malSymbol, list->item(0))) {
|
|
String special = symbol->value();
|
|
int argCount = list->count() - 1;
|
|
|
|
if (special == "def!") {
|
|
checkArgsIs("def!", 2, argCount);
|
|
const malSymbol* id = VALUE_CAST(malSymbol, list->item(1));
|
|
return env->set(id->value(), EVAL(list->item(2), env));
|
|
}
|
|
|
|
if (special == "do") {
|
|
checkArgsAtLeast("do", 1, argCount);
|
|
|
|
for (int i = 1; i < argCount; i++) {
|
|
EVAL(list->item(i), env);
|
|
}
|
|
ast = list->item(argCount);
|
|
continue; // TCO
|
|
}
|
|
|
|
if (special == "fn*") {
|
|
checkArgsIs("fn*", 2, argCount);
|
|
|
|
const malSequence* bindings =
|
|
VALUE_CAST(malSequence, list->item(1));
|
|
StringVec params;
|
|
for (int i = 0; i < bindings->count(); i++) {
|
|
const malSymbol* sym =
|
|
VALUE_CAST(malSymbol, bindings->item(i));
|
|
params.push_back(sym->value());
|
|
}
|
|
|
|
return mal::lambda(params, list->item(2), env);
|
|
}
|
|
|
|
if (special == "if") {
|
|
checkArgsBetween("if", 2, 3, argCount);
|
|
|
|
bool isTrue = EVAL(list->item(1), env)->isTrue();
|
|
if (!isTrue && (argCount == 2)) {
|
|
return mal::nilValue();
|
|
}
|
|
ast = list->item(isTrue ? 2 : 3);
|
|
continue; // TCO
|
|
}
|
|
|
|
if (special == "let*") {
|
|
checkArgsIs("let*", 2, argCount);
|
|
const malSequence* bindings =
|
|
VALUE_CAST(malSequence, list->item(1));
|
|
int count = checkArgsEven("let*", bindings->count());
|
|
malEnvPtr inner(new malEnv(env));
|
|
for (int i = 0; i < count; i += 2) {
|
|
const malSymbol* var =
|
|
VALUE_CAST(malSymbol, bindings->item(i));
|
|
inner->set(var->value(), EVAL(bindings->item(i+1), inner));
|
|
}
|
|
ast = list->item(2);
|
|
env = inner;
|
|
continue; // TCO
|
|
}
|
|
|
|
if (special == "quasiquote") {
|
|
checkArgsIs("quasiquote", 1, argCount);
|
|
ast = quasiquote(list->item(1));
|
|
continue; // TCO
|
|
}
|
|
|
|
if (special == "quote") {
|
|
checkArgsIs("quote", 1, argCount);
|
|
return list->item(1);
|
|
}
|
|
}
|
|
|
|
// Now we're left with the case of a regular list to be evaluated.
|
|
std::unique_ptr<malValueVec> items(list->evalItems(env));
|
|
malValuePtr op = items->at(0);
|
|
if (const malLambda* lambda = DYNAMIC_CAST(malLambda, op)) {
|
|
ast = lambda->getBody();
|
|
env = lambda->makeEnv(items->begin()+1, items->end());
|
|
continue; // TCO
|
|
}
|
|
else {
|
|
return APPLY(op, items->begin()+1, items->end(), env);
|
|
}
|
|
}
|
|
}
|
|
|
|
String PRINT(malValuePtr ast)
|
|
{
|
|
return ast->print(true);
|
|
}
|
|
|
|
malValuePtr APPLY(malValuePtr op, malValueIter argsBegin, malValueIter argsEnd,
|
|
malEnvPtr env)
|
|
{
|
|
const malApplicable* handler = DYNAMIC_CAST(malApplicable, op);
|
|
MAL_CHECK(handler != NULL,
|
|
"\"%s\" is not applicable", op->print(true).c_str());
|
|
|
|
return handler->apply(argsBegin, argsEnd, env);
|
|
}
|
|
|
|
static bool isSymbol(malValuePtr obj, const String& text)
|
|
{
|
|
const malSymbol* sym = DYNAMIC_CAST(malSymbol, obj);
|
|
return sym && (sym->value() == text);
|
|
}
|
|
|
|
static const malSequence* isPair(malValuePtr obj)
|
|
{
|
|
const malSequence* list = DYNAMIC_CAST(malSequence, obj);
|
|
return list && !list->isEmpty() ? list : NULL;
|
|
}
|
|
|
|
static malValuePtr quasiquote(malValuePtr obj)
|
|
{
|
|
const malSequence* seq = isPair(obj);
|
|
if (!seq) {
|
|
return mal::list(mal::symbol("quote"), obj);
|
|
}
|
|
|
|
if (isSymbol(seq->item(0), "unquote")) {
|
|
// (qq (uq form)) -> form
|
|
checkArgsIs("unquote", 1, seq->count() - 1);
|
|
return seq->item(1);
|
|
}
|
|
|
|
const malSequence* innerSeq = isPair(seq->item(0));
|
|
if (innerSeq && isSymbol(innerSeq->item(0), "splice-unquote")) {
|
|
checkArgsIs("splice-unquote", 1, innerSeq->count() - 1);
|
|
// (qq (sq '(a b c))) -> a b c
|
|
return mal::list(
|
|
mal::symbol("concat"),
|
|
innerSeq->item(1),
|
|
quasiquote(seq->rest())
|
|
);
|
|
}
|
|
else {
|
|
// (qq (a b c)) -> (list (qq a) (qq b) (qq c))
|
|
// (qq xs ) -> (cons (qq (car xs)) (qq (cdr xs)))
|
|
return mal::list(
|
|
mal::symbol("cons"),
|
|
quasiquote(seq->first()),
|
|
quasiquote(seq->rest())
|
|
);
|
|
}
|
|
}
|
|
|
|
static const char* malFunctionTable[] = {
|
|
"(def! list (fn* (& items) items))",
|
|
"(def! not (fn* (cond) (if cond false true)))",
|
|
"(def! >= (fn* (a b) (<= b a)))",
|
|
"(def! < (fn* (a b) (not (<= b a))))",
|
|
"(def! > (fn* (a b) (not (<= a b))))",
|
|
"(def! load-file (fn* (filename) \
|
|
(eval (read-string (str \"(do \" (slurp filename) \")\")))))",
|
|
};
|
|
|
|
static void installFunctions(malEnvPtr env) {
|
|
for (auto &function : malFunctionTable) {
|
|
rep(function, env);
|
|
}
|
|
}
|
|
|
|
// Added to keep the linker happy at step A
|
|
malValuePtr readline(const String& prompt)
|
|
{
|
|
String input;
|
|
if (s_readLine.get(prompt, input)) {
|
|
return mal::string(input);
|
|
}
|
|
return mal::nilValue();
|
|
}
|
|
|