Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.compilers > #1494
| From | jeremy.p.wright@gmail.com |
|---|---|
| Newsgroups | comp.compilers |
| Subject | Re: Algorithm(s) to convert textual regular expressions to a transition table? |
| Date | 2015-01-21 01:05 -0800 |
| Organization | Compilers Central |
| Message-ID | <15-01-037@comp.compilers> (permalink) |
| References | <15-01-035@comp.compilers> |
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
Back to comp.compilers | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll 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