Re: Algorithm(s) to convert textual regular expressions to a transition table?

Path	csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!usenet.blueworldhosting.com!feeder01.blueworldhosting.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!news.iecc.com!.POSTED!nerds-end
From	ioan <niciodata.eu@gmail.com>
Newsgroups	comp.compilers
Subject	Re: Algorithm(s) to convert textual regular expressions to a transition table?
Date	Wed, 21 Jan 2015 01:46:44 -0800 (PST)
Organization	Compilers Central
Lines	11
Sender	news@iecc.com
Approved	comp.compilers@iecc.com
Message-ID	<15-01-036@comp.compilers> (permalink)
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 1421880544 68925 2001:470:1f07:1126:0:676f:7373:6970 (21 Jan 2015 22:49:04 GMT)
X-Complaints-To	abuse@iecc.com
NNTP-Posting-Date	Wed, 21 Jan 2015 22:49:04 +0000 (UTC)
Keywords	lex
Posted-Date	21 Jan 2015 17:49:04 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:1493

Show key headers only | View raw

Hello,

Some time ago I wrote this:

   http://sourceforge.net/p/nfa2dfa/code/HEAD/tree/nfa2dfa.sh

implementation for the subset construction algorithm.


I don't know how good my choices for data structures I have
used in the implementation were.

Thread

Algorithm(s) to convert textual regular expressions to a transition table? "Costello, Roger L." <costello@mitre.org> - 2015-01-20 16:08 +0000
  Re: Algorithm(s) to convert textual regular expressions to a transition table? ioan <niciodata.eu@gmail.com> - 2015-01-21 01:46 -0800
  Re: Algorithm(s) to convert textual regular expressions to a transition table? jeremy.p.wright@gmail.com - 2015-01-21 01:05 -0800
  Re: Algorithm(s) to convert textual regular expressions to a transition table? Kaz Kylheku <kaz@kylheku.com> - 2015-01-22 01:35 +0000

csiph-web