Concepts of programming languages / Robert W. Sebesta.

Includes bibliographical references and index.

Chapter 1 Preliminaries 1
1.1 Reasons for Studying Concepts of Programming Languages
1.2 Programming Domains
1.3 Language Evaluation Criteria
1.4 Influences on Language Design
1.5 Language Categories
1.6 Language Design Trade-Offs
1.7 Implementation Methods
1.8 Programming Environments
Summary • Review Questions • Problem Set
Chapter 2 Evolution of the Major Programming Languages 35
2.1 Zuse’s Plankalkül
2.2 Pseudocodes
2.3 The IBM 704 and Fortran
2.4 Functional Programming: LISP
2.5 The First Step Toward Sophistication: ALGOL 60
2.6 Computerizing Business Records: COBOL
2.7 The Beginnings of Timesharing: BASIC
interview: Alan Cooper–User Design and Language Design
2.8 Everything for Everybody: PL/I
2.9 Two Early Dynamic Languages: APL and SNOBOL
2.10 The Beginnings of Data Abstraction: SIMULA 67
2.11 Orthogonal Design: ALGOL 68
2.12 Some Early Descendants of the ALGOLs
2.13 Programming Based on Logic: Prolog
2.14 History’s Largest Design Effort: Ada
2.15 Object-Oriented Programming: Smalltalk
2.16 Combining Imperative and Object-Oriented Features: C++
2.17 An Imperative-Based Object-Oriented Language: Java
2.18 Scripting Languages
2.19 The Flagship .NET Language: C#
2.20 Markup/Programming Hybrid Languages
Summary • Bibliographic Notes • Review Questions • Problem Set • Programming Exercises
Chapter 3 Describing Syntax and Semantics 113
3.1 Introduction
3.2 The General Problem of Describing Syntax
3.3 Formal Methods of Describing Syntax
3.4 Attribute Grammars
History Note
3.5 Describing the Meanings of Programs: Dynamic Semantics
History Note
Summary • Bibliographic Notes • Review Questions • Problem Set
Chapter 4 Lexical and Syntax Analysis 167
4.1 Introduction
4.2 Lexical Analysis
4.3 The Parsing Problem
4.4 Recursive-Descent Parsing
4.5 Bottom-Up Parsing
Summary • Review Questions • Problem Set • Programming Exercises...... 197
Chapter 5 Names, Bindings, and Scopes 203
5.1 Introduction
5.2 Names
History Note
5.3 Variables
5.4 The Concept of Binding
5.5 Scope
5.6 Scope and Lifetime
5.7 Referencing Environments
5.8 Named Constants
Summary • Review Questions • Problem Set • Programming Exercises...... 234
Chapter 6 Data Types 243
6.1 Introduction
6.2 Primitive Data Types
6.3 Character String Types
History Note
6.4 User-Defined Ordinal Types
6.5 Array Types
History Note
History Note
6.6 Associative Arrays
interview: Roberto Ierusalimschy–Lua
6.7 Record Types
6.8 Tuple Types
6.9 List Types
6.10 Union Types
6.11 Pointer and Reference Types
History Note
6.12 Type Checking
6.13 Strong Typing
6.14 Type Equivalence
6.15 Theory and Data Types
Summary • Bibliographic Notes • Review Questions • Problem Set • Programming Exercises
Chapter 7 Expressions and Assignment Statements 317
7.1 Introduction
7.2 Arithmetic Expressions
7.3 Overloaded Operators
7.4 Type Conversions
History Note
7.5 Relational and Boolean Expressions
History Note
7.6 Short-Circuit Evaluation
7.7 Assignment Statements
History Note
7.8 Mixed-Mode Assignment
Summary • Review Questions • Problem Set • Programming Exercises
Chapter 8 Statement-Level Control Structures 347
8.1 Introduction
8.2 Selection Statements
8.3 Iterative Statements
8.4 Unconditional Branching
History Note
8.5 Guarded Commands
8.6 Conclusions
Summary • Review Questions • Problem Set • Programming Exercises
Chapter 9 Subprograms 387
9.1 Introduction
9.2 Fundamentals of Subprograms
9.3 Design Issues for Subprograms
9.4 Local Referencing Environments
9.5 Parameter-Passing Methods
History Note
History Note
9.6 Parameters That Are Subprograms
9.7 Calling Subprograms Indirectly
History Note
9.8 Overloaded Subprograms
9.9 Generic Subprograms
9.10 Design Issues for Functions
9.11 User-Defined Overloaded Operators
9.12 Closures
9.13 Coroutines
Summary • Review Questions • Problem Set • Programming Exercises
Chapter 10 Implementing Subprograms 441
10.1 The General Semantics of Calls and Returns
10.2 Implementing “Simple” Subprograms
10.3 Implementing Subprograms with Stack-Dynamic Local Variables
10.4 Nested Subprograms
10.5 Blocks
10.6 Implementing Dynamic Scoping
Summary • Review Questions • Problem Set • Programming Exercises
Chapter 11 Abstract Data Types and Encapsulation Constructs 473
11.1 The Concept of Abstraction
11.2 Introduction to Data Abstraction
11.3 Design Issues for Abstract Data Types
11.4 Language Examples
interview: Bjarne Stroustrup–C++: Its Birth, Its Ubiquitousness, and Common Criticisms
11.5 Parameterized Abstract Data Types
11.6 Encapsulation Constructs
11.7 Naming Encapsulations
Summary • Review Questions • Problem Set • Programming Exercises

15.6 Common LISP.............................................................................. 699
15.7 ML............................................................................................... 701
15.8 Haskell......................................................................................... 707
15.9 F#................................................................................................ 712
15.10 Support for Functional Programming in Primarily Imperative Languages................................................................... 715
15.11 A Comparison of Functional and Imperative Languages.................. 717
Summary • Bibliographic Notes • Review Questions • Problem Set • Programming Exercises............................................................................ 720
Chapter 16 Logic Programming Languages 727
16.1 Introduction.................................................................................. 728
16.2 A Brief Introduction to Predicate Calculus..................................... 728
16.3 Predicate Calculus and Proving Theorems...................................... 732
16.4 An Overview of Logic Programming............................................... 734
16.5 The Origins of Prolog.................................................................... 736
16.6 The Basic Elements of Prolog........................................................ 736
16.7 Deficiencies of Prolog................................................................... 751
16.8 Applications of Logic Programming............................................... 757
Summary • Bibliographic Notes • Review Questions • Problem Set •
Programming Exercises............................................................................ 758
Bibliography................................................................................. 763
Index............................................................................................ 773