Parsing as Tree Traversal
<|reference_start|>Parsing as Tree Traversal: 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.<|reference_end|>
@article{gerdemann1994parsing,
    title={Parsing as Tree Traversal},
    author={Dale Gerdemann (University of Tuebingen, Germany)},
    journal={arXiv preprint arXiv:cmp-lg/9407027},
    year={1994},
    archivePrefix={arXiv},
    eprint={cmp-lg/9407027},
    primaryClass={cmp-lg cs.CL}
}