While compilers for high-level programming languages are large complex software systems, they have particular characteristics that differentiate them from other software systems. Their functionality is almost completely well-defined - ideally there exist complete precise descriptions of the source and target languages. Additional descriptions of the interfaces to the operating system, programming system and programming environment, and to other compilers and libraries are often available. The book deals with the optimization phase of compilers. In this phase, programs are transformed in order to increase their efficiency. To preserve the semantics of the programs in these transformations, the compiler has to meet the associated applicability conditions. These are checked using static analysis of the programs. In this book the authors systematically describe the analysis and transformation of imperative and functional programs. In addition to a detailed description of important efficiency-improving transformations, the book offers a concise introduction to the necessary concepts and methods, namely to operational semantics, lattices, and fixed-point algorithms. This book is intended for students of computer science. The book is supported throughout with examples, exercises and program fragments.

While compilers for high-level programming languages are large complex software systems, they have particular characteristics that differentiate them from other software systems. Their functionality is almost completely well-defined ideally there exist complete precise descriptions of the source and target languages. Additional descriptions of the interfaces to the operating system, programming system and programming environment, and to other compilers and libraries are often available.

This book deals with the analysis phase of translators for programming languages. It describes lexical, syntactic and semantic analysis, specification mechanisms for these tasks from the theory of formal languages, and methods for automatic generation based on the theory of automata. The authors present a conceptual translation structure, i.e., a division into a set of modules, which transform an input program into a sequence of steps in a machine program, and they then describe the interfaces between the modules. Finally, the structures of real translators are outlined. The book contains the necessary theory and advice for implementation.

This book is intended for students of computer science. The book is supported throughout with examples, exercises and program fragments.

"

While compilers for high-level programming languages are large complex software systems, they have particular characteristics that differentiate them from other software systems. Their functionality is almost completely well-defined - ideally there exist complete precise descriptions of the source and target languages, while additional descriptions of the interfaces to the operating system, programming system and programming environment, and to other compilers and libraries are often available. The implementation of application systems directly in machine language is both difficult and error-prone, leading to programs that become obsolete as quickly as the computers for which they were developed. With the development of higher-level machine-independent programming languages came the need to offer compilers that were able to translate programs into machine language. Given this basic challenge, the different subtasks of compilation have been the subject of intensive research since the 1950s.

This book is not intended to be a cookbook for compilers, instead the authors' presentation reflects the special characteristics of compiler design, especially the existence of precise specifications of the subtasks. They invest effort to understand these precisely and to provide adequate concepts for their systematic treatment. This is the first book in a multivolume set, and here the authors describe what a compiler does, i.e., what correspondence it establishes between a source and a target program. To achieve this the authors specify a suitable virtual machine (abstract machine) and exactly describe the compilation of programs of each source language into the language of the associated virtual machine for an imperative, functional, logic and object-oriented programming language.

This book is intended for students of computer science. Knowledge of at least one imperative programming language is assumed, while for the chapters on the translation of functional and logic programming languages it would be helpful to know a modern functional language and Prolog. The book is supported throughout with examples, exercises and program fragments.

While compilers for high-level programming languages are large complex software systems, they have particular characteristics that differentiate them from other software systems. Their functionality is almost completely well-defined - ideally there exist complete precise descriptions of the source and target languages. Additional descriptions of the interfaces to the operating system, programming system and programming environment, and to other compilers and libraries are often available. The book deals with the optimization phase of compilers. In this phase, programs are transformed in order to increase their efficiency. To preserve the semantics of the programs in these transformations, the compiler has to meet the associated applicability conditions. These are checked using static analysis of the programs. In this book the authors systematically describe the analysis and transformation of imperative and functional programs. In addition to a detailed description of important efficiency-improving transformations, the book offers a concise introduction to the necessary concepts and methods, namely to operational semantics, lattices, and fixed-point algorithms. This book is intended for students of computer science. The book is supported throughout with examples, exercises and program fragments.

While compilers for high-level programming languages are large complex software systems, they have particular characteristics that differentiate them from other software systems. Their functionality is almost completely well-defined - ideally there exist complete precise descriptions of the source and target languages. Additional descriptions of the interfaces to the operating system, programming system and programming environment, and to other compilers and libraries are often available. This book deals with the analysis phase of translators for programming languages. It describes lexical, syntactic and semantic analysis, specification mechanisms for these tasks from the theory of formal languages, and methods for automatic generation based on the theory of automata. The authors present a conceptual translation structure, i.e., a division into a set of modules, which transform an input program into a sequence of steps in a machine program, and they then describe the interfaces between the modules. Finally, the structures of real translators are outlined. The book contains the necessary theory and advice for implementation. This book is intended for students of computer science. The book is supported throughout with examples, exercises and program fragments.

This book constitutes the refereed proceedings of the 10th International Conference on Compiler Construction, CC 2001, held in Genova, Italy in April 2001.The 22 revised full papers presented were carefully reviewed and selected from a total of 69 submissions. The papers are organized in topical sections on program analysis, program transformation, intraprocessor parallelism, parsing, memory hierarchy, profiling, and demos.

"Informatics - 10 Years Back, 10 Years Ahead" presents a unique collection of expository papers on major current issues in the field of computer science and information technology. The 26 contributions written by leading researchers on personal invitation assess the state of the art of the field by looking back over the past decade, presenting important results, identifying relevant open problems, and developing visions for the decade to come.
This book marks two remarkable and festive moments: the 10th anniversary of the International Research and Conference Center for Computer Science in Dagstuhl, Germany and the 2000th volume published in the Lecture Notes in Computer Science series.

Das Buch behandelt die Analysephase von Ubersetzern fur Programmiersprachen. Die Autoren beschreiben die lexikalische, syntaktische und semantische Analyse sowie Spezifikationsmechanismen fur diese Aufgaben aus der Theorie der formalen Sprachen und automatische Erzeugungsverfahren aus der Theorie der Automaten. Vorgestellt wird eine konzeptionelle Ubersetzerstruktur, mit der ein Eingabe- in ein Maschinenprogramm transformiert wird. Das Buch enthalt neben der notwendigen Theorie auch Hinweise zur Implementierung von Ubersetzern.

Dieses Buch behandelt die Optimierungsphase von UEbersetzern. In dieser Phase werden Programme zur Effizienzsteigerung transformiert. Damit die Semantik der Programme bei diesen Transformationen erhalten bleibt, mussen jeweils zugehoerige Anwendbarkeitsbedingungen erfullt sein. Diese werden mittels statischer Analyse der Programme uberpruft. In diesem Buch werden Analysen und Transformationen imperativer und funktionaler Programme systematisch beschrieben. Neben einer detaillierten Beschreibung wichtiger Optimierungen bietet das Buch eine knappe Einfuhrung in die erforderlichen Konzepte und Methoden zur operationalen Semantik, zu vollstandigen Verbanden und Fixpunktalgorithmen.

Virtuelle Maschinen sind Abstraktionen von realen Rechnern. Meist sind sie in Software realisiert. Haufig sind sie fur eine spezielle Programmiersprache entworfen. Dieses Buch beschreibt die Ubersetzung von imperativen, funktionalen, logischen und objekt-orientierten Programmiersprachen. Fur jedes dieser Sprachparadigmen wird eine virtuelle Maschine eingefuhrt und die Ubersetzung einer Quellsprache in die Sprache der virtuellen Maschine prazise aber verstandlich beschrieben."

Dieses Buch behandelt Grundlagen von Programmiersprachen, deren Verknupfung mit realen Rechenmaschinen und - exemplarisch - Algorithmen. Das Ziel des Buches ist es, eine solide Basis fur das Studium der Informatik zu legen. Es ist ins besondere fur Studenten im Grundstudium des Studienganges Informatik gedacht. Ein Programm ist nur dann brauchbar, wenn es das gestellte Problem korrekt loest, und dies daruber hinaus mit der gewunschten Effizienz tut. Aussagen uber die Korrektheit und Effizienz eines Programms sind nur dann moeglich, wenn die verwendete Programmiersprache exakt definiert ist, d.h., wenn die Menge der Pro gramme (Syntax) und deren Bedeutung (Semantik) festliegen. Die Definition von Syntax und Semantik nimmt daher in diesem Buch einen wichtigen Platz ein. For male Definitionen werden erst dann lebendig, wenn sie auf einem guten intuitiven Verstandnis aufbauen, und wenn sie zu Folgerungen in der Form von Satzen fuhren. Daher enthalt dieses Buch eine grosse Anzahl von Beispielen, Satzen und Aufgaben. Die Grundlagen der Programmiersprachen werden eingefuhrt anhand einer spezifischen Programmiersprache, PROSA genannt (PROgrammiersprache SAar brucken). PROSA ist der Programmiersprache Pascal sehr ahnlich, weicht aber in einigen Punkten (z.B. dynamische Felder, geschachtelte Verbunde) aus didaktischen Grunden ab. Die Abweichungen dienen zum einen der Vereinfachung, und zum an deren der lllustration einiger Konzepte, die Pascal nicht kennt. Die Benutzung von Pascal in einem begleitenden Programmierpraktikum stellt aber keinerlei Problem dar.

Es ist fur Fachleute wie Laien immer wieder uberraschend, wie die Errungenschaften der Informatik das Leben der Menschen verbessern koennen, manchmal sogar in Richtungen, welche die Menschen gar nicht unbedingt wunschen. Die aus der Zeitschrift Informatik Spektrum stammenden Glossen in diesem Buch beschreiben kurzweilig und mit viel Humor viele solcher Errungenschaften: Wie sie entstehen, weshalb sie vielleicht doch nicht so gross sind und was noch auf uns zukommt.Eine amusante Lekture fur Informatiker und ihre gequalten Anwender.