Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
CIGALE: A tool for interactive grammar construction and expression parsing
Science of Computer Programming
Algebraic specification
The syntax definition formalism SDF—reference manual—
ACM SIGPLAN Notices
Incremental generation of parsers
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Incremental generation of lexical scanners
ACM Transactions on Programming Languages and Systems (TOPLAS)
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An efficient context-free parsing algorithm
Communications of the ACM
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Lithe: a language combining a flexible syntax and classes
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Deterministic Techniques for Efficient Non-Deterministic Parsers
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
A meta-environment for generating programming environments
ACM Transactions on Software Engineering and Methodology (TOSEM)
Lazy and incremental program generation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Controlled grammatic ambiguity
ACM Transactions on Programming Languages and Systems (TOPLAS)
Attribute grammar paradigms—a high-level methodology in language implementation
ACM Computing Surveys (CSUR)
LR recursive transition networks for Earley and Tomita parsing
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Incremental parser generation for Tree Adjoining Grammars
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Fast and flexible instruction selection with on-demand tree-parsing automata
Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
A User Interface for a Mathematical System that Allows Ambiguous Formulae
Electronic Notes in Theoretical Computer Science (ENTCS)
Software Language Engineering
An efficient algorithm to induce minimum average lookahead grammars for incremental LR parsing
IncrementParsing '04 Proceedings of the Workshop on Incremental Parsing: Bringing Engineering and Cognition Together
Renovation of the Asf+Sdf meta-environment: current state of affairs
Algebraic'97 Proceedings of the 2nd international conference on Theory and Practice of Algebraic Specifications
| Hi-index | 0.00 |
An LR-based parser generator for arbitrary context-free grammars that generates parsers by need and handles modifications to its input grammar by updating the parser it has generated so far is described. The need for these techniques is discussed in the context of interactive language definition environments. All required algorithms are presented. Measurements are given comparing their performance with that of conventional techniques.