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: a07f3367d7,c550113251b19a6 X-Google-Attributes: gida07f3367d7,public,usenet X-Google-NewGroupId: yes X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news2.google.com!news1.google.com!news.glorb.com!feeder.erje.net!newsfeed.xs4all.nl!newsfeed6.news.xs4all.nl!newsgate.cistron.nl!newsgate.news.xs4all.nl!194.109.133.84.MISMATCH!newsfeed.xs4all.nl!newsfeed5.news.xs4all.nl!xs4all!news.stack.nl!aioe.org!not-for-mail From: Dennis Hoppe Newsgroups: comp.lang.ada Subject: Re: Error: "could not understand bounds information on packed array" Date: Fri, 29 May 2009 15:46:53 +0200 Organization: Aioe.org NNTP Server Message-ID: References: NNTP-Posting-Host: u2a4eF22+ozJM+GErK5hqg.user.aioe.org Mime-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 7bit X-Complaints-To: abuse@aioe.org X-Notice: Filtered by postfilter v. 0.7.9 Cancel-Lock: sha1:OtBVzFYh9GuxnsLJbAlYzfZMQxg= User-Agent: Postbox 1.0b12 (Macintosh/2009051120) Xref: g2news2.google.com comp.lang.ada:6102 Date: 2009-05-29T15:46:53+02:00 List-Id: Thank you both, John and Per, for your answers. In my opionion, the best idea is to transform the recursion into an iterative procedure, because I cannot predict, if the stack size will be sufficient - even if I specify it manually. Nevertheless, it is nice to know, how to alter the stack size in Ada. Best regards, Dennis