Incremental parser generation for Tree Adjoining Grammars
Incremental parser generation for Tree Adjoining Grammars
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.
12 pages, 12 Postscript figures, uses fullname.sty
- University of Pennsylvania United States
FOS: Computer and information sciences, D.3.1, Computer Science - Computation and Language, I.2.7, I.2.7; D.3.1, Computation and Language (cs.CL)
FOS: Computer and information sciences, D.3.1, Computer Science - Computation and Language, I.2.7, I.2.7; D.3.1, Computation and Language (cs.CL)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!