Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!news.glorb.com!border1.nntp.dca1.giganews.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!news.iecc.com!.POSTED!nerds-end
From: jeremy.p.wright@gmail.com
Newsgroups: comp.compilers
Subject: Re: Algorithm(s) to convert textual regular expressions to a transition table?
Date: Wed, 21 Jan 2015 01:05:57 -0800 (PST)
Organization: Compilers Central
Lines: 9
Sender: news@iecc.com
Approved: comp.compilers@iecc.com
Message-ID: <15-01-037@comp.compilers>
References: <15-01-035@comp.compilers>
NNTP-Posting-Host: news.iecc.com
Mime-Version: 1.0
Content-Type: text/plain; charset=ISO-8859-1
X-Trace: miucha.iecc.com 1421880582 69247 2001:470:1f07:1126:0:676f:7373:6970 (21 Jan 2015 22:49:42 GMT)
X-Complaints-To: abuse@iecc.com
NNTP-Posting-Date: Wed, 21 Jan 2015 22:49:42 +0000 (UTC)
Keywords: lex
Posted-Date: 21 Jan 2015 17:49:42 EST
X-submission-address: compilers@iecc.com
X-moderator-address: compilers-request@iecc.com
X-FAQ-and-archives: http://compilers.iecc.com
Xref: csiph.com comp.compilers:1494

As John says, there are tools such as lex that already do this. If you
need to use regular expressions, use an existing tool.

If you want a good description of what is going on inside such tools,
I recommend Chapter 2 of Engineering a Compiler, by Keith Cooper and
Linda Torczon of Rice University.

Jeremy