Lisp implemented in under 1K of JavaScript

by swannodette • 11 years ago

108 16 11 years ago

Thank you for at least not writing another Brainfuck clone.

mattdw• 11 years ago

It's JSON lists as s-exps, which means (as I understand it) that the author doesn't need to implement parsing, only traversal and evaluation. (Which can essentially be a big-ass case statement.)

    ["def", "foo", 1]
    ["fn", "foo", ["a", "b"], […]]

It's not the most attractive Lisp I've seen…

infogulch2• 11 years ago

So write a lisp parser, then dump the result into this. I like that they didn't include a parser in compacted code, such a parser wouldn't be very interesting.

zardeh• 11 years ago

So, uhmm,

    def parse(s): return json.loads('['+re.sub('([")])\s*(["(])','\g<1>,\g<2>',re.sub('[^()\s]+','"\g<0>"',s)).replace('(','[').replace(')',']')+']')

works for python, I'm assuming javascript has something equally small

andrewchambers• 11 years ago

This person wrote a lisp in 1K lines of C (not bytes :)), the cool thing is that also includes a copying garbage collector.

https://github.com/rui314/minilisp

rrmm2• 11 years ago

IMO, the garbage collection (along with optimization) is the most interesting part of implementing a lisp.

mrottenkolber• 11 years ago

I wrote a minimal Lisp compiler (targeting C) when I was a bit younger. :> My GC was just a really bad reference counting implementation though. I dare you to make fun of my "hash function". Hehe.

https://github.com/eugeneia/microlisp

rrmm2• 11 years ago

Your hash function is fast! So it's got that going for it.

PinnBrain• 11 years ago

So much effort to go under 1K (in the era of 128GiB fingernail chips), with this .gitignore:

node_modules -uglify -crush -regpack

TazeTSchnitzel• 11 years ago

I wrote a minimal Lisp for PHP in about an hour: https://gist.github.com/TazeTSchnitzel/44720ea3aec64a9e330a

Lisp implemented in under 1K of JavaScript

Related Stories