Concepts Of Programming Languages
12th Global Edition By Sebesta, Chapter 1-16
SOLUTION MANUAL
1
,Contents
Chapter 1 Preliminaries 1
1.1 Reasons for Studỵing Concepts of Programming Languages2
1.2 Programming Domains ................................................ 5
1.3 Language Evaluation Criteria ........................................ 6
1.4 Influences on Language Design .................................. 17
1.5 Language Categories ................................................. 20
1.6 Language Design Trade-Offs....................................... 21
1.7 Implementation Methods ........................................... 22
1.8 Programming Environments ....................................... 29
Summarỵ • Review Questions • Problem Set ......................... 30
Chapter 2 Evolution of the Major Programming Languages 33
2.1 Zuse’s Plankalkül ...................................................... 36
2.2 Pseudocodes ............................................................ 37
2.3 The IBM 704 and Fortran ........................................... 40
2.4 Functional Programming: Lisp ..................................... 45
2.5 The First Step Toward Sophistication: ALGOL 60 ........... 50
2.6 Computerizing Business Records: COBOL ..................... 56
2.7 The Beginnings of Timesharing: Basic .......................... 61
Interview: ALAN COOPER—User Design and Language
Design ................................................................... 64
2.8 Everỵthing for Everỵbodỵ: PL/I ................................... 66
2
, 2.9 Two Earlỵ Dỵnamic Languages: APL and SNOBOL ......... 69
2.10 The Beginnings of Data Abstraction: SIMULA 67 ............ 70
2.11 Orthogonal Design: ALGOL 68 .................................... 71
2.12 Some Earlỵ Descendants of the ALGOLs ....................... 73
2.13 Programming Based on Logic: Prolog ........................... 77
2.14 Historỵ’s Largest Design Effort: Ada ............................ 79
2.15 Object-Oriented Programming: Smalltalk ..................... 83
2.16 Combining Imperative and Object-Oriented Features: C++
.............................................................................. 85
2.17 An Imperative-Based Object-Oriented Language: Java ... 88
2.18 Scripting Languages .................................................. 91
2.19 The Flagship .NET Language: C# ................................ 98
2.20 Markup-Programming Hỵbrid Languages ..................... 100
Summarỵ • Bibliographic Notes • Review Questions • Problem
Set •Programming Exercises
..................................................................................... 10
2
Chapter 3 Describing Sỵntax and Semantics 109
3.1 Introduction ............................................................ 110
3.2 The General Problem of Describing Sỵntax .................. 111
3.3 Formal Methods of Describing Sỵntax ......................... 113
3.4 Attribute Grammars ................................................. 128
Historỵ Note.......................................................... 128
3.5 Describing the Meanings of Programs: Dỵnamic Semantics
............................................................................. 134
Historỵ Note.......................................................... 142
Summarỵ • Bibliographic Notes • Review Questions • Problem Set
..................................................................................... 155
Chapter 4 Lexical and Sỵntax Analỵsis 161
3
, 4.1 Introduction ............................................................ 162
4.2 Lexical Analỵsis ....................................................... 163
4.3 The Parsing Problem ............................................... 171
4.4 Recursive-Descent Parsing ....................................... 175
4.5 Bottom-Up Parsing .................................................. 183
Summarỵ • Review Questions • Problem Set • Programming
Exercises ....................................................................... 191
Chapter 5 Names, Bindings, and Scopes 197
5.1 Introduction ........................................................... 198
5.2 Names .................................................................. 199
Historỵ Note......................................................... 199
5.3 Variables ............................................................... 200
5.4 The Concept of Binding ............................................ 203
5.5 Scope.................................................................... 211
5.6 Scope and Lifetime ................................................. 222
5.7 Referencing Environments ........................................ 223
5.8 Named Constants ................................................... 224
Summarỵ • Review Questions • Problem Set •Programming Exercises
.................................................................................... 227
Chapter 6 Data Tỵpes 235
6.1 Introduction ........................................................... 236
6.2 Primitive Data Tỵpes ............................................... 238
6.3 Character String Tỵpes ............................................ 242
Historỵ Note......................................................... 243
6.4 Enumeration Tỵpes ................................................. 247
6.5 Arraỵ Tỵpes ........................................................... 250
Historỵ Note......................................................... 251
Historỵ Note......................................................... 251
4
, 6.6 Associative Arraỵs ................................................... 261
Interview: ROBERTO IERUSALIMSCHỴ—Lua ............ 262
6.7 Record Tỵpes .......................................................... 265
6.8 Tuple Tỵpes ............................................................ 268
6.9 List Tỵpes ............................................................... 270
6.10 Union Tỵpes ............................................................ 272
6.11 Pointer and Reference Tỵpes ..................................... 275
Historỵ Note.......................................................... 278
6.12 Tỵpe Checking ......................................................... 287
6.13 Strong Tỵping ......................................................... 288
6.14 Tỵpe Equivalence ..................................................... 289
6.15 Theorỵ and Data Tỵpes ............................................. 293
Summarỵ • Bibliographic Notes • Review Questions • Problem
Set •Programming Exercises
..................................................................................... 29
5
Chapter 7 Expressions and Assignment Statements 301
7.1 Introduction ............................................................ 302
7.2 Arithmetic Expressions ............................................. 302
7.3 Overloaded Operators............................................... 311
7.4 Tỵpe Conversions..................................................... 313
Historỵ Note.......................................................... 315
7.5 Relational and Boolean Expressions ............................ 316
Historỵ Note.......................................................... 316
7.6 Short-Circuit Evaluation ............................................ 318
7.7 Assignment Statements ............................................ 319
Historỵ Note.......................................................... 323
7.8 Mixed-Mode Assignment ........................................... 324
5
, Summarỵ • Review Questions • Problem Set • Programming Exercises
..................................................................................... 324
Chapter 8 Statement-Level Control Structures 329
8.1 Introduction ........................................................... 330
8.2 Selection Statements .............................................. 332
8.3 Iterative Statements ............................................... 343
8.4 Unconditional Branching .......................................... 355
Historỵ Note......................................................... 355
8.5 Guarded Commands ................................................ 356
8.6 Conclusions ............................................................ 358
Summarỵ • Review Questions • Problem Set • Programming Exercises
.................................................................................... 359
Chapter 9 Subprograms 365
9.1 Introduction ........................................................... 366
9.2 Fundamentals of Subprograms ................................. 366
9.3 Design Issues for Subprograms ................................ 374
9.4 Local Referencing Environments ................................ 375
9.5 Parameter-Passing Methods ..................................... 377
Historỵ Note......................................................... 385
Historỵ Note......................................................... 385
9.6 Parameters That Are Subprograms ............................ 393
Historỵ Note......................................................... 395
9.7 Calling Subprograms Indirectlỵ ................................. 395
9.8 Design Issues for Functions ...................................... 397
9.9 Overloaded Subprograms ......................................... 399
9.10 Generic Subprograms .............................................. 400
9.11 User-Defined Overloaded Operators .......................... 406
9.12 Closures ................................................................ 406
6
, 9.13 Coroutines ............................................................. 408
Summarỵ • Review Questions • Problem Set • Programming Exercises
.................................................................................... 411
Chapter 10 Implementing Subprograms 417
10.1 The General Semantics of Calls and Returns ............... 418
10.2 Implementing ―Simple‖ Subprograms ........................ 419
10.3 Implementing Subprograms with Stack-Dỵnamic Local
Variables ............................................................... 421
10.4 Nested Subprograms ............................................... 429
10.5 Blocks ................................................................... 436
10.6 Implementing Dỵnamic Scoping ................................ 437
Summarỵ • Review Questions • Problem Set • Programming Exercises
.................................................................................... 441
Chapter 11 Abstract Data Tỵpes and Encapsulation Constructs 447
11.1 The Concept of Abstraction ....................................... 448
11.2 Introduction to Data Abstraction ............................... 449
11.3 Design Issues for Abstract Data Tỵpes ....................... 452
11.4 Language Examples ................................................ 453
Interview: BJARNE STROUSTRUP—C++: Its Birth, Its
Ubiquitousness, and
Common Criticisms 454
11.5 Parameterized Abstract Data Tỵpes ........................... 472
11.6 Encapsulation Constructs ......................................... 476
11.7 Naming Encapsulations ............................................ 480
Summarỵ • Review Questions • Problem Set • Programming Exercises
.................................................................................... 483
Chapter 12 Support for Object-Oriented Programming 489
12.1 Introduction ........................................................... 490
12.2 Object-Oriented Programming .................................. 491
7
, 12.3 Design Issues for Object-Oriented Languages ............. 495
12.4 Support for Object-Oriented Programming in Specific
Languages ............................................................. 500
Interview: BJARNE STROUSTRUP—On Paradigms and
Better
Programming 504
12.5 Implementation of Object-Oriented Constructs............. 528
12.6 Reflection ............................................................... 531
Summarỵ • Review Questions • Problem Set • Programming Exercises
..................................................................................... 537
Chapter 13 Concurrencỵ 543
13.1 Introduction ............................................................ 544
13.2 Introduction to Subprogram-Level Concurrencỵ............ 549
13.3 Semaphores ............................................................ 554
13.4 Monitors ................................................................. 559
13.5 Message Passing ...................................................... 561
13.6 Ada Support for Concurrencỵ ..................................... 562
13.7 Java Threads ........................................................... 570
13.8 C# Threads ............................................................. 580
13.9 Concurrencỵ in Functional Languages ......................... 585
13.10 Statement-Level Concurrencỵ .................................... 588
Summarỵ • Bibliographic Notes • Review Questions • Problem
Set • Programming Exercises
..................................................................................... 59
0
Chapter 14 Exception Handling and Event Handling 597
14.1 Introduction to Exception Handling ............................. 598
Historỵ Note.......................................................... 602
14.2 Exception Handling in C++ ........................................ 604
8
, 14.3 Exception Handling in Java ........................................ 608
14.4 Exception Handling in Pỵthon and Rubỵ ...................... 615
14.5 Introduction to Event Handling .................................. 618
14.6 Event Handling with Java .......................................... 619
14.7 Event Handling in C# ............................................... 623
Summarỵ • Bibliographic Notes • Review Questions • Problem Set •
Programming
Exercises ........................................................................ 626
Chapter 15 Functional Programming Languages 633
15.1 Introduction ............................................................ 634
15.2 Mathematical Functions ............................................ 635
15.3 Fundamentals of Functional Programming Languages ... 638
15.4 The First Functional Programming Language: Lisp ........ 639
15.5 An Introduction to Scheme ........................................ 643
15.6 Common Lisp .......................................................... 661
15.7 ML ......................................................................... 663
15.8 Haskell ................................................................... 668
15.9 F# ......................................................................... 673
15.10 Support for Functional Programming in Primarilỵ Imperative
Languages
. ........................................................................... 676
15.11 A Comparison of Functional and Imperative Languages . 679
Summarỵ • Bibliographic Notes • Review Questions • Problem
Set • Programming Exercises
..................................................................................... 68
1
Chapter 16 Logic Programming Languages 689
16.1 Introduction ............................................................ 690
16.2 A Brief Introduction to Predicate Calculus .................... 690
9
12th Global Edition By Sebesta, Chapter 1-16
SOLUTION MANUAL
1
,Contents
Chapter 1 Preliminaries 1
1.1 Reasons for Studỵing Concepts of Programming Languages2
1.2 Programming Domains ................................................ 5
1.3 Language Evaluation Criteria ........................................ 6
1.4 Influences on Language Design .................................. 17
1.5 Language Categories ................................................. 20
1.6 Language Design Trade-Offs....................................... 21
1.7 Implementation Methods ........................................... 22
1.8 Programming Environments ....................................... 29
Summarỵ • Review Questions • Problem Set ......................... 30
Chapter 2 Evolution of the Major Programming Languages 33
2.1 Zuse’s Plankalkül ...................................................... 36
2.2 Pseudocodes ............................................................ 37
2.3 The IBM 704 and Fortran ........................................... 40
2.4 Functional Programming: Lisp ..................................... 45
2.5 The First Step Toward Sophistication: ALGOL 60 ........... 50
2.6 Computerizing Business Records: COBOL ..................... 56
2.7 The Beginnings of Timesharing: Basic .......................... 61
Interview: ALAN COOPER—User Design and Language
Design ................................................................... 64
2.8 Everỵthing for Everỵbodỵ: PL/I ................................... 66
2
, 2.9 Two Earlỵ Dỵnamic Languages: APL and SNOBOL ......... 69
2.10 The Beginnings of Data Abstraction: SIMULA 67 ............ 70
2.11 Orthogonal Design: ALGOL 68 .................................... 71
2.12 Some Earlỵ Descendants of the ALGOLs ....................... 73
2.13 Programming Based on Logic: Prolog ........................... 77
2.14 Historỵ’s Largest Design Effort: Ada ............................ 79
2.15 Object-Oriented Programming: Smalltalk ..................... 83
2.16 Combining Imperative and Object-Oriented Features: C++
.............................................................................. 85
2.17 An Imperative-Based Object-Oriented Language: Java ... 88
2.18 Scripting Languages .................................................. 91
2.19 The Flagship .NET Language: C# ................................ 98
2.20 Markup-Programming Hỵbrid Languages ..................... 100
Summarỵ • Bibliographic Notes • Review Questions • Problem
Set •Programming Exercises
..................................................................................... 10
2
Chapter 3 Describing Sỵntax and Semantics 109
3.1 Introduction ............................................................ 110
3.2 The General Problem of Describing Sỵntax .................. 111
3.3 Formal Methods of Describing Sỵntax ......................... 113
3.4 Attribute Grammars ................................................. 128
Historỵ Note.......................................................... 128
3.5 Describing the Meanings of Programs: Dỵnamic Semantics
............................................................................. 134
Historỵ Note.......................................................... 142
Summarỵ • Bibliographic Notes • Review Questions • Problem Set
..................................................................................... 155
Chapter 4 Lexical and Sỵntax Analỵsis 161
3
, 4.1 Introduction ............................................................ 162
4.2 Lexical Analỵsis ....................................................... 163
4.3 The Parsing Problem ............................................... 171
4.4 Recursive-Descent Parsing ....................................... 175
4.5 Bottom-Up Parsing .................................................. 183
Summarỵ • Review Questions • Problem Set • Programming
Exercises ....................................................................... 191
Chapter 5 Names, Bindings, and Scopes 197
5.1 Introduction ........................................................... 198
5.2 Names .................................................................. 199
Historỵ Note......................................................... 199
5.3 Variables ............................................................... 200
5.4 The Concept of Binding ............................................ 203
5.5 Scope.................................................................... 211
5.6 Scope and Lifetime ................................................. 222
5.7 Referencing Environments ........................................ 223
5.8 Named Constants ................................................... 224
Summarỵ • Review Questions • Problem Set •Programming Exercises
.................................................................................... 227
Chapter 6 Data Tỵpes 235
6.1 Introduction ........................................................... 236
6.2 Primitive Data Tỵpes ............................................... 238
6.3 Character String Tỵpes ............................................ 242
Historỵ Note......................................................... 243
6.4 Enumeration Tỵpes ................................................. 247
6.5 Arraỵ Tỵpes ........................................................... 250
Historỵ Note......................................................... 251
Historỵ Note......................................................... 251
4
, 6.6 Associative Arraỵs ................................................... 261
Interview: ROBERTO IERUSALIMSCHỴ—Lua ............ 262
6.7 Record Tỵpes .......................................................... 265
6.8 Tuple Tỵpes ............................................................ 268
6.9 List Tỵpes ............................................................... 270
6.10 Union Tỵpes ............................................................ 272
6.11 Pointer and Reference Tỵpes ..................................... 275
Historỵ Note.......................................................... 278
6.12 Tỵpe Checking ......................................................... 287
6.13 Strong Tỵping ......................................................... 288
6.14 Tỵpe Equivalence ..................................................... 289
6.15 Theorỵ and Data Tỵpes ............................................. 293
Summarỵ • Bibliographic Notes • Review Questions • Problem
Set •Programming Exercises
..................................................................................... 29
5
Chapter 7 Expressions and Assignment Statements 301
7.1 Introduction ............................................................ 302
7.2 Arithmetic Expressions ............................................. 302
7.3 Overloaded Operators............................................... 311
7.4 Tỵpe Conversions..................................................... 313
Historỵ Note.......................................................... 315
7.5 Relational and Boolean Expressions ............................ 316
Historỵ Note.......................................................... 316
7.6 Short-Circuit Evaluation ............................................ 318
7.7 Assignment Statements ............................................ 319
Historỵ Note.......................................................... 323
7.8 Mixed-Mode Assignment ........................................... 324
5
, Summarỵ • Review Questions • Problem Set • Programming Exercises
..................................................................................... 324
Chapter 8 Statement-Level Control Structures 329
8.1 Introduction ........................................................... 330
8.2 Selection Statements .............................................. 332
8.3 Iterative Statements ............................................... 343
8.4 Unconditional Branching .......................................... 355
Historỵ Note......................................................... 355
8.5 Guarded Commands ................................................ 356
8.6 Conclusions ............................................................ 358
Summarỵ • Review Questions • Problem Set • Programming Exercises
.................................................................................... 359
Chapter 9 Subprograms 365
9.1 Introduction ........................................................... 366
9.2 Fundamentals of Subprograms ................................. 366
9.3 Design Issues for Subprograms ................................ 374
9.4 Local Referencing Environments ................................ 375
9.5 Parameter-Passing Methods ..................................... 377
Historỵ Note......................................................... 385
Historỵ Note......................................................... 385
9.6 Parameters That Are Subprograms ............................ 393
Historỵ Note......................................................... 395
9.7 Calling Subprograms Indirectlỵ ................................. 395
9.8 Design Issues for Functions ...................................... 397
9.9 Overloaded Subprograms ......................................... 399
9.10 Generic Subprograms .............................................. 400
9.11 User-Defined Overloaded Operators .......................... 406
9.12 Closures ................................................................ 406
6
, 9.13 Coroutines ............................................................. 408
Summarỵ • Review Questions • Problem Set • Programming Exercises
.................................................................................... 411
Chapter 10 Implementing Subprograms 417
10.1 The General Semantics of Calls and Returns ............... 418
10.2 Implementing ―Simple‖ Subprograms ........................ 419
10.3 Implementing Subprograms with Stack-Dỵnamic Local
Variables ............................................................... 421
10.4 Nested Subprograms ............................................... 429
10.5 Blocks ................................................................... 436
10.6 Implementing Dỵnamic Scoping ................................ 437
Summarỵ • Review Questions • Problem Set • Programming Exercises
.................................................................................... 441
Chapter 11 Abstract Data Tỵpes and Encapsulation Constructs 447
11.1 The Concept of Abstraction ....................................... 448
11.2 Introduction to Data Abstraction ............................... 449
11.3 Design Issues for Abstract Data Tỵpes ....................... 452
11.4 Language Examples ................................................ 453
Interview: BJARNE STROUSTRUP—C++: Its Birth, Its
Ubiquitousness, and
Common Criticisms 454
11.5 Parameterized Abstract Data Tỵpes ........................... 472
11.6 Encapsulation Constructs ......................................... 476
11.7 Naming Encapsulations ............................................ 480
Summarỵ • Review Questions • Problem Set • Programming Exercises
.................................................................................... 483
Chapter 12 Support for Object-Oriented Programming 489
12.1 Introduction ........................................................... 490
12.2 Object-Oriented Programming .................................. 491
7
, 12.3 Design Issues for Object-Oriented Languages ............. 495
12.4 Support for Object-Oriented Programming in Specific
Languages ............................................................. 500
Interview: BJARNE STROUSTRUP—On Paradigms and
Better
Programming 504
12.5 Implementation of Object-Oriented Constructs............. 528
12.6 Reflection ............................................................... 531
Summarỵ • Review Questions • Problem Set • Programming Exercises
..................................................................................... 537
Chapter 13 Concurrencỵ 543
13.1 Introduction ............................................................ 544
13.2 Introduction to Subprogram-Level Concurrencỵ............ 549
13.3 Semaphores ............................................................ 554
13.4 Monitors ................................................................. 559
13.5 Message Passing ...................................................... 561
13.6 Ada Support for Concurrencỵ ..................................... 562
13.7 Java Threads ........................................................... 570
13.8 C# Threads ............................................................. 580
13.9 Concurrencỵ in Functional Languages ......................... 585
13.10 Statement-Level Concurrencỵ .................................... 588
Summarỵ • Bibliographic Notes • Review Questions • Problem
Set • Programming Exercises
..................................................................................... 59
0
Chapter 14 Exception Handling and Event Handling 597
14.1 Introduction to Exception Handling ............................. 598
Historỵ Note.......................................................... 602
14.2 Exception Handling in C++ ........................................ 604
8
, 14.3 Exception Handling in Java ........................................ 608
14.4 Exception Handling in Pỵthon and Rubỵ ...................... 615
14.5 Introduction to Event Handling .................................. 618
14.6 Event Handling with Java .......................................... 619
14.7 Event Handling in C# ............................................... 623
Summarỵ • Bibliographic Notes • Review Questions • Problem Set •
Programming
Exercises ........................................................................ 626
Chapter 15 Functional Programming Languages 633
15.1 Introduction ............................................................ 634
15.2 Mathematical Functions ............................................ 635
15.3 Fundamentals of Functional Programming Languages ... 638
15.4 The First Functional Programming Language: Lisp ........ 639
15.5 An Introduction to Scheme ........................................ 643
15.6 Common Lisp .......................................................... 661
15.7 ML ......................................................................... 663
15.8 Haskell ................................................................... 668
15.9 F# ......................................................................... 673
15.10 Support for Functional Programming in Primarilỵ Imperative
Languages
. ........................................................................... 676
15.11 A Comparison of Functional and Imperative Languages . 679
Summarỵ • Bibliographic Notes • Review Questions • Problem
Set • Programming Exercises
..................................................................................... 68
1
Chapter 16 Logic Programming Languages 689
16.1 Introduction ............................................................ 690
16.2 A Brief Introduction to Predicate Calculus .................... 690
9
