Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
An efficient augmented-context-free parsing algorithm
Computational Linguistics
Information Processing Letters
Recursive ascent parsing: from Earley to Marcus
Theoretical Computer Science
A fast and effective heuristic for the feedback arc set problem
Information Processing Letters
Obtaining practical variants of LL (K) and LR (K) for K greater than 1 by splitting the atomic K-tuple
ANTLR: a predicated-LL(k) parser generator
Software—Practice & Experience
Java Threads
Faster Tomita parsing
Generalized L.R. Parsing
Even faster generalized LR parsing
Acta Informatica
JDBC API Tutorial and Reference
JDBC API Tutorial and Reference
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
| Hi-index | 0.00 |
Tomita devised a method of generalized LR(GLR) parsing to parse ambiguous grammars efficiently. A GLR parser uses linear-time LR parsing techniques as long as possible, falling back on more expensive general techniques when necessary. In this paper, the motivation of adopting the GLR parsing algorithm to construct parsers for programming languages is presented. We create a multi-level scheme to fasten the GLR parser. We introduce runtime control mechanisms to the GLR parser to invoke semantic actions attached to grammar rules. The algorithm has been implemented in Development Expert Tools (DET), a compiler which is designed by Institute of Intelligent Machines, Chinese Academy of Sciences, at Hefei. Experiments show that the speed of our GLR parser is comparable to LALR(1) parsers when parsing deterministic programming languages.