loganzartman / lzscheme Goto Github PK

This interpreter allows unquoted lists of symbols, like (a b c), to match the scheme syntax used in The Little Schemer.
The Little Schemer uses the bare word "and" in example lists, but it also uses "and" as the name of the boolean AND operation, i.e.

(peanut butter and jelly) ; list of symbols (`peanut` is not defined)

(and #t #f) ; boolean operation (`and` is a function)

This sort of works in my interpreter; the problem is if you try to call a recursive function that iterates over the list (peanut butter and jelly), eventually it will eval something like (car (and jelly)) and try to call and as a function, which isn't the desired outcome. This may just be too ambiguous to resolve.

(I probably won't ever fix this)