From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,baa6871d466e5af9 X-Google-Attributes: gid103376,public From: dewar@merv.cs.nyu.edu (Robert Dewar) Subject: Re: AQ&S Guidance on pragma Elaborate_Body Date: 1997/04/27 Message-ID: #1/1 X-Deja-AN: 237699764 References: <528878564wnr@diphi.demon.co.uk> <5jabeq$3ltk@info4.rus.uni-stuttgart.de> <5jfukp$lda@top.mitre.org> Organization: New York University Newsgroups: comp.lang.ada Date: 1997-04-27T00:00:00+00:00 List-Id: Matthew Heaney says <> Not necessarily, you can find lots of examples -- I am still surprised if you really never ran across this in your own code. I have not seen any large (say a couple of hundred thousand lines up) Ada program that did NOT have this kind of mutual dependencies -- it is really a natural consequence of any domain in which recursion is an important idiom. For example, if we have a compiler with separate units to handle if statements and loop statements, it is natural for if's to have loops and loops to have if's. Surely you don't think this means that we have to put loops and if's in the same unit -- because if you do you are syaing the whole compiler must be one unit! Another example is that Text_IO might well with some FPT conversion unit, that might well have debugging statements that under a switch call Put_Line in Text_IO. and on and on and on ...