Mark it as unvisited yellow in this diagram winter

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 2013 UW CSE 401 (Michael Ringenburg) 4 2 1/14/13 Example a 3 b 4 CSE341: Programming Languages CSE341: Programming ε •  Convert NFA to a DFA: Languages2 Lecture 1 Lecture 1 1 Course ε Course Mechanics Mechanics c ML Variable Bindings 6 5 ML Variable Bindings Dan Grossman Fall 2011 ε 7 ε Dan Grossman Fall 2011 {1,2,5} Step 2: Make a new DFA state corresponding to this ε closure. Mark it as unvisited (yellow in this diagram). Winter 2013 UW CSE 401 (Michael Ringenburg) 5 Example CSE341: Programming a 3 b 4 CSE341: Programming Languages2 Languages ε •  Convert NFA to a DFA: ε Lecture 1 Lecture 1 1 Course ε ε Course Mechanics Mechanics c 6 ML Variable Bindings 5 ML Variable Bindings a {1,2,5} b Dan? Grossman Fall 2011 7 Dan Grossman Fall 2011 ? c ? Loop: As long as there are unvisited DFA nodes, pick one. Consider transi:ons from its corresponding NFA states for every symbol in the alphabet. Winter 2013 UW CSE 401 (Michael Ringenburg) 6 3 1/14/13 Example a 3 b 4 CSE341: Programming Languages CSE341: Programming ε •  Convert NFA to a DFA: Lan...
View Full Document

Ask a homework question - tutors are online