|3 years ago|
|attic||10 years ago|
|examples||10 years ago|
|lib||11 years ago|
|llt||3 years ago|
|tests||4 years ago|
|tiny||3 years ago|
|.gitattributes||3 years ago|
|.gitignore||3 years ago|
|LICENSE||11 years ago|
|Makefile||8 years ago|
|Makefile.macosx||6 years ago|
|README.md||4 years ago|
|aliases.scm||7 years ago|
|ascii-mona-lisa||11 years ago|
|ascii-mona-lisa-2||11 years ago|
|bootstrap.sh||11 years ago|
|builtins.c||6 years ago|
|compiler.lsp||4 years ago|
|cvalues.c||6 years ago|
|equal.c||6 years ago|
|equalhash.c||11 years ago|
|equalhash.h||11 years ago|
|flisp.boot||4 years ago|
|flisp.c||3 years ago|
|flisp.h||10 years ago|
|flmain.c||10 years ago|
|iostream.c||6 years ago|
|mkboot0.lsp||11 years ago|
|mkboot1.lsp||11 years ago|
|opaque_type_template.c||11 years ago|
|opcodes.h||11 years ago|
|operators.c||11 years ago|
|print.c||4 years ago|
|read.c||4 years ago|
|string.c||6 years ago|
|system.lsp||7 years ago|
|table.c||10 years ago|
|todo||11 years ago|
|todo-scrap||11 years ago|
|types.c||6 years ago|
...a purely symbolic gesture...
This project began with an attempt to write the fastest lisp interpreter I could in under 1000 lines of C. It snowballed from there as I kept trying to see if I could add powerful features with minimal code. At the same time I assembled a library of some of my favorite C code (by myself and others) to use as a base for a standard library. This includes
ios, a replacement for parts of C's stdio that adds more flexible features.
Before you say "oh no, another lisp", consider the following: femtolisp is about 150kb, is very self-contained, and has the following features:
- vectors, strings, gensyms
- printing and reading circular/shared structure
- all values can be printed readably
- hash tables
- support for directly using C data types ala Python's ctypes
equaland ordered comparison predicates that work on circular structure
- proper tail recursion
- io and memory streams with utf8 support
- highly compatible with Scheme, including some
- simple, well-organized, powerful API with as few functions as possible
- compacting GC
...it is fast, ranking among the fastest non-native-compiled Scheme implementations. It achieves this level of speed even though many primitives (e.g.
for-each) are written in the language instead of C. femtolisp uses a bytecode compiler and VM, with the compiler written in femtolisp. Bytecode is first-class, can be printed and read, and is "human readable" (the representation is a string of normal low-ASCII characters).
femtolisp is a simple, elegant Scheme dialect. It is a lisp-1 with lexical scope. The core is 12 builtin special forms and 33 builtin functions.
A primary design goal is to keep the code concise and interesting. I strive to have each concept implemented in just one place, so the system is easy to understand and modify. The result is high reliability, because there are fewer places for bugs to hide. You want a small core of generically useful features that work really well (for example, see
Almost everybody has their own lisp implementation. Some programmers' dogs and cats probably have their own lisp implementations as well. This is great, but too often I see people omit some of the obscure but critical features that make lisp uniquely wonderful. These include read macros like
#. and backreferences, gensyms, and properly escaped symbol names. If you're going to waste everybody's time with yet another lisp, at least do it right damnit.
Another design goal is to avoid spurious novelties. Many others offering their own "shiny new" lisp dialects get carried away and change anything that strikes their fancy. These changes have no effect except incompatibility, and often make the language worse because the new design was not as carefully thought out and has not stood the test of time. For example, how does it help to remove backquote? One design changes the syntax of
quote. Some systems disallow dotted lists. (I've seen all three of these.) What's the point? Implementers wave the banner of "simplicity", yet wedge in all kinds of weird implicit behaviors and extra evaluation rules.
Lately a surprising amount of FUD has been spread about proper tail recursion. I agree that not every language needs it, but I would like to refute the idea that it makes interpreters slow. Look at the "tiny" subdirectory or the "interpreter" branch to see a pure s-expr interpreter with efficient proper tail calls. All you have to do is keep track of whether you're in tail position, which can be done very cheaply. These interpreters are difficult to beat for speed, yet they have lexical scope and proper tail calls.
This project is mostly a matter of style. Look at the code and you'll understand.
This is what I do for fun, because it is the exact opposite of the kind of thing people will pay for: an obscure implementation of a programming language everybody hates.