Some Grammatical Structures of Programming Languages as Simple Bracketed Languages
Boris Melnikov,Elena Kashlakova +1 more
TLDR
This paper obtains the sufficient conditions for the representation some language by special sequences of simple bracketed languages, and can decide equivalence problem for some grammatical structures of programming languages, which define neither regular, nor deterministic context-free languages.Abstract:
We consider in this paper so called simple bracketed languages having special limita- tions. They are sometimes used for the definitions of some grammatical structures of programming languages. Generally speaking, these languages are context-free, but not deterministic context- free, i.e., they cannot be defined by deterministic push-down automata. For the simple bracketed languages having special limitations, the equivalence problem is decidable. We obtain the sufficient conditions for the representation some language by special sequences of simple bracketed languages. We also consider the examples of grammatical structures as the simple bracketed languages. Therefore, we can decide equivalence problem for some grammatical structures of programming languages, and such structures define neither regular, nor deterministic context-free languages.read more
Citations
More filters
Journal Article
On the task of extracting the root from the language
TL;DR: It is hoped that the further development of the theory described in this paper will provide an opportunity to describe a polynomial-time algorithms for solving the general case of extracting the root from a finite language.
Journal ArticleDOI
A New Algorithm of Constructing the Basis Finite Automaton
TL;DR: This paper obtains some properties for the basis automaton, which is, like automaton of canonical form, an invariant of a given regular language in a non-deterministic finite Rabin-Scott's automata.
References
More filters
Book
The Theory of Parsing, Translation, and Compiling
Alfred V. Aho,Jeffrey D. Ullman +1 more
TL;DR: It is the hope that the algorithms and concepts presented in this book will survive the next generation of computers and programming languages, and that at least some of them will be applicable to fields other than compiler writing.
Book ChapterDOI
The Equivalence Problem for Deterministic Pushdown Automata is Decidable
TL;DR: The equivalence problem for deterministic pushdown automata is shown to be decidable and a complete formal system for deducing equivalent pairs of deterministic rational series on the alphabet associated with a dpda M is exhibited.
Journal ArticleDOI
Decidability of the equivalence problem for deterministic pushdown automata
TL;DR: Decidability of the equivalence problem is proved for deterministic pushdown automata and the main theorem leads to solution of a number of open problems in the theory of program schemes and in formal language theory.