Awesome
Lisp Interpreter from C
This repository contains a Lisp interpreter written from scratch in pure C (c99). The interpreter can be used to run Lisp programs saved in files, or from an interactive shell. This Lisp interpreter showcases many features including variable and function declaration, arithmetic operations, first class/lambda functions, closures, currying, recursive functions, a mutable global interpreter environment, dynamic scoping, memory allocation and deterministic memory management without garbage collection.
Although the interpreter and all of it's libraries are written in C, performance benchmarking and some unit testing are done using Google Benchmark and Google Test, respectively, which are both C++ libraries. If you want to build the performance and unit testing binaries, you will need a C++ compiler.
Example
The Lisp interpreter comes with a global environment which can be used to set values and then recal them later
> (set 'x 6)
6
> (set 'y 7)
7
> (* x y)
42
This interpreter also supports the creation of closures from lambda functions with variable capture at declaraion time.
> (set 'make-adder
(lambda (x)
(lambda (n) (+ x n))))
<closure:(x), 2 vars captured>
> (set 'add-2 (make-adder 2))
<closure:(n), 2 vars captured>
> (add-2 40)
42
In this example the make-adder
function returns a closure with the value of n
captured within the closure.
Recursive functions may declared, such as this recursive definition of the factorial function:
> (set 'factorial
(lambda (n)
(cond
((= n 0) 1)
(t (* n (factorial (- n 1)))))))
> (factorial 6)
720
recursion may even be accomplished with anonymous functions via the Y-Combinator
> (set 'Y
(lambda (r)
((lambda (f) (f f))
(lambda (f) (r (lambda (x) ((f f) x)))))))
> (set 'F
(lambda (g)
(lambda (n)
(cond
((= n 0) 1)
(t (* n (g (- n 1))))))))
> ((Y F) 6)
720
Usage
If you would like to run this Lisp interpreter from the command line, you will have to build it from source using the CMake build system. To do so, you will need to have a C99 compiler, and the CMake build system. To build, issue the following two commands from with in the top-level directory
cmake .
make
To run the interactive shell (REPL) use the lisp
executable.
To have matching parentheses hilighting, run echo "set blink-matching-paren on" >> ~/.inputrc
.
You can also run a Lisp script by adding it as an argument.
./lisp my-program.lisp
Dependencies
- C99
- Readline
- Ubuntu:
sudo apt-get install libreadline-dev
- MacOS:
brew install readline
- Ubuntu:
Testing and Benchmarking
If you would like to check out my handiwork, a testing framework for the interpreter
is also included and can be run with the test-lisp
executable.
For performance benchmarking, we use the Google Benchmark library. To use this part of the repository, you will need a C++ compiler (as this library is written in C++) and have installed the library as instructed.
Design
To understand in greater detail the design choices which were made in the creation of this interpreter
you may refer to design.md
.
To do
The following "to do" list contains many things which I have accomplished in this project as well as things which I have not yet accomplished. Please cross one off!
REPL prompt and re-promptCorrect parsing and un-parsingeval
andapply
Implement testing frameworkSeven primitivesset primitivebasiclambda
functionalityError messages and stack traceSmart indentation in re-prompt'Usereadline
for interactive promptMath libraryenv
primitive to print the environmentmemory managementclosuresUse CList instead of CVectorLambda with zero argumentsClosure partial applicationEmpty expression is not invalidSignal handler in REPL (to exit gracefully with garbage collection)Abstract Lisp Interpreter and Garbage Collector into structureAllow for REPL to run from any file descriptorProper error reporting on file reading and malloc failureSpecify lisp history fileVerbose logging functionality with CLI flagExit on error during program executionTests for proper error behaviorGreater than and less than primitiveslambda primitive instead of special caseFix the help/version printoutUse tail recursion instead of loops where possibleFix bug withcar
andcdr
of empty list, or end of listEnable testing framework to report which test is failingFix self-referential environment settingFix variable capture of overloaded parameter namesFix the way that unused variables are handled#define UNUSED __attribute__ ((unused))
Change the error logger to usesnptintf
instead ofsprintf
Rename the garbage collector to memory managerNest structs inside one another where possible (GC, allocated CList)Use CVector instead of CListY (U NO WORK) combinator testsFix the way that errors are reported (noreturn LOG_ERROR(...)
)Use flexible array member in lisp objects- Performance benchmarking
Pass full interpreter to primitives- Lexical scoping
- Allow circular references by keeping track of freed pointers
- Use a single truth and nil tuple
defmacro
- Avoid deleting large data structures during set with over-write
- Garbage Collector
- Lisp standard library
- Dot notation / Variadic functions
- Strings