Parsing as Tree Traversal
| dc.creator | Gerdemann, Dale | |
| dc.date | 1994-07-29 | |
| dc.date.accessioned | 2026-07-07T09:09:26Z | |
| dc.date.available | 2026-07-07T09:09:26Z | |
| dc.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. | |
| dc.description | COLING 94 paper, Postscript, compressed and uuencoded | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9407027 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9407027 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151038 | |
| dc.subject | Computation and Language | |
| dc.title | Parsing as Tree Traversal | |
| dc.type | text |