Parsing as Tree Traversal

Details Parsing as Tree Traversal Parsing as Tree Traversal

1994-07-29

arxiv.org/abs/cmp-lg/9407027v1

Computer Science

Computation and Language

COLING 94 paper, Postscript, compressed and uuencoded

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Parsing as Tree Traversal does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Parsing as Tree Traversal, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parsing as Tree Traversal will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-282186