Indexed Grammars—An Extension of Context-Free Grammars

@article{Aho1968IndexedGE,
  title={Indexed Grammars—An Extension of Context-Free Grammars},
  author={Alfred V. Aho},
  journal={Journal of the ACM (JACM)},
  year={1968},
  volume={15},
  pages={647 - 671}
}
  • A. Aho
  • Published 1968
  • Computer Science
  • Journal of the ACM (JACM)
A new type of grammar for generating formal languages, called an indexed grammar, is presented. An indexed grammar is an extension of a context-free grammar, and the class of languages generated by indexed grammars has closure properties and decidability results similar to those for context-free languages. The class of languages generated by indexed grammars properly includes all context-free languages and is a proper subset of the class of context-sensitive languages. Several subclasses of… Expand
Context-free grammars on trees
  • W. Rounds
  • Computer Science, Mathematics
  • STOC
  • 1969
TLDR
This paper defines the tree analogue of a non deterministic generalized sequential machine and obtain results about the domain and range of such a mapping and relates these results to the theory of generalized finite automata6. Expand
Context-Free Grammars with Storage
TLDR
The context-free S languages can be obtained from the deterministic one-way S automaton languages by way of the delta operations on languages, introduced in this paper. Expand
Controlled bidirectional grammars
We investigate context-free grammars the rules of which can be used in a productive and in a reductive fashion, while the application of these rules is controlled by a regular language. WeExpand
Boolean grammars
A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous semantics for theseExpand
Parsers for indexed grammars
  • R. Sebesta, N. Jones
  • Computer Science
  • International Journal of Computer & Information Sciences
  • 2004
TLDR
This work shows that the flag strings generated by indexed grammars are regular sets and can be generated by regular canonical systems, and generates all the deterministic contextfree languages, along with some noncontextfree languages. Expand
A Geometric Hierarchy Beyond Context-Free Languages
TLDR
This paper gives a progression of automata and shows that it corresponds exactly to the language hierarchy defined with control grammars, the first member of which is context-free languages. Expand
Grammars, Derivation Modes and Properties of Indexed and Type-0 Languages
TLDR
The context-free-like structure of the grammar is used as a tool to investigate normal-form transformations, Dyck languages and homomorphic characterizations and the two derivation modes yield the classes of indexed and type-0 languages respectively. Expand
On the Generative Power of Multiple Context-Free Grammars and Macro Grammars
TLDR
The generative power of several subclasses of variable-linear macro Grammars and that of multiple context-free grammars are compared in details. Expand
The equivalence of four extensions of context-free grammars
TLDR
The result presented in this paper is that all four of the formalisms under consideration generate exactly the same class of string languages. Expand
A Generalization of Linear Indexed Grammars Equivalent to Simple Context-Free Tree Grammars
I define a generalization of linear indexed grammars that is equivalent to simple context-free tree grammars in the same way that linear indexed grammars are equivalent to tree-adjoining grammars.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 31 REFERENCES
Indexed Grammars-An Extension of Context Free Grammars
  • A. Aho
  • Computer Science
  • SWAT
  • 1967
TLDR
The class of indexed languages seems to be a closer approximation to theclass of algorithmic programming languages than either the class of context free languages or the classof context sensitive languages. Expand
Programmed Grammars: A New Device for Generating Formal Languages
TLDR
The generative power of programmed grammars with various types of production cores is investigated, and every recursively enumerable language can be obtained from a cfpg language by a homomorphism. Expand
A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
TLDR
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. Expand
Abstract Families of Languages
The notion of an abstract family of languages (AFL) as a family of sets of words satisfying certain properties common to many types of formal languages is introduced. Operations preserving AFL areExpand
On the nonexistence of a phrase structure grammar for ALGOL 60
TLDR
It is shown that no formal mechanisms of the type used are sufficient to define ALGOL 60. Expand
Stack automata and compiling
TLDR
A mathematical model is presented which embodies salient features of many modern compiling techniques, including deterministic linear bounded automaton and nondeterministic stack automaton, and particular instances of this more general device are noted. Expand
Nonerasing Stack Automata
TLDR
It is shown that the Deterministic, nonerasing stack automaton is equivalent to a deterministic, off-line Turing machine whose storage tape never grows beyond n log"2n cells where n is the length of the input. Expand
One-way stack automata
A number of operations which either preserve sets accepted by one-way stack automata or preserve sets accepted by deterministic one-way stack automata are presented. For example, sequentialExpand
Language and information
TLDR
This book is a kind of precious book written by an experienced author and it will show you the reasonable reasons why you need to read this book. Expand
Computability and Unsolvability
  • Martin D. Davis
  • Mathematics, Computer Science
  • McGraw-Hill Series in Information Processing and Computers
  • 1958
Only for you today! Discover your favourite computability and unsolvability book right here by downloading and getting the soft file of the book. This is not your time to traditionally go to the bookExpand
...
1
2
3
4
...