Sebesta Chapter Notes

1. Preliminaries.

Reasons for Studying Concepts of Programming Languages.
Programming Domains.
Language Evaluation Criteria.
Influences on Language Design.
Language Categories.
Language Design Trade-Offs.
Implementation Methods.
Programming Environments.

2. Evolution of the Major Programming Languages.
Zuse's Plankalkül.
Minimal Hardware Programming: Pseudocodes.
The IBM 704 and FORTRAN.
Functional Programming: LISP.
The First Step Toward Sophistication: ALGOL 60.
Computerizing Business Records: COBOL.
The Beginnings of Timesharing: BASIC.
Everything for Everybody: PL/I.
Two Early Dynamic Languages: APL and SNOBOL.
The Beginnings of Data Abstraction: SIMULA 67.
Orthogonal Design: ALGOL 68.
Some Important Descendants of the ALGOLs.
Programming Based on Logic: Prolog.
History's Largest Design Effort: Ada.
Object-Oriented Programming: Smalltalk.
Combining Imperative and Object-Oriented Features: C++.
Programming the World Wide Web: Java.

3. Describing Syntax and Semantics.
Introduction.
The General Problem of Describing Syntax.
Formal Methods of Describing Syntax.
Attribute Grammars.
Describing the Meanings of Programs: Dynamic Semantics.

4. Lexical and Syntax Analysis.
Introduction.
Lexical Analysis.
The Parsing Problem.
Recursive-Descent Parsing.
Bottom-Up Parsing.

5. Names, Bindings, Type Checking, and Scopes.
Introduction.
Names.
Variables.
The Concept of Binding.
Type Checking.
Strong Typing.
Type Compatibility.
Scope.
Scope and Lifetime.
Referencing Environments.
Named Constants.
Variable Initialization.

6. Data Types.
Introduction.
Primitive Data Types.
Character String Types.
User-Defined Ordinal Types.
Array Types.
Associative Arrays.
Record Types.
Union Types.
Set Types.
Pointer Types.

7. Expressions and Assignment Statements.
Introduction.
Arithmetic Expressions.
Overloaded Operators.
Type Conversions.
Relational and Boolean Expressions.
Short-Circuit Evaluation.
Assignment Statements.
Mixed-Mode Assignment.

8. Statement-Level Control Structures.
Introduction.
Compound Statements.
Selection Statements.
Iterative Statements.
Unconditional Branching.
Guarded Commands.
Conclusions.

9. Subprograms.
Introduction.
Fundamentals of Subprograms.
Design Issues for Subprograms.
Local Referencing Environments.
Parameter-Passing Methods.
Parameters That Are Subprogram Names.
Overloaded Subprograms.
Generic Subprograms.
Separate and Independent Compilation.
Design Issues for Functions.
Accessing Nonlocal Environments.
User-Defined Overloaded Operators.
Coroutines.

10. Implementing Subprograms.
The General Semantics of Calls and Returns.
Implementing FORTRAN 77 Subprograms.
Implementing Subprograms in ALGOL-Like Languages.
Implementing Dynamic Scoping.
Implementing Parameters That Are Subprogram Names.

11. Abstract Data Types.
The Concept of Abstraction.
Encapsulation.
Introduction to Data Abstraction.
Design Issues.
Language Examples.
Parameterized Abstract Data Types.

12. Support for Object-Oriented Programming.
Introduction.
Object-Oriented Programming.
Design Issues for Object-Oriented Languages.
Overview of Smalltalk.
Introduction to the Smalltalk Language.
Smalltalk Example Programs.
Large-Scale Features of Smalltalk.
Evaluation of Smalltalk.
Support for Object-Oriented Programming in C++.
Support for Object-Oriented Programming in Java.
Support for Object-Oriented Programming in Ada 95.
Support for Object-Oriented Programming in Eiffel.
The Object Model of JavaScript.
Implementation of Object-Oriented Constructs.

13. Concurrency.
Introduction.
Introduction to Subprogram-Level Concurrency.
Semaphores.
Monitors.
Message Passing.
Concurrency in Ada 95.
Java Threads.
Statement-Level Concurrency.

14. Exception Handling.
Introduction to Exception Handling.
Exception Handling in PL/I.
Exception Handling in Ada.
Exception Handling in C++.
Exception Handling in Java.

15. Functional Programming Languages.
Introduction.
Mathematical Functions.
Fundamentals of Functional Programming Languages.
The First Functional Programming Language: LISP.
An Introduction to Scheme.
COMMON LISP.
ML.
Haskell.
Applications of Functional Languages.
A Comparison of Functional and Imperative Languages.

16. Logic Programming Languages.
Introduction.
A Brief Introduction to Predicate Calculus.
Predicate Calculus and Proving Theorems.
An Overview of Logic Programming.
The Origins of Prolog.
The Basic Elements of Prolog.
Deficiencies of Prolog.
Applications of Logic Programming.
Conclusions.