An efficient context-free parsing algorithm
Communications of the ACM
Transition network grammars for natural language analysis
Communications of the ACM
PASCAL user manual and report
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Compiler Construction for Digital Computers
Compiler Construction for Digital Computers
Practical lr analysis of regular right part grammars.
Practical lr analysis of regular right part grammars.
Grammatical abstraction and incremental syntax analysis in a language-based editor
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Scannerless NSLR(1) parsing of programming languages
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Incremental analysis of real programming languages
Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
Efficient and flexible incremental parsing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Stochastic Grammatical Inference of Text Database Structure
Machine Learning
The Construction of Stack-Controlling LR Parsers for Regular Right Part Grammars
ACM Transactions on Programming Languages and Systems (TOPLAS)
Program Synthesis from Formal Requirements Specifications Using APTS
Higher-Order and Symbolic Computation
On predictive parsing and extended context-free grammars
Computer Science in Perspective
Macros for context-free grammars
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Towards a Taxonomy for ECFG and RRPG Parsing
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
On predictive parsing and extended context-free grammars
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Efficient recognition of trace languages defined by repeat-until loops
Information and Computation
An LR parsing technique for extended context-free grammars
Computer Languages
| Hi-index | 48.22 |
This paper introduces an alternative to context-free grammars called regular right part (RRP) grammars, which resemble PASCAL syntax diagrams. Formally, RRP grammars have production right parts, which are nondeterministic finite state machines (FSMs), and, as a special case, regular expression, since these can be converted to FSMs. RRP grammars describe the syntax of programming languages more concisely and more understandably than is possible with CF grammars. Also introduced is a class of parsers, RRP LR(m, k) parsers, which includes the CF LR(k) parsers and provides the same advantages. Informally, an RRP LR(m, k) parser can determine the right end of each handle by considering at most k symbols to the right of the handle and the left end, after the right end has been found, by considering at most m symbols to the left of the handle. A mechanism for determining the left end is required because there is no bound on the length of the handle.