Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.compilers > #1493

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

From ioan <niciodata.eu@gmail.com>
Newsgroups comp.compilers
Subject Re: Algorithm(s) to convert textual regular expressions to a transition table?
Date 2015-01-21 01:46 -0800
Organization Compilers Central
Message-ID <15-01-036@comp.compilers> (permalink)
References <15-01-035@comp.compilers>

Show all headers | 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.

Back to comp.compilers | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread

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