Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| Deterministic Finite Automata: Sub-element captures alexander.morou@gmail.com (Alexander Morou) (2009-09-02) |
| Re: Deterministic Finite Automata: Sub-element captures rsc@swtch.com (Russ Cox) (2009-09-02) |
| Re: Deterministic Finite Automata: Sub-element captures Danny.Dube@ift.ulaval.ca (2009-09-12) |
| From: | Danny.Dube@ift.ulaval.ca (Danny =?utf-8?Q?Dub=C3=A9?=) |
| Newsgroups: | comp.compilers |
| Date: | Sat, 12 Sep 2009 09:49:50 -0400 |
| Organization: | Compilers Central |
| References: | 09-09-013 09-09-021 |
| Keywords: | lex, bibliography |
| Posted-Date: | 13 Sep 2009 20:08:10 EDT |
Hi,
You might find this one interesting:
DubC) D., Feeley M. (2000), "Efficiently building a parse tree from
a regular expression", Acta Informatica, volume 37, number 2,
pages 121-144.
Instead of simply capturing selected sub-expressions, it builds a
complete parse tree for a word w that matches a regular expression r.
The technique can produce either a single parse tree or a grammar that
indirectly represents all the parse trees in time |w|*|r|, no matter
how ambiguous r is.
Danny
--
Danny DubC), professeur
DC)partement d'informatique et de gC)nie logiciel
UniversitC) Laval
Return to the
comp.compilers page.
Search the
comp.compilers archives again.