Programming Language (CS 550)
Assignments and Solutions
- Course Description
Covers basic concepts of the design and implementation of programming languages,
including data representation and types, functions, sequence control,
environments, block structure, subroutines and coroutines, storage management.
Emphasizes language features and implementation, not mastery of any particular
This is a core course required by all graduate Computer Science students and
is an elective for graduate Software Engineering students.
The course is available to other students with sufficient programming
experience (see prerequisites) who have an interest in programming languages
(e.g. Information Systems, Computer Engineering, etc.).
- Course Themes
- Evaluation and implementation of of programming languages
- Tools for describing and analyzing languages, including syntax,
semantics, and pragmatics
- Tools to design new languages
- Programming Paradigms (imperative, functional, logic,
- Implementation of programming languages
- Course Objectives
- Be able to compare and evaluate different programming languages and
implement different programming constructs and features
(e.g. variables, loops, procedures, dynamic memory).
- Be able to formally specify the syntax and semantics of programming
- Be able to write a parser and a scanner.
- Be able to write a translator to convert from one language to
- Be able to describe the semantics of and implement an interpreter and
compiler for a simple programming language.
- Be comfortable with the major programming paradigms and be able to use
at least one language from each paradigm.
- Course Benefits
- Easier to express algorithmic ideas
- Better able to formally express concepts
- Improved ability to select appropriate languages
- Easier to learn new languages
- Understand the significance and impact of language choices and
- Able to design new languages (little languages, interface
Assumes familiarity with the basics of logic (predicate calculus),
recursion and induction, data structures, automata, and grammars.
All students should be proficient with at least one object-oriented
programming language (e.g. java, C++) - inheritance, polymorphism,
and should have seen at least two different programming languages.
- Jeremy Johnson
Office: University Crossings 100C
e-mail: jjohnson AT cs DOT drexel DOT edu
office hours: W 1-2 and T 8-9 (online), additional hours by appointment.
- Kurt Schmidt
Office: University Crossings 105
e-mail: AT drexel DOT edu
office hours: R 5-6 and M 8-9 (online).
- Meeting Time
- Thursday 6-9:00 in Univ. Crossings 153 and online.
The online and in class versions
of the course will be identical (in class lectures will be recorded and posted
on webct and use of online discussions will be required by everyone).
- Course Discussion Groups
- BbVista will be used for class discussion and announcements - check regularly
Please use this list for questions and discussions related to the course.
If you know the answer to someone's question, please feel free to jump in,
as long as well it is not an answer to a homework problem. I will moderate
the list so that frivolous mail and spam is not forwarded.
Michael L. Scott, Programming Language Pragmatics, 3rd Ed., Morgan Kaufmann Publishers, 2009.
- In addition to the official text book listed below, a variety of resources
for different programming languages will be made available and should be
consulted. Also all students must have access to the necessary compilers
and interpreters for the different languages discussed. All required
compilers/interpreters will be made available on the department of Computer
Science computers. Many, if not all, are publicaly available.
- Week 1: Parsing and Grammars (ch. 2)
- Week 2: Mini Language Interpreter (ch. 4)
- Week 3: List Processing, Memory Management,
Garbage Collection (ch. 3 sec. 2 and 7 sec. 7-8)
- Week 4: Scanner and Parser Generation (ch. 2)
- Week 5: Mini Language Compiler (ch. 14)
- Week 5: Midterm
- Week 6: Functional Programming (ch. 10 and SICP)
- Week 7: Object Oriented Programming (ch. 9 and SICP)
- Week 8: Logic Programming and Query Languages (ch. 11 and SICP)
- Week 9: Lambda Calculus (ch. 10)
- Week 10: Programming Language Semantics
Students will be assigned to groups (4 students each - members may come
from either the in class or online sections). Each group
will be responsible for weekly homework (8 total), and each member
will take the lead on two of the assignments. Peer grading will be
used for group participation and discussion groups will be set up
in webct for each group and all members are expected to participate
in the discussions and contribute to every assignment. Doing all of
the assignments will be essential for the exams.
- Homework and participation (50%)
- Midterm (25%)
- Final Exam (25%)
- John R. Levine,
flex & bison,
O'Reilly & Associates. An
online copy of this book is available through Drexel's library
(safari). This is a rewrite of the older book on Lex and Yacc by
Levine, Mason, and Brown.
- John R. Levine, Tony Mason, Doug Brown,
Lex & Yacc,
2nd/updated edition (October 1992), O'Reilly & Associates. An
online copy of this book is available through Drexel's library
- Alfred V. Aho and Jeffrey D. Ullman,
Foundations of Computer Science - C Edition,
W. H. Freeman and Company, 1995.
- Kenneth Louden, Programming Languages: Principles and Practice, 2nd Ed., Thomson Brooks/Cole, 2003.
- list reference books here.
- Ken Louden's Web resources for hist text Programming Languages.
- [SICP] Abelson and Sussman, Structure and Interepretation of Computer Programs.
- Graphviz - Graph Visualization Software.
- CUP Reference Manula - Parser generator for Java.
- PLY - Python Lex-Yacc.
- MIT/GNU Scheme
- Lambda Calculus Tutorial
from Chris Barker at NYU.
(Last updated Sun. Mar. 21)
Look Here for Important Announcements
This list is tentative and may be modified at the instructor's discretion.
- Lecture 1: Grammars and Parsing (ch. 2 of the text)
- Lecture 2: Mini Language Interpreter (ch. 4 of the text)
- Lecture 3: Dynamic Memory Management and Garbage Collection (ch. 3 sec. 2 and ch. 7 sec. 7-8 of the text)
- Lecture 4: Scanner and Parser Generators (ch. 2 of text)
- Lecture 5: Mini Language Compiler (ch. 5, 14 and 16 of text)
- Lecture 6: Functional Programming and Operational Semantics of Scheme (ch. 10 of the text and ch. 3 and 4.1-3 of SICP)
- Lecture 7: Object Oriented Programming and Implementation (ch. 9)
- Lecture 8: Logic Programming and a Simple Query Language (ch. 11 [logic programming] and ch. 4 of SICP [query language])
- Lecture 9: Lambda Calculus (ch. 10)
- Lecture 9: Programming Language Semantics
Programs and Worksheets
- Assignment 1 - parsing,
parser generators, and recursive data structures (due Wed. April 13 at 9am).
- Assignment 2 - extending
the mini language to support lists (due Thur. April 21 at 9am).
- Assignment 3 - dynamic
memory allocation and garbage collection (due Thur. April 28 at 9am).
- Midterm Exam - Thur. April 28 through Wed. May 4 (9 am)
- Assignment 4 - mini
language compiler - version 1 (due Thur. May 12 at 9am).
- Assignment 5 - mini
language compiler - version 2 (due Thur. May 19 at 9am).
- Assignment 6 - support for
functional programming (due Thur. May 26 at 9am).
- Final Exam - Due Thursday June 9 by 9pm.
Created: 3/30/07 [last updated 6/3/11] by jjohnson AT cs DOT drexel DOT edu
- Available for the class only through BbVista.