Re: += in ada

[18k11tm001@sneakemail.com (Russ)]

christoph.grein@eurocopter.com wrote in message news:<mailman.120.1066647437.25614.comp.lang.ada@ada-france.org>...
> > 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.