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 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,54889de51045a215 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2003-10-21 01:35:13 PST Path: archiver1.google.com!news2.google.com!news.maxwell.syr.edu!feed.news.qwest.net!namche.sun.com!news1brm.central.sun.com!new-usenet.uk.sun.com!not-for-mail From: Ole-Hjalmar Kristensen Newsgroups: comp.lang.ada Subject: Re: += in ada Date: 21 Oct 2003 10:25:58 +0200 Organization: Sun Microsystems Message-ID: References: NNTP-Posting-Host: khepri06.norway.sun.com Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Trace: new-usenet.uk.sun.com 1066724759 11980 129.159.112.195 (21 Oct 2003 08:25:59 GMT) X-Complaints-To: usenet@new-usenet.uk.sun.com NNTP-Posting-Date: 21 Oct 2003 08:25:59 GMT User-Agent: Gnus/5.0808 (Gnus v5.8.8) Emacs/21.2 Xref: archiver1.google.com comp.lang.ada:1258 Date: 2003-10-21T08:25:59+00:00 List-Id: >>>>> "R" == Russ <18k11tm001@sneakemail.com> writes: R> christoph.grein@eurocopter.com wrote in message news:... >> > I realize that standard Ada is stuck with ":=", of course. However, I >> > have developed a relatively simple pre-processor that effectively >> > implements a dialect of Ada that uses "=". I call it "MyAda". I also >> > have the inverse pre-processor, so I can go in both directions. With a >> > few additional utilities, it should be possible for a member of an Ada >> > devepment team to use MyAda without anyone else on the team ever even >> > knowing. I realize that this is a long shot, but as I said, I am a bit >> > obsessive/compulsive. >> >> Russ, >> >> Try YourAda on >> >> procedure P is >> >> procedure Russ (X: in Boolean) is begin null; end Russ; >> >> X, Y: Boolean; >> >> begin >> >> Russ (X => Y); >> Russ (X = Y); >> >> end P; >> >> And please, do tell me the outcome. R> I sense by the haughty tone of your last sentence that is a trick R> question. Well, if it is, you're going to have to do better than that. R> Following is the resulting MyAda code, which converted back to the R> original Ada code flawlessly (not a single character difference). Note R> that MyAda eliminates the semicolons, converts := and => to =, and R> uses == for equality testing (oh, gosh, that'll throw all those R> unwashed C/C++ masses for a loop!). I welcome any other challenges for R> MyAda. Here is the resulting MyAda code: R> procedure P is R> procedure Russ (X: in Boolean) is begin null; end Russ R> X, Y: Boolean R> begin R> Russ (X = Y) I think you have just illustrated his point .... R> Russ (X == Y) R> end P R> I'll bet I'm smarter than you think I am, Christoph Grein. -- This page intentionally left blank