| Description |
1 online resource (xiii, 187 pages) |
| Contents |
Preface -- Acknowledgments -- Contents -- 1 Introduction -- 1.1 High-Level Programming Languages -- 1.2 Implementation of Programming Languages -- 1.2.1 Interpreters -- 1.2.2 Compilers -- 1.2.3 Real and Virtual Machines -- 1.2.4 Combined Compilation and Interpretation -- 1.3 General References -- 2 Imperative Programming Languages -- 2.1 Language Concepts and Their Compilation -- 2.2 The Architecture of the C-Machine -- 2.3 Simple Expressions and Assignments -- 2.4 Statements and Statement Sequences -- 2.5 Conditional and Iterative Statements |
|
2.6 Memory Allocation for Variables of Basic Types2.7 Memory Allocation for Arrays and Structures -- 2.8 Pointers and Dynamic Memory Allocation -- 2.9 Functions -- 2.9.1 Memory Organization of the C-Machine -- 2.9.2 Dealing with Local Variables -- 2.9.3 Function Call and Return -- 2.10 Translation of Programs -- 2.11 Exercises -- 2.12 List of CMa Registers -- 2.13 List of Code Functions of the CMa -- 2.14 List of CMa Instructions -- 2.15 References -- 3 Functional Programming Languages -- 3.1 Basic Concepts and Introductory Examples |
|
3.2 A Simple Functional Programming Language3.3 The Architecture of the MaMa -- 3.4 Translation of Simple Expressions -- 3.5 Access to Variables -- 3.6 let Expressions -- 3.7 Function Definitions -- 3.8 Function Application -- 3.9 Under- and Oversupply with Arguments -- 3.10 Recursive Variable Definitions -- 3.11 Closures and Their Evaluation -- 3.12 Optimization I: Global Variables -- 3.13 Optimization II: Closures -- 3.14 Translating Program Expressions -- 3.15 Structured Data -- 3.15.1 Tuples -- 3.15.2 Lists -- 3.15.3 Closures for Tuples and Lists |
|
3.16 Optimization III: Last Calls3.17 Exercises -- 3.18 List of MaMa Registers -- 3.19 List of Code Functions of the MaMa -- 3.20 List of MaMa Instructions -- 3.21 References -- 4 Logic Programming Languages -- 4.1 The Language ProL -- 4.2 The Architecture of the WiM -- 4.3 Allocation of Terms in the Heap -- 4.4 The Translation of Literals -- 4.5 Unification -- 4.6 Clauses -- 4.7 The Translation of Predicates -- 4.7.1 Backtracking -- 4.7.2 Putting It All Together -- 4.8 The Finalization of Clauses -- 4.9 Queries and Programs |
|
4.10 Optimization I: Last Goals4.11 Optimization II: Trimming of Stack Frames -- 4.12 Optimization III: Clause Indexing -- 4.13 Extension: The Cut Operator -- 4.14 Digression: Garbage Collection -- 4.15 Exercises -- 4.16 List of WiM Registers -- 4.17 List of Code Functions of the WiM -- 4.18 List of WiM Instructions -- 4.19 References -- 5 Object-Oriented Programming Languages -- 5.1 Concepts of Object-Oriented Languages -- 5.1.1 Objects -- 5.1.2 Object Classes -- 5.1.3 Inheritance -- 5.1.4 Genericity -- 5.1.5 Information Encapsulation -- 5.1.6 Summary |
| Summary |
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 |
| Analysis |
computerwetenschappen |
|
computer sciences |
|
programmeertalen |
|
programming languages |
|
programmeren |
|
programming |
|
Information and Communication Technology (General) |
|
Informatie- en communicatietechnologie (algemeen) |
| Bibliography |
Includes bibliographical references and index |
| Notes |
English |
| Subject |
Compilers (Computer programs)
|
|
Informatique.
|
|
Compilers (Computer programs)
|
| Form |
Electronic book
|
| Author |
Seidl, Helmut
|
| ISBN |
9783642149092 |
|
364214909X |
|
3642149081 |
|
9783642149085 |
|
1283477335 |
|
9781283477338 |
|
