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=-0.3 required=5.0 tests=BAYES_00, REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4 X-Google-Thread: 103376,a84eaf8fb2470909 X-Google-Attributes: gid103376,public X-Google-Language: ENGLISH,ASCII Path: g2news2.google.com!news3.google.com!border1.nntp.dca.giganews.com!wns14feed!worldnet.att.net!63.218.45.11!nx02.iad01.newshosting.com!newshosting.com!newsfeed.icl.net!newsfeed.fjserv.net!colt.net!feeder.news-service.com!216.196.110.148.MISMATCH!border1.nntp.ams.giganews.com!nntp.giganews.com!pe2.news.blueyonder.co.uk!blueyonder!proxad.net!proxad.net!newsfeed.arcor.de!newsspool4.arcor-online.net!news.arcor.de.POSTED!not-for-mail From: "Dmitry A. Kazakov" Subject: Re: Ada generics Newsgroups: comp.lang.ada User-Agent: 40tude_Dialog/2.0.15.1 MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 8bit Reply-To: mailbox@dmitry-kazakov.de Organization: cbb software GmbH References: <1166710494.869393.108730@a3g2000cwd.googlegroups.com> <17fe4xfogg7p5.1dcyc5nyc2gsl.dlg@40tude.net> <1166805696.291429.239590@48g2000cwx.googlegroups.com> <186qujlcx6rwl.1h6eq4mbdaa5s$.dlg@40tude.net> <1167150212.165097.289010@73g2000cwn.googlegroups.com> <1qmdvus6du3xu.1n21tzgev46ia$.dlg@40tude.net> <1167246396.057028.325080@48g2000cwx.googlegroups.com> <15jxp8z1iu5fk.1oeihvavjghgg$.dlg@40tude.net> <1167327306.22163.66.camel@localhost> Date: Fri, 29 Dec 2006 15:48:40 +0100 Message-ID: <1on3cinnnckc5.1rxxvjhxs5qzl.dlg@40tude.net> NNTP-Posting-Date: 29 Dec 2006 15:48:30 CET NNTP-Posting-Host: cfaca0a9.newsspool2.arcor-online.net X-Trace: DXC=Bk=5\No2HjZHigV@eW57PQA9EHlD;3YcR4Fo<]lROoRQFl8W>\BH3YR?S4OKB_jT_QDNcfSJ;bb[UIRnRBaCd On Thu, 28 Dec 2006 18:35:06 +0100, Georg Bauhaus wrote: > GNAT already supports the detection of identifiers that were > spelled similarly. In case of errors, it lists their "relatives". > Surely a helpful feature, and a proof that practical handling of > natural language identifiers is possible. > As an example, as you have been referring to German, consider that > sharp s, '�', is usually written "SS" when capitalized. > So "Stra�e" tends to become "STRASSE". Now if you have a composite > word that has > - a '�', and > - an 's' right after it, > such as "Ma�stab" (= scale, rule, yardstick), then from a simple > minded formalist's perspective I could argue: > > "Using Unicode is nonsense because there is no 1:1 mapping for the > German word 'Ma�stab' which will become 'MASSSTAB'. "SSS" is > ambiguous, it could be "s�" or it could be "�s". That's too big > a challenge for a compiler write. So leave me alone with your > Unicode and case insensitivity." > > Is that what computer science has to answer when asked about > characters handling? No. CS is all about introducing formal languages in place of natural ones, for obvious reasons. Corollary: never ever make a formal language (Ada) dependent on a natural one (German). That would make the former natural. That's the answer of CS, IMO. -- Regards, Dmitry A. Kazakov http://www.dmitry-kazakov.de