LSU CSC 7101 | Practice Exams, Lecture Notes, Textbooks, Study Guides and Study Materials

hw2

LSU CSC 7101

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
hw3

LSU CSC 7101

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
hw4

LSU CSC 7101

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
hw5

LSU CSC 7101

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
hw6

LSU CSC 7101

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
p48-larson

LSU CSC 7101

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
prog1

LSU CSC 7101

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
studyguide

LSU CSC 7101

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.
syllabus

LSU CSC 7101

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
Prolog.pdf

LSU CSC 7101

Logic Programming Instead of using functions as in imperative and functional programs We use predicates as in predicate calculus Interpretation = proving theorems 1 Prolog Developed at Univ. of Aix-Marseille and Edinburgh in early to mid 1970s Goal:
midterm.pdf

LSU CSC 7101

Midterm CSC 7101, Spring 2005 3 March 2005 Read the whole exam rst (there are 6 pages) and plan your time. You have 80 minutes to complete all the questions. There are a total of 100 points. The exam is open notes but closed neighbors. Good luck! N
Types.pdf

LSU CSC 7101

Types in Programming Languages Stansifer Ch. 4 Cardelli Sec. 1 1 Types Organization of untyped values Untyped universes: bit strings, S-expr, Categorize based on usage and behavior Type = set of computational objects with uniform behavior Constra
Attribute.pdf

LSU CSC 7101

Attribute Grammars Pagan Ch. 2.1, 2.2, 2.3, 3.2 Stansifer Ch. 2.2, 2.3 Slonneger and Kurtz Ch 3.1, 3.2 1 Formal Languages Important role in the design and implementation of programming languages Alphabet: finite set of symbols String: finite sequen
ML.pdf

LSU CSC 7101

History of ML Developed at Edinburgh (early 80s) as Meta-Language for a program verification system Now a general purpose language Standard ML (1991) from ftp:/ftp.research.bell-labs.com/dist/smlnj/ Development of ML 2000 CAML from INRIA, Moby from
Denotational.pdf

LSU CSC 7101

Denotational Semantics Winskel Ch. 5 1 Denotation Semantics The most abstract of the approaches covered in this class Quite powerful, kind of heavy on the math We will only consider the basic issues for IMP Key idea: semantics as partial functions
final.pdf

LSU CSC 7101

Final Exam CSC 7101, Spring 2005 10 May 2005 Read the whole exam rst (there are 8 pages) and plan your time. You have 1 hour 50 minutes to complete all the questions. There are a total of 100 points. The exam is open notes but closed neighbors. Good
Operational.pdf

LSU CSC 7101

Operational Semantics Winskel, Ch. 2 Slonneger and Kurtz Ch 8.4, 8.5, 8.6 1 Operational vs. Axiomatic Axiomatic semantics Describes properties of program state, using first-order logic Concerned with constructing proofs for such properties Operati
syllabus.pdf

LSU CSC 7101

CSC 7101 Programming Language Structures Spring 2009 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 specic
midterm.pdf

LSU CSC 7101

Midterm CSC 7101, Spring 2005 3 March 2005 Read the whole exam rst (there are 6 pages) and plan your time. You have 80 minutes to complete all the questions. There are a total of 100 points. The exam is open notes but closed neighbors. Good luck! N
final.pdf

LSU CSC 7101

Final Exam CSC 7101, Spring 2005 10 May 2005 Read the whole exam rst (there are 8 pages) and plan your time. You have 1 hour 50 minutes to complete all the questions. There are a total of 100 points. The exam is open notes but closed neighbors. Good
p471-cardelli.pdf

LSU CSC 7101

On Understanding LUCA CARDELLI AT&T Bell Laboratories, Types, Data Abstraction, and Polymorphism Murray Hill, N. J. 07974 PETER WEGNER Department of Computer Science, Brown University, Providence, R. I. 02912 Our objective is to understand t
Cohen.pdf

LSU CSC 7101

ARTICLES DESCRIBING PROLOG BY ITS INTERPRETATION AND COMPILATION Since its conception, Prolog has followed a developmental course similar to the early evolution of LISP. Although the version of Prolog described here typifies that currently in use, i
studyguide.pdf

LSU CSC 7101

CSC 7700 Study Guide Programming Languages Fall 2007 Gerald Baumgartner Reading Slides on course web page: http:/www.csc.lsu.edu/~gb/csc7101/ . CSC 4101 textbook: Michael Scott, Programming Language Pragmatics, 2nd ed., Morgan Kaufmann Publishers,
hw1.pdf

LSU CSC 7101

Homework 1 CSC 7101, Spring 2009 Due: 9 February 2009 1. (10 pts) Given the following grammar with start symbol A : A := B C { B .i := C .s1; } { C .i := B .s + 2; } { print( C .s2); } B C := b { B .s = 2 * B .i; } 1 := D { C { C { C C 2 1 .s1
syllabus.pdf

LSU CSC 7101

CSC 7101 Programming Language Structures Spring 2009 Syllabus Gerald Baumgartner Course Summary The course listing says: Advanced study of data specification, storage management, and control in programming languages; includes coverage of formal spec
Axiomatic.pdf

LSU CSC 7101

Axiomatic Semantics Stansifer Ch 2.4, Ch. 9 Winskel Ch.6 Slonneger and Kurtz Ch. 11 1 Axiomatic Semantics Concerned w/ properties of program state Properties are described (specified) through first-order logic Axiomatic semantics is a set of rules
p38-shustek.pdf

LSU CSC 7101

V T viewpoints DOI:10.1145/1467247 .1467261 Len Shustek, Editor interview an interview with C.a.R. hoare h e C o M p U t e R h i S to R Y Museum has an active program to gather videotaped histories from people who have done pioneering work in thi
popl06-p42-leroy.pdf

LSU CSC 7101

Formal Certication of a Compiler Back-end or: Programming a Compiler with a Proof Assistant Xavier Leroy INRIA Rocquencourt Xavier.Leroy@inria.fr Abstract This paper reports on the development and formal certication (proof of semantic preservation)
hw3.pdf

LSU CSC 7101

Homework 3 CSC 7101, Spring 2009 Due: 18 March 2009 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 discus
prog1.pdf

LSU CSC 7101

Program 1: Prolog Interpreter CSC 7101, Spring 2009 Due: 3 April 2009 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, pag
hw2.pdf

LSU CSC 7101

Homework 2 CSC 7101, Spring 2009 Due: 2 March 2009 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 trip
PrologImpl.pdf

LSU CSC 7101

Prolog Implementation Prolog uses the following search Goals are solved left to right For each goal, the database is searched top to bottom 1 Example 1. 2. 3. 3 4. 5. 6. a :- b, c, d. a :- e, f. b :- f : f. e. f. a :- f. ?- a, e. 2 Tree 3 CSC
hw4.pdf

LSU CSC 7101

Homework 4 CSC 7101, Spring 2009 Due: 22 April 2009 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 thr
hw5.pdf

LSU CSC 7101

Homework 5 CSC 7101, Spring 2009 Due: 29 April 2009 This homework is just for practice. You don\'t need to hand it in. 1. Consider Dijkstra\'s guarded conditional: c := if be 1 c 1 [] be 2 c 2 [] be 3 c 3 fi where if and fi are keywords,
hw6.pdf

LSU CSC 7101

Homework 6 CSC 7101, Spring 2009 Due: 29 April 2009 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 floating point numbers, respectively. Suppose we define the subtype relationship o