Parsing as tree traversal
Dale Gerdemann · 1994
This paper presents a unified approach to parsing, in which top-down, bottomup and left-corner parsers m:e 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 togethe~ as in the I]IJP parser of Matsumoto.