Unformatted text preview: • NFA to Reg. expression • NFA to DFA be able to convert using Thompson's construction • Minimal DFA be able to take a DFA convert to minimal DFA • Be able to code the algorithm for a Finite State Machine using a state transition diagram • Scanner Generators -- javacc know sections of a javacc input file be able to write a specification in javacc for a simple scanner including SKIP, TOKEN, and states...
View Full Document
- Spring '08
- construction Minimal DFA, Reg. expression NFA, expression Reg. expression, NFA NFA