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-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,78b2880bc7e78e39 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2001-03-16 13:58:58 PST Path: supernews.google.com!sn-xit-02!supernews.com!news.gv.tsc.tdk.com!hub.org!hub.org!newsfeed.wirehub.nl!fr.usenet-edu.net!usenet-edu.net!freenix!isdnet!grolier!club-internet!not-for-mail From: Laurent Guerby Newsgroups: comp.lang.ada Subject: Re: RISC Date: 16 Mar 2001 20:13:41 +0100 Organization: Club-Internet (France) Message-ID: <86g0gd5xy2.fsf@acm.org> References: <98qumf$5sf$1@nh.pace.co.uk> <98r4g1$7r1$1@nh.pace.co.uk> <3AB22CB2.E8A851A5@averstar.com> NNTP-Posting-Host: nas20-241.vlt.club-internet.fr X-Trace: front7m.grolier.fr 984769824 4135 195.36.170.241 (16 Mar 2001 19:10:24 GMT) NNTP-Posting-Date: 16 Mar 2001 19:10:24 GMT X-Newsreader: Gnus v5.7/Emacs 20.5 Xref: supernews.google.com comp.lang.ada:5770 Date: 2001-03-16T19:10:24+00:00 List-Id: Robert A Duff writes: > There are also a lot of things that rep clauses just can't express. Eg, > TCP/IP protocols often have data structures defined like "a count byte, > followed by an array of sub-records" where the count gives the number of > sub-records, or the number of bytes including (or not including) the > count byte itself. I would like to have a language that could describe > that sort of thing at a reasonably high level. For the "non including" case, a discriminated record should do the job in Ada. (OK, it fails for more complicated stuff.) > - Bob -- Laurent Guerby