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=-0.3 required=5.0 tests=BAYES_00,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4
X-Google-Thread: 56f85c39da,6684a832252eb200
X-Google-Attributes: gid56f85c39da,public,usenet
X-Google-NewGroupId: yes
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news2.google.com!news1.google.com!npeer02.iad.highwinds-media.com!news.highwinds-media.com!feed-me.highwinds-media.com!border1.nntp.dca.giganews.com!nntp.giganews.com!newsfeed00.sul.t-online.de!newsfeed01.sul.t-online.de!t-online.de!newsfeed.straub-nv.de!noris.net!newsfeed.arcor.de!newsspool4.arcor-online.net!news.arcor.de.POSTED!not-for-mail
From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Subject: Re: Alternatives to C: ObjectPascal, Eiffel, Ada or Modula-3?
Newsgroups: 
 comp.lang.eiffel,comp.lang.ada,comp.lang.modula3,comp.lang.pascal.misc,comp.programming
User-Agent: 40tude_Dialog/2.0.15.1
MIME-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Content-Transfer-Encoding: 7bit
Reply-To: mailbox@dmitry-kazakov.de
Organization: cbb software GmbH
References: <h3sln0$rhm$2@news.eternal-september.org>
 <c3f14h.bln.ln@hunter.axlog.fr>
  <b72f5d8d-0cea-4d5c-bf28-beeb32f349b2@o6g2000yqj.googlegroups.com>
 <uj124h.761.ln@hunter.axlog.fr>
 <bac5e579-f959-4b13-a01e-f727c3a5056f@d32g2000yqh.googlegroups.com>
Date: Fri, 24 Jul 2009 10:10:24 +0200
Message-ID: <nqb4iishm0vw.1t8g054350cqt.dlg@40tude.net>
NNTP-Posting-Date: 24 Jul 2009 10:10:21 CEST
NNTP-Posting-Host: 17308f64.newsspool1.arcor-online.net
X-Trace: 
 DXC=M7Q8i;ZT>NF^B]`=U:WelBic==]BZ:afN4Fo<]lROoRA^YC2XCjHcbIG^P39oGY4INDNcfSJ;bb[EIRnRBaCd<MNDGZ:eR_53\J=SmcOZEToaJ
X-Complaints-To: usenet-abuse@arcor.de
Xref: g2news2.google.com comp.lang.eiffel:404 comp.lang.ada:7305
 comp.lang.modula3:93 comp.lang.pascal.misc:307 comp.programming:12012
Date: 2009-07-24T10:10:21+02:00
List-Id: <comp.lang.ada>

On Fri, 24 Jul 2009 00:26:11 -0700 (PDT), tm wrote:

> On 20 Jul., 17:14, Jean-Pierre Rosen <ro...@adalog.fr> wrote:
>>
>> Parsing is not the difficult part of an Ada compiler.
> 
> I once met somebody, who wrote the front end of an Ada compiler, and
> he told me a different story. E.g.: He said that a special function
> needs to read ahead just to find out the semantic of a parenthesis.

There is no need to know the semantics of parenthesis in order to parse
them. Semantic analysis is anther compilation phase.

The only moderately difficult part of Ada that requires short look ahead
are digraphs like "and then" (overloaded with "and"). There can be comments
and new lines between "and" and "then" in the digraph. However it does not
require any roll backs.

> Another friend told me
> stories about a buggy early Ada compiler where it was necessary to
> "code around" compiler bugs.

This problem still exist. (:-() This is not language specific, Delphi,
Borland C++, MSVC are no less buggy.

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de