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=-0.3 required=5.0 tests=BAYES_00, REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,32def4c079945de X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 1995-02-06 15:20:02 PST Path: nntp.gmd.de!newsserver.jvnc.net!nntpserver.pppl.gov!princeton!rutgers!koriel!lll-winken.llnl.gov!winken.llnl.gov!woodruff From: woodruff@neux2.addvax.llnl.gov (John Woodruff) Newsgroups: comp.lang.ada Subject: Re: regular expressions Date: 06 Feb 1995 23:20:02 GMT Organization: Lawrence Livermore National Lab Message-ID: References: <3gucrg$2dn@kaiwan009.kaiwan.com> Reply-To: woodruff1@llnl.gov NNTP-Posting-Host: neux2.llnl.gov In-reply-to: dshochat@kaiwan009.kaiwan.com's message of 3 Feb 1995 15:05:20 -0800 Date: 1995-02-06T23:20:02+00:00 List-Id: David Shochat dshochat@logicon.com asks any regular expression pattern matching tools in Ada? Booch's book Software Components w Ada, Benjamin Cummings 1987, ISBN 0-8053-0610-2 devotes a chapter to pattern matching, including Knuth-Morris-Pratt and Boyer-Moore implementations. The software itself is copyright so you'll need to find a license, however the text presents (almost?) all of the code in Ada. -- John Woodruff Lawrence Livermore National Lab 510 422 4661 -- John Woodruff Lawrence Livermore National Lab 510 422 4661