Computer Science 262
January 2017

Tentative Schedule

Week of Material Covered Remarks
January 4 Introduction and Preliminaries
Chapter 1 - Preliminaries
Reasons, Evaluation, Classifications
Chapter 2 - Evolution of Major Programming Languages
Classifications, History.
January 9 Chapter 3 - Describing Syntax and Semantics
Compilers Grammars; Chomsky Hierarchy
Context-Free Grammars, BNF
Chapter 4 - Lexical and Syntax Analysis
Syntax diagrams, Recursive Descent Parsing
Attribute Grammars, Semantics
January 16 Chapter 5 - Names, Bindings, Type Checking and Scopes
Names, Variables, Bindings
Type Checking, Scope of Bindings, Environments
January 23 Chapter 6 - Data Types
Specification and Implementation.
Primitive typesStrings.
Arrays, records, files, sets, and pointers
January 30 Chapter 16 - Logic Programming Languages
Predicate Calculus; Horn Clauses
Introduction to Prolog
Environment and SyntaxBacktracking
List and List Matching
February 6 Complete Prolog.
Chapter 15 - Functional Programming Languages
Overview; Lambda expressions
Introduction to Scheme
Scheme/LISP: language features

February 13

February 20 Islander Day and Mid-semester break. No classes

February 27 Chapter 7 - Expressions and Assignment
Arithmetic Expressions, Overloaded operators,
Relational and Boolean operators.
Chapter 8 - Statement-Level Control Structures
Compound, Selection and Iterative Statements
March 6

March 13 Student Presentations

March 20 Student Presentations
March 27 Student Presentations
April 3

Last modified:Wednesday January 25, 2017 at 03:18 am AST
Cezar Câmpeanu