词汇分析部分摘要.pptVIP

词法分析部分总结; 描述：用正规式对模式进行描述； 构造NFA：为每个正规式构造一个NFA； 确定化：将NFA转换成等价的DFA； 最小化：优化DFA，使其状态数最少； 构造词法分析器：由DFA构造词法分析器（表驱动，直接编码，LEX）。;涉及到的形式化概念;正则语言;正则语言;Algebraic Laws for RE’s;Identities and Annihilators;正则语言相关内容;RE to ε-NFA: Basis;RE to ε-NFA: Induction 1 – Union;RE to ε-NFA: Induction 2 – Concatenation;RE to ε-NFA: Induction 3 – Closure;正则语言相关内容;From Automata to RE;From Automata to RE;From Automata to RE;From Automata to RE;DFA-to-RE;Decision Properties of Regular Languages;Properties of Language Classes;Decision Properties;Why Decision Properties?;Why Decision Properties – (2);Closure Properties;The Membership Question;Example: Testing Membership;Example: Testing Membership;Example: Testing Membership;Example: Testing Membership;Example: Testing Membership;Example: Testing Membership;The Emptiness Problem;The Infiniteness Problem;Proof of Key Idea;Proof – (2);Finding Cycles;The Pumping Lemma;Statement of the Pumping Lemma;Example: Use of Pumping Lemma;Pumping Lemma;Decision Property: Equivalence;Product DFA – Continued;Example: Product DFA;Equivalence Algorithm;Example: Equivalence;Equivalence Algorithm – (2);Decision Property: Containment ;Example: Containment;The Minimum-State DFA for a Regular Language;Efficient State Minimization;Efficient State Minimization;Example: State Minimization;Efficient State Minimization;Efficient State Minimization;Efficient State Minimization;Efficient State Minimization;Efficient State Minimization;Efficient State Minimization;Efficient State Minimization;Efficient State Minimization;Example – Concluded;Eliminating Unreachable States;Closure Under Union;Closure Under Concatenation and Kleene Closure;Closure Under Intersection;Example: Product DFA for Intersection;Closure Under Difference;Example: Product DFA for Difference;Closure Under Complementation;Closure Under Reversal – (2);Reversal of a Regular Expression;Example: Reversal of a RE;Homomorphisms;Closure Under Homomorphism;Example: Closure under Homomorphism;Example – Continued;正则语言小结;