From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Subject: Re: sharp � and ss in Ada keywords like ACCESS
Date: Wed, 12 Oct 2011 09:43:33 +0200
Date: 2011-10-12T09:43:33+02:00 [thread overview]
Message-ID: <1jwwodd91xfc8$.1xbuqt6j4xh5$.dlg@40tude.net> (raw)
In-Reply-To: j72954$3m5$1@munin.nbi.dk
On Tue, 11 Oct 2011 15:32:35 -0500, Randy Brukardt wrote:
> I believe (but haven't checked carefully), that Unicode case folding never
> treats Cyrillic and Latin characters as the same (even when it could).
That is for sure, they are different code points.
> So this problem would not come up in Ada.
Depends on what is considered problematic.
ß is not ss and for that matter, it is not β (beta). Their capital letters,
if exist (ß does not have capital case) are different.
If Ada wished to introduce some rules of equivalence for Central European
languages, like ß=ss, ä=ae, ö=oe, and Eastern European languages, like a=а,
ё=e, and who knows what rules in other languages exist, that would be
hopeless.
But without them, the programmer could have *all* Ada keywords as
identifiers, by replacing appropriate Latin letters with Cyrillic ones.
Furthermore, identifiers looking perfectly same will be different and there
is a huge number of homonyms of practically *each* reasonable identifier. I
see it in breach with basic Ada design.
Since it likely just to stay so, there seems to me absolutely no reason to
keep any reserved keywords in such a language. I would drop them, and
finally be able to declare something "Range".
--
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de
next prev parent reply other threads:[~2011-10-12 7:43 UTC|newest]
Thread overview: 32+ messages / expand[flat|nested] mbox.gz Atom feed top
2011-10-10 16:30 sharp ß and ss in Ada keywords like ACCESS Georg Bauhaus
2011-10-10 16:46 ` Adam Beneschan
2011-10-10 18:23 ` Georg Bauhaus
2011-10-10 22:25 ` sharp � " Randy Brukardt
2011-10-11 7:36 ` Dmitry A. Kazakov
2011-10-11 7:41 ` sharp ß " Yannick Duchêne (Hibou57)
2011-10-11 8:33 ` Dmitry A. Kazakov
2011-10-11 20:32 ` sharp � " Randy Brukardt
2011-10-12 7:43 ` Dmitry A. Kazakov [this message]
2011-10-12 9:42 ` J-P. Rosen
2011-10-12 12:09 ` Dmitry A. Kazakov
2011-10-12 20:17 ` sharp " Randy Brukardt
2011-10-12 21:18 ` Dmitry A. Kazakov
2011-10-11 17:33 ` sharp ß " Martin Krischik
2011-10-11 18:54 ` Adam Beneschan
2011-10-12 13:03 ` Georg Bauhaus
2011-10-12 13:48 ` Dmitry A. Kazakov
2011-10-12 18:24 ` Georg Bauhaus
2011-10-12 20:06 ` sharp � " Randy Brukardt
2011-10-12 20:48 ` sharp ß " Dmitry A. Kazakov
2011-10-12 22:56 ` sharp ß and ss in Ada keywords like AC CESS Georg Bauhaus
2011-10-13 8:10 ` Dmitry A. Kazakov
2011-10-13 12:13 ` Georg Bauhaus
2011-10-13 13:25 ` Dmitry A. Kazakov
2011-10-13 15:18 ` Georg Bauhaus
2011-10-13 19:17 ` Dmitry A. Kazakov
2011-10-11 7:33 ` sharp ß and ss in Ada keywords like ACCESS Yannick Duchêne (Hibou57)
2011-10-11 14:32 ` Adam Beneschan
2011-10-11 17:26 ` sharp ß and ss in Ada keywords like ACCESS (better not) Martin Krischik
2011-10-12 12:34 ` Georg Bauhaus
2011-10-10 17:22 ` sharp ß and ss in Ada keywords like ACCESS Simon Wright
2011-10-10 17:45 ` AdaMagica
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox