Spring 2003: CS 5304
Translator Design and Construction
J D Arthur
Spring 2003: CS 5304 Translator Design and Construction J D Arthur |
|
| CRN | 15389 |
| Class Timing | TR 8:00 AM - 9:15 AM |
| Location | MCB 316 |
Instructor : Dr. J. D. Arthur
| Office | McBryde 610 |
| arthur@vt.edu | |
| Telephone | (540) 231-7538 |
| Office Hours | Tuesday & Thursday 10:00 am - 11:30 pm or by Appointment |
GTA (CRN 15389) : Kibum Kim
| kikim@vt.edu | |
| Recitation Hours | Wednesday 6:00pm - 7:00pm Location : MCB 219 |
| Office Hours | M 1:00 pm - 3:00 pm Location : MCB 133 |
What's New:
(4/1): Expression Code Generation Files and the loadfile record format for Project 5 are available in the project site.
(3/27): Project 5 is available in the project site. Due date is 4/8.
(3/20): Test files for the Symbol table and Example expression parser code are available in the project site.
(3/16): The simulator for the code is available in projects site.
(3/11):
Midterm will be held at MCB 316, 8am on Tuesday(3/18) (3/11):
Midterm review session will be held at MCB 316, 4pm on Sunday(3/16) (3/11):
Homework 6 is available in homework assignments site. Due date is and 3/13.
(3/9): ErrRecovery.pdf is available on the project site (2/25): Tar file containing testing files
for recursive descent parser is available in project site (2/25):
Homework 5 is available in homework assignments site. Due date is 2/27 and 3/11.
(2/20):
Homework 4 is available in homework assignments site. Due date is 2/25.
(2/11):
Project 2 input tar file is available in Programming Projects site.
(2/6):
Homework 2 is available in homework assignments site. Due date is 2/11.
(2/3):
Pdf file containing project submission guidelines is available in project site
(1/29):
Tar file containing testing files for lexical analyzer is available in project site
(1/29):
One of the homework problems (I believe it is 2.4) asks you to show that
the grammar is unambiguous... I do not need a formal proof... a logical
argument with illustrations will do. For example, one might argue (and
illustrate using the grammar) that no alternate selection of a productions
lead to identical strings, etc.
(1/27): Tar file containing testing files for lexical analyzer is available in project site (1/23):
One of the homework problems (I believe it is 2.4) asks you to show that
the grammar is unambiguous... I do not need a formal proof... a logical
argument with illustrations will do. For example, one might argue (and
illustrate using the grammar) that no alternate selection of a productions
lead to identical strings, etc.
(1/16):
You can download GNU Pascal from my ftp "pub" directory.
Ftp to arthur.cs.vt.edu, login id is "anonymous", password is you e-mail
address, cd to pub and get the tar.gz file.It runs on an Intel architecture under UNIX.
You must be on a computer having a University IP address to be able to ftp to my machine.