pattern/wild card matching

Ron Levine levine at szebra.com
Fri Feb 15 20:06:00 AEST 1991


In article <844 at caslon.cs.arizona.edu> dave at cs.arizona.edu (Dave P. Schaumann) writes:
>In article <6467 at saffron1.UUCP> benyukhi at 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 at cs.arizona.edu | carton and subsequent injury to the user.

Source code routines for regular expressions and a mini-grep were published
in C-Gazette within the last 6 months.  You can contact the magazine
operating people or use their source code BBS to download (408-2410164)

ron levine



More information about the Comp.lang.c mailing list