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 X-Received: by 10.107.165.197 with SMTP id o188mr35629508ioe.34.1438091385304; Tue, 28 Jul 2015 06:49:45 -0700 (PDT) X-Received: by 10.140.104.147 with SMTP id a19mr508892qgf.2.1438091385176; Tue, 28 Jul 2015 06:49:45 -0700 (PDT) Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!mx02.eternal-september.org!feeder.eternal-september.org!news.glorb.com!f3no3982572igg.0!news-out.google.com!4ni82434qgh.1!nntp.google.com!69no2426489qgl.1!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail Newsgroups: comp.lang.ada Date: Tue, 28 Jul 2015 06:49:44 -0700 (PDT) In-Reply-To: <75a31df9-801e-4e7f-8e29-403c0650c891@googlegroups.com> Complaints-To: groups-abuse@google.com Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=81.203.145.32; posting-account=AFCLjAoAAABJAOf_HjgEEEi3ty-lG5m2 NNTP-Posting-Host: 81.203.145.32 References: <1ckwx9hern944$.1w0k6fbvlqo62$.dlg@40tude.net> <1ipfeas9434z5.o8661mp0cpkh.dlg@40tude.net> <75a31df9-801e-4e7f-8e29-403c0650c891@googlegroups.com> User-Agent: G2/1.0 MIME-Version: 1.0 Message-ID: Subject: Re: Running a preprocessor from GPS? From: EGarrulo Injection-Date: Tue, 28 Jul 2015 13:49:45 +0000 Content-Type: text/plain; charset=ISO-8859-1 Xref: news.eternal-september.org comp.lang.ada:27087 Date: 2015-07-28T06:49:44-07:00 List-Id: On Tuesday, July 28, 2015 at 3:18:06 PM UTC+2, EGarrulo wrote: > On Tuesday, July 28, 2015 at 2:54:50 PM UTC+2, Dmitry A. Kazakov wrote: > > Preprocessor is never a way. > > Indeed it shouldn't. A preprocessor is a workaround for the limitations > of a programming language. Ideally, you shouldn't need a preprocessor, > but -- alas -- how many languages make a preprocessor redundant? In this case, a deficiency of Ada is that Ada doesn't allow you to evaluate an expression lazily. Let's imagine that Ada had a `lazy` keyword to evaluate an expression lazily. Then I could have written: Trace (Me, lazy "Performing Step " & Step(...)); without any need for a preprocessor.