Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!rutgers!apple!bloom-beacon!tut.cis.ohio-state.edu!ukma!uflorida!novavax!twwells.com!bill
From: bill@twwells.com (T. William Wells)
Newsgroups: comp.sources.wanted
Subject: Re: Creating a finite state automaton to process regular expressions
Message-ID: <1989Jun11.164257.2297@twwells.com>
Date: 11 Jun 89 16:42:57 GMT
References: <564@lakart.UUCP>
Reply-To: bill@twwells.UUCP (T. William Wells)
Organization: None, Ft. Lauderdale, FL
Lines: 14

In article <564@lakart.UUCP> dg@lakart.UUCP writes:
: I am looking for code, comments, suggestions on how to create a FSA that
: will recognise regular expressions, when handed a stream of text (i.e.
: a file). Ignoring the setup time, I'm basically after a linear time grep
: algorithm. Comments on what can be done and what can't, and how to do it,
: will be welcome, as will any source or anything.

You might pick up _Compilers: Principles, Techniques, and Tools_ by
Aho, Sethi, and Ullman. It has all the information you'll need, though
no source code. And yes, you can do a linear time grep, though both
the setup time and memory use can be awful on occasion.

---
Bill                            { uunet | novavax } !twwells!bill