Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Parsing techniques: a practical guide
Parsing techniques: a practical guide
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
Journal of the ACM (JACM)
Deterministic parsing of ambiguous grammars
Communications of the ACM
An efficient context-free parsing algorithm
Communications of the ACM
Communications of the ACM
A global parser for context-free phrase structure grammars
Communications of the ACM
A syntax directed compiler for ALGOL 60
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
Recent Advances in Parsing Technology
Recent Advances in Parsing Technology
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
Deterministic Techniques for Efficient Non-Deterministic Parsers
Proceedings of the 2nd Colloquium on Automata, Languages and 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
Generalised Reduction Modified LR Parsing for Domain Specific Language Prototyping
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
An optimal tabular parsing algorithm
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Reducing non-determinism in right nulled GLR parsers
Acta Informatica
The Grammar Tool Box: A Case Study Comparing GLR Parsing Algorithms
Electronic Notes in Theoretical Computer Science (ENTCS)
CC'03 Proceedings of the 12th international conference on Compiler construction
Evaluating GLR parsing algorithms
Science of Computer Programming - The fourth workshop on language descriptions, tools, and applications (LDTA'04)
Declarative, formal, and extensible syntax definition for aspectJ
Proceedings of the 21st annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
Some observations on LR-like parsing with delayed reduction
Information Processing Letters
Proofs and pedagogy; science and systems: The grammar tool box
Science of Computer Programming
An Experimental Ambiguity Detection Tool
Electronic Notes in Theoretical Computer Science (ENTCS)
Faster Scannerless GLR Parsing
CC '09 Proceedings of the 18th International Conference on Compiler Construction: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Recognition is not parsing - SPPF-style parsing from cubic recognisers
Science of Computer Programming
An experimental ambiguity detection tool
Science of Computer Programming
Semantics and algorithms for data-dependent grammars
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the Tenth Workshop on Language Descriptions, Tools and Applications
A new method for dependent parsing
ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
Science of Computer Programming
Proceedings of the 9th Central & Eastern European Software Engineering Conference in Russia
| Hi-index | 0.00 |
The right nulled generalized LR parsing algorithm is a new generalization of LR parsing which provides an elegant correction to, and extension of, Tomita's GLR methods whereby we extend the notion of a reduction in a shift-reduce parser to include right nulled items. The result is a parsing technique which runs in linear time on LR(1) grammars and whose performance degrades gracefully to a polynomial bound in the presence of nonLR(1) rules. Compared to other GLR-based techniques, our algorithm is simpler and faster.