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

jeremy.p.wright@gmail.com
Wed, 21 Jan 2015 01:05:57 -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: jeremy.p.wright@gmail.com
Newsgroups: comp.compilers
Date: Wed, 21 Jan 2015 01:05:57 -0800 (PST)
Organization: Compilers Central
References: 15-01-035
Keywords: lex
Posted-Date: 21 Jan 2015 17:49:42 EST

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


Post a followup to this message

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