论文信息 - Indexed Grammars—An Extension of Context-Free Grammars

Indexed Grammars—An Extension of Context-Free Grammars

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 indexed grammars generate interesting classes of languages.

Alfred V. Aho | A. Aho

[1] Martin D. Davis,et al. Computability and Unsolvability , 1959, McGraw-Hill Series in Information Processing and Computers.

[2] Journal of the Association for Computing Machinery , 1961, Nature.

[3] Robert W. Floyd,et al. On the nonexistence of a phrase structure grammar for ALGOL 60 , 1962, CACM.

[4] Eugene Galanter,et al. Handbook of mathematical psychology: I. , 1963 .

[5] S.-Y. Kuroda,et al. Classes of Languages and Linear-Bounded Automata , 1964, Inf. Control..

[6] Sheila A. Greibach,et al. A New Normal-Form Theorem for Context-Free Phrase Structure Grammars , 1965, JACM.

[7] J. Hartmanis,et al. On the Computational Complexity of Algorithms , 1965 .

[8] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .

[9] Daniel J. Rosenkrantz,et al. Programmed Grammars: A New Device for Generating Formal Languages , 1967, SWAT.

[10] Seymour Ginsburg,et al. One-way stack automata , 1967, JACM.

[11] Seymour Ginsburg,et al. Stack automata and compiling , 1967, JACM.

[12] Seymour Ginsburg,et al. Abstract Families of Languages , 1967, SWAT.

[13] Alfred V. Aho. Indexed Grammars-An Extension of Context Free Grammars , 1967, SWAT.

[14] Jeffrey D. Ullman,et al. Nonerasing Stack Automata , 1967, J. Comput. Syst. Sci..

[15] A. G. Oettinger,et al. Language and information , 1968 .

[16] Alfred V. Aho,et al. Nested Stack Automata , 1969, Journal of the ACM.