Upper bounds on the size of LR(k) parsers
Information Processing Letters
A PREttier compiler-compiler: generating higher-order parsers in C
Software—Practice & Experience
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
Compiling language definitions: the ASF+SDF compiler
ACM Transactions on Programming Languages and Systems (TOPLAS)
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
Packrat parsing:: simple, powerful, lazy, linear time, functional pearl
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Generalised Recursive Descent parsing and Fellow-Determinism
CC '98 Proceedings of the 7th International Conference on Compiler Construction
CC '99 Proceedings of the 8th International Conference on Compiler Construction, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Parsing expression grammars: a recognition-based syntactic foundation
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Generalized Bottom Up Parsers With Reduced Stack Activity
The Computer Journal
ACM Transactions on Programming Languages and Systems (TOPLAS)
BRNGLR: a cubic Tomita-style GLR parsing algorithm
Acta Informatica
Recognition is not parsing - SPPF-style parsing from cubic recognisers
Science of Computer Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
Modelling GLL parser implementations
SLE'10 Proceedings of the Third international conference on Software language engineering
| Hi-index | 0.00 |
Backtracking techniques which are often used to extend recursive descent (RD) parsers can have explosive run-times and cannot deal with grammars with left recursion. GLL parsers are fully general, worst-case cubic parsers which have the recursive descent-like property that they are easy to write and to use for grammar debugging. They have the direct relationship with the grammar that an RD parser has. In this paper we give an algorithm for generating GLL parsers which build an SPPF representation of the derivations of the input, complementing our existing GLL recognition algorithm, and we show that such parsers and recognisers are worst-case cubic.