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.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM
	autolearn=ham autolearn_force=no version=3.4.4
X-Google-Thread: 103376,ab1d177a5a26577d
X-Google-NewGroupId: yes
X-Google-Attributes: gida07f3367d7,domainid0,public,usenet
X-Google-Language: ENGLISH,UTF8
Received: by 10.68.38.134 with SMTP id g6mr10557843pbk.6.1317796407303;
        Tue, 04 Oct 2011 23:33:27 -0700 (PDT)
Path: 
 lh7ni11911pbb.0!nntp.google.com!news1.google.com!goblin2!goblin.stu.neva.ru!aioe.org!.POSTED!not-for-mail
From: =?utf-8?Q?Yannick_Duch=C3=AAne_=28Hibou57?=
 =?utf-8?Q?=29?=
 <yannick_duchene@yahoo.fr>
Newsgroups: comp.lang.ada
Subject: Re: What's wrong with C++?
Date: Wed, 05 Oct 2011 08:33:25 +0200
Organization: Ada @ Home
Message-ID: <op.v2u8hzeyule2fv@index.ici>
References: 
 <1ee1a434-4048-48f6-9f5e-d8126bebb808@r19g2000prm.googlegroups.com>
 <op.v2uhj3r7ule2fv@index.ici> <op.v2uhyugyule2fv@index.ici>
 <EeadnV_UDMIFJRbT4p2dnAA@giganews.com> <op.v2uwgkj6ule2fv@index.ici>
 <9f27b2FsgsU1@mid.individual.net>
NNTP-Posting-Host: ayaubkfideyuokJPhZQd9Q.user.speranza.aioe.org
Mime-Version: 1.0
X-Complaints-To: abuse@aioe.org
User-Agent: Opera Mail/11.51 (Linux)
X-Notice: Filtered by postfilter v. 0.8.2
Xref: news1.google.com comp.lang.ada:18307
Content-Type: text/plain; charset=utf-8; format=flowed; delsp=yes
Content-Transfer-Encoding: Quoted-Printable
Date: 2011-10-05T08:33:25+02:00
List-Id: <comp.lang.ada>

Le Wed, 05 Oct 2011 07:13:16 +0200, Niklas Holsti  =

<niklas.holsti@tidorum.invalid> a =C3=A9crit:
> Doesn't Ada have a similar theoretical problem with the elaboration  =

> order? I seem to remember that finding a valid elaboration order for a=
n  =

> arbitrary Ada program is rather difficult, in general, and compilers a=
re  =

> allowed to give up on it.
I am not aware enough of the techniques used there, and not a compiler  =

implementor, but I guess this is a divide-and-conquer strategy. I suppos=
e  =

this end to be solving a graph route problem, not a Turing complete  =

language interpretation.

You raised a good question anyway, I'm curious to know (may be an answer=
  =

in some GNAT design papers, or some answers from Randy).

-- =

=E2=80=9CSyntactic sugar causes cancer of the semi-colons.=E2=80=9D  [Ep=
igrams on  =

Programming =E2=80=94 Alan J. =E2=80=94 P. Yale University]
=E2=80=9CStructured Programming supports the law of the excluded muddle.=
=E2=80=9D [Idem]
Java: Write once, Never revisit