Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
The C programming language
Parsing techniques: a practical guide
Parsing techniques: a practical guide
Extending context-free grammars with permutation phrases
ACM Letters on Programming Languages and Systems (LOPLAS)
The design and evolution of C++
The design and evolution of C++
A PREttier compiler-compiler: generating higher-order parsers in C
Software—Practice & Experience
An efficient context-free parsing algorithm
Communications of the ACM
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)
Semi-automatic grammar recovery
Software—Practice & Experience
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
Reverse Compilation of Digital Signal Processor Assembler Source to ANSI-C
ICSM '99 Proceedings of the IEEE International Conference on Software Maintenance
Deriving tolerant grammars from a base-line grammar
ICSM '03 Proceedings of the International Conference on Software Maintenance
Generalized Bottom Up Parsers With Reduced Stack Activity
The Computer Journal
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proofs and pedagogy; science and systems: The grammar tool box
Science of Computer Programming
ANTLRWorks: an ANTLR grammar development environment
Software—Practice & Experience
Pure and declarative syntax definition: paradise lost and regained
Proceedings of the ACM international conference on Object oriented programming systems languages and applications
| Hi-index | 0.00 |
We describe the behaviour of three variants of GLR parsing: (i) Farshi's original Correction to Tomita's non-general algorithm; (ii) the Right Nulled GLR algorithm which provides a more efficient generalisation of Tomita and (iii) the Binary Right Nulled GLR algorithm, on three types of LR table. We present a guide to the parse-time behaviour of these algorithms which illustrates the inefficiencies in conventional Farshi-style GLR parsing. We also describe the tool GTB (Grammar Tool Box) which provides a platform for comparative studies of parsing algorithms; and use GTB to exercise the three GLR algorithms running with LR(0), SLR(1) and LR(1) tables for ANSI-C, ISO-Pascal and IBM VS-COBOL. We give results showing the size of the structures constructed by these parsers and the amount of searching reguired during the parse, which abstracts their runtime.