On predictive parsing and extended context-free grammars
Anne Brüggemann-Klein,Derick Wood +1 more
- Vol. 2598, pp 239-247
Reads0
Chats0
TLDR
A novel view on top-down predictive parser construction for extended context-free grammars that is based on the rewriting of partial syntax trees is presented.Abstract:
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.read more
Citations
More filters
Balanced Context-Free Grammars, Hedge Grammars and Pushdown Caterpillar Automata
TL;DR: It is argued that hedge Grammars are effecively identical to balanced grammars and that balanced languages are identical to regular hedge languages, modulo encoding, from the close relationship between Dyck strings and hedges.
Book ChapterDOI
Towards a Taxonomy for ECFG and RRPG Parsing
TL;DR: This paper presents first steps towards a taxonomy of parsers for ECFGs and RRPGs, in order to make this subject more accessible.
Book ChapterDOI
Defining contexts in context-free grammars
Mikhail Barash,Alexander Okhotin +1 more
TL;DR: This paper gives two equivalent definitions of the model and establishes its basic properties, including a transformation to a normal form, a cubic-time parsing algorithm, and another recognition algorithm working in linear space.
Proceedings ArticleDOI
Checking potential validity of XML documents
TL;DR: The notion of potential validity of XML documents is introduced, which allows us to distinguish between XML Documents that are invalid because the encoding is simply incomplete and XML documents that are valid because some of the DTD rules guiding the structure of the encoding were violated during the markup process.
Book ChapterDOI
Extended Context-Free Grammars Parsing with Generalized LL
TL;DR: A modification of GLL algorithm which can process grammars in a form which is closely related to EBNF (Extended Context-Free Grammar), and it is shown that the modification improves parsing performance as compared to grammar transformation-based approach.
References
More filters
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Book
Compilers: Principles, Techniques, and Tools
TL;DR: This book discusses the design of a Code Generator, the role of the Lexical Analyzer, and other topics related to code generation and optimization.
Journal Article
Extensible Markup Language (XML).
TL;DR: XML is an extremely simple dialect of SGML which is completely described in this document, to enable generic SGML to be served, received, and processed on the Web in the way that is now possible with HTML.
Journal ArticleDOI
Extensible markup language
TL;DR: XML is the lingua franca of the wireless Web and is already being used for a host of server-server communication applications, which make it possible for different data servers to easily exchange information.
Journal ArticleDOI
ANTLR: a predicated- LL(k) parser generator
Terence Parr,Russell W. Quong +1 more
TL;DR: ANTLR is introduced, a public‐domain parser generator that combines the flexibility of hand‐coded parsing with the convenience of a parser generator, which is a component of PCCTS.