Incremental Parser Generation for Tree Adjoining Grammars

TL;DR

This paper introduces an incremental parser generation method for Tree Adjoining Grammars that updates parse tables dynamically in response to grammar modifications, improving efficiency and adaptability.

Contribution

It presents a novel incremental parser generator for TALs that updates parse tables on-the-fly, enabling more flexible and efficient parsing.

Findings

Lazy generation of LR-type parsers for TALs

Incremental update of parse tables in response to grammar changes

Enhanced parsing efficiency for dynamic grammar modifications

Abstract

This paper describes the incremental generation of parse tables for the LR-type parsing of Tree Adjoining Languages (TALs). The algorithm presented handles 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.