Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with
or
.
Download ZIP
a wannabe lisp interpreter
C
branch: master

Fetching latest commit…

Cannot retrieve the latest commit at this time

Failed to load latest commit information.
.gitignore
Makefile
README
main.c
parse.c
parse.h

README

shave

This is the beginnings of a LISP interpreter.  It's kind of full of garbage right now, because I got impatient and started copy-pasting.  The lexer is handwritten, so yeah, it rules.  The generated AST is a big linked list, which is evaluated in the eval step.  The AST is made up of 'Token' structs, which have type and property enums used by the eval routines.

My end goal here is to make the cleanest, smallest, and simplest implementation of LISP that would handle the recursive computation of a factorial:

 (defun factorial (n)
     (if (<= n 1)
             1
          (* n (factorial (- n 1)))))

There's a ways to go; namely cleanup and implementing defun.

compile:

  $ make

use:

  $ ./shave
  shave.
  > (if (> 3 2) (/ 9 (+ 3 2)))
  list:
    if:

    list:
      >:
      atom: 3
      atom: 2

    list:
      /:
      atom: 9

      list:
        +:
        atom: 3
        atom: 2
  atom: 1.8
Something went wrong with that request. Please try again.