References
D. G. Hayes, Introduction to Computational Linguistics, American Elsevier, New York (1967).
D. H. Younger, "Recognition and analysis of context-free languages," in: Problems of Mathematical Logic [Russian translation], Mir, Moscow (1970), pp. 344–362.
T. Kasami, "An efficient recognition and syntax analysis algorithm for context-free languages," Sci. Rep. AFCRL.
J. Early, "An effective algorithm for the analysis of context-free languages," in: Languages and Automata [Russian translation], Mir, Moscow (1975), pp. 47–70.
L. G. Valiant, "General context-free recognition in less than cubic time," J. Comp. Syst. Sci.,10, No. 2, 308–315 (1975).
A. V. Aho and J. Ullman, The Theory of Parsing, Translation, and Compiling, Prentice Hall, Englewood Cliffs, NJ (1972).
S. Ginsburg, Mathematical Theory of Context-Free Languages [Russian translation], Mir, Moscow (1970).
W. J. Rayword-Smith, Theory of Formal Languages: An Introductory Course [Russian translation], Radio i Svyaz’, Moscow (1988).
W. Kuich and A. Salomaa, Semirings, Automata, Languages, Springer, Berlin (1986).
A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass. (1974).
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 159–164, November–December, 1993.
Rights and permissions
About this article
Cite this article
Iordzhev, K. Ann 2 algorithm for recognition of context-free languages. Cybern Syst Anal 29, 922–927 (1993). https://doi.org/10.1007/BF01122746
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01122746