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.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,5997b4b7b514f689 X-Google-Attributes: gid103376,public From: dewar@merv.cs.nyu.edu (Robert Dewar) Subject: Re: Reading a line of arbitrary length Date: 1997/02/17 Message-ID: #1/1 X-Deja-AN: 219317646 References: <5ds40o$rpo@fg70.rz.uni-karlsruhe.de> <33032AE2.666F@mds.lmco.com> <33037A74.44AF@mds.lmco.com> <3304D791.489C@acm.org> Organization: New York University Newsgroups: comp.lang.ada Date: 1997-02-17T00:00:00+00:00 List-Id: Brian said << This is unfortunate, IMO. Do you think that it would be prohibitively difficult to implement the library in standard Ada 95? I've started working on my Ada pattern matching library, which is based on a Perl style regexp matcher, but I'd drop it if I knew that something better was on the way. Here "better" also means "portable".>> Since we are only interested in it working with GNAT, as efficiently as possible, this is not unfortunate from our point of view. Yes it would be possible to do a portable version, but it would be annoyingly limited (by not allowing the use of nested functions), and the syntax would not be nearly so neat. This implementation will of course be portable between all implementations of GNAT! It will be GPL'ed code, so you can certainly use it as a starting point for a more standard version (it's about 10,000 lines of code in all including comments).