This is a preview of subscription content, log in via an institution to check access.
Literature Cited
A. V. Aho, P. J. Denning, and J. D. Ullman, “Weak and mixed strategy precedence parsing,” J. Assoc. Comput. Mach.,19, No. 2 (1972).
A. J. Korenjak and J. E. Hopcroft, “Simple deterministic languages,” in: IEEE Conference Record, 1966. Seventh Annual Symposium on Switching and Automata Theory (1966).
S. Greibach, “A new normal-form theorem for context-free phrase structure grammars,” J. Assoc. Comput. Mach.,12, No. 1 (1965).
D. E. Knuth, “On the translation of languages from left to right,” Inf., Control,8, No. 6 (1965).
A. L. Fuksman, “On certain grammars for the description of context-free languages,” in: First All-Union Conference on Programming, Section A [in Russian], Kiev (1968).
D. J. Rosenkrantz and R. E. Stearns, “Properties of deterministic top-down grammars,” Inf. Control17, No. 3 (1970).
P. M. Lewis II and R. E. Stearns, “Syntax-directed transduction,” J. Assoc. Comput. Mach.,15, No. 3 (1968).
Kurki-Suonio, “Notes on top-down languages,” BIT,9, No. 3 (1969).
D. Wood, “A further note on top-down deterministic languages,” Comput. J.,14, No. 4 (1971).
D. J. Rosenkrantz, “Matrix equations and normal forms for context-free grammars,” J. Assoc. Comput. Mach.,14, No. 3 (1967).
T. V. Griffiths and S. P. Petrick, “On the relative efficiencies of context-free grammar recognizers,” Commun. ACM,8 (1965).
S. Ginsburg, The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York (1966).
Additional information
Translated from Kibernetika, No. 6, pp. 32–42, November–December, 1975.
Rights and permissions
About this article
Cite this article
Nepomnyashchaya, A.S. Syntactic analysis of CF-languages by deterministic pushdown automata. Cybern Syst Anal 11, 880–890 (1975). https://doi.org/10.1007/BF01074232
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01074232