[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
- To: JOSH at MIT-MC
- From: GLS at MIT-MC (Guy L. Steele, Jr.)
- Date: Mon, 3 Jul 78 20:38:00 GMT
- Cc: (BUG LISP) at MIT-MC, (BUG LISPM) at MIT-MC
- Original-date: 3 JUL 1978 1638-EDT
I'd like to find out what the "best" READ algorithm in lisp is.
our (rutgers) lisp has a very fast read but it loses for long
lists... the length of a list goes on the stack so it blows up
in those cases. I asked our resident LISP hacker (before he left)
why and he thought that destructive additions to the structure
(or reversing it afterwards) was messy. Are there any reasons
that either of these methods aren't as straightforward as they
seem to me?
Well, it seems to me that the choice between a clean algorithm
that doesn't work and a messy one that does should be obvious.
MacLISP uses destructive additions, and it is not "messy" at all.