Discrete Mathematics (3rd Edition), edited by Geng Suyun, Qu Wanling and Sean, Tsinghua University Publishing House, 2004;

Compilation principle, edited by Chen Huowang, National Defense Industry Press, 2000, third edition.

Discrete mathematics part

1. Propositional logic and first-order logic

1. 1. Connectives, quantifiers and predicates

1.2. Propositional logic paradigm

1.3. Combination formula, explanation and equivalent formula

1.4. Reasoning theory

2. Set and relation

2. Operation and Properties of1.Set

2.2. Operations, properties and closures of relations

2.3. Equivalence relation and partial order relation

2.4. Operation and Properties of Functions

3. Algebraic system

3. 1. algebraic system and its homomorphism and isomorphism

3.2. Semigroups and Groups

3.3. Lattice and Boolean Algebra

4. Graphics and trees

4. Definition and Representation of1.Graph

4.2. Connectivity of Graph, Euler Graph and Hamilton Graph

4.3. Two-part drawings and floor plans

4.4. Tree, Spanning Tree and Root Tree

Compilation principle part

Chapter 1: Understand the basic concept and structure of compiler.

Chapter two: master the definition of language and the basic concepts, terms and grammar conversion methods of grammar description;

Chapter 3: Master the concepts and algorithms of finite automata and normal forms; Transformation between normal form and finite automata and normal grammar.

Chapter 4: Master LL( 1) analysis method; Arithmetic method; LR(K) analysis method.

Chapter 5: Mastering the concept of attribute grammar; The definitions of S-attribute grammar and L-attribute grammar, the translation mode, and the calculation methods of inherited attributes and comprehensive attributes.

Chapter six: Master the translation of assignment sentences and Boolean expressions; Control the translation of sentences; Procedure calls and type checking.

Chapter 7: Operation storage organization; Static and dynamic storage management and implementation.

Chapter 8: Master the concepts of optimization and local optimization, data flow equation and cyclic optimization method.