Paper: Incremental Parser Generation For Tree Adjoining Grammars

ACL ID P96-1056
Title Incremental Parser Generation For Tree Adjoining Grammars
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1996
Authors
  • Anoop Sarkar (University of Pennsylvania, Philadelphia PA)

This paper describes the incremental generation of parse tables for the LR- type parsing of Tree Adjoining Languages (TALs). The algorithm presented han- dles modifications to the input grammar by updating the parser generated so far. In this paper, a lazy generation of LR- type parsers for TALs is defined in which parse tables are created by need while parsing. We then describe an incremental parser generator for TALs which responds to modification of the input grammar by updating parse tables built so far. 1 LR Parser Generation Tree Adjoining Grammars (TAGs) are tree rewrit- ing systems which combine trees with the sin- gle operation of adjoining. (Schabes and Vijay- Shanker, 1990) describes the construction of an LR parsing algorithm for TAGs 1. Parser generation here is taken to be th...