Popular in Course
Popular in ComputerScienence
This 2 page Class Notes was uploaded by Vito Kilback on Wednesday September 23, 2015. The Class Notes belongs to CS360 at Drexel University taught by Staff in Fall. Since its upload, it has received 14 views. For similar materials see /class/212459/cs360-drexel-university in ComputerScienence at Drexel University.
Reviews for ProgrammingLanguageConcepts
Report this Material
What is Karma?
Karma is the currency of StudySoup.
You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!
Date Created: 09/23/15
cs360 Final Exam Review The Final Exam will be held Monday June 6m The Exam for the Tuesday Thursday section will at 330pm in Randell 326 The Exam for theMonday night will at 600pm in the same room as all previous classes The Exam will be closed books and closed notes and the Exam will be cumulative The following topics will be covered Questions from the previous exams and homework exercises are both execellent study sources Chapter 1 What is a programming language Compilation and interpretation advantages and disadvantages What is a programming language Computational Paradigms Chapter 2 History Historic languages and developers Chapter 3 Language Design Principles Question 31 in Chapter 3 give example in a language of your choice that promote or violate design principles Questions 34 35 318 Chapter 4 Syntax Lexical structure of programming languages Contextfree grammars Parse trees and ASTs Ambiguity Parsing Techniques and tools Lexics vs syntax vs semantics Questions 44 45 414 419422 Chapter 5 Semantics Attributes binding Declarations block and scope Dynamic versus static The Symbol table Allocation lifetime and the environment Aliases dangling references and garbage Chapter 6 Data Types Topics to focus on Type Equivalence Type Checking Type Conversion Type Inference the books uses the term Polymorphic Type Checking Dynamic versus Static Type Checking What is a type You need to know the HindleyMilner Type Inference Algorithm Exercises from the end of Chapter 6 are good to go over as well as the homework 3 Chapter 7 and 8 Exception Handling 75 Exception Handling and Environments 86 Activation records Procedure environments activations and allocation You should be able to illustrate an exception being propagated up the runtime call stack and indicate the method that catches an exception and where execution in the program source resumes Exercises at the end of 7 and 8 corresponding the exceptions are good to go over Chapter 10 Object oriented programming Inheritance Encapsulation polymorphism Dynamic binding Vtables and implementation issues of multiple inheritance Constant pool table in Java Static versus dynamic resolution Chapter 11 Functional Programming Programs as functions Functional programming in an imperative language Scheme List functions high order functions Lambda calculus Questions 111 115 1114 Term Project You need to understand scanner and parser implementation and execution In addition CFGs ASTs and implementation of ASTs might be covered The final part of the course project namely the interpreter and how to interpret the semantics into executable code will be covered Any terminology from the course is fair game
Are you sure you want to buy this material for
You're already Subscribed!
Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'