Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!nstn.ns.ca!news.cs.indiana.edu!samsung!zaphod.mps.ohio-state.edu!usc!jarthur!nntp-server.caltech.edu!nntp-server.caltech.edu!ph From: ph@ama-1.ama.caltech.edu (Paul Hardy) Newsgroups: comp.arch Subject: Re: standard extensions Message-ID: Date: 23 Feb 91 02:08:07 GMT References: <1087@kaos.MATH.UCLA.EDU> <14814@lanl.gov> <1991Feb15.192653.9846@rice.edu> <6049@mentor.cc.purdue.edu> <3381.27c548c3@iccgcc.decnet.ab.com> Sender: news@nntp-server.caltech.edu Followup-To: comp.arch Organization: California Institute of Technology Lines: 22 In-Reply-To: herrickd@iccgcc.decnet.ab.com's message of 22 Feb 91 21:37:23 GMT Nntp-Posting-Host: ama.caltech.edu In article <3381.27c548c3@iccgcc.decnet.ab.com> herrickd@iccgcc.decnet.ab.com (daniel lance herrick) writes: > What has frosted me about the languages is that the arithmetic > operators are all single valued. I usually want the quotient > and remainder from a division. I have to tell the compiler to > give me the quotient and then tell it to give me the remainder. This is annoying, but it's one thing an optimizer should look for since it happens a lot in multi-precision code so that it won't cost much extra time. Alternatively there's Forth, a stack-based language, which will leave a quotient and remainder on the stack after a divide. And there's always assembly language.... --Paul -- This is my address: ph@ama.caltech.edu This is UUCP: ...!{decwrl,uunet}! This is my address on UUCP: ...!{decwrl,uunet}!caltech.edu!ama!ph Any questions? "Does Emacs have the Buddha nature?" --Paul Hardy "Yow!" --Zippy Brought to you by Super Global Mega Corp .com