Yielding loop-clausesYielding loop-clauses

[Wilhelm Bernhard Kloke]

This topic reminds me on observations I made, when I did my own try at an
Algol68 compiler for the DEC PDP-11.

The language wastes a lot of reserved words for a superfluous construct.
The appended program shows that all of the DO - OD construction is not
needed. A simple function call yields the same result. Of course, it is
(formally) recursive, but tail-recursive, so easily optimised by the
compiler to the same machine language.

Some more text is found in
https://pkeus.de/~wb/RR/algol2000.txt
and
https://pkeus.de/~wb/RR/rant.tex .

In my Bison parser for algol68 I used
( serialclause1 '|' '|' serialclause2 )
as a BRIEF form for
WHILE serialclause1 DO serialclause2 OD

I changed my original VOID version of fortest.a68 to one which yields the
loop INT.
-- 
Dipl.-Math. Wilhelm Bernhard Kloke
Kreisstr. 52, 58454 Witten
Tel. 02302 203050
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://gcc.gnu.org/pipermail/algol68/attachments/20251004/9a2fd264/attachment.htm>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: fortest.a68
Type: application/octet-stream
Size: 411 bytes
Desc: not available
URL: <https://gcc.gnu.org/pipermail/algol68/attachments/20251004/9a2fd264/attachment.obj>