mirror of
https://github.com/kanaka/mal.git
synced 2024-10-27 14:52:16 +03:00
033892777a
See issue #587. * Merge eval-ast and eval into a single conditional. * Expand macros during the apply phase, removing lots of duplicate tests, and increasing the overall consistency by allowing the macro to be computed instead of referenced by name (`((defmacro! cond (...)))` is currently illegal for example). * Print "EVAL: $ast" at the top of EVAL if DEBUG-EVAL exists in the MAL environment. * Remove macroexpand and quasiquoteexpand special forms. * Use pattern-matching style in process/step*.txt. Unresolved issues: c.2: unable to reproduce with gcc 11.12.0. elm: the directory is unchanged. groovy: sometimes fail, but not on each rebuild. nasm: fails some new soft tests, but the issue is unreproducible when running the interpreter manually. objpascal: unreproducible with fpc 3.2.2. ocaml: unreproducible with 4.11.1. perl6: unreproducible with rakudo 2021.09. Unrelated changes: Reduce diff betweens steps. Prevent defmacro! from mutating functions: c forth logo miniMAL vb. dart: fix recent errors and warnings ocaml: remove metadata from symbols. Improve the logo implementation. Encapsulate all representation in types.lg and env.lg, unwrap numbers. Replace some manual iterations with logo control structures. Reduce the diff between steps. Use native iteration in env_get and env_map Rewrite the reader with less temporary strings. Reduce the number of temporary lists (for example, reverse iteration with butlast requires O(n^2) allocations). It seems possible to remove a few exceptions: GC settings (Dockerfile), NO_SELF_HOSTING (IMPLS.yml) and step5_EXCLUDES (Makefile.impls) .
152 lines
4.1 KiB
C
152 lines
4.1 KiB
C
#include <stdlib.h>
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <unistd.h>
|
|
|
|
#include "types.h"
|
|
#include "readline.h"
|
|
#include "reader.h"
|
|
|
|
// Declarations
|
|
MalVal *EVAL(MalVal *ast, GHashTable *env);
|
|
|
|
// read
|
|
MalVal *READ(char prompt[], char *str) {
|
|
char *line;
|
|
MalVal *ast;
|
|
if (str) {
|
|
line = str;
|
|
} else {
|
|
line = _readline(prompt);
|
|
if (!line) {
|
|
_error("EOF");
|
|
return NULL;
|
|
}
|
|
}
|
|
ast = read_str(line);
|
|
if (!str) { MAL_GC_FREE(line); }
|
|
return ast;
|
|
}
|
|
|
|
// eval
|
|
MalVal *EVAL(MalVal *ast, GHashTable *env) {
|
|
if (!ast || mal_error) return NULL;
|
|
//g_print("EVAL: %s\n", _pr_str(ast,1));
|
|
|
|
if (ast->type == MAL_SYMBOL) {
|
|
//g_print("EVAL symbol: %s\n", ast->val.string);
|
|
// TODO: check if not found
|
|
MalVal *res = g_hash_table_lookup(env, ast->val.string);
|
|
assert(res, "'%s' not found", ast->val.string);
|
|
return res;
|
|
} else if (ast->type == MAL_LIST) {
|
|
// Proceed after this conditional.
|
|
} else if (ast->type == MAL_VECTOR) {
|
|
//g_print("EVAL sequential: %s\n", _pr_str(ast,1));
|
|
MalVal *el = _map2((MalVal *(*)(void*, void*))EVAL, ast, env);
|
|
if (!el || mal_error) return NULL;
|
|
el->type = ast->type;
|
|
return el;
|
|
} else if (ast->type == MAL_HASH_MAP) {
|
|
//g_print("EVAL hash_map: %s\n", _pr_str(ast,1));
|
|
GHashTableIter iter;
|
|
gpointer key, value;
|
|
MalVal *seq = malval_new_list(MAL_LIST,
|
|
g_array_sized_new(TRUE, TRUE, sizeof(MalVal*),
|
|
_count(ast)));
|
|
g_hash_table_iter_init (&iter, ast->val.hash_table);
|
|
while (g_hash_table_iter_next (&iter, &key, &value)) {
|
|
MalVal *kname = malval_new_string((char *)key);
|
|
g_array_append_val(seq->val.array, kname);
|
|
MalVal *new_val = EVAL((MalVal *)value, env);
|
|
g_array_append_val(seq->val.array, new_val);
|
|
}
|
|
return _hash_map(seq);
|
|
} else {
|
|
//g_print("EVAL scalar: %s\n", _pr_str(ast,1));
|
|
return ast;
|
|
}
|
|
|
|
// apply list
|
|
if (_count(ast) == 0) { return ast; }
|
|
MalVal *a0 = _nth(ast, 0);
|
|
assert_type(a0, MAL_SYMBOL, "Cannot invoke %s", _pr_str(a0,1));
|
|
MalVal *el = _map2((MalVal *(*)(void*, void*))EVAL, ast, env);
|
|
if (!el || mal_error) { return NULL; }
|
|
MalVal *(*f)(void *, void*) = (MalVal *(*)(void*, void*))_first(el);
|
|
//g_print("eval_invoke el: %s\n", _pr_str(el,1));
|
|
return f(_nth(el, 1), _nth(el, 2));
|
|
}
|
|
|
|
// print
|
|
char *PRINT(MalVal *exp) {
|
|
if (mal_error) {
|
|
return NULL;
|
|
}
|
|
return _pr_str(exp,1);
|
|
}
|
|
|
|
// repl
|
|
|
|
// read and eval
|
|
MalVal *RE(GHashTable *env, char *prompt, char *str) {
|
|
MalVal *ast, *exp;
|
|
ast = READ(prompt, str);
|
|
if (!ast || mal_error) return NULL;
|
|
exp = EVAL(ast, env);
|
|
if (ast != exp) {
|
|
malval_free(ast); // Free input structure
|
|
}
|
|
return exp;
|
|
}
|
|
|
|
// Setup the initial REPL environment
|
|
GHashTable *repl_env;
|
|
|
|
WRAP_INTEGER_OP(plus,+)
|
|
WRAP_INTEGER_OP(minus,-)
|
|
WRAP_INTEGER_OP(multiply,*)
|
|
WRAP_INTEGER_OP(divide,/)
|
|
|
|
void init_repl_env() {
|
|
repl_env = g_hash_table_new(g_str_hash, g_str_equal);
|
|
|
|
g_hash_table_insert(repl_env, "+", int_plus);
|
|
g_hash_table_insert(repl_env, "-", int_minus);
|
|
g_hash_table_insert(repl_env, "*", int_multiply);
|
|
g_hash_table_insert(repl_env, "/", int_divide);
|
|
}
|
|
|
|
int main()
|
|
{
|
|
MalVal *exp;
|
|
char *output;
|
|
char prompt[100];
|
|
|
|
MAL_GC_SETUP();
|
|
|
|
// Set the initial prompt and environment
|
|
snprintf(prompt, sizeof(prompt), "user> ");
|
|
init_repl_env();
|
|
|
|
// repl loop
|
|
for(;;) {
|
|
exp = RE(repl_env, prompt, NULL);
|
|
if (mal_error && strcmp("EOF", mal_error->val.string) == 0) {
|
|
return 0;
|
|
}
|
|
output = PRINT(exp);
|
|
|
|
if (mal_error) {
|
|
fprintf(stderr, "Error: %s\n", _pr_str(mal_error,1));
|
|
malval_free(mal_error);
|
|
mal_error = NULL;
|
|
} else if (output) {
|
|
puts(output);
|
|
MAL_GC_FREE(output); // Free output string
|
|
}
|
|
|
|
//malval_free(exp); // Free evaluated expression
|
|
}
|
|
}
|