Path: utzoo!utgpu!water!watmath!clyde!att!osu-cis!tut.cis.ohio-state.edu!mailrus!ames!umd5!uflorida!gatech!hubcap!fpst
From: fpst@hubcap.UUCP (Steve Stevenson)
Newsgroups: comp.arch
Subject: Re: typical programs
Message-ID: <1757@hubcap.UUCP>
Date: 26 May 88 17:04:47 GMT
References: <1763@pt.cs.cmu.edu>
Organization: Clemson University, Clemson, SC
Lines: 20

> In article <1035@astroatc.UUCP> johnw@astroatc.UUCP (John F. Wardale) writes:
>>People claim stack machines can give you fast execution and dense code.
>>I have two arguments against this:
>>1: Code Size
>>	Several studies yield overwelming evidence that almost all code
>>	takes on of these three forms:
>>	1: a=b    2: a=a+b    3: a=b+c    (+ is an operation)

It's also fair to point out that many of these old studies were done on
numerical codes which were for compilers which improperly optimized.
Due to the nature of numerical codes and numerical error, lots of people
wanted to make sure that things happened exactly the way the analysis
went.

Non sequitor for the day:
While speed is fine, correctness is more important-- 
Steve Stevenson                            fpst@hubcap.clemson.edu
(aka D. E. Stevenson),                     fpst@clemson.csnet
Department of Computer Science,            comp.parallel
Clemson University, Clemson, SC 29634-1906 (803)656-5880.mabell