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.2 required=5.0 tests=BAYES_00,INVALID_MSGID, REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,999172cfe4113340 X-Google-Attributes: gid103376,public From: dvdeug@x8b4e53cd.dhcp.okstate.edu (David Starner) Subject: Re: How to implement a continue statement in Ada? Date: 2000/02/09 Message-ID: <87s8s3$aai1@news.cis.okstate.edu>#1/1 X-Deja-AN: 583782283 References: <87pgm3$o3p$1@nnrp1.deja.com> <87pmrq$9ae1@news.cis.okstate.edu> Organization: Oklahoma State University User-Agent: slrn/0.9.6.2 (Linux) Reply-To: dstarner98@aasaa.ofe.org Newsgroups: comp.lang.ada Date: 2000-02-09T00:00:00+00:00 List-Id: On 08 Feb 2000 22:28:08 +0000, Aidan Skinner wrote: >dvdeug@x8b4e53cd.dhcp.okstate.edu (David Starner) writes: > >> I disagree with that rule. The goto statement is the most >> powerful control structure, and judiciously used, is >> very useful. My most recent use of a goto was to emulate >> tail recursion. Does that mean that Ada needs a tail > >I would expect this case to be picked up by the compiler, without the >need for an explicit goto. Was there a reason why the appropriate >section of code couldn't be put into a (possibly nested) procedure and >recurse itself? The code was part of a lexer, and looked like function lexer return token is begin <