CS 5363 -- Fall 2002 Homepage

(Click image for larger picture.)

CS 5363 Programming Languages & Compilers
Fall 2002 Homepage

Lectures and Assignments (tentative)
Answers to questions
Mostly those submitted by email.
Course Handouts
Many handouts for the course are provided here in several forms: as text-only (".txt" or ".text"), as source programs (".c" or ".cpp" or ".java"), as a Postscript file (".ps"), and as a PDF file (".pdf").
Instructor: Neal R. Wagner

3.02.16 SB.

(210)458-5550.

To be determined

Textbook: Compilers: Principles, Techniques, and Tools
By Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman, Addison-Wesley, 1986
A classic in the field, written in 1986, the text is dated in a few respects, but this is a mature technology whose underpinnings have not been changing much. Here are sites related to purchasing the textbook.
Description (From the UTSA Graduate Catalog):
5363 Programming Languages and Compliers (PDF)
(3-0) 3 hours credit. Prerequisite: CS 3343 and 3233.
A study of modern programming languages with emphasis on their implementation. Topics include scanning, parsing, syntax-directed translation, code generation, and optimization.
Prerequisites: CS 3343 (Analysis of Algorithms) and CS 3233 (Discrete Mathematical Structures). The Analysis of Algorithms course is a particularly important prerequisite. You must have taken it or its equivalent to enroll in CS 5363.
Students in the Course: class roster
Final Examination (Review) : Tuesday, 10 December 2002, 8:00-10:45 pm

Revision date: 2002-08-27. (Please use ISO 8601, the International Standard.)