Parsing as Tree Traversal
cmp-lg
2008-02-03 v1 Computation and Language
Abstract
This paper presents a unified approach to parsing, in which top-down, bottom-up and left-corner parsers are related to preorder, postorder and inorder tree traversals. It is shown that the simplest bottom-up and left-corner parsers are left recursive and must be converted using an extended Greibach normal form. With further partial execution, the bottom-up and left-corner parsers collapse together as in the BUP parser of Matsumoto.
Cite
@article{arxiv.cmp-lg/9407027,
title = {Parsing as Tree Traversal},
author = {Dale Gerdemann},
journal= {arXiv preprint arXiv:cmp-lg/9407027},
year = {2008}
}
Comments
COLING 94 paper, Postscript, compressed and uuencoded