Zusammenfassung
In diesem Kapitel wollen wir eine intuitive Vorstellung davon geben, was ein Übersetzer einer imperativen Programmiersprache tut, während wir später erst genau erklären, wie er es tut. Dazu definieren wir präzise aber intuitiv, wie die Korrespondenz zwischen Programmen einer imperativen Quellsprache und den durch Übersetzung gewonnenen Programmen eines Zielrechners aussieht.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literatur
B. Courcelle. Attribute Grammars: Definitions, Analysis of Depen dencies. In [Lor84], 1984.
B. Courcelle. Equivalences and Transformations of Regular Systems Applications to Program Schemes and Grammars. In Theor. Comp. Sci. 42, pp. 1-122, 1986.
P. Dencker, K. Drre, J. Henft. Optimization of Parser Tables for Portable Compilers. In ACM Transactions on Programming Languages and Systems 6(4), pp. 546-572, 1984.
F.L. DeRemer. Practical Translators for LR(k) Languages. Ph.D. Thesis, MIT, 1969.
F.L. DeRemer. Simple LR(k) Grammars. In Communications of the ACM 14, pp. 453-460, 1971.
F.L. DeRemer. Lexical Analysis. In F.L. Bauer, J. Eickel (Hrsg.), Compiler Construction, An Advanced Course, LNCS 21. Springer, 1974.
N. Dershowitz, J.-P. Jouannaud. Rewrite Systems. In J.v. Leeuwen (Hrsg.), Handbook of Theoretical Computer Science, Chapter 6. Elsevier, 1990.
P. Deransart, M. Jourdan, B. Lorho. Attribute Grammars, Defini tions, Systems and Bibliography, LNCS 323. Springer, 1988.
L. Damas, R. Milner. Principal Type Schemes for Functional Pro gramms. In 9th ACM Symp. on Principles of Programming Languages, pp. 207-212, 1982.
F.L. DeRemer, T. Penello. Efficient Computation of LALR(1) LookAhead Sets. In ACM Transactions on Programming Languages and Systems 4(4), pp. 615-649, 1982.
P.J. Downey, R. Sethi, R.E. Tarjan. Variations on the common subexpression problem. In Journal of the ACM 27, pp. 758-771, 1980.
J. Engelfriet, G. Fil. Simple Multivisit Attribute Grammars. In Journal of Computer and System Sciences 24, pp. 283-314, 1982.
J.R. Ellis. Bulldog: A Computer for VLIW Architectures. MIT Press, 1986.
H. Emmelmann. Code Selection by Regularly Controlled Term Rewriting. In Proc. Workshop: CODE’'91 in Dagstuhl, 1992, (to appear).
J. Engelfriet. Attribute Grammars: Attribute Evaluation Methods. In [Lor84], 1984.
A.P. Ershov. On Programming of Arithmetic Operations. In Com munications of the ACM 1(8), pp. 3-6, and 1(9), p. 16, 1958.
A.P. Ershov. Reducing the Problem of Memory Allocation when compiling Programs to one of Coloring the Vertices of Graphs. Doklady Akademii Nauk S.S.S.R 124(4), 1962, englische bersetzung in Soviet Math 3, 1962.
M. Eulenstein. Generierung portabler Compiler. IFB 164, Springer, 1988.
J.A. Fisher, J.R. Ellis, J.C. Ruttenberg, A. Nicolau. Parallel Processing: A Smart Compiler and a Dumb Maschine. In Proc. ACM SIGPLAN’84 Symp. on Compiler Construction, SIGPLAN Notkea- 19(6), pp. 37-44, 1984.
J.A. Fisher. The Optimiznt: of Horizontal Microcode within and beyond Basic RL;cics: An Application of Processor Scheduling with Rezources. Department of Energy Report C00-3077-161, Courant Mathematics and Computing Laboratory, New York University, 1979.
R. Giegerich. Code Selection by Inversion of Order-sorted Derivors. In Theoretical Computer Science 73, pp. 177-211, 1990.
C. Ferdinand, H. Seidl, R. Wilhelm. Tree Automata for Code Selec tion. In Proc. Workshop: CODE’91 in Dagstuhl, 1992, (to appear).
J. Fairbairn, S.C. Wray. Code Generation Techniques for Functional Languages. In Proc. 1986 ACM Conference on LISP and Functional Programming, pp. 94-104, 1986.
J. Fairbairn, S.C. Wray. TIM. A Simple, Lazy Abstract Machine to Execute Supercombinators. In Proc. Functional Programming Languages and Computer Architecture, LNCS 274, pp. 34-45. Springer, 1987.
R.S. Glanville, S. L. Graham. A new Method for Compiler Code Generation. In Proc. 5th ACM Symp. on Principles of Programming Languages, pp. 231-240, 1978.
B. Goldberg, P. Hudak. Serial Combinators, Optimal Grains of Parallelism. In LNCS 201, pp. 382-399. Springer, 1985.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Wilhelm, R., Maurer, D. (1992). Übersetzung imperativer Programmiersprachen. In: Übersetzerbau. Springer-Lehrbuch. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-00077-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-662-00077-9_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-00078-6
Online ISBN: 978-3-662-00077-9
eBook Packages: Springer Book Archive