School of Engineering Architecture and Computer Science

Department of Systems and Computer Science

306-350-01 Structure of Programming Languages

 

Syllabus, Spring, 2001

 

INSTRUCTOR: Prof. Lee Burge

EMAIL: [email protected]

OFFICE: LKD 2111

OFFICE HOUR: MWF 1pm-2pm, WF 3pm-4pm

TEXT: Programming Language Design and Implementation

by T. Pratt and M. Zelkowitz

 

COURSE DESCRIPTION:

Treats the formal definition of programming languages, including specification of syntax and semantics; elementary considerations of precedence, infix, prefix, and postfix notations; and global properties of algorithmic languages, including scope of declarations and storage allocations. Prerequisites: 306-363 Large Scale Programming

COURSE OBJECTIVE:

To provide an overview of the key paradigms used in developing modern programming languages. To highlight several languages (i.e. C/Java/Lisp/Prolog), to permit programs to be written in each language. To explore the implementation of each language in sufficient detail to provide the programmer an understanding of the relationship between a source program and its execution behavior. To provide sufficient formal theory to show where programming language design fits within the general computer science research agenda.

TOPICS:

  1. Issues and concepts in the design and implementation of languages
  2. Compiled and interpreted languages
  3. Data storage and language bindings
  4. Language syntax, parsing and semantics
  5. Procedural languages
  6. Block structured languages
  7. Object-oriented Languages
  8. Functional Languages
  9. Logic languages

GRADING:

3 quizzes

25 pts

75 pts total

5 hw/projects

20 pts

100 pts total

2 exams

50 pts

100 pts total

1 final

100 pts

100 pts total

 

 

375 pts total

 

Grade

Points

Percent

A

337-375

90%-100%

B

300-336

80%-89%

C

262-299

70%-79%

D

225-261

60%69%

F

Below-224

Below-59%

 

CSAB Category Content:

CORE: None

ADVANCED:

����������� Programming Languages 2.5

Theoretical Concepts .5

Total Credits: 3

 

Policy on late projects, research papers, and make-up exams:

Late projects will be deducted 10% per day for each day late. NO make-up exams will be given unless there is a bona fide written doctor�s excuse. In the event that such an excuse is accepted, the deadline will be extended the number of days specified in the excuse.

Plagiarism Policy:

Howard University has adopted a new policy on plagiarism and cheating. In short, all instances of plagiarism will be resolved by an office of the administration, which will conduct the appropriate hearings. See the section entitled "ACADEMIC CODE OF STUDENT CONDUCT" on pages 26-27 of the "Student Reference Manual and Directory of Classes."

Note: All projects must be submitted electronically. They will be tested for similarities with other projects using programs that compute the Halstead, McCabe, and BVA (boundary value analysis) metrics. See the 1995 paper in the SIGCSE Bulletin entitled "Using Software metrics to Detect Cheating in Student Programs." Other techniques due to Dr. Michael Wise of the University of Sydney will also be used as necessary to detect plagiarism.

Notice:

The Americans with Disabilities Act requires institutions to accommodate the needs of persons with disabilities. If you need special arrangements such as sign language interpreters or audiotapes of lectures, please make an appointment to see me.