2014compiler课件ch232007章节.pptVIP

samuel2005@126.com samuel2005@126.com Chapter 2Scanning 2.4 From Regular Expressions to DFAs From Regular Expressions to DFAs From a Regular Expression to an NFA From a Regular Expression to an NFA The construction we will describe is know as Thompson’s construction. It uses ε-transitions to “glue together” the machines of each piece of a regular expression. Basic Regular Expression Concatenation Clearly, this machine accepts L(rs) = L(r)L(s) and corresponds to the regular expression rs Choice among Alternatives We added a new start state and a new accepting state using ε-transitions. This machine accepts L( r | s ) = L(r) ∪ L(s). Repetition This machine corresponds to r*. Example 2.12 Translate the regular expression ab|a into a NFA. Example 2.13 letter(letter|digit)* From NFA to DFA From NFA to DFA We need some method for eliminating ε-transitions and multiple transitions from a state on a single input character. Eliminating ε-transitions involves the construction of ε-closures (ε-闭包). Eliminating multiple transitions involves keeping track of the set of the states instead of single states. This algorithm is called the subset construction（子集构造）. ε - Closure ε-closure of a single state s is the set of states reachable by zero or more ε-transitions. We denote this set by s. ε-closure of a state always contains the state itself. Example 2.14 a* 1 = {1, 2, 4} 2 = {2} 3 = {2, 3, 4} 4 = {4} ε-Closure of Set of States ε-closure of a set of states is defined as the union of ε-closures of each individual state. If S = {s1, s2,…sn} is a set of states, then S = s1 ∪ s2 ∪ … ∪ sn In the previous example we had 1 = {1, 2, 4} and 3 = {2, 3, 4} Let S = {1, 3} S = {1, 3} = 1 ∪ 3 = {1, 2, 4} ∪ {2, 3, 4} = {1, 2, 3, 4} The Subset Construction（※） Given NFA M. Need to construct a corresponding DFA M’. Compute ε-closure of the start state of M; this becomes the start state of M’. For this set and for each subsequent set, we compute transitio