🚀 go-pugleaf

(Actual subject, BCPL syntax)
In article <3452@ficc.uu.net> peter@ficc.uu.net (Peter da Silva) writes:
>In article <39273@oliveb.olivetti.com>, chase@Ozona.orc.olivetti.com (David Chase) writes:
>>         LET min2(a,b) = a < b -> a,b
>
>Take your pick:
>
>	min2(a,b) { return (a < b) ? a : b; }
>	#define min2(a,b) (((a) < (b)) ? (a) : (b))
>-- 

You are actually missing a certain subtlety here.  The BCPL statement
when executed assigns the address of the code segment to variable min2.
BCPL (at least on the IBM 360 that I used around 1970) linked separate
compilation modules in an interesting way:

1. BCPL maintains a global common area with numbered (ugh!) slots.

2. Somewhere in the program is a list of compilation module names.

3. When the program loads, each module gets called in turn.

4. The top level code in each module consists of procedure (and global
   data declarations) which assign the routine addresses in the common
   area.

5. The "main" module, which is last in the list, contains the main procedure
    which now has access to procedures in any module!

Pretty clever, heh? Sorta looks a bit like Modula-2?

If you are really tricky, you could do something like:

	temp, min, max := min, max, temp

to exchange the functions "min" and "max" anywhere they are used!

Tom Almy
toma@tekgvs.labs.tek.com
Standard Disclaimers Apply
(And I haven't used BCPL in over 15 years now)