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: a07f3367d7,4fd338e56f592cfb X-Google-Attributes: gida07f3367d7,public,usenet X-Google-NewGroupId: yes X-Google-Language: ENGLISH,ASCII-7-bit X-Received: by 10.180.76.194 with SMTP id m2mr2920139wiw.4.1367665914234; Sat, 04 May 2013 04:11:54 -0700 (PDT) Path: hg5ni66838wib.1!nntp.google.com!feeder1.cambriumusenet.nl!82.197.223.108.MISMATCH!feeder2.cambriumusenet.nl!feed.tweaknews.nl!194.109.133.86.MISMATCH!newsfeed.xs4all.nl!newsfeed3.news.xs4all.nl!xs4all!border4.nntp.ams.giganews.com!border2.nntp.ams.giganews.com!border3.nntp.ams.giganews.com!border1.nntp.ams.giganews.com!backlog1.nntp.dca.giganews.com!border3.nntp.dca.giganews.com!border1.nntp.dca.giganews.com!border4.nntp.dca.giganews.com!border2.nntp.dca.giganews.com!nntp.giganews.com!nrc-news.nrc.ca!News.Dal.Ca!news.litech.org!news.stack.nl!aioe.org!.POSTED!not-for-mail From: "Dmitry A. Kazakov" Newsgroups: comp.lang.ada Subject: Re: LALR parser question Date: Tue, 30 Apr 2013 23:18:56 +0200 Organization: cbb software GmbH Message-ID: References: <85sj2aydwi.fsf@stephe-leake.org> Reply-To: mailbox@dmitry-kazakov.de NNTP-Posting-Host: 15waz9CoS+eMakbyhTPyFQ.user.speranza.aioe.org Mime-Version: 1.0 X-Complaints-To: abuse@aioe.org User-Agent: 40tude_Dialog/2.0.15.1 X-Notice: Filtered by postfilter v. 0.8.2 X-Original-Bytes: 1764 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit Date: 2013-04-30T23:18:56+02:00 List-Id: On Tue, 30 Apr 2013 09:06:53 -0700 (PDT), Shark8 wrote: > Had to look that one up -- then got sidetracked, as there' s a lot of interesting stuff out there. > > http://en.wikipedia.org/wiki/GLR_parser > http://link.springer.com/chapter/10.1007%2F3-540-53669-8_70 -- hybrid ascent-descent > > It's an interesting field, IMO. The way humans parse texts and consequently grammars of programming are uncorrelated to the classes of formal grammars. This is why formal grammars proved to be quite useless for compiler construction. Practically there is no language for which recursive descent parser would not work, provided that literals, identifiers and expressions are parsed by other means. Specifically, parsing Ada imposes no problems at all. -- Regards, Dmitry A. Kazakov http://www.dmitry-kazakov.de