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,1c5ea9562750d823 X-Google-Attributes: gida07f3367d7,public,usenet X-Google-NewGroupId: yes X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news2.google.com!news3.google.com!proxad.net!feeder1-2.proxad.net!194.25.134.126.MISMATCH!newsfeed01.sul.t-online.de!t-online.de!newsfeed.arcor.de!newsspool1.arcor-online.net!news.arcor.de.POSTED!not-for-mail Date: Thu, 28 May 2009 23:22:31 +0200 From: Georg Bauhaus Reply-To: rm.tsoh+bauhaus@maps.futureapps.de User-Agent: Thunderbird 2.0.0.21 (Windows/20090302) MIME-Version: 1.0 Newsgroups: comp.lang.ada Subject: Re: Ada extension information References: In-Reply-To: Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 7bit Message-ID: <4a1f0096$0$31331$9b4e6d93@newsspool4.arcor-online.net> Organization: Arcor NNTP-Posting-Date: 28 May 2009 23:22:30 CEST NNTP-Posting-Host: 95068e38.newsspool4.arcor-online.net X-Trace: DXC=0cP_O7VW]ogQKQDKiQ7h info@midoan.com wrote: > More specifically where are these Ada extensions formally documented? This is AI 147, Conditional Expressions (as primaries). http://www.ada-auth.org/cgi-bin/cvsweb.cgi/ai05s/ai05-0147-1.txt?rev=1.2 Yet another thing that makes Ada more attractive for programmers who would not waste valuable time for finding names, say write a small named function that conditionally returs this or that. Obviously, local functions are overly verbose and explicative, they must be avoided at all cost. Ada finally gets C's ?: conditionals! Have you ever seen anyone using ?: in C or Perl in a way that is obfuscating? Really? Nah, it's nice! We can even leave out the bulky comb structure. Just pairs of parentheses! the Lisp fans will rejoyce, C programmers will feel at home, done with a single stroke! loop exit if (if N > 0 then M/N > 0 else M > 1); N := F(M, N); end loop; Not even Lisp or ML style let bindings are necessary! Ah, fancy that! We've got more and more anonymous pointers, free and easy, why not free floating control structure then? I forget, it's a nice opportunity for tool vendors to sell more style enforcment programs and language restriction options. They are learning ... :-)