Compilation Principle课程：前往报名学习
Through the study of this course, students should have the ability to apply compilation knowledge, be able to solve problems encountered in programming design, have the programming quality of compilation skills
开设学校：；学科：计算机、
Through the study of this course, students should have the ability to apply compilation knowledge, be able to solve problems encountered in programming design, have the programming quality of compilation skills
-1.1 An Introduction to Compiler Principles
--1.1 An Introduction to Compiler Principles
--1.1 An Introduction to Compiler Principles
-1.2 The Structure of the Compiler
--1.2 The Structure of the Compiler
--1.2 The Structure of the Compiler
-1.3 The Construction and Composition of a Compiler (I)
--1.3 The Construction and Composition of a Compiler (I)
--1.3 The Construction and Composition of a Compiler (I)
-1.4 The Construction and Composition of a Compiler (II)
--1.4 The Construction and Composition of a Compiler (II)
--1.4 The Construction and Composition of a Compiler (II)
-1.5 Auxiliary Routines and Tools run by the Compiler
--1.5 Auxiliary Routines and Tools run by the Compiler
--1.5 Auxiliary Routines and Tools run by the Compiler
-1.6 Main Data Structures that the Compiler Runs（I）
--1.6 Main Data Structures that the Compiler Runs（I）
--1.6 Main Data Structures that the Compiler Runs（I）
-1.7 Main Data Structures that the Compiler Runs（II）
--1.7 Main Data Structures that the Compiler Runs（II）
--1.7 Main Data Structures that the Compiler Runs（II）
-1.8 Bootstrapping and Porting（I）
--1.8 Bootstrapping and Porting（I）
--1.8 Bootstrapping and Porting（I）
-1.9 Bootstrapping and Porting（II）
--1.9 Bootstrapping and Porting（II）
--1.9 Bootstrapping and Porting（II）
-Chapter 1 testing
-2.1 Scanning Process
-2.2 Regular Expressions (I)
-2.3 Regular Expressions (II)
--2.3 Regular Expressions (II)
--2.3 Regular Expressions (II)
-2.4 Regular Expressions (III)
--2.4 Regular Expressions (III)
--2.4 Regular Expressions (III)
-2.5 Finite Automata (I)
-2.6 Finite Automata (II)
-2.7 Nondeterministic finite automata (I)
--2.7 Nondeterministic finite automata (I)
--2.7 Nondeterministic finite automata (I)
-2.8 Nondeterministic Finite Automata (II)
--2.8 Nondeterministic Finite Automata (II)
--2.8 Nondeterministic Finite Automata (II)
-2.9 From Regular Expressions to DFA (I)
--2.9 From Regular Expressions to DFA (I)
--2.9 From Regular Expressions to DFA (I)
-2.10 From Regular Expressions to DFA (II)
--2.10 From Regular Expressions to DFA (II)
--2.10 From Regular Expressions to DFA (II)
-2.11 From Regular Expressions to DFA (III)
--2.11 From Regular Expressions to DFA (III)
--2.11 From Regular Expressions to DFA (III)
-2.12 From Regular Expressions to DFA (IV)
--2.12 From Regular Expressions to DFA (IV)
--2.12 From Regular Expressions to DFA (IV)
-Chapter 2 testing
-3.1 Context-Free Grammars and Parsing
--3.1 Context-Free Grammars and Parsing
--3.1 Context-Free Grammars and Parsing
-3.2 Derivation (I)
-3.3 Derivation (II)
-3.4 Parse Trees and Abstract Syntax Trees
--3.4 Parse Trees and Abstract Syntax Trees
--3.4 Parse Trees and Abstract Syntax Trees
-3.5 Ambiguous Grammars
-3.6 Extended Notation : EBNF and Syntax Diagrams
--3.6 Extended Notation : EBNF and Syntax Diagrams
--3.6 Extended Notation : EBNF and Syntax Diagrams
-3.7 Formal Properties of Context-Free Languages
--3.7 Formal Properties of Context-Free Languages
--3.7 Formal Properties of Context-Free Languages
-3.8 Context-Free Grammars for TINY
--3.8 Context-Free Grammars for TINY
--3.8 Context-Free Grammars for TINY
-Chapter 3 testing
-4.1 The Introduction of Top-Down Parsing
--4.1 The Introduction of Top-Down Parsing
--4.1 The Introduction of Top-Down Parsing
-4.2 Recursive-Descent Analysis (I)
--4.2 Recursive-Descent Analysis (I)
--4.2 Recursive-Descent Analysis (I)
-4.3 Recursive-Descent Analysis (II)
--4.3 Recursive-Descent Analysis (II)
--4.3 Recursive-Descent Analysis (II)
-4.4 Error-Recovery in Top-Down Analysis
--4.4 Error-Recovery in Top-Down Analysis
--4.4 Error-Recovery in Top-Down Analysis
-4.5 LL(1) Parsing (I)
-4.6 LL(1) Parsing (II)
-4.7 LL(1) Grammars
-4.8 First sets
-4.9 Follow sets (I)
-4.10 Follow Sets (II)
-4.11 LL(1) Parsing Tables
-4.12 The Problems in LL(1) Grammar
--4.12 The Problems in LL(1) Grammar
--4.12 The Problems in LL(1) Grammar
-4.13 Elimination of Left Recursion and Left Factoring
--4.13 Elimination of Left Recursion and Left Factoring
--4.13 Elimination of Left Recursion and Left Factoring
-chapter 4 testing
-5.1 Extraction of Attribute Grammars and Semantic Rules (I)
--5.1 Extraction of Attribute Grammars and Semantic Rules (I)
--5.1 Extraction of Attribute Grammars and Semantic Rules (I)
-5.2 Extraction of Attribute Grammar and Semantic Rules (II)
--5.2 Extraction of Attribute Grammar and Semantic Rules (II)
--5.2 Extraction of Attribute Grammar and Semantic Rules (II)
-5.3 Construction of Dependency Graphs
--5.3 Construction of Dependency Graphs
--5.3 Construction of Dependency Graphs
-5.4 Synthesized Attributes and Inherited Attributes
--5.4 Synthesized Attributes and Inherited Attributes
--5.4 Synthesized Attributes and Inherited Attributes
-chapter 5 testing
-6.1 Runtime Environment (I)
-6.2 Runtime Environment (II)
--6.2 Runtime Environment (II)
--6.2 Runtime Environment (II)
-6.3 The Realization of Stack Storage Allocation (I)
--6.3 The Realization of Stack Storage Allocation (I)
--6.3 The Realization of Stack Storage Allocation (I)
-6.4 The realization of Stack Storage Allocation (II)
--6.4 The realization of Stack Storage Allocation (II)
--6.4 The realization of Stack Storage Allocation (II)
-Chapter 6 testing
-7.1 Intermediate Code (I)
-7.2 Intermediate Code (II)
-7.3 Postfix Notation(I)
-7.4 Postfix Notation(II)
-7.5 Three-Address Code (I)
-7.6 Three-Address Code (II)
-7.7 P Code
-7.8 Code Generation Techniques
--7.8 Code Generation Techniques
--7.8 Code Generation Techniques
-Chapter 7 testing
副教授，博士 主要研究方向，人工智能、自然语言处理、编译原理、数据挖掘、机器学习。1976年9月出生，1999年始任职于哈尔滨工程大学计算机科学与技术学院。2005年美国伊利诺伊大学香槟分校(UIUC)访问学者，2014年澳大利亚莫纳什大学(Monash)博士后。IEEE会员，国际计算机学会会员，中国计算机学会会员，黑龙江省计算机学会会员。长期以来一直在高等院校从事软件与理论、模式识别与智能系统、程序验证、模型构造等方面的教学科研工作。在政策关联关系挖掘、智能软件测试、模型构建与检测、博弈论、政策可验性证明、形式化表示方法和政策仿真等方面进行了比较深入的研究，并取得了在国内外独具特色的研究成果。是我国计算机审计领域有影响的审计专家，在计算机联网审计技术研究、社会保险审计实践方面代表了国内顶尖水平。参与国家政策审计，参与两部国家部颁标准制定，所取得政策审计成果已列入总理政府工作报告。承担国家自然科学基金项目1项，国家重点研发计划项目1项，承担国家科技支撑计划项目2项，教育部规划基金项目1项，中国博士后科学基金1项，黑龙江省十二五规划课题1项。获得中国信息化成果二等奖1项，黑龙江省科技进步二等奖1项、三等奖2项，专利8项，软件著作权14项。在国外学术期刊和IEEE国际学术会议上发表与本项目相关的学术论文50余篇，30余篇被SCI、EI和ISTP检索。出版专著和教材5部。
讲师 哈尔滨工程大学计算机与技术学院教师。 主讲课程：编译原理，离散数学，人工智能。研究方向：智能控制与智能机器人，嵌入式系统等。
讲师，博士 近年来一直从事人工智能、图形图像处理等方面的教学科研工作，参与多项科研项目。在Pattern Recognition等国内外高水平学术期刊上发表论文，多篇被SCI、EI检索。主讲课程，《编译原理》，《操作系统》等。
副教授，硕士生导师。 教学课程包括“编译原理”，“面向对象程序设计”等。 主持国家自然科学基金项目1项，黑龙江省自然科学基金项目1项，中央高校基础研究基金项目2项，参加国家自然科学基金项目1项。 她获得了3个省部级奖项，并发表了20多篇论文。 她在美国佐治亚州立大学有一年的学习经验。
讲师，教学课程包括“计算思维”，“软件测试质量和保证”等。 她主持了中央大学基础研究基金的1个项目。她获得了1个省和部级奖项，出版了3本书和近10篇论文。
