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=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-20 23:16:03 PST Path: archiver1.google.com!postnews1.google.com!not-for-mail From: 18k11tm001@sneakemail.com (Russ) Newsgroups: comp.lang.ada Subject: Re: += in ada Date: 20 Oct 2003 23:16:02 -0700 Organization: http://groups.google.com Message-ID: References: NNTP-Posting-Host: 63.194.87.148 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 8bit X-Trace: posting.google.com 1066716963 17652 127.0.0.1 (21 Oct 2003 06:16:03 GMT) X-Complaints-To: groups-abuse@google.com NNTP-Posting-Date: Tue, 21 Oct 2003 06:16:03 +0000 (UTC) Xref: archiver1.google.com comp.lang.ada:1254 Date: 2003-10-20T23:16:02-07:00 List-Id: 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. I sense by the haughty tone of your last sentence that is a trick question. Well, if it is, you're going to have to do better than that. Following is the resulting MyAda code, which converted back to the original Ada code flawlessly (not a single character difference). Note that MyAda eliminates the semicolons, converts := and => to =, and uses == for equality testing (oh, gosh, that'll throw all those unwashed C/C++ masses for a loop!). I welcome any other challenges for MyAda. Here is the resulting MyAda code: 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 I'll bet I'm smarter than you think I am, Christoph Grein.