• Instructor: Neal R. Wagner

Office: 3.02.16 SB.    Phone: (210)458-5550.   
Tentative Office hours: MWF 11 am -1 pm, MW 11-12 noon.
• Goals and Objectives
  The syllabus mentions course goals and objectives, while this link discusses them in more detail.

• Lectures and Assignments (tentative)
  There will be a 6- or 7-part programming project and up to 4 written homework assignments.

• Grading Policy
  Your grade will depend on a programming project, written homework, an in-class midterm exam, a final exam, and attendance.

• Dishonesty Policy
  As a new policy, you will need comments at the beginning of each programming assignment identifying any sources of program code that you did not write yourself.

• Course Handouts
  Many handouts for the course will be provided here in several forms: as text-only (".txt" or ".text"), as source programs (".c" or ".cpp" or ".java"), and as a Postscript file (".ps").

• 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. The other disadvantage of the text is that it is written at a fairly sophisticated level.  Here are sites related to purchasing the textbook.

• Description (From the UTSA Undergraduate Catalog):
  3723 Programming Languages
  (3-0) 3 hours credit. Prerequisites: CS 3233 and 3323 (on-line catalog), CS 2213 and 3233 (printed catalog).
  An introduction to the organization of high-level programming languages, including data types, control structures, data flow, and run time environments. Use of formal syntax descriptions. The implications of interpretation versus compilation. Activation records and dynamic storage in block structured languages.

  Special Note: The prerequisites for this course are confusing. CS 3233 (Discrete Mathematical Structures) remains unchanged as a prerequisite, but CS 3323 is no longer required for a CS major and will no longer be a prerequisite for this course. Instead, the new course CS 2213 (Advanced Programming) will be one of the new prerequsites.

• Students in the course
  A list of students in the course along with their runner account.

• Postscript Resources:
  • Postscript handouts.
    Postscript Programs

  • Postscript References:
    • Postscript ``Blue'' book (a good introductory tutorial)
      Local copy (PDF, 847k)    Remote copy (PDF, 847k)   
      
    • Programs from the Blue book Bluebook programs
      
    • Postscript ``Green'' Book (help for serious Postscript programmers)
      Local copy (PDF, 934K)   Remote copy (PDF, 934K)
      
    • Postscript Language Reference Manual (the best reference)
      Local copy (PDF, 7.9 meg)   Remote copy (PDF, 7.9 meg)
      
    • First Guide to Postscript (a simple introduction) First Guide
      
    • Postscript Tutorial (a simple tutorial) Postscript Tutorial
      
    • Thinking in Postscript (another tutorial)
      Local copy (PDF, 847k)   Remote copy (PDF, 847k)
      
    • Postscript for Mathematicians Book
      
    • Postscript Sources and Links Sources and Links
      
    • More Postscript Sources and Links More Sources and Links

• Prolog Resources:
  • Prolog knowledgebase example
    
  • Example Prolog session
    
  • Other Prolog examples
    
  • Prolog Manual
    

• Smalltalk Resources:
  • Smalltalk
    

Mid-term Examination, Review, Answers: Wednesday, 21 March 2001
Final Examination, Partial Answers: Wednesday, 9 May 2001, 8:00-10:15 pm