CSCE 3650 Course Information Page

May 5:

Here is a solution set (or at least a first attempt at one) for Homework 2.

April 27:

I'll be awarding 5 points on the final for each student who turns in evidence of completing a SETE evaluation and another 5 for each student who turns in evidence of a CSE exit survey. PLEASE, limit yourself to one of each. I had a student last term wanting to get more credit for turning in two exit surveys. Sigh. You should be able to fill out the SETE form by accessing your my.unt.edu page.

The CSE exit survey (for this class) is here.

2/17/2011:

Since some students are planning to use C++ for their compilers, and since I've spent some time on a project of my own getting bison and flex to play nicely with one another, I'm going to share an example of how to do this that I plan to have ready by class time today. Meanwhile, here is a link that outlines the approach I'll be using.

2/1/2011:

I've received a few requests for "clarification" on the symbol table assignment, which is due next Sunday night at the stroke of 11:59pm. So, I've added a pdf file that describes what could go into your symbol table program. Scoll down to the list of "handouts" below and you'll see a link. There is also a plain text version of the document available on the "csp" machines at: ~sweany/public/3650/symbolTableDescription.

I hope this document provides more clarification than obfuscation.

We'll be using the Moodle online submission system this term. To access it, go here to set up an account on the 3650 page.

Textbook

Section Meeting Time

This class has one prerequisite, CSCE 3600 (AKA CSCI 3600).

Objectives

I expect each student to meeting the following objectives this term.

Topics

• Compiler Formalisms
• Lexical Analysis: Regular Expressions
• Finite Automata: definitions, constructions, equivalences
• Flex
• Semantic Analysis: Context-Free Grammars
• Bison
• Intermediate Representations
• Code Generation
• Dataflow Analysis and Optimization
• Register Allocation and Assignment

In-Class ``Handouts''

• "Notes" for the Term
• LR Parse Algorithm
• First and Follow Sets
• Run Time Stack
• Symbol Table Discussion
• Parse Table for Expression Grammar
• Live Variable Analysis

Attendance Policy

Grading Policy

Your grade in this course will be determined by a combination of written exams, homework, and programs.

Homework	20%
Program (compiler) Assignments	50%
Midterm	20%
Final	10%

My late policies are the following:

• For homework, including any take-home exams, no late submissions will be graded.
• For programs, I have two different late policies, namely:
  • Any program submitted after the due date and time but before 1 full week after the due date and time will be graded with a 10% penalty.
  • Since the programs in this class will build upon one another, I will "rebate" up to 50% of the points "lost" on one assignment if (and only if) the next program assignment includes working code for the previous one. So if your second program recieves a score of 40, and your third program includes a working version of the second program you would receive as many as 30 points added to your second program grade, which (might) then become 70.

Grades to Date

Collaboration and Cheating

On homework and programs, do your own work. I know that leaves a lot to interpretation, but we'll be discussing acceptable cooperation on a per-assignment basis. In the final analysis though, it DOES come down to "do your own work."

And of course you need to do your own work on quizzes and exams as well. Here there should be no ambiguity at all.

In case the above description, and in-class discussion of my views on appropriate and inappropriate collaboration does not answer all of your questions, please look at the university Student Rights and Responsibilities page.