Compilation Principle Wang Ting, National University of Defense Technology

The construction principles and techniques of compilers can be said to be the best example of combining theory and practice in computer science and technology. In the teaching of many courses, there is often a lack of concrete and vivid examples of the connection between classic theories and advanced technologies, and the course on compilation principles has a unique advantage in this regard. Formal language and automaton theory provide a solid theoretical foundation for the design of compiler programs. It is under the guarantee of scientific theory that a series of advanced compiler program design methods and tools have been formed, making the construction of compiler programs highly efficient. Systematicity and automation.

• Chapter 1：Chapter 1 Introduction (1) (44 minutes and 36 seconds)

• Chapter 2：Chapter 1 Introduction (2) (59 minutes and 21 seconds)

• Chapter 3：Chapter 2 Section 1 Definition of Programming Language and Classification of High-Level Languages (55 minutes and 26 seconds)

• Chapter 4：Chapter 2 Section 2 General Characteristics of High-Level Languages (46 minutes and 42 seconds)

• Chapter 5：Chapter 2 Section 3 Syntax Description of Programming Language (1) (46 minutes and 44 seconds)

• Chapter 6：Chapter 2 Section 3 Syntax Description of Programming Language (2) (58 minutes and 14 seconds)

• Chapter 7：Chapter 3 Section 1 Design of Lexical Analyzer (1 hours and 4 minutes and 4 seconds)

• Chapter 8：Chapter 3 Section 2 Regular Expressions and Finite Automata (1) (39 minutes and 16 seconds)

• Chapter 9：Chapter 3 Section 2 Regular Expressions and Finite Automata (2) (1 hours and 2 minutes and 45 seconds)

• Chapter 10：Chapter 3 Section 2 Regular Expressions and Finite Automata (3) (39 minutes and 56 seconds)

• Chapter 11：Chapter 3 Section 2 Regular Expressions and Finite Automata (4) (47 minutes and 13 seconds)

• Chapter 12：Chapter 3 Section 2 Regular Expressions and Finite Automata (5) (49 minutes and 56 seconds)

• Chapter 13：Chapter 4 Section 1 Top-down Analysis and LL(1) Analysis Method (1) (53 minutes and 38 seconds)

• Chapter 14：Chapter 4 Section 1 Top-down Analysis and LL(1) Analysis Method (2) (59 minutes and 26 seconds)

• Chapter 15：Chapter 4 Section 2 Recursive Descent Analysis Program Structure (36 minutes and 59 seconds)

• Chapter 16：Chapter 4 Section 3 Predictive Analysis Program (45 minutes and 49 seconds)

• Chapter 17：Chapter 5 Section 1 Basic Issues in Bottom-up Analysis (57 minutes and 26 seconds)

• Chapter 18：Chapter 5 Section 2 Operator Priority Analysis Algorithm (1) (36 minutes and 40 seconds)

• Chapter 19：Chapter 5 Section 2 Operator Priority Analysis Algorithm (2) (57 minutes and 38 seconds)

• Chapter 20：Chapter 5 Section 2 Operator Priority Analysis Algorithm (3) (48 minutes and 18 seconds)

• Chapter 21：Chapter 5 Section 3 LR Analysis Method (1) (51 minutes and 1 seconds)

• Chapter 22：Chapter 5 Section 3 LR Analysis Method (2) (59 minutes and 28 seconds)

• Chapter 23：Chapter 5 Section 3 LR Analysis Method (3) (44 minutes and 13 seconds)

• Chapter 24：Chapter 5 Section 3 LR Analysis Method (4) (50 minutes and 41 seconds)

• Chapter 25：Chapter 6 Section 1 Attribute Grammar (47 minutes and 10 seconds)

• Chapter 26：Chapter 6 Section 2 Processing methods based on attribute grammar, S-attribute grammar (1) (44 minutes and 35 seconds)

• Chapter 27：Chapter 6 Section 2 Processing methods based on attribute grammar, S-attribute grammar (2) (47 minutes and 37 seconds)

• Chapter 28：Chapter 6 Section 3 L-Attribute Grammar and Top-Down Translation (1) (49 minutes and 51 seconds)

• Chapter 29：Chapter 6 Section 3 L-Attribute Grammar and Top-Down Translation (2) (52 minutes and 42 seconds)

• Chapter 30：Chapter 7 Section 1 Intermediate Language (44 minutes and 37 seconds)

• Chapter 31：Chapter 7 Section 2 Translation of Assignment Statements (1 hours and 49 seconds)

• Chapter 32：Chapter 7 Section 3 Translation of Boolean Expressions (1) (50 minutes and 25 seconds)

• Chapter 33：Chapter 7 Section 3 Translation of Boolean Expressions (2) (53 minutes and 55 seconds)

• Chapter 34：Chapter 7 Section 4 Translation of Control Statements and Procedure Calls (1) (51 minutes and 7 seconds)

• Chapter 35：Chapter 7 Section 4 Translation of Control Statements and Procedure Calls (2) (51 minutes and 2 seconds)

• Chapter 36：Chapter 7 Section 4 Exercise Lesson (1) (44 minutes and 26 seconds)

• Chapter 37：Chapter 7 Section 4 Exercise Lesson (2) (55 minutes and 4 seconds)

• Chapter 38：Chapter 8 Section 1 Organization and Operation of Symbol Table (39 minutes and 22 seconds)

• Chapter 39：Chapter 8 Section 2 Contents and Scope Analysis of Symbol Table (57 minutes and 57 seconds)

• Chapter 40：Chapter 9 Section 1 Activities when the target program is running (43 minutes and 12 seconds)

• Chapter 41：Chapter 9 Section 2 Static Storage Management and Dynamic Storage Management (55 minutes and 56 seconds)

• Chapter 42：Chapter 9 Section 3 Stack Implementation of Nested Procedural Language (1) (44 minutes and 17 seconds)

• Chapter 43：Chapter 9 Section 3 Stack Implementation of Nested Procedural Language (2) (1 hours and 11 minutes and 18 seconds)

• Chapter 44：Chapter 10 Section 1 Overview (40 minutes and 27 seconds)

• Chapter 45：Chapter 10 Section 2 Local Optimization (47 minutes and 19 seconds)

• Chapter 46：Chapter 10 Section 3 Loop Optimization (46 minutes and 2 seconds)

• Chapter 47：Chapter 11 Target Code Generation (1) (1 hours and 11 minutes and 25 seconds)

• Chapter 48：Chapter 11 Target Code Generation (2) (33 minutes and 59 seconds)

• Chapter 49：Chapter 11 Exercise Lesson (3) (48 minutes and 49 seconds)

• Chapter 50：Chapter 11 Exercise Lesson (4) (50 minutes and 43 seconds)