Weiter zum Menü

Universität Paderborn - Home

Universität Paderborn

Die Universität der Informationsgesellschaft

Weiter zum Ende

Compiler I WS 2001/2002 - Slides

0. Compiler I
Compiler I (01)
1. Introduction
Objectives (02) Lectures in English (03) Syllabus (04) Prerequisites (05) References (06) Course material in the Web (07) Commented slide in the course material (07a) What does a compiler compile? (08) What is compiled here? (09) What is compiled here? (10) Languages for specification and modeling (11) Domain Specific Languages (DSL) (12) Programming languages as source or target languages (13) Semester project as running example (14) Meaning described for abstract machine (15) Example: Tokens and structure (16) Example: Names, types, generated code (17) Language definition - Compiler task (18) Compiler tasks (19) Compiler structure and interfaces (20) Software qualities of the compiler (21) Strategies for compiler construction (22) Generators (23) Environment of compilers (24) Compilation and interpretation of Java programs (25)
2. Lexical analysis
Lexical Analysis (26) Representation of tokens (27) Specification of token notations (28) Regular expressions mapped to syntax diagrams (29) Construction of deterministic finite state machines (30) Example: Floating point numbers in Pascal (31) Composition of token automata (32) Rule of the longest match (33) Scanner: Aspects of implementation (34) Identifier module and literal modules (35) Scanner generators (36)
3. Syntactic analysis
Syntactic analysis (37) Concrete and abstract syntax (38) Example: concrete expression grammar (39) Example: abstract expression grammar (40) Recursive descent parser (41) Grammar conditions for recursive descent (42) Grammar transformations for LL(1) (43) Comparison: top-down vs. bottom-up (44) LR(1) automata (45) LR(1) states and operations (46) Example for a LR(1) automaton (47) Construction of LR(1) automata (48) Operations of the LR(1) automaton (49) LR conflicts (50) Shift-reduce conflict for ,dangling else" ambiguity (51) Simplified LR grammar classes (52) Implementation of LR automata (53) Error handling: general criteria (54) Error position (55) Error recovery (56) Recovery method: simulated continuation (57) Parser generators (58) Design of concrete grammars (59) Grammar design for an existing language (60) Grammar design together with language design (61) Syntactic restrictions versus semantic conditions (62) Reasons of LALR(1) conflicts (63) Eliminate ambiguities (64) Unbounded lookahead (65) LR(1) but not LALR(1) (66)
4. Semantic analysis
4. Semantic analysis and transformation (67) 4.1 Attribute grammars (68) Basic concepts of attribute grammars (69) Definition of attribute grammars (69a) AG Example: Compute expression values (69b) AG Binary numbers (70) An attributed tree for AG Binary numbers (71) Dependency analysis for AGs (72) Dependency graphs for AG Binary numbers (73) Construction of attribute evaluators (74) Visit-sequences (75) Visit-sequences for the AG Binary numbers (76) Tree walk for AG Binary numbers (76a) LAG (k) condition and algorithm (77) Generators for attribute grammars (78) State attributes without values (78a) Dependency pattern CHAIN (78b) Dependency pattern INCLUDING (78c) Dependency pattern CONSTITUENTS (78d) 4.2 Definitionmodul (79) 4.3 Type analysis (80) Declarations and type notations (81) Types of expressions required by context (82) Overloading resolution for operators (83) Type analysis for object-oriented languages (84) Type analysis for functional languages (1) (85) Type analysis for functional languages (1) (86) 4.4 Name analysis (87) Environment module (88) Data structure of the environment module (89) Environment operations in tree contexts (90) Semantic error handling (91)
5. Transformation
5. Transformation (92) Example: Target tree construction (93) Attribute grammar for target tree construction (CI-93) (94) Generator for creation of structured target texts (95) PTG Patterns for creation of HTML-Texts (96)
6. Synthesis
6. Synthesis: An Overview (97) Optimization (98) Optimizing Transformations (99) Analysis in Compilers (100) Example for a Control-flow Graph (101) Data-Flow Analysis (102) Specification of a DFA Problem (103) Call Graphs for object-oriented programs (104) Code Generation (105) Storage Mapping (106) Run-Time Stack (107) Code Sequences for Control Statements (108) Example for Code Selection (109) Register Allocation (110) Example for Graph Coloring (111) Code Parallelization (112) Software Pipelining (113) Loop Parallelization (114)

Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 10.04.2006

Weiter zum Anfang