References
V. V. Gusev, “Syntactic adaptability tools in programming languages,” Kibernet. Sist. Anal., No. 2, 166–175 (1994).
H. Kristiansen, “A survey of adaptable grammars,” ACM SIGPLAN, Notices,25(11), 35–44 (1990).
D. Knuth, “On the translation of languages from left to right,” Inform. Contr.,8, 607–639 (1965).
A. C. Forini, “Some remarks on the syntax of symbolic programming languages,” Comm. ACM, No. 6, 456–460 (1963).
A. A. Letichevskii, “A generalized notion of context-free grammars,” Kibernetika, No. 3, 1–3 (1972).
D. Gries, Compiler Construction for Digital Computers, Wiley, New York (1971).
J. Earley, “An efficient context-free parsing algorithm,” Comm. ACM,13(2), 94–102 (1970).
V. V. Gusev, T. N. Galagan, and V. V. Yaremenko, “A programming language with an expandable grammar” Kibernet. Sistem. Anal., No. 3, 147–155 (1993).
A. V. Aho and J. Ullman, The Theory of Parsing, Translation, and Compiling, Prentice Hall, Englewood Cliffs, NJ (1972).
J. Heering, P. Klint, and J. Rekers, “Incremental generation of parsers,” ACM SIGPLAN Notices,24(7), 179–191 (1989).
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 182–187, September–October, 1994.
Rights and permissions
About this article
Cite this article
Gusev, V.V., Galagan, T.N. Syntactic recognizer for expandable languages. Cybern Syst Anal 30, 787–791 (1994). https://doi.org/10.1007/BF02367763
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02367763