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++
Fast context-free grammar parsing requires fast boolean matrix multiplication
Journal of the ACM (JACM)
Generalized L.R. Parsing
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Semi-automatic grammar recovery
Software—Practice & Experience
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
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
An efficient context-free parsing algorithm
An efficient context-free parsing algorithm
Reducing non-determinism in right nulled GLR parsers
Acta Informatica
Toward an engineering discipline for grammarware
ACM Transactions on Software Engineering and Methodology (TOSEM)
Generalized Bottom Up Parsers With Reduced Stack Activity
The Computer Journal
ACM Transactions on Programming Languages and Systems (TOPLAS)
Evaluating GLR parsing algorithms
Science of Computer Programming - The fourth workshop on language descriptions, tools, and applications (LDTA'04)
Automatic recursion engineering of reduction incorporated parsers
Science of Computer Programming
The Grammar Tool Box: A Case Study Comparing GLR Parsing Algorithms
Electronic Notes in Theoretical Computer Science (ENTCS)
General context-free recognition in less than cubic time
Journal of Computer and System Sciences
CC'03 Proceedings of the 12th international conference on Compiler construction
Recognition is not parsing - SPPF-style parsing from cubic recognisers
Science of Computer Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
GTB (the Grammar Tool Box) is the tool that underpins our investigations into generalised parsing. Our goal is to produce a system that supports systematic investigation of various styles of generalised parsing in a way that allows meaningful comparisons between them in a repeatable and easily accessible fashion whilst also allowing: (i) new theoretical ideas to be generated and explored; (ii) production quality parsers to be generated and (iii) humane pedagogy. GTB comprises a language (LC) with various kinds of built-in grammar and automata related objects, and a set of black-box methods written in C++ that provide implementations of grammar transforms, automata construction algorithms, parsing and recognition algorithms, and a variety of visualisation aids. In this paper we focus on the overall rationale for the GTB framework; the GTB design goals; and some detailed operational flows that are supported by GTB.