Parsers for indexed grammars. (English) Zbl 0402.68059


68N20 Theory of compilers and interpreters
68Q45 Formal languages and automata
Full Text: DOI


[1] S. Abraham, ?Some Questions of Phrase Structure Grammars,?Computat. Linguist. 4:61?70 (1965).
[2] A. V. Aho, ?Indexed grammars-an extension of context-free grammars,?J. ACM 15(4):647?671 (October 1968). · Zbl 0175.27801
[3] A. V. Aho and J. D. Ullman,The Theory of Parsing, Translation and Compiling: Vol. 1, Parsing (Prentice-Hall, Englewood Cliffs, N. J., 1972). · Zbl 0264.68032
[4] E. Bertsch, ?Two thoughts on fast recognition of indexed Languages,?Inf. Control 29:381?384 (1975). · Zbl 0316.68041
[5] J. R. Buchi, ?Regular Canonical Systems,?Mathemat. Logik 6:91?111 (1964). · Zbl 0129.26102
[6] J. E. Hopcroft and J. D. Ullman,Formal Languages and Their Relation to Automata (Addison-Wesley, Reading, Mass., 1969). · Zbl 0196.01701
[7] D. E. Knutb, ?On the translation of languages from left to right,?Inf. Control 8:607?639 (1965). · Zbl 0231.68027
[8] D. J. Rosenkrantz, ?Programmed grammars and classes of formal languages,?J. ACM 16(1):108?131 (January 1969). · Zbl 0182.02004
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.