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-Thread: 103376,24d7acf9b853aac8
X-Google-NewGroupId: yes
X-Google-Attributes: gida07f3367d7,domainid0,public,usenet
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news1.google.com!news2.google.com!npeer02.iad.highwinds-media.com!news.highwinds-media.com!feed-me.highwinds-media.com!nntp.club.cc.cmu.edu!micro-heart-of-gold.mit.edu!newsswitch.lcs.mit.edu!nntp.TheWorld.com!not-for-mail
From: Robert A Duff <bobduff@shell01.TheWorld.com>
Newsgroups: comp.lang.ada
Subject: Re: S-expression I/O in Ada
Date: Mon, 09 Aug 2010 15:18:03 -0400
Organization: The World Public Access UNIX, Brookline, MA
Message-ID: <wcctyn3lhn8.fsf@shell01.TheWorld.com>
References: <547afa6b-731e-475f-a7f2-eaefefb25861@k8g2000prh.googlegroups.com>
 <osztlhozsld6.cnzz5m4w13ts.dlg@40tude.net>
 <bd4cba52-3e2c-4160-89bd-1f460271bcf9@5g2000yqz.googlegroups.com>
 <46866b8yq8nn$.151lqiwa0y2k6.dlg@40tude.net>
 <13b07f2c-2f35-43e0-83c5-1b572c65d323@y11g2000yqm.googlegroups.com>
 <13tpf7ya3evig$.h05p3x08059s$.dlg@40tude.net>
 <ee8ec904-60c1-405d-925f-89eba34a44d0@l20g2000yqm.googlegroups.com>
 <wccvd7l86f4.fsf@shell01.TheWorld.com>
 <1omt2srxtpsga$.c3hbxthzo6cf.dlg@40tude.net>
 <wcc4of4ub1x.fsf@shell01.TheWorld.com>
 <1e4cch2df5uyb.18brqdd16dhv8.dlg@40tude.net>
 <wccd3tsizh9.fsf@shell01.TheWorld.com>
 <cba4ng6r4ko9$.158m00g3j3x2a.dlg@40tude.net>
 <wcc7hjzzylp.fsf@shell01.TheWorld.com>
 <14y70ke8am9qw$.2csc9eflvigg.dlg@40tude.net>
 <4c601b5c$0$7665$9b4e6d93@newsspool1.arcor-online.net>
 <9czktq4ntzq7.fhbsnocx0x4w$.dlg@40tude.net>
 <4c6030e3$0$7659$9b4e6d93@newsspool1.arcor-online.net>
 <wcctyn3ra18.fsf@shell01.TheWorld.com>
 <4c6048fd$0$7663$9b4e6d93@newsspool1.arcor-online.net>
NNTP-Posting-Host: shell01.theworld.com
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
X-Trace: pcls6.std.com 1281381468 19650 192.74.137.71 (9 Aug 2010 19:17:48
 GMT)
X-Complaints-To: abuse@TheWorld.com
NNTP-Posting-Date: Mon, 9 Aug 2010 19:17:48 +0000 (UTC)
User-Agent: Gnus/5.1008 (Gnus v5.10.8) Emacs/21.3 (irix)
Cancel-Lock: sha1:zxOqbZwkxUo5hqwPeugHmjy1kqM=
Xref: g2news1.google.com comp.lang.ada:13009
Date: 2010-08-09T15:18:03-04:00
List-Id: <comp.lang.ada>

Georg Bauhaus <rm.dash-bauhaus@futureapps.de> writes:

> Always takes a while until my slow head grasps Dmitry's
> non-Ada semantics.

;-)

Dmitry has many "interesting" ideas about what Ada ought to be like,
some (many?) of which I agree with.  But it's important to keep
straight the difference between "Ada as it is" and "Ada as Dmitry
(or Bob, or ...) would like it to be".  ;-)

> case {T0 x T1 x T3} is
>  when ... => ...
>
> Static dispatch tables on composite types' values
> switching to non-subprogram sequences of instructions
> wrapped in a case statement that's likely to have
> impressive combinatorial properties...

I can think of several reasonable ways to implement such a
feature.  It would, of course, require a rather massive
change to what "static expression" means.

You can already do "case" on a 64-bit integer,
so the compiler already has to deal with cases where
a simple jump table is infeasible.

> Is there no better way than this?
>
> Experimenting further, what will be a useful type of
> case_statement_alternative's discrete choice list, then?
> One that can be explored programmatically?

Any non-limited type, I guess.

- Bob