Building fast RE parse tree
12 Feb 2000 22:43:08 -0500

          From comp.compilers

Related articles
Building fast RE parse tree (2000-02-12)
| List of all articles for this month |

Newsgroups: comp.compilers
Date: 12 Feb 2000 22:43:08 -0500
Organization: - Before you buy.
Keywords: lex, question

Can anyone point me to a good link that discuss about making a parse
tree of a regular expression notation and change it to DFA.

I have succeded tranforming RE->NFA but its getting slower when the RE
involve more then 2 parentheses (I am using pure PDA machine to build
the parse tree)


Post a followup to this message

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