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
This note was uploaded on 04/29/2008 for the course COSC 4342 taught by Professor Baker during the Spring '08 term at St. Edwards.
- Spring '08