Symbolics

From: Shawn T. Rutledge <rutledge_at_cx47646-a.phnx1.az.home.com>
Date: Mon Feb 28 19:25:26 2000

On Mon, Feb 28, 2000 at 07:40:43PM -0500, Dave McGuire wrote:
> On February 28, Shawn T. Rutledge wrote:
> > Do they still have performance advantages over less specialized systems?
> > What kind of hardware modifications would optimize execution of Lisp?
>
> Hmm...what processor instructions might one create to deal with a
> language with more parens than actual code? ;)

I doubt that is an issue... I've never written a lisp interpreter (wish
I'd had one of those CS classes where they do that) but I'd guess the
ASCII source code gets tokenized into some kind of tree structure which
is probably interpreted by doing a tree traversal, so the parens are all
gone by that point (they just tell it how to build the tree). But I can't
think of any hardware optimizations that help with trees, other than the
concept of a "stack", which is hardly a new one. Evidently there are some
though.

-- 
  _______                                     http://www.bigfoot.com/~ecloud
 (_  | |_)  ecloud_at_bigfoot.com   finger rutledge_at_cx47646-a.phnx1.az.home.com
 __) | | \__________________________________________________________________
   Join the ProcessTree Network: For-pay Internet distributed processing.
                http://www.ProcessTree.com/?sponsor=5903
Received on Mon Feb 28 2000 - 19:25:26 GMT

This archive was generated by hypermail 2.3.0 : Fri Oct 10 2014 - 23:32:54 BST