Loading...
Please wait, while we are loading the content...
Similar Documents
Incremental Parser Generation for Tree Adjoining Grammars (1996)
| Content Provider | CiteSeerX |
|---|---|
| Author | Sarkar, Anoop |
| Description | In Proceedings of the 34th Meeting of the ACL, Student Session |
| Abstract | This paper describes the incremental generation of parse tables for the LR#type parsing of Tree Adjoining Languages #TALs#. The algorithm presented handles modi#cations to the input grammar by updating the parser generated so far. In this paper# a lazy generation of LR#type parsers for TALs is de#ned in which parse tables are created by need while parsing. We then describe an incremental parser generator for TALs which responds to modi#cation of the input grammar by updating parse tables built so far. 1 Introduction Tree Adjoining Grammars #TAGs# are tree rewriting systems which combine trees with the single operation of adjunction #see Figure 1#. The construction of deterministic bottom#up left to right parsing of Tree Adjoining Languages #TALs# 1 #Schabes and Vijay#Shanker# 1990# is an extension of the LR pars# ing strategy for context free languages #Aho et al.# 1986#. Parser generation # Thanks to Dania Egedi# Aravind Joshi# B. Srinivas and the student session reviewers. 1 F... |
| File Format | |
| Publisher Date | 1996-01-01 |
| Access Restriction | Open |
| Subject Keyword | Introduction Tree Adjoining Grammar Tag Incremental Generation Lr Par Lr Type Parsing Deterministic Bottom Right Parsing Vijay Shanker Parse Table Incremental Parser Generation Tree Adjoining Grammar Lr Type Parser Lazy Generation Handle Modi Cation Input Grammar Student Session Reviewer Dania Egedi Aravind Joshi Incremental Parser Generator Single Operation Tree Adjoining Language Tals Parser Generation Thanks Context Free Language Aho |
| Content Type | Text |
| Resource Type | Proceeding Article |
