Efficiently building a parse tree from a regular expression

@article{Dub2000EfficientlyBA,
  title={Efficiently building a parse tree from a regular expression},
  author={Danny Dub{\'e} and Marc Feeley},
  journal={Acta Informatica},
  year={2000},
  volume={37},
  pages={121-144}
}
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… CONTINUE READING
Highly Cited
This paper has 23 citations. REVIEW CITATIONS
14 Citations
6 References
Similar Papers

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…