References
K. Samelson andF. Bauer, Sequential formula translation.Comm. ACM 3 (1960), 76–83.
N. Chomsky, On certain formal properties of grammars.Information and Control 2 (1959), 137–167.
N. Chomsky, Formal properties of grammars.Handbook of Mathematical Psychology, Vol. 2, pp. 323–418, 1963.
B. Dömölki, An algorithm for syntactic analysis.Computational Linguistics 3 (1964), 29–46.
B. Dömölki, Voprosy sintaksicheskogo analiza dlja formalnyh jazykov.Computational Linguistics 5 (1967), 41–93.
M. Paul, A general processor for certain formal languages,Symbolic Languages in Data Processing pp. 65–74, ICC Symposium, Rome, 1962.
P. Naur (Editor), Revised Report on the Algorithmic LanguageAlgol 60.Comm. ACM 6 (1963), 1–17.
Gy. Révész, Egy univerzális értelmezö programról. Dissertation, Budapest, 1967.
L. Kalmár, On a digital computer which can be programmed in a mathematical formula language, II. Hungarian Mathematical Congress, Vol. II. Section V., pp. 3–16, Budapest, 1960.
V. M. Glushkov, A. A. Letichevski, andA. A. Stogni, Vhodnoi jazyk vychislitelnoi mashini dlja inzhenernyh raschetov,Kibernetika 1 (1965), 74–82.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Révész, G. An efficient syntactic analyser of certain formal languages. Math. Systems Theory 2, 147–158 (1968). https://doi.org/10.1007/BF01692512
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01692512