def EVAL(ast, env):
while True:
dbgeval = env.get_or_nil('DEBUG-EVAL')
if dbgeval is not None and dbgeval is not False:
print('EVAL: ' + printer._pr_str(ast))
if types._symbol_Q(ast):
return env.get(ast)
elif types._vector_Q(ast):
return types._vector(*map(lambda a: EVAL(a, env), ast))
elif types._hash_map_Q(ast):
return types.Hash_Map((k, EVAL(v, env)) for k, v in ast.items())
elif not types._list_Q(ast):
return ast # primitive value, return unchanged
else:
# apply list
if len(ast) == 0: return ast
a0 = ast[0]
if "def!" == a0:
a1, a2 = ast[1], ast[2]
res = EVAL(a2, env)
return env.set(a1, res)
elif "let*" == a0:
a1, a2 = ast[1], ast[2]
let_env = Env(env)
for i in range(0, len(a1), 2):
let_env.set(a1[i], EVAL(a1[i + 1], let_env))
ast = a2
env = let_env
# Continue loop (TCO)
elif "do" == a0:
for i in range(1, len(ast) - 1):
EVAL(ast[i], env)
ast = ast[-1]
# Continue loop (TCO)
elif "if" == a0:
a1, a2 = ast[1], ast[2]
cond = EVAL(a1, env)
if cond is None or cond is False:
if len(ast) > 3: ast = ast[3]
else: ast = None
else:
ast = a2
# Continue loop (TCO)
elif "fn*" == a0:
a1, a2 = ast[1], ast[2]
return types._function(EVAL, Env, a2, env, a1)
else:
f = EVAL(a0, env)
args = ast[1:]
if hasattr(f, '__ast__'):
ast = f.__ast__
env = f.__gen_env__(types.List(EVAL(a, env) for a in args))
else:
return f(*(EVAL(a, env) for a in args))
def eval_ast(ast, env):
if types._symbol_Q(ast):
return env.get(ast)
elif types._list_Q(ast):
return types._list(*map(lambda a: EVAL(a, env), ast))
elif types._vector_Q(ast):
return types._vector(*map(lambda a: EVAL(a, env), ast))
elif types._hash_map_Q(ast):
return types.Hash_Map((k, EVAL(v, env)) for k, v in ast.items())
else:
return ast # primitive value, return unchanged
def quasiquote(ast):
if types._list_Q(ast):
if len(ast) == 2 and ast[0] == u'unquote':
return ast[1]
else:
return qq_foldr(ast)
elif types._hash_map_Q(ast) or types._symbol_Q(ast):
return types._list(types._symbol(u'quote'), ast)
elif types._vector_Q(ast):
return types._list(types._symbol(u'vec'), qq_foldr(ast))
else:
return ast
def quasiquote(ast):
if types._list_Q(ast):
if len(ast) == 2:
fst = ast[0]
if isinstance(fst, MalSym) and fst.value == u"unquote":
return ast[1]
return qq_foldr(ast.values)
elif types._vector_Q(ast):
return _list(_symbol(u"vec"), qq_foldr(ast.values))
elif types._symbol_Q(ast) or types._hash_map_Q(ast):
return _list(_symbol(u"quote"), ast)
else:
return ast
def eval_ast(ast, env):
if types._symbol_Q(ast):
try:
return env[ast]
except:
raise Exception("'" + ast + "' not found")
elif types._list_Q(ast):
return types._list(*map(lambda a: EVAL(a, env), ast))
elif types._vector_Q(ast):
return types._vector(*map(lambda a: EVAL(a, env), ast))
elif types._hash_map_Q(ast):
return types.Hash_Map((k, EVAL(v, env)) for k, v in ast.items())
else:
return ast # primitive value, return unchanged
def eval_ast(ast, env):
if types._symbol_Q(ast):
return env.get(ast)
elif types._list_Q(ast):
return types._list(*map(lambda a: EVAL(a, env), ast))
elif types._vector_Q(ast):
return types._vector(*map(lambda a: EVAL(a, env), ast))
elif types._hash_map_Q(ast):
keyvals = []
for k in ast.keys():
keyvals.append(EVAL(k, env))
keyvals.append(EVAL(ast[k], env))
return types._hash_map(*keyvals)
else:
return ast # primitive value, return unchanged
def eval_ast(ast, env):
if types._symbol_Q(ast):
return env.get(ast)
elif types._list_Q(ast):
return types._list(*map(lambda a: EVAL(a, env), ast))
elif types._vector_Q(ast):
return types._vector(*map(lambda a: EVAL(a, env), ast))
elif types._hash_map_Q(ast):
keyvals = []
for k in ast.keys():
keyvals.append(EVAL(k, env))
keyvals.append(EVAL(ast[k], env))
return types._hash_map(*keyvals)
else:
return ast # primitive value, return unchanged
def eval_ast(ast, env):
if types._symbol_Q(ast):
try:
return env[ast]
except:
raise Exception("'" + ast + "' not found")
elif types._list_Q(ast):
return types._list(*map(lambda a: EVAL(a, env), ast))
elif types._vector_Q(ast):
return types._vector(*map(lambda a: EVAL(a, env), ast))
elif types._hash_map_Q(ast):
keyvals = []
for k in ast.keys():
keyvals.append(EVAL(k, env))
keyvals.append(EVAL(ast[k], env))
return types._hash_map(*keyvals)
else:
return ast # primitive value, return unchanged
def eval_ast(ast, env):
if types._symbol_Q(ast):
assert isinstance(ast, MalSym)
return env.get(ast)
elif types._list_Q(ast):
res = []
for a in ast.values:
res.append(EVAL(a, env))
return MalList(res)
elif types._vector_Q(ast):
res = []
for a in ast.values:
res.append(EVAL(a, env))
return MalVector(res)
elif types._hash_map_Q(ast):
new_dct = {}
for k in ast.dct.keys():
new_dct[k] = EVAL(ast.dct[k], env)
return MalHashMap(new_dct)
else:
return ast # primitive value, return unchanged
def EVAL(ast, env):
# print('EVAL: ' + printer._pr_str(ast))
if types._symbol_Q(ast):
try:
return env[ast]
except:
raise Exception("'" + ast + "' not found")
elif types._vector_Q(ast):
return types._vector(*map(lambda a: EVAL(a, env), ast))
elif types._hash_map_Q(ast):
return types.Hash_Map((k, EVAL(v, env)) for k, v in ast.items())
elif not types._list_Q(ast):
return ast # primitive value, return unchanged
else:
# apply list
if len(ast) == 0: return ast
f = EVAL(ast[0], env)
args = ast[1:]
return f(*(EVAL(a, env) for a in args))
def eval_ast(ast, env):
if types._symbol_Q(ast):
assert isinstance(ast, MalSym)
return env.get(ast)
elif types._list_Q(ast):
res = []
for a in ast.values:
res.append(EVAL(a, env))
return MalList(res)
elif types._vector_Q(ast):
res = []
for a in ast.values:
res.append(EVAL(a, env))
return MalVector(res)
elif types._hash_map_Q(ast):
new_dct = {}
for k in ast.dct.keys():
new_dct[k] = EVAL(ast.dct[k], env)
return MalHashMap(new_dct)
else:
return ast # primitive value, return unchanged
def symbol_Q(args):
return wrap_tf(types._symbol_Q(args[0]))
def EVAL(ast, env):
while True:
#print("EVAL %s" % printer._pr_str(ast))
if types._symbol_Q(ast):
assert isinstance(ast, MalSym)
return env.get(ast)
elif types._vector_Q(ast):
res = []
for a in ast.values:
res.append(EVAL(a, env))
return MalVector(res)
elif types._hash_map_Q(ast):
new_dct = {}
for k in ast.dct.keys():
new_dct[k] = EVAL(ast.dct[k], env)
return MalHashMap(new_dct)
elif not types._list_Q(ast):
return ast # primitive value, return unchanged
else:
# apply list
if len(ast) == 0: return ast
a0 = ast[0]
if isinstance(a0, MalSym):
a0sym = a0.value
else:
a0sym = u"__<*fn*>__"
if u"def!" == a0sym:
a1, a2 = ast[1], ast[2]
res = EVAL(a2, env)
return env.set(a1, res)
elif u"let*" == a0sym:
a1, a2 = ast[1], ast[2]
let_env = Env(env)
for i in range(0, len(a1), 2):
let_env.set(a1[i], EVAL(a1[i + 1], let_env))
ast = a2
env = let_env # Continue loop (TCO)
elif u"quote" == a0sym:
return ast[1]
elif u"quasiquote" == a0sym:
ast = quasiquote(ast[1]) # Continue loop (TCO)
elif u"defmacro!" == a0sym:
func = EVAL(ast[2], env)
func.ismacro = True
return env.set(ast[1], func)
elif u"try*" == a0sym:
if len(ast) < 3:
return EVAL(ast[1], env)
a1, a2 = ast[1], ast[2]
a20 = a2[0]
if isinstance(a20, MalSym):
if a20.value == u"catch*":
try:
return EVAL(a1, env)
except types.MalException as exc:
exc = exc.object
catch_env = Env(env, _list(a2[1]), _list(exc))
return EVAL(a2[2], catch_env)
except Exception as exc:
exc = MalStr(unicode("%s" % exc))
catch_env = Env(env, _list(a2[1]), _list(exc))
return EVAL(a2[2], catch_env)
return EVAL(a1, env)
elif u"do" == a0sym:
if len(ast) == 0:
return nil
for i in range(1, len(ast) - 1):
EVAL(ast[i], env)
ast = ast[-1] # Continue loop (TCO)
elif u"if" == a0sym:
a1, a2 = ast[1], ast[2]
cond = EVAL(a1, env)
if cond is nil or cond is false:
if len(ast) > 3: ast = ast[3] # Continue loop (TCO)
else: return nil
else:
ast = a2 # Continue loop (TCO)
elif u"fn*" == a0sym:
a1, a2 = ast[1], ast[2]
return MalFunc(None, a2, env, a1, EVAL)
else:
f = EVAL(a0, env)
args = ast.rest()
if f.ismacro:
ast = f.apply(ast.rest()) # Continue loop (TCO)
else:
res = []
for a in args.values:
res.append(EVAL(a, env))
el = MalList(res)
if isinstance(f, MalFunc):
if f.ast:
ast = f.ast
env = f.gen_env(el) # Continue loop (TCO)
else:
return f.apply(el)
else:
raise Exception("%s is not callable" % f)
def is_macro_call(ast, env):
return (types._list_Q(ast) and
types._symbol_Q(ast[0]) and
env.find(ast[0]) and
hasattr(env.get(ast[0]), '_ismacro_'))
def is_macro_call(ast, env):
return (types._list_Q(ast) and types._symbol_Q(ast[0]) and env.find(ast[0])
and hasattr(env.get(ast[0]), '_ismacro_'))
def symbol_Q(args): return wrap_tf(types._symbol_Q(args[0])) def keyword(args): return types._keyword(args[0])
def EVAL(ast, env):
while True:
dbgeval = env.get_or_nil('DEBUG-EVAL')
if dbgeval is not None and dbgeval is not False:
print('EVAL: ' + printer._pr_str(ast))
if types._symbol_Q(ast):
return env.get(ast)
elif types._vector_Q(ast):
return types._vector(*map(lambda a: EVAL(a, env), ast))
elif types._hash_map_Q(ast):
return types.Hash_Map((k, EVAL(v, env)) for k, v in ast.items())
elif not types._list_Q(ast):
return ast # primitive value, return unchanged
else:
# apply list
if len(ast) == 0: return ast
a0 = ast[0]
if "def!" == a0:
a1, a2 = ast[1], ast[2]
res = EVAL(a2, env)
return env.set(a1, res)
elif "let*" == a0:
a1, a2 = ast[1], ast[2]
let_env = Env(env)
for i in range(0, len(a1), 2):
let_env.set(a1[i], EVAL(a1[i+1], let_env))
ast = a2
env = let_env
# Continue loop (TCO)
elif "quote" == a0:
return ast[1]
elif "quasiquote" == a0:
ast = quasiquote(ast[1]);
# Continue loop (TCO)
elif 'defmacro!' == a0:
func = types._clone(EVAL(ast[2], env))
func._ismacro_ = True
return env.set(ast[1], func)
elif "py!*" == a0:
exec(compile(ast[1], '', 'single'), globals())
return None
elif "py*" == a0:
return types.py_to_mal(eval(ast[1]))
elif "." == a0:
el = (EVAL(ast[i], env) for i in range(2, len(ast)))
f = eval(ast[1])
return f(*el)
elif "try*" == a0:
if len(ast) < 3:
return EVAL(ast[1], env)
a1, a2 = ast[1], ast[2]
if a2[0] == "catch*":
err = None
try:
return EVAL(a1, env)
except types.MalException as exc:
err = exc.object
except Exception as exc:
err = exc.args[0]
catch_env = Env(env, [a2[1]], [err])
return EVAL(a2[2], catch_env)
else:
return EVAL(a1, env);
elif "do" == a0:
for i in range(1, len(ast)-1):
EVAL(ast[i], env)
ast = ast[-1]
# Continue loop (TCO)
elif "if" == a0:
a1, a2 = ast[1], ast[2]
cond = EVAL(a1, env)
if cond is None or cond is False:
if len(ast) > 3: ast = ast[3]
else: ast = None
else:
ast = a2
# Continue loop (TCO)
elif "fn*" == a0:
a1, a2 = ast[1], ast[2]
return types._function(EVAL, Env, a2, env, a1)
else:
f = EVAL(a0, env)
args = ast[1:]
if hasattr(f, '_ismacro_'):
ast = f(*args)
continue # TCO
if hasattr(f, '__ast__'):
ast = f.__ast__
env = f.__gen_env__(types.List(EVAL(a, env) for a in args))
else:
return f(*(EVAL(a, env) for a in args))