next »

[nop_90]

The famous lisp in a box
common-lisp.net/project/lispbox/
a package of emacs and popular lisp implementations

Practical Common Lisp
www.gigamonkeys.com/book/
Lisp oriented. Designed for lisp newbies, advantages of lisp and how to use lisp macros.

Structure and Interpretation of Computer Programs
mitpress.mit.edu/sicp/full-text/book/book.html
this is my favorite book. For the examples in the book it uses scheme.
(one day when i get time have to finish working on examples)
But it is more the a book on scheme.
It is a book on programming
Ironically very few books on "programming"
Covers everything from simple data structures to compiler construction
Those MIT boys are brilliant

Example of how to implement a state machine in scheme using syntax case macro system
not for newbies. a very complex macro. if you look at it ur head will blow up like perks did
classes.eclab.byu.edu/330/wiki/index.cgi?FunWithMacros

Red lisp
A very small lisp, probably not much practical use, will investigate
http://omouse.googlepages.com/

[perkiset]

I made it about 3/4 the way down before I started swimming... I'm gonna read that again tomorrow because tonight the fog of a nice Chardonnay has got me listing hard to port... I'm still having trouble seeing why that is superior (as they claim) to the C macros, but let me at it tomorrow again...

/p

[nop_90]

C macros are basically a simple replace macro.
the only "logic" you can do with the macro are primite IF statements.

But imagion if the macro had all of the C string manipulation libs, and runtime available ?

[malloc]

Another good book is "The Little Schemer"  formally "The Little Lisper" 

http://www.ccs.neu.edu/home/matthias/BTLS/ 

You don't learn much about Scheme but it does teach you to think recursively.

[perkiset]

Another good book is "The Little Schemer"  formally "The Little Lisper" 

LOL @ The Little Lisper - someone had a giggle titling that book.

Actually interesting how many programmers DONT think recursively M... I agree. My first exercise was to write a formula solver in a recursive way (about the best way it can be done IMO...) for example:

2+((3*4) / 5)

... basically the routine called itself as it found the innermost parens, then kept reducing the forumula to "Left Side / Operator / Right Side", solved that, then stepped out of recursion until the problem was solved. This also worked very well for a robotics language I wrote for evaluating the "right side" of a line.

Sounds like you'll do well here

[nop_90]

One day when i get arround to it, i want to order that book from amazon