nmm@cl.cam.ac.uk (Nick Maclaren) (04/18/91)
I am involved in the publication of algorithms, and would be interested
in any references to descriptions of pseudocodes (i.e. formalised code,
based on ordinary English). Almost every relevant book, from Knuth to
the most obscure, uses one - unfortunately, I am looking for a description
of the technique. I require a well-described pseudocode with the
following properties:
1) It must be very compact (preferably many times more concise than
most 3GLs).
2) It must be clear to the reader, even if he has never seen its
description or any of the code before.
3) It must be flexible enough to describe almost all algorithms (in
my case, semi-numerical or numerical).
4) It need NOT be compilable using current technology though (from
point 2 above), it must be theoretically 'almost compilable'.
I can remember that there were considerable arguments between the Algol
people and the pseudocode people some 20-30 years ago, but I am
disinclined to chase references that old. Has anything useful been
published recently?
Please reply by EMAIL, unless your followup is likely to be of general
interest. I will summarise if I get enough responses to make it worth
while people reading the summary.
Nick Maclaren
University of Cambridge Computer Laboratory
nmm@cl.cam.ac.uk