CSC 7101 Study Guide
Programming Languages
Fall 2011
Gerald Baumgartner
Reading
Slides on course web page: http:/www.csc.lsu.edu/~gb/csc7101/ .
CSC 4101 textbook:
Michael Scott, Programming Language Pragmatics, 3rd ed., Morgan Kaufmann Publishers, 2009.
Homework 2
CSC 7101, Spring 2011
Due: 28 February 2011
1. (5 pts)
What set of states does the formula x.x = 3 characterize? What set of states does the
formula x.x = x characterize? Explain your answers.
2. (10 pts)
Which of the following Hoare triples ar
Homework 6
CSC 7101, Spring 2011
Due: 4 May 2011
1. An int in Java is represented as a 32-bit number, float and double are represented as 32-bit and
64-bit IEEE 754 oating point numbers, respectively. Suppose we dene the subtype relationship
on integers a
practice
Designed for concurrency from the ground
up, the Erlang language can be a valuable tool
to help solve concurrent problems.
BY Jim LaRson
erlang for
concurrent
Programming
Erlang is a language developed to let mere mortals
write, test, deploy, and
Program 1: Prolog Interpreter
CSC 7101, Spring 2011
Due: 8 April 2011
Reading
Please read: Describing PROLOG by its interpretation and compilation, by Jacques Cohen. It appeared
in Communications of the ACM, volume 28, number 12, December 1985, pages 1311
CSC 7101
Programming Language Structures
Spring 2011
Syllabus
Gerald Baumgartner
Course Summary
The course listing says:
Advanced study of data specication, storage management, and control in programming languages; includes coverage of formal specication
Homework 3
CSC 7101, Spring 2011
Due: 14 March 2011
1. Consider a standard programming language (say, like C or Pascal). Suppose we have dened the
context sensitive syntax of this language using attribute grammars in the same manner as what we
discussed i
Homework 4
CSC 7101, Spring 2011
Due: 27 April 2011
1. Translate our operational semantics rules into Prolog clauses. Represent syntactic constructs using functors.
E.g., the if-statement could be represented as ifThenElse(B,C0,C1). Represent the three di
Homework 5
CSC 7101, Spring 2011
Due: 4 May 2011
This homework is just for practice. You dont need to hand it in.
1. Consider Dijkstras guarded conditional:
c
:=
if be
1
c
1
[] be
2
c
2
[] be
3
c
3
fi
where if and fi are keywords, be i are boolean express