This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aho, A. V. and Ullman, J. D. The Theory of Parsing, Translation, and Compiling, Vols. 1 and 2. Prentice Hall, Inc., Englewood Cliffs, N.J., 1972 and 1973.
Culik, K. and Cohen, R. LR-regular grammars — an extension of LR(k) grammars. J. Comput. System Sci. 7 (1973), 66–96.
Harrison, M. A. Introduction to Formal Language Theory. Addison-Wesley, Reading, Mass., 1978.
Harrison, M. A. and Havel, I. M. Strict deterministic grammars. J. Comput. System Sci. 7 (1973), 237–277.
Harrison, M. A. and Havel, I. M. Real-time strict deterministic grammars. SIAM J. Comput. 1 (1972), 333–349.
Harrison, M. A. Havel, I. M. and Yehudai, A. An equivalence of grammars through transformation trees. Theoret. Comput. Sci. 9 (1979), 173–206.
Hopcroft, J. E. and Ullman, J. D. Formal Languages and their Relation to Automata. Addison-Wesley, Reading, Mass., 1969.
Jarzabek, S. and Krawczyk, T. LL-regular grammars. Information Processing Letters 4 (1975), 31–37.
Korenjak, A. J. and Hopcroft, J. E. Simple deterministic languages. Conf. Record of 7th Annual Symp. on Switching and Automata Theory 1966, 36–46.
Nijholt, A. On the parsing of LL-regular grammars. In: Math. Foundations of Computer Sci., A. Mazurkiewicz (ed.), LNCS 45, Springer, Berlin, 1976, 446–452.
Nijholt, A. LL-regular grammars. Int. J. of Computer Math. 8 (1980), 303–318.
Nijholt, A. From LL-regular to LL(1) grammars. Report IR-61, Amsterdam, May 1980.
Nijholt, A. A framework for classes of grammars between the LL(k) and LR(k) grammars. TR No. 80-CS-25, McMaster University, Hamilton, 1980.
Olshansky, T. and Pnueli, A. A direct algorithm for checking equivalence of LL(k) grammars. Theoret. Comput. Sci. 4 (1977), 321–349.
Oyamaguchi, M., Honda, N. and Inagaki, Y. The equivalence problem for real-time strict deterministic languages. Information and Control 45 (1980), 90–115.
Poplawski, D. A. On LL-regular grammars. J. Comput. System Sci. 18 (1979), 218–227.
Rosenkrantz D. J. and Stearns, R. E. Properties of deterministic top-down grammars. Information and Control 17 (1970), 226–255.
Ukkonen, E. A decision method for the equivalence of some non-real-time deterministic pushdown automata. 12th Ann. S. on Theory of Computing, 1980, 29–38.
Wood, D. Some remarks on the KH algorithm for s-grammars. BIT 13 (1973), 476–489.
Wood, D. Lecture notes on top-down syntax analysis. J. of the Computer Society of India 8 (1978), 1–22.
Zubenko, V. V. Simple pushdown storage automata and the equivalence problem in certain classes of LL(Ï€) grammars (in Russian). Theory and Practice of systems programming, Inst. Kibernet., Akad. Nauk Ukrain. SSR, Kiev, 1976.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nijholt, A. (1981). The equivalence problem for LL- and LR-regular grammars. In: Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1981. Lecture Notes in Computer Science, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10854-8_32
Download citation
DOI: https://doi.org/10.1007/3-540-10854-8_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10854-2
Online ISBN: 978-3-540-38765-7
eBook Packages: Springer Book Archive