LALR(1, 1) parser generation for regular right part grammars
Acta Informatica
Generation of efficient LALR parsers for regular right part grammars
Acta Informatica
A simple realization of LR-parsers for regular right part grammars
Information Processing Letters
LR PARSING theory and practice
LR PARSING theory and practice
Software development by LL(1) syntax description
Software development by LL(1) syntax description
Generation of path directed LALR(k) parsers for regular right part grammars
Journal of Information Processing
An improved LALR(k) parser generation for regular right part grammars
Information Processing Letters
A note on a proposed LALR parser for extended context-free grammars
Information Processing Letters
A Formalization of Transition Diagram Systems
Journal of the ACM (JACM)
Regular right part grammars and their parsers
Communications of the ACM
What can we do about the unnecessary diversity of notation for syntactic definitions?
Communications of the ACM
An efficient context-free parsing algorithm
Communications of the ACM
Transition network grammars for natural language analysis
Communications of the ACM
Design of a separable transition-diagram compiler
Communications of the ACM
Algorithms + Data Structures = Programs
Algorithms + Data Structures = Programs
Compiler Design
LR recursive transition networks for Earley and Tomita parsing
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Parsing schemata for grammars with variable number and order of constituents
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
The Structure of Formula-Translators
ALGOL Bulletin
Forest FIRE and FIRE Wood: Tools for Tree Automata and Tree Algorithms
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
On predictive parsing and extended context-free grammars
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Operator precedence and the visibly pushdown property
Journal of Computer and System Sciences
| Hi-index | 0.00 |
Extended Context-Free Grammars (ECFGs) and Regular Right-Part Grammars (RRPGs) have many applications, but they are sparsely covered in the vast literature on parsing and grammars. This paper presents first steps towards a taxonomy of parsers for ECFGs and RRPGs, in order to make this subject more accessible.