From mboxrd@z Thu Jan 1 00:00:00 1970 From: peter at rulingia.com (Peter Jeremy) Date: Thu, 23 Jan 2020 16:27:02 +1100 Subject: [COFF] [TUHS] Unix quix In-Reply-To: <20200122184244.14CBB18C083@mercury.lcs.mit.edu> References: <20200122184244.14CBB18C083@mercury.lcs.mit.edu> Message-ID: <20200123052702.GA83898@server.rulingia.com> => coff since it's non-Unix On 2020-Jan-22 13:42:44 -0500, Noel Chiappa wrote: >Pretty interesting machine, if you study its instruction set, BTW; with no >stack, subroutines are 'interesting'. "no stack" was fairly standard amongst early computers. Note the the IBM S/360 doesn't have a stack.. The usual approach to subroutines was to use some boilerplate as part of the "call" or function prologue that stashed a return address in a known location (storing it in the word before the function entry or patching the "return" branch were common aproaches). Of course this made recursion "hard" (re-entrancy typically wasn't an issue) and Fortran and Cobol (at least of that vintage) normally don't support recursion for that reason. -- Peter Jeremy -------------- next part -------------- A non-text attachment was scrubbed... Name: signature.asc Type: application/pgp-signature Size: 963 bytes Desc: not available URL: