Xref: utzoo comp.lang.c:20602 comp.sys.mac:36312 comp.sys.mac.programmer:8234
Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!purdue!bu-cs!dartvax!eleazar.dartmouth.edu!earleh
From: earleh@eleazar.dartmouth.edu (Earle R. Horton)
Newsgroups: comp.lang.c,comp.sys.mac,comp.sys.mac.programmer
Subject: Re: C wildcard routines
Message-ID: <14989@dartvax.Dartmouth.EDU>
Date: 11 Aug 89 21:29:29 GMT
References: <89220.141719LMD101@PSUVM> <21181@cup.portal.com> <1359@intercon.UUCP>
Sender: news@dartvax.Dartmouth.EDU
Reply-To: earleh@eleazar.dartmouth.edu (Earle R. Horton)
Followup-To: comp.lang.c
Organization: Thayer School of Engineering
Lines: 19

In article <1359@intercon.UUCP> amanda@intercon.uu.net (Amanda Walker) writes:
...
>Another place to look is a set of routines written by Henry Spencer at
>the University of Totonto.  They match UNIX-style regular expressions,
>and all he asks is that you don't misrepresent where you got the code.
>None of the GNU political baggage.  They came across comp.sources.unix
>some time ago--they should be available for FTP from uunet or other
>archive sites.

     A good place to look is j.cc.purdue.edu.  The directory is
comp.sources.unix, and you want files regexp.Z and regexp2.Z.  These
are compressed shar files, if memory serves me well.

     I have used these to do regular expression searching on the Mac,
and they work well.  They are even "16-bit clean," by this meaning
they will compile and run when used with a compiler where (sizeof(int) == 16).
That is most definitely not the case with some of the GNU code.

Earle R. Horton