Properties of deterministic top-down grammars
Reads0
Chats0
TLDR
The class of context-free grammars that can be deterministically parsed in a top down manner with a fixed amount of look-ahead is investigated and it is shown that the equivalence problem is decidable for LL(k) Grammars.Abstract:
The class of context-free grammars that can be deterministically parsed in a top down manner with a fixed amount of look-ahead is investigated. These grammars, called LL(k) grammars where k is the amount of look-ahead are defined and a procedure is given for determining if a context-free grammar is LL(k) for a given value of k . A procedure is given for eliminating the e-rules from an LL(k) grammar at the cost of increasing k by 1. There exist cases in which this increase is inevitable. A procedure is given for obtaining a deterministic push-down machine to recognize a given LL(k) grammar and it is shown that the equivalence problem is decidable for LL(k) grammars. Additional properties are also given.read more
Citations
More filters
Book
Parsing Techniques: A Practical Guide
Dick Grune,Ceriel J. H. Jacobs +1 more
TL;DR: This second edition of Grune and Jacobs brilliant work presents new developments and discoveries that have been made in the field of parsing, also referred to as syntax analysis, and is used extensively in linguistics.
Journal ArticleDOI
Attributed translations
TL;DR: Classes of attributed translation grammars are defined whose translation can be performed deterministically while parsing top down or bottom up and certain augmented pushdown machines are defined.
Proceedings ArticleDOI
Deterministic left corner parsing
TL;DR: In this article, a subset of LC(k) grammars, called strong LC (k) grammar, is defined and shown to be exactly those grammarmars for which a certain canonical pushdown machine that does left corner parsing is deterministic.
Deterministic one-counter automata
Leslie G. Valiant,Mike Paterson +1 more
TL;DR: The equivalence problem for deterministic one-counter automata is shown to be bedecidable in this paper, and a corollary for schema theory is that equivalence is decidable for Ianov schemas with an auxiliary counter.
Journal ArticleDOI
On the equivalence, containment, and covering problems for the regular and context-free languages
TL;DR: This work considers the complexity of the equivalence and containment problems for regular expressions and context-free grammars, concentrating on the relationship between complexity and various language properties.
References
More filters
Journal ArticleDOI
On the translation of languages from left to right
TL;DR: LR(k) grammars are defined, which are perhaps the most general ones of this type, and they provide the basis for understanding all of the special tricks which have been used in the construction of parsing algorithms for languages with simple structure, e.g. algebraic languages.
Journal ArticleDOI
Syntax-Directed Transduction
TL;DR: Some special conditions are investigated under which syntax-directed translations can be performed on (deterministic) pushdown machines and some time bounds for translations on Turing machines are derived.
Journal ArticleDOI
A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
TL;DR: It is given that every context-free phrase structure generator is strongly equivalent to one in standard form and offers an independent proo[' of a variant of the Chomsky-Setditzenberger 1tortoni form theorem.
Journal ArticleDOI
Deterministic context free languages
TL;DR: A number of results about deterministic languages (languages accepted by pushdown automata with no choice of moves) are established, and several problems are shown to be recursively unsolvable.