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: 103376,4cb1f8d1c17d39a8 X-Google-NewGroupId: yes X-Google-Attributes: gida07f3367d7,domainid0,public,usenet X-Google-Language: ENGLISH,ASCII-7-bit Received: by 10.43.48.202 with SMTP id ux10mr18296664icb.6.1320396518756; Fri, 04 Nov 2011 01:48:38 -0700 (PDT) Path: p6ni69580pbn.0!nntp.google.com!news1.google.com!npeer01.iad.highwinds-media.com!news.highwinds-media.com!feed-me.highwinds-media.com!nntp.club.cc.cmu.edu!feeder.erje.net!news2.arglkargh.de!news.mixmin.net!aioe.org!.POSTED!not-for-mail From: "Dmitry A. Kazakov" Newsgroups: comp.lang.ada Subject: Re: Ada 'hello world' for Android; success! Date: Fri, 4 Nov 2011 09:48:50 +0100 Organization: cbb software GmbH Message-ID: References: <8239efcjuw.fsf@stephe-leake.org> <98ca5430-aa52-4e39-b789-70d0dd6adb46@d33g2000prb.googlegroups.com> <824nyrq5p6.fsf@stephe-leake.org> <4eac1ca1$0$7625$9b4e6d93@newsspool1.arcor-online.net> <82mxciogt0.fsf@stephe-leake.org> <4eafbc25$0$6575$9b4e6d93@newsspool3.arcor-online.net> <82mxcemscg.fsf@stephe-leake.org> <4eb1e241$0$7627$9b4e6d93@newsspool1.arcor-online.net> <8239e5mo9q.fsf@stephe-leake.org> <4eb31240$0$6549$9b4e6d93@newsspool4.arcor-online.net> Reply-To: mailbox@dmitry-kazakov.de NNTP-Posting-Host: FbOMkhMtVLVmu7IwBnt1tw.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 Xref: news1.google.com comp.lang.ada:18822 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit Date: 2011-11-04T09:48:50+01:00 List-Id: On Thu, 03 Nov 2011 23:14:24 +0100, Georg Bauhaus wrote: > On 03.11.11 12:36, Stephen Leake wrote: > >> In my opinion, this recursive descent style is much harder to >> understand. In particular, it is very difficult to see that the program >> structure matches the grammar structure. > > Yes, recursion does take getting used to. I am sketching a generator > that will remove the burden of writing the recursive subprograms. Hmm, actually recursive descent parser is the simplest thing in the world. I never could understand why anybody would need to write some library for that. What is wrong with case Token_Table.Match (Source) is when Boo_Token => Do_Boo; when Foo_Token => Do_Foo; ... end case; -- Regards, Dmitry A. Kazakov http://www.dmitry-kazakov.de