Proc. of a conference on Functional programming languages and computer architecture
Recursive ascent: an LR analog to recursive descent
ACM SIGPLAN Notices
Information Processing Letters
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
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Review of "Generalized LR parsing" by Masaru Tomita. Kluwer Academic Publishers 1991.
Computational Linguistics - Special issue on inheritance: II
Generalized left-corner parsing
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Computational aspects of M-grammars
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
TOOL PAPER: ScalaBison Recursive Ascent-Descent Parser Generator
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
A purely functional implementation of LR-parsers is given, together with a simple correctness proof. It is presented as a generalization of the recursive descent parser. For non-LR grammars the time-complexity of our parser is cubic if the functions that constitute the parser are implemented as memo-functions, i.e. functions that memorize the results of previous invocations. Memo-functions also facilitate a simple way to construct a very compact representation of the parse forest. For LR(0) grammars, our algorithm is closely related to the recursive ascent parsers recently discovered by Kruseman Aretz [1] and Roberts [2]. Extended CF grammars (grammars with regular expressions at the right hand side) can be parsed with a simple modification of the LR-parser for normal CF grammars.