Sciweavers

ACTA
2000

Efficiently building a parse tree from a regular expression

13 years 3 months ago
Efficiently building a parse tree from a regular expression
We show in this paper that parsing with regular expressions instead of context-free grammars, when it is possible, is desirable. We present efficient algorithms for performing different tasks that concern parsing: producing the external representation and the internal representation of parse trees; producing all possible parse trees or a single one. Each of our algorithms to produce a parse tree from an input string has an optimal time complexity, linear with the length of the string. Moreover, ambiguous regular expressions can be used. Key words: regular expression
Danny Dubé, Marc Feeley
Added 17 Dec 2010
Updated 17 Dec 2010
Type Journal
Year 2000
Where ACTA
Authors Danny Dubé, Marc Feeley
Comments (0)