Path: utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!tut.cis.ohio-state.edu!ucbvax!decwrl!decvax!ima!cfisun!lakart!dg
From: dg@lakart.UUCP (David Goodenough)
Newsgroups: comp.sources.wanted
Subject: Creating a finite state automaton to process regular expressions
Message-ID: <564@lakart.UUCP>
Date: 9 Jun 89 14:42:11 GMT
Reply-To: dg@lakart.UUCP
Organization: Lakart Corporation, Newton, MA
Lines: 10

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.
-- 
	dg@lakart.UUCP - David Goodenough		+---+
						IHS	| +-+-+
	....... !harvard!xait!lakart!dg			+-+-+ |
AKA:	dg%lakart.uucp@xait.xerox.com		  	  +---+