Abstract
Three classes of parsable indexed grammars are defined. The new parsing mechanisms are derived by extending those that have been most successful for contextfree grammars, the LR and LL algorithms. Design criteria for the new grammar classes include membership decidability and unambiguity. We show that all three parsers operate in linear time for at least some grammars in our new classes. One of our new classes generates all the deterministic contextfree languages, along with some noncontextfree languages. We also show that the flag strings generated by indexed grammars are regular sets. This is done by showing that they can be generated by regular canonical systems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Abraham, “Some Questions of Phrase Structure Grammars,”Computat. Linguist. 4:61–70 (1965).
A. V. Aho, “Indexed grammars-an extension of context-free grammars,”J. ACM 15(4):647–671 (October 1968).
A. V. Aho and J. D. Ullman,The Theory of Parsing, Translation and Compiling: Vol. 1, Parsing (Prentice-Hall, Englewood Cliffs, N. J., 1972).
E. Bertsch, “Two thoughts on fast recognition of indexed Languages,”Inf. Control 29:381–384 (1975).
J. R. Buchi, “Regular Canonical Systems,”Mathemat. Logik 6:91–111 (1964).
J. E. Hopcroft and J. D. Ullman,Formal Languages and Their Relation to Automata (Addison-Wesley, Reading, Mass., 1969).
D. E. Knutb, “On the translation of languages from left to right,”Inf. Control 8:607–639 (1965).
D. J. Rosenkrantz, “Programmed grammars and classes of formal languages,”J. ACM 16(1):108–131 (January 1969).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sebesta, R.W., Jones, N.D. Parsers for indexed grammars. International Journal of Computer and Information Sciences 7, 345–359 (1978). https://doi.org/10.1007/BF00991819
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00991819