Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Incremental generation of parsers
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Incremental Generation of Parsers
IEEE Transactions on Software Engineering
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Deterministic left to right parsing of Tree Adjoining Languages
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Implementation of Efficient and Portable Parser for Czech
TSD '99 Proceedings of the Second International Workshop on Text, Speech and Dialogue
| Hi-index | 0.00 |
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.