🚀 go-pugleaf

In article <14317@lambda.UUCP> jlg@lambda.UUCP (Jim Giles) writes:
>...                    The fact is that C is not simpler to implement
>than the other procedural languages in general use.  In some ways it
>is harder to implement.  Since you pick Fortran as the point of comparison,
>I will look at both.
>[Lots of detail deleted]

While I think that your comparison is fair, you have missed out some tricky 
bits of Fortran, which *might* change the perspective.
For example:

  - DATA statements, with implied DO, which can be quite complex when you 
    have nested cases.

  - EQUIVALENCE statements, which (given overlapping EQUIVALENCEd arrays) can 
    set up quite complex constraint problems.

As you say, these are all well understood etc..., but they DO make Fortran a
bit more complex than you implied.

Mike,



Michael P. Harrison - Software Group - Inmos Ltd. UK.
-----------------------------------------------------------
UK : mph@inmos.co.uk             with STANDARD_DISCLAIMERS;
US : mph@inmos.com               use  STANDARD_DISCLAIMERS;