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

ioan <niciodata.eu@gmail.com>
Wed, 21 Jan 2015 01:46:44 -0800 (PST)

          From comp.compilers
Related articles
Algorithm(s) to convert textual regular expressions to a transition ta costello@mitre.org (Costello, Roger L.) (2015-01-20)
Re: Algorithm(s) to convert textual regular expressions to a transitio niciodata.eu@gmail.com (ioan) (2015-01-21)
Re: Algorithm(s) to convert textual regular expressions to a transitio jeremy.p.wright@gmail.com (2015-01-21)
Re: Algorithm(s) to convert textual regular expressions to a transitio kaz@kylheku.com (Kaz Kylheku) (2015-01-22)
| List of all articles for this month |
From: ioan <niciodata.eu@gmail.com>
Newsgroups: comp.compilers
Date: Wed, 21 Jan 2015 01:46:44 -0800 (PST)
Organization: Compilers Central
References: 15-01-035
Keywords: lex
Posted-Date: 21 Jan 2015 17:49:04 EST

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.

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.