CS 4550 - Compilers

Institution:

Utah Tech University

Subject:

Computer Science

Description:

Required of students pursuing a Computer Science degree or emphasis. Covers compiler design and implementation, including lexical analysis, parsing, symbol table management, and generating code through challenging programming assignments. **COURSE LEARNING OUTCOMES (CLOs) At the successful conclusion of this course, students will be able to: 1. Create Grammars and Finite Automata corresponding to Regular Languages. 2. Scan a text file (of programming code) using a Finite Automata to identify the Tokens. 3. Parse a sequence of Tokens using Context Free Grammar to build a Parse Tree. 4. Interpret a Parse Tree to run the original programming code. 5. Write and execute machine code corresponding to a Parse Tree. 6. Build and maintain a Symbol Table to keep track of all variables in programming code. Course fee required. Prerequisites: CS 2420 (Grade C or higher); AND CS 2810 (Grade C or higher); AND CS 3005 (Grade C or higher). SP

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.utahtech.edu/

Phone Number:

(435) 652-7500

Regional Accreditation:

Northwest Commission on Colleges and Universities

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.