COSC4342 Exam 1 Study Guide - Topics

COSC4342 Exam 1 Study Guide - Topics - • NFA to Reg...

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

View Full Document Right Arrow Icon
COSC 4342 Exam #1 Study topics Turing machines - be able to identify parts of a turing machine, instructions, trace thru code, explain purpose Know Chomsky's hierarchy of language types Which machines are required to recognize which languages Major phases of compilation Tasks of a scanner Tasks of a parser Regular expressions English description to reg. expression Reg. expression to English description Reg. expression to NFA
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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.

Ask a homework question - tutors are online