Re: algorithm performance, was Add nested-function support in a language the based on a stack-machine

rpw3@rpw3.org (Rob Warnock)
Sun, 25 Mar 2018 07:02:11 -0000 (UTC)

          From comp.compilers

Related articles
Re: algorithm performance robin51@dodo.com.au (Robin Vowels) (2018-03-27)
| List of all articles for this month |

From: rpw3@rpw3.org (Rob Warnock)
Newsgroups: comp.compilers
Date: Sun, 25 Mar 2018 07:02:11 -0000 (UTC)
Organization: Rob Warnock, Consulting Systems Architect
References: <6effed5e-6c90-f5f4-0c80-a03c61fd2127@gkc.org.uk> 18-03-090 18-03-092 18-03-094
Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="56608"; mail-complaints-to="abuse@iecc.com"
Keywords: performance, history, comment
Posted-Date: 25 Mar 2018 06:47:35 EDT

At the end of a message by Anton Ertl <anton@mips.complang.tuwien.ac.at>,
our august moderator noted:
+---------------
| [Back in the 1970s, the Dartmouth BASIC compiler was so fast that
| nobody bothered to save object code. It rarely took more than a few
| clock ticks from source code to starting the executable. -John]
+---------------


And lest we forget:


        https://en.wikipedia.org/wiki/WATFIV


WATFOR/WATFIV [a.k.a. Univ. Waterloo FORTRAN] was a compile-and-go
system widely used to teach FORTRAN from 1965 until the late 1980s
[and in some places until >1995].


-Rob


-----
Rob Warnock <rpw3@rpw3.org>
627 26th Avenue <http://rpw3.org/>
San Mateo, CA 94403
[Apropos of another comment, Dartmouth BASIC was a real compiler that
generated machine code. So was WATFOR/WATFIV. -John]


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.