Article View: comp.arch
Article #1645Re: DECSYSTEM 20
From: Peter da Silva
Date: Mon, 24 Jul 1989 13:38
Date: Mon, 24 Jul 1989 13:38
15 lines
1309 bytes
1309 bytes
In article <443@anasaz.UUCP>, john@anasaz.UUCP (John Moore) writes: > I found the ability to define multiple stacks to be very handy. > A FORTH interpreter can be written in that instruction set that > is very efficient. Also, I once wrote a binary tree balancing routine > that used a pair of recursive co-routines. It took about 30 > instructions for both routines. Try that with today's architectures! Well, the PDP-11 used the same concept (stack pointer is a general register). But, really, given that you're using 30 instructions anyway what's the overhead of an extra !mov Rn,SP! in each routine? -- Peter da Silva, Xenix Support, Ferranti International Controls Corporation. Business: peter@ficc.uu.net, +1 713 274 5180. | "...helping make the world Personal: peter@sugar.hackercorp.com. `-_-' | a quote-free zone..." Quote: Have you hugged your wolf today? 'U` | -- hjm@cernvax.cern.ch
Technical Details
Message-ID:
<5213@ficc.uu.net>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!apple!sun-barr!cs.utexas.edu!uunet!ficc!peterReferences:
<3256@wpi.wpi.edu> <EGDORF.89Jul21195924@zaphod.lanl.gov> <443@anasaz.UUCP>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!apple!sun-barr!cs.utexas.edu!uunet!ficc!peter From: peter@ficc.uu.net (Peter da Silva) Newsgroups: comp.arch Subject: Re: DECSYSTEM 20 Message-ID: <5213@ficc.uu.net> Date: 24 Jul 89 13:38:51 GMT References: <3256@wpi.wpi.edu> <EGDORF.89Jul21195924@zaphod.lanl.gov> <443@anasaz.UUCP> Organization: Xenix Support, FICC Lines: 15