Path: utzoo!attcan!uunet!wuarchive!sdd.hp.com!ucsd!ucbvax!SHUM.HUJI.AC.IL!gadi
From: gadi@SHUM.HUJI.AC.IL (Gad Aharoni)
Newsgroups: comp.lang.misc
Subject: Re: C's sins of commission
Message-ID: <387@shum.huji.ac.il>
Date: 11 Oct 90 08:42:15 GMT
References: <64618@lanl.gov).<2883@igloo.scum.com).<2171@enea.se>
Sender: daemon@ucbvax.BERKELEY.EDU
Lines: 20

UUCP>
Reply-To: shum!gadi (Gad Aharoni)
Organization: The Hebrew University of Jerusalem
Lines: 15
Apparently-To: post-usenet@ucbvax.berkeley.edu

In article <3254@mcrware.UUCP> jejones@mcrware.UUCP (James Jones) writes:

>... but I'd rather like the ability to define
>recursive data structures (I think Hoare wrote a paper about this sort
>of thing) rather than using pointers.  I tend to agree--pointers are to
>data structure what gotos are to control flow.

To all you pointer haters, I hate to point out that it is exremely
awkward to implement a graph data structure without the use of pointers.
And a graph is the most general data structure.

Incidentally, pointers do not necessarily mean side effects.

Gadi