Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!swrinde!cs.utexas.edu!uunet!convex!swarren
From: swarren@convex.com (Steve Warren)
Newsgroups: comp.sys.amiga.misc
Subject: Re: Wanted: fast string searching routine in C (SAS/Lattice)
Message-ID: <1991Apr15.171655.20761@convex.com>
Date: 15 Apr 91 17:16:55 GMT
References: <1991Apr11.055803.404@ericsson.se>
Sender: newsadm@convex.com (news access account)
Organization: Convex Computer Corporation, Richardson, Tx.
Lines: 27
Nntp-Posting-Host: neptune.convex.com

In article <1991Apr11.055803.404@ericsson.se> etmjvro@sunbeamfs.ericsson.se writes:
                           [...]
> from the autodoc files. I've used the lattice/sas grep program,
> but this is not so fast. What I need is a program or routine in
                           [...]
If you can find the source to the Unix 'egrep' command, that might be
what you are looking for.  Here is something I snipped out of the man
page for grep on our system:

"DESCRIPTION
     Commands of the grep family search the input files (standard
     input default) for lines matching a pattern.  Normally, each
     line found is copied to the standard output.  Grep patterns
     are limited regular expressions in the style of ex(1); it
     uses a compact nondeterministic algorithm.  Egrep patterns
     are full regular expressions; it uses a fast deterministic
                                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
     algorithm that sometimes needs exponential space.  Fgrep
     patterns are fixed strings.  The following options are
     recognized."

            _.
--Steve   ._||__      DISCLAIMER: All opinions are my own.
  Warren   v\ *|     ----------------------------------------------
             V       {uunet,sun}!convex!swarren; swarren@convex.com

--