Paper: Simplifying Deterministic Parsing

ACL ID P84-1052
Title Simplifying Deterministic Parsing
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1984

This paper presents a model for deterministic parsing which was designed to simplify the task of writing and understanding a deterministic grammar. While retaining structures and operations similar to those of Mareus's PARSIFAL parser [Marcus 80] the grammar language incorporates the following changes. (1) The use of productions operating in parallel has essentially been eliminated and instead the productions are organized into sequences. Not only does this improve the understandability of the grammar, it is felt that, this organization corresponds more closely to the task of per- forming the sequence of buffer transformations and attachments required to parse the most common constituent types. (2) A general method for interfacing between the parser and a semavtic represen- tation system i...