1
1
mirror of https://github.com/kanaka/mal.git synced 2024-09-20 01:57:09 +03:00
mal/objpascal/step4_if_fn_do.pas
2016-04-02 17:27:43 -05:00

200 lines
4.7 KiB
ObjectPascal

program Mal;
{$H+} // Use AnsiString
Uses sysutils,
CMem,
fgl,
mal_readline,
mal_types,
mal_func,
reader,
printer,
mal_env,
core;
var
Repl_Env : TEnv;
Line : string;
I : longint;
Key : string;
// read
function READ(const Str: string) : TMal;
begin
READ := read_str(Str);
end;
// eval
// Forward declation since eval_ast call it
function EVAL(Ast: TMal; Env: TEnv) : TMal; forward;
function eval_ast(Ast: TMal; Env: TEnv) : TMal;
var
OldArr, NewArr : TMalArray;
OldDict, NewDict : TMalDict;
I : longint;
begin
if Ast is TMalSymbol then
begin
eval_ast := Env.Get((Ast as TMalSymbol));
end
else if Ast is TMalList then
begin
OldArr := (Ast as TMalList).Val;
SetLength(NewArr, Length(OldArr));
for I := 0 to Length(OldArr)-1 do
begin
NewArr[I] := EVAL(OldArr[I], Env);
end;
if Ast is TMalVector then
eval_ast := TMalVector.Create(NewArr)
else
eval_ast := TMalList.Create(NewArr);
end
else if Ast is TMalHashMap then
begin
OldDict := (Ast as TMalHashMap).Val;
NewDict := TMalDict.Create;
I := 0;
while I < OldDict.Count do
begin
NewDict[OldDict.Keys[I]] := EVAL(OldDict[OldDict.Keys[I]], Env);
I := I + 1;
end;
eval_ast := TMalHashMap.Create(NewDict);
end
else
eval_ast := Ast;
end;
function EVAL(Ast: TMal; Env: TEnv) : TMal;
var
Lst : TMalList;
Arr : TMalArray;
Arr1 : TMalArray;
A0Sym : string;
LetEnv : TEnv;
FnEnv : TEnv;
Cond : TMal;
I : longint;
Fn : TMalFunc;
Args : TMalArray;
begin
if Ast.ClassType <> TMalList then
Exit(eval_ast(Ast, Env));
// Apply list
Lst := (Ast as TMalList);
Arr := Lst.Val;
if Length(Arr) = 0 then
Exit(Ast);
if Arr[0] is TMalSymbol then
A0Sym := (Arr[0] as TMalSymbol).Val
else
A0Sym := '__<*fn*>__';
case A0Sym of
'def!':
EVAL := Env.Add((Arr[1] as TMalSymbol), EVAL(Arr[2], ENV));
'let*':
begin
LetEnv := TEnv.Create(Env);
Arr1 := (Arr[1] as TMalList).Val;
I := 0;
while I < Length(Arr1) do
begin
LetEnv.Add((Arr1[I] as TMalSymbol), EVAL(Arr1[I+1], LetEnv));
Inc(I,2);
end;
EVAL := EVAL(Arr[2], LetEnv);
end;
'do':
begin
Arr := (eval_ast(Lst.Rest, Env) as TMalList).Val;
EVAL := Arr[Length(Arr)-1];
end;
'if':
begin
Cond := EVAL(Arr[1], Env);
if (Cond is TMalNil) or (Cond is TMalFalse) then
if Length(Arr) > 3 then
EVAL := EVAL(Arr[3], Env)
else
EVAL := TMalNil.Create
else
EVAL := EVAL(Arr[2], Env);
end;
'fn*':
begin
EVAL := TMalFunc.Create(Arr[2], Env, (Arr[1] as TMalList))
end;
else
begin
Arr := (eval_ast(Ast, Env) as TMalList).Val;
if Arr[0] is TMalFunc then
begin
Fn := Arr[0] as TMalFunc;
if Length(Arr) < 2 then
SetLength(Args, 0)
else
Args := copy(Arr, 1, Length(Arr)-1);
if Fn.Ast = nil then
EVAL := Fn.Val(Args)
else
begin
FnEnv := TEnv.Create(Fn.Env, Fn.Params, Args);
EVAL := EVAL(Fn.Ast, FnEnv);
end
end
else
raise Exception.Create('invalid apply');
end;
end;
end;
// print
function PRINT(Exp: TMal) : string;
begin
PRINT := pr_str(Exp, True);
end;
// repl
function REP(Str: string) : string;
begin
REP := PRINT(EVAL(READ(Str), Repl_Env));
end;
begin
Repl_Env := TEnv.Create;
// core.pas: defined using Pascal
for I := 0 to core.NS.Count-1 do
begin
Key := core.NS.Keys[I];
Repl_Env.Add(TMalSymbol.Create(Key),
TMalFunc.Create(core.NS[Key]));
end;
// core.mal: defined using language itself
REP('(def! not (fn* (a) (if a false true)))');
while True do
begin
try
Line := _readline('user> ');
if Line = '' then continue;
WriteLn(REP(Line))
except
On E : MalEOF do Halt(0);
On E : Exception do
begin
WriteLn('Error: ' + E.message);
WriteLn('Backtrace:');
WriteLn(GetBacktrace(E));
end;
end;
end;
end.