[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
- To: (BUG LISP) at MIT-MC, (BUG LISPM) at MIT-MC
- From: JOSH at MIT-MC (J Storrs Hall)
- Date: Sun, 2 Jul 78 04:24:00 GMT
- Original-date: 2 JUL 1978 0024-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?