Parsing as Tree Traversal

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
COLING 94 paper, Postscript, compressed and uuencoded

Keywords

Computation and Language

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/151038

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cmp-lg/9407027
 http://arxiv.org/abs/cmp-lg/9407027

Collections

arXiv