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,dff686f95f235879 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2003-01-17 00:29:07 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!news.tele.dk!news.tele.dk!small.news.tele.dk!newsfeed.wirehub.nl!transit.news.xs4all.nl!newsfeed.xs4all.nl!xs4all!not-for-mail Sender: Fraser@FWILSON From: Fraser Wilson Newsgroups: comp.lang.ada Subject: Re: Composing sequences (interesting to solve) References: <3e2620ad$0$33930$bed64819@news.gradwell.net> <3e2712ff$0$33929$bed64819@news.gradwell.net> User-Agent: Gnus/5.09 (Gnus v5.9.0) Emacs/21.2 Date: 17 Jan 2003 09:27:49 +0100 Message-ID: MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii NNTP-Posting-Date: 17 Jan 2003 09:27:54 CET NNTP-Posting-Host: 80.126.24.12 X-Trace: 1042792074 news.xs4all.nl 49107 80.126.24.12:1155 X-Complaints-To: abuse@xs4all.nl Xref: archiver1.google.com comp.lang.ada:33118 Date: 2003-01-17T09:27:54+01:00 List-Id: porton@ex-code.com (Victor Porton) writes: > In article ,> You haven't given me a solution. (I suspect that it is even impossible > in Ada9X.) Presented with S & T where S is a sequence, and T is something else, how can you know whether the desired result is a new sequence of S and T, or the sequence S with T tacked onto the end (i.e. an intermediate result from "P & Q & T")? Unless you add an extra rule which says that all sequences get merged (i.e. always choose the second option in this case), I don't think this is possible. It's not an Ada thing as such; more of an ambiguity in the problem definition. Fraser.