Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
An efficient ELL(1)-parser generator
Acta Informatica
The implementation of the Amsterdam SGML parser
Electronic Publishing—Origination, Dissemination, and Design
A generator for production quality compilers
CC '90 Proceedings of the third international workshop on Compiler compilers
Software development by LL(1) syntax description
Software development by LL(1) syntax description
Electronic Publishing—Origination, Dissemination, and Design
Regular expressions into finite automata
Theoretical Computer Science
ANTLR: a predicated-LL(k) parser generator
Software—Practice & Experience
One-unambiguous regular languages
Information and Computation
A List Structure Form of Grammars for Syntactic Analysis
ACM Computing Surveys (CSUR)
Regular right part grammars and their parsers
Communications of the ACM
SGML and XML document grammars and exceptions
Information and Computation
Compiler Design
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
On predictive parsing and extended context-free grammars
Computer Science in Perspective
Towards a Taxonomy for ECFG and RRPG Parsing
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
| Hi-index | 0.00 |
Extended context-free grammars are context-free grammars in which the right-hand sides of productions are allowed to be any regular language rather than being restricted to only finite languages.We present a novel view on top-down predictive parser construction for extended context-free grammars that is based on the rewriting of partial syntax trees. This work is motivated by our development of ecfg, a Java toolkit for the manipulation of extended context-free grammars, and by our continuing investigation of XML.