Xref: utzoo comp.lang.c:36055 comp.std.c:4308
Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!zaphod.mps.ohio-state.edu!ncar!noao!arizona!dave
From: dave@cs.arizona.edu (Dave P. Schaumann)
Newsgroups: comp.lang.c,comp.std.c
Subject: Re: pattern/wild card matching
Message-ID: <844@caslon.cs.arizona.edu>
Date: 12 Feb 91 03:39:43 GMT
References: <6467@saffron1.UUCP>
Followup-To: comp.lang.c
Organization: U of Arizona CS Dept, Tucson
Lines: 21

In article <6467@saffron1.UUCP> benyukhi@motcid.UUCP (Ed Benyukhis) writes:
>Can anyone on the net e-mail or post the sources or pointers to
>where I can find such for the pattern/wild card matching routines
>in "C".  [...]

You might look at the Gnu version of grep.  Also, if you're interested in
a good theoretical discussion, check out chapter 3 of _Compilers: Principles,
Techniques and Tools_ by Aho, Sethi & Ullman (aka the Red Dragon Book).

They give both deterministic and non-deterministic methods of wildcard
matching.






-- 
Dave Schaumann      | DANGER: Access holes may tear easily.  Use of the access
		    | holes for lifting or carrying may result in damage to the
dave@cs.arizona.edu | carton and subsequent injury to the user.