Abstract
Compiler construction as some applied field of programming is discussed, and all related experisnce, i.e. applied methodology, is proposed to be represented by operational networks. The network provides convenient comparison of different tactics of problem solving and explicit exposition of the necessary actions and their relations. Some aspects of syntax-directed compilers are also cosidered.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Ershov, A.P., System Development Technology in "System and Theoretical Programming", Novosibirsk, 1972.
Redjko, V.N., Parametric Programming Systems, Proceedings of 1 All-Union Conference on programming, sec. I, Kiev, 1969.
Tyugu, E.H., Solving Problems by Computative Models. BM и Mф, 10, 5, 1970.
Fuksman, A.L., Stratified Programming, in "Systematical and Theoretical Programming", Novosibirsk, 1974.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Fuksman, A.L. (1977). Some principles of compiler constructions. In: Ershov, A., Koster, C.H.A. (eds) Methods of Algorithmic Language Implementation. Lecture Notes in Computer Science, vol 47. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08065-1_8
Download citation
DOI: https://doi.org/10.1007/3-540-08065-1_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08065-7
Online ISBN: 978-3-540-37510-4
eBook Packages: Springer Book Archive