Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!julius.cs.uiuc.edu!news.cs.indiana.edu!msi.umn.edu!cs.umn.edu!thornley
From: thornley@cs.umn.edu (David H. Thornley)
Newsgroups: comp.lang.misc
Subject: Re: Complexity of syntax
Message-ID: <1990Dec20.193352.25744@cs.umn.edu>
Date: 20 Dec 90 19:33:52 GMT
References: <9012061208.AA08577@decpa.pa.dec.com> <1990Dec9.013923.14456@cs.umn.edu> <20@garth.UUCP>
Organization: University of Minnesota, Minneapolis - CSCI Dept.
Lines: 18

In article <20@garth.UUCP> smryan@garth.UUCP (Steven Ryan) writes:
>>How many languages support arrays of pointers to functions returning
>>pointers to functions that return pointers to integers?  If you limit
>>yourself to data structures that would work in FORTRAN or Pascal, you
>>have no need for such programs.
>
>[Listing several neat things to do with Algol 68 declarations]
>
>I suppose if you limit yourself to data structures that would work in C,
>you have no need for such programs using (2).
>

Actually, my comment was in reference to the existence of cdecl
to help declare data structures.

Is there an algol68decl program?  :-)

DHT