home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!charon.amdahl.com!pacbell.com!decwrl!sdd.hp.com!zaphod.mps.ohio-state.edu!rpi!batcomputer!munnari.oz.au!uniwa!john
- From: john@gu.uwa.edu.au (John West)
- Newsgroups: comp.arch
- Subject: Re: What's wrong with stack machines?
- Date: 6 Nov 1992 02:23:56 GMT
- Organization: The University of Western Australia
- Lines: 18
- Message-ID: <1dckvsINN7mb@uniwa.uwa.edu.au>
- References: <17035@mindlink.bc.ca> <Bx679q.Az9.2@cs.cmu.edu>
- NNTP-Posting-Host: mackerel.gu.uwa.edu.au
-
- lindsay+@cs.cmu.edu (Donald Lindsay) writes:
-
- >>You have to consider stack machines according to their own strengths, not how
- >>well or not well they handle non-stack language programming techniques.
-
- >Surely typical stack-language programs can be mechanically
- >transformed (recompiled) into non-stack forms.
-
- And typical non-stack-languages can be transformed into stack forms. So?
- You lose a lot of efficiency going both ways. There is no way a conventional
- processor is going to run converted stack code as well as a stack machine.
- Likewise, a stack machine is going to have a tough time on the converted
- non-stack code.
- The problem is that there hasn't been enough work done on stack languages.
-
- John West
- --
- For the humour impaired: Insert a :-) after every third word
-