3 ms·
Impressive. This the tiniest Lisp implementation I ever saw. Having two strides of storage for pairs is an elegant solution. It even provides macro support by b
by garganzol 8y ago
Impressive. This the tiniest Lisp implementation I ever saw. Having two strides of storage for pairs is an elegant solution. It even provides macro support by building atop of lambda which is impressive too.
This small kernal bootstraps itself with 'klsrc' file, and then it's able to provide 'cond', 'or', 'and' and other keywords for a conventional Lisp syntax.
I am eager to characterize the performance of this implementation. Tiny tends to mean fast but not always.
- rain1 8y agoin language implementation the speed you get generally follows this path: AST interpreter < bytecode interpreter < native code compiler and it's an AST interrpeter so it's (likely to be) on the lower end of the speed scale.