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=unavailable autolearn_force=no version=3.4.4 Path: border1.nntp.dca3.giganews.com!border2.nntp.dca3.giganews.com!border4.nntp.dca.giganews.com!border2.nntp.dca.giganews.com!nntp.giganews.com!news.glorb.com!feeder.erje.net!eu.feeder.erje.net!de-l.enfer-du-nord.net!feeder1.enfer-du-nord.net!gegeweb.org!aioe.org!.POSTED!not-for-mail From: =?utf-8?Q?Yannick_Duch=C3=AAne_=28Hibou57?= =?utf-8?Q?=29?= Newsgroups: comp.lang.ada Subject: Re: LALR parser question Date: Thu, 02 May 2013 04:39:25 +0200 Organization: Ada @ Home Message-ID: References: <85sj2aydwi.fsf@stephe-leake.org> NNTP-Posting-Host: nS0pckIoQAtdrQ+ei+VCFQ.user.speranza.aioe.org Mime-Version: 1.0 Content-Type: text/plain; charset=utf-8; format=flowed; delsp=yes Content-Transfer-Encoding: Quoted-Printable X-Complaints-To: abuse@aioe.org User-Agent: Opera Mail/12.15 (Linux) X-Notice: Filtered by postfilter v. 0.8.2 X-Original-Bytes: 2049 Xref: number.nntp.dca.giganews.com comp.lang.ada:181352 Date: 2013-05-02T04:39:25+02:00 List-Id: Le Thu, 02 May 2013 03:49:53 +0200, Randy Brukardt = a =C3=A9crit: > I tend to agree that the speed of parsing doesn't matter that much, bu= t = > you > would be surprised at how slow some compilers were at parsing and synt= ax > analysis, especially before GNAT came out. We actually had a pretty = > decent > business from companies that bought our fast compiler just to do > pre-compiles on before using their main development slug to build the = = > actual > system. More precisely, is there an average picture? What is considered fast and= = what is considered slow? Which amount of sample Ada sources parsed in = which amount of time? How slow was their =E2=80=9Cmain development slug=E2= =80=9D? How fast = is Janus Ada compared to theirs? -- = =E2=80=9CSyntactic sugar causes cancer of the semi-colons.=E2=80=9D [1] =E2=80=9CStructured Programming supports the law of the excluded muddle.= =E2=80=9D [1] [1]: Epigrams on Programming =E2=80=94 Alan J. =E2=80=94 P. Yale Univers= ity