ML p(r)ior | Parsing as Tree Traversal

Parsing as Tree Traversal

9407027 | cmp-lg
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.

Highlights - Most important sentences from the article

Login to like/save this paper, take notes and configure your recommendations