Article View: comp.sys.transputer
Article #1713Re: Why Occam3 probably won't be recursive (was: IS Occam3 recursive?)
From: Bryan Carpenter
Date: Wed, 18 Nov 1992 11:37
Date: Wed, 18 Nov 1992 11:37
23 lines
1445 bytes
1445 bytes
In <2225@eagle.ukc.ac.uk> wgd@ukc.ac.uk (W.G.Day) writes: >... >As the adding of recursion would prevent the compile-time-only memory >allocation from being performed (occam programs should never run out of >memory at runtime); I suspect not. >However, having recently implemented the Towers of Hanoi on a processor farm >and quicksort in occam (Tony Hoare's sort algorithm on C.S.P. hardware, hmm), >I found the building of my own stack to hold the details of the recursing on >to be the quite literally the easist part of the whole designing and writing >process, and it's not something I've had to do before. Doing it all yourself >means you can build a queue instead of a stack and do things breadth-first if >you wish. Personally, I wouldn't object to building my own stack, if I just had `malloc' to do it with. Building my own `malloc' I object to more strongly. >Warren Bryan
Technical Details
Message-ID:
<dbc.722086651@bill>Path:
arc1-ca.pugleaf.net!sparky!uunet!cis.ohio-state.edu!zaphod.mps.ohio-state.edu!sol.ctr.columbia.edu!spool.mu.edu!agate!doc.ic.ac.uk!sot-ecs!bill!dbcReferences:
<1992Nov11.033835.21118@netcom.com> <2225@eagle.ukc.ac.uk>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!cis.ohio-state.edu!zaphod.mps.ohio-state.edu!sol.ctr.columbia.edu!spool.mu.edu!agate!doc.ic.ac.uk!sot-ecs!bill!dbc From: dbc@ecs.soton.ac.uk (Bryan Carpenter) Newsgroups: comp.sys.transputer Subject: Re: Why Occam3 probably won't be recursive (was: IS Occam3 recursive?) Keywords: Occam3 recursive, no Message-ID: <dbc.722086651@bill> Date: 18 Nov 92 11:37:31 GMT References: <1992Nov11.033835.21118@netcom.com> <2225@eagle.ukc.ac.uk> Sender: news@ecs.soton.ac.uk Lines: 24 Nntp-Posting-Host: bill