Description

Features

• An examination of related topics is coupled with the fundamental concepts of programming languages:
  • Formal methods of describing the syntax and semantics of programming languages are described in Chapter 3.
  • Implementation techniques for various language constructs are discussed in chapter 4 using lexical and syntax analysis, and in chapter 10 using the implementation of subprogram linkage.
• Coverage of advanced object-oriented topics and languages like C#, Java™, JavaScript™, Perl™, PHP, XHTML, XSLT, and JSP™ is integrated throughout.
• Historical boxes and interviews with James Gosling, Larry Wall, Alan Cooper, Bjarne Stroustrup, and others set the material into context.
• Valuable historical foundations are presented in Chapter 2, outlining the origins, purposes, and contributions of the most important languages discussed in the rest of the text.
• In-depth discussions of the design issues for the primary constructs of the imperative languages are presented in Chapters 5—14. Design choices for several example languages are presented and evaluated, including variables (Chapter 5), data types (Chapter 6), expressions and assignment statements (Chapter 7), control statements (Chapter 8), subprograms (Chapters 9 and 10), data abstraction facilities (Chapter 11), object-oriented programming (Chapter 12), concurrent program units (Chapter 13), and exception and event handling (Chapter 14).
• Two alternative programming paradigms concludes coverage, functional programming in Chapter 15 and logical programming in Chapter 16.
• Each new student copy includes an access card for the Companion Website, which includes lab projects, self-assessment quizzes, and a language reference library.

New To This Edition

• Enhanced Pedagogy: 110 new review questions have been added along with 51 new programming exercises.
• Revised Coverage: Semantics coverage in Chapter 3 has been revised.
• New and Expanded Coverage:
• Chapter 4 - Includes a complete, running lexical analyzer program with actual output as well as ouput for the example recursive descent parser.  Also included is a parse tree for the given input statement.
• Chapter 5 - New material on global scope and declaration order in the scoping section (Names, Bindings, and Scopes).
• Chapter 6 - New coverage of Lua’s table types, Python’s tuples and list comprehensions, and Ruby’s slices.
• Chapter 9 - New discussions of Lua’s variable number of method parameters and variable number of return values.
• Chapter 11 - Expanded discussion of Ruby’s abstract data types.
• Chapter 15 - New section on tail recursion in Scheme.
  

Table of Contents

Chapter 1 Preliminaries 1

1.1 Reasons for Studying Concepts of Programming Languages ...............2

1.2 Programming Domains .....................................................................5

1.3 Language Evaluation Criteria ............................................................7

1.4 Influences on Language Design .......................................................19

1.5 Language Categories .......................................................................22

1.6 Language Design Trade-Offs ............................................................24

1.7 Implementation Methods ................................................................25

1.8 Programming Environments ............................................................32

Summary • Review Questions • Problem Set .............................................33

2.1 Zuse’s Plankalkül ...........................................................................38

2.2 Minimal Hardware Programming: Pseudocodes ...............................41

2.3 The IBM 704 and Fortran ..............................................................44

2.4 Functional Programming: LISP ......................................................49

2.5 The First Step Toward Sophistication: ALGOL 60 ............................54

2.6 Computerizing Business Records: COBOL ........................................60

2.7 The Beginnings of Timesharing: BASIC ............................................65

Interview: ALAN COOPER–User Design and Language Design..................68

2.8 Everything for Everybody: PL/I .......................................................70

2.9 Two Early Dynamic Languages: APL and SNOBOL .........................73

2.10 The Beginnings of Data Abstraction: SIMULA 67 ............................74

2.11 Orthogonal Design: ALGOL 68 ........................................................75

2.12 Some Early Descendants of the ALGOLs ......................................... 77

2.13 Programming Based on Logic: Prolog ............................................. 81

2.14 History’s Largest Design Effort: Ada .............................................. 83

2.15 Object-Oriented Programming: Smalltalk ........................................ 87

2.16 Combining Imperative and Object-Oriented Features: C++ ................ 90

2.17 An Imperative-Based Object-Oriented Language: Java ...................... 93

2.18 Scripting Languages ....................................................................... 97

2.19 A C-Based Language for the New Millennium: C# ......................... 103

2.20 Markup/Programming Hybrid Languages ....................................... 106

Summary • Bibliographic Notes • Review Questions • Problem Set • Programming Exercises..... 108

3.1 Introduction ................................................................................. 116

3.2 The General Problem of Describing Syntax .................................... 117

3.3 Formal Methods of Describing Syntax ........................................... 119

3.4 Attribute Grammars ..................................................................... 134

History Note......................................................................................... 135

3.5 Describing the Meanings of Programs: Dynamic Semantics ............ 141

History Note........................................................................................ 156

Summary • Bibliographic Notes • Review Questions • Problem Set ...........163

4.1 Introduction ................................................................................. 172

4.2 Lexical Analysis ........................................................................... 173

4.3 The Parsing Problem .................................................................... 182

4.4 Recursive-Descent Parsing ............................................................ 185

4.5 Bottom-Up Parsing ...................................................................... 194

Summary • Review Questions • Problem Set • Programming Exercises......202

5.1 Introduction ................................................................................. 208

5.2 Names ......................................................................................... 208

History Note.........................................................................................209

History Note.........................................................................................210

5.3 Variables ......................................................................................211

History Note.........................................................................................212

5.4 The Concept of Binding .................................................................214

Interview: RASMUS LERDORF–Scripting Languages and Other Examples of Slick Solutions .......218

5.5 Scope ...........................................................................................225

History Note.........................................................................................227

5.6 Scope and Lifetime .......................................................................234

5.7 Referencing Environments .............................................................235

5.8 Named Constants ........................................................................237

Summary • Review Questions • Problem Set • Programming Exercises ... 239

6.1 Introduction .................................................................................248

6.2 Primitive Data Types .....................................................................250

6.3 Character String Types ..................................................................254

History Note.........................................................................................255

6.4 User-Defined Ordinal Types ............................................................259

6.5 Array Types ..................................................................................263

History Note.........................................................................................264

History Note.........................................................................................267

6.6 Associative Arrays ........................................................................277

Interview: ROBERTO IERUSALIMSCHY–Lua ................................280

6.7 Record Types ................................................................................282

6.8 Union Types ..................................................................................287

6.9 Pointer and Reference Types ..........................................................291

History Note.........................................................................................294

6.10 Type Checking ..............................................................................304

6.11 Strong Typing ...............................................................................305

6.12 Type Equivalence ..........................................................................306

6.13 Theory and Data Types .................................................................. 310

Summary • Bibliographic Notes • Review Questions • Problem Set • Programming Exercises ......312

7.1 Introduction ................................................................................. 320

7.2 Arithmetic Expressions ................................................................. 321

7.3 Overloaded Operators ................................................................... 330

7.4 Type Conversions .......................................................................... 331

History Note......................................................................................... 334

7.5 Relational and Boolean Expressions .............................................. 335

History Note......................................................................................... 335

7.6 Short-Circuit Evaluation .............................................................. 337

7.7 Assignment Statements ................................................................ 339

History Note......................................................................................... 343

7.8 Mixed-Mode Assignment .............................................................. 343

Summary • Review Questions • Problem Set • Programming Exercises .... 344

8.1 Introduction ................................................................................. 350

8.2 Selection Statements .................................................................... 352

History Note......................................................................................... 352

History Note......................................................................................... 354

8.3 Iterative Statements ..................................................................... 365

History Note......................................................................................... 365

Interview: LARRY WALL–Part 1: Linguistics and the Birth of Perl ........ 370

History Note......................................................................................... 378

8.4 Unconditional Branching .............................................................. 380

8.5 Guarded Commands ..................................................................... 381

8.6 Conclusions .................................................................................. 383

Summary • Review Questions • Problem Set • Programming Exercises..... 384

9.1 Introduction .................................................................................392

9.2 Fundamentals of Subprograms ......................................................392

9.3 Design Issues for Subprograms .....................................................403

9.4 Local Referencing Environments ...................................................404

9.5 Parameter-Passing Methods .........................................................406

Interview: LARRY WALL–Part 2: Scripting Languages in General and Perl in Particular ........408

History Note.........................................................................................416

History Note.........................................................................................416

History Note.........................................................................................420

9.6 Parameters That Are Subprograms ................................................427

History Note.........................................................................................429

9.7 Overloaded Subprograms ..............................................................429

9.8 Generic Subprograms ...................................................................431

9.9 Design Issues for Functions ...........................................................438

9.10 User-Defined Overloaded Operators ...............................................439

9.11 Coroutines ....................................................................................440

History Note.........................................................................................440

Summary • Review Questions • Problem Set • Programming Exercises .....442

10.1 The General Semantics of Calls and Returns .................................450

10.2 Implementing “Simple” Subprograms ..........................................451

10.3 Implementing Subprograms with Stack-Dynamic Local Variables ...............453

10.4 Nested Subprograms ...................................................................462

Interview: NIKLAUS WIRTH–Keeping It Simple ............................464

10.5 Blocks ........................................................................................470

10.6 Implementing Dynamic Scoping ...................................................472

Summary • Review Questions • Problem Set • Programming Exercises ....475

11.1 The Concept of Abstraction ......................................................... 482

11.2 Introduction to Data Abstraction ................................................. 483

11.3 Design Issues for Abstract Data Types .......................................... 486

11.4 Language Examples .................................................................... 487

Interview: BJARNE STROUSTRUP–C++: Its Birth, Its Ubiquitousness, and Common Criticisms ....... 490

11.5 Parameterized Abstract Data Types .............................................. 504

11.6 Encapsulation Constructs ............................................................ 508

11.7 Naming Encapsulations ............................................................... 512

Summary • Review Questions • Problem Set • Programming Exercises .... 517

12.1 Introduction ................................................................................ 524

12.2 Object-Oriented Programming ...................................................... 524

12.3 Design Issues for Object-Oriented Languages ................................ 527

12.4 Support for Object-Oriented Programming in Smalltalk ................ 532

12.5 Support for Object-Oriented Programming in C++ ........................ 535

Interview: BJARNE STROUSTRUP–On Paradigms and Better Programming ........ 536

12.6 Support for Object-Oriented Programming in Java ........................ 546

12.7 Support for Object-Oriented Programming in C# .......................... 550

12.8 Support for Object-Oriented Programming in Ada 95 .................... 552

12.9 Support for Object-Oriented Programming in Ruby........................ 557

12.10 Implementation of Object-Oriented Constructs .............................. 560

Summary • Review Questions • Problem Set • Programming Exercises..... 564

13.1 Introduction ................................................................................ 570

13.2 Introduction to Subprogram-Level Concurrency ............................ 574

History Note ....................................................................................... 577

13.3 Semaphores ................................................................................ 578

13.4 Monitors .....................................................................................583

13.5 Message Passing .........................................................................585

13.6 Ada Support for Concurrency .......................................................587

13.7 Java Threads ...............................................................................598

13.8 C# Threads ..................................................................................606

13.9 Statement-Level Concurrency ......................................................608

Summary • Bibliographic Notes • Review Questions • Problem Set • Programming Exercises .....610

14.1 Introduction to Exception Handling ..............................................616

History Note........................................................................................620

14.2 Exception Handling in Ada ..........................................................622

14.3 Exception Handling in C++ ..........................................................629

14.4 Exception Handling in Java ..........................................................634

Interview: JAMES GOSLING–The Birth of Java .............................636

14.5 Introduction to Event Handling ....................................................643

14.6 Event Handling with Java ............................................................644

Summary • Bibliographic Notes • Review Questions • Problem Set • Programming Exercises ..... 650

15.1 Introduction ................................................................................656

15.2 Mathematical Functions ..............................................................657

15.3 Fundamentals of Functional Programming Languages ..................659

15.4 The First Functional Programming Language: LISP .....................661

15.5 An Introduction to Scheme ..........................................................664

15.6 COMMON LISP ..........................................................................682

15.7 ML .............................................................................................682

15.8 Haskell .......................................................................................686

15.9 Applications of Functional Languages ..........................................691

15.10 A Comparison of Functional and Imperative Languages ................692

Summary • Bibliographic Notes • Review Questions • Problem Set • Programming Exercises ....694

16.1 Introduction ................................................................................ 702

16.2 A Brief Introduction to Predicate Calculus ................................... 702

16.3 Predicate Calculus and Proving Theorems .................................... 706

16.4 An Overview of Logic Programming ............................................. 708

16.5 The Origins of Prolog .................................................................. 710

16.6 The Basic Elements of Prolog ...................................................... 711

16.7 Deficiencies of Prolog .................................................................. 725

16.8 Applications of Logic Programming ............................................ 731

Summary • Bibliographic Notes • Review Questions • Problem Set • Programming Exercises.... 733

Bibliography ...............................................................................737

Index ..........................................................................................747

Courses

Programming Languages/Comparative Languages  (Computer Science)

Previous Edition(s)

• Concepts of Programming Languages, 8/E
  Sebesta
  ©2008  |  Addison-Wesley  |  Cloth; 752 pp  |  Out of Print
  ISBN-10: 0321493621  |  ISBN-13: 9780321493620
    Brief Description  | 

  

  Now in the Eighth Edition, Concepts of Programming Languages introduces students to the main constructs of contemporary programming languages and provides the tools necessary to critically evaluate existing and future programming languages. By presenting design issues for various language constructs, examining the design choices for these constructs in some of the most common languages, and critically comparing the design alternatives, this book gives readers a solid foundation for understanding the fundamental concepts of programming languages. In addition, Sebesta strives to prepare the reader for the study of compiler design by providing an in-depth discussion of programming language structures, presenting a formal method of describing syntax, and introducing approaches to lexical and syntactic analysis.

  More Info
  

Next Edition(s)

• Concepts of Programming Languages, 10/E
  Sebesta
  ©2013  |  Addison-Wesley  |  Cloth; 816 pp  |  Instock
  ISBN-10: 0131395319  |  ISBN-13: 9780131395312
  URL:  www.pearsonhighered.com/sebesta/Suggested retail price: $122.00  Buy from myPearsonStoreNet price: $91.50  (What's this?)Brief Description  | 

  

  For undergraduate students in Computer Science and Computer Programming courses.

   

  Now in its Tenth Edition, Concepts of Programming Languages introduces students to the main constructs of contemporary programming languages and provides the tools needed to critically evaluate existing and future programming languages. Readers gain a solid foundation for understanding the fundamental concepts of programming languages through the author's presentation of design issues for various language constructs, the examination of the design choices for these constructs in some of the most common languages, and critical comparison of the design alternatives. In addition, Sebesta strives to prepare the reader for the study of compiler design by providing an in-depth discussion of programming language structures, presenting a formal method of describing syntax, and introducing approaches to lexical and syntactic analysis.

  More Info
  

• Concepts of Programming Languages, 10/E
  Sebesta
  ©2013  |  Addison-Wesley  |  Cloth; 816 pp  |  Instock
  ISBN-10: 0131395319  |  ISBN-13: 9780131395312
  URL:  www.pearsonhighered.com/sebesta/Suggested retail price: $122.00  Buy from myPearsonStoreNet price: $91.50  (What's this?)Brief Description  | 

  

  For undergraduate students in Computer Science and Computer Programming courses.

   

  Now in its Tenth Edition, Concepts of Programming Languages introduces students to the main constructs of contemporary programming languages and provides the tools needed to critically evaluate existing and future programming languages. Readers gain a solid foundation for understanding the fundamental concepts of programming languages through the author's presentation of design issues for various language constructs, the examination of the design choices for these constructs in some of the most common languages, and critical comparison of the design alternatives. In addition, Sebesta strives to prepare the reader for the study of compiler design by providing an in-depth discussion of programming language structures, presenting a formal method of describing syntax, and introducing approaches to lexical and syntactic analysis.

  More Info
  

Author Bios

Companion Website for Concepts of Programming Languages, 9/E
Sebesta
©2010  |  Addison-Wesley  |  Website  |  Live
ISBN-10: 0136079547  |  ISBN-13: 9780136079545
Online purchase price: $18.40More Info  |  Students, buy access More Info

Downloadable Instructor Resources

Show All Downloadable Files

Hide All Downloadable Files

|

Help Downloading Files

Online Powerpoint Figure Slides for Concepts of Programming Languages, 9/E
Sebesta
©2010  |  Addison-Wesley  |  On-line Supplement  |  Live
ISBN-10: 0136079180  |  ISBN-13: 9780136079187

Show Downloadable Files

Hide Downloadable Files

|

More Info

Online Power Point Lecture Slides, 9/E
Sebesta
©2010  |  Addison-Wesley  |  On-line Supplement  |  Live
ISBN-10: 0136073484  |  ISBN-13: 9780136073482

Show Downloadable Files

Hide Downloadable Files

|

More Info

Online Solutions Manual for Concepts of Programming Languages, 9/E
Sebesta
©2010  |  Addison-Wesley  |  On-line Supplement  |  Live
ISBN-10: 0136079555  |  ISBN-13: 9780136079552

Show Downloadable Files

Hide Downloadable Files

|

More Info

Back to top

Companion Website for Concepts of Programming Languages, 9/E
Sebesta
©2010  |  Addison-Wesley  |  Website  |  Live
ISBN-10: 0136079547  |  ISBN-13: 9780136079545
Online purchase price: $18.40More Info  |  Students, buy access More Info

Back to top

Companion Website for Concepts of Programming Languages, 9/E
Sebesta
©2010  |  Addison-Wesley  |  Website  |  Live
ISBN-10: 0136079547  |  ISBN-13: 9780136079545
Online purchase price: $18.40More Info  |  Students, buy access More Info

CS Support-Student Support Material
Addison-Wesley
©2008  |  Addison-Wesley  |  On-line Supplement  |  Live
ISBN-10: 0321446852  |  ISBN-13: 9780321446855
This online resource is available at no cost at http://www.aw.com/cssupport.
More Info

Companion Website for Concepts of Programming Languages, 9/E
Sebesta
©2010  |  Addison-Wesley  |  Website  |  Live
ISBN-10: 0136079547  |  ISBN-13: 9780136079545
Online purchase price: $18.40More Info  |  Students, buy access More Info

Back to top

Give your students a choice! PearsonChoices products are designed to give your students more value and flexibility by letting them choose from a variety of text and media formats to best match their learning style and their budget.

Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students, see the Packages Tab.

• Concepts of Programming Languages, CourseSmart eTextbook, 9/E
  Sebesta
  ©2010  |  Addison-Wesley  |  Electronic Book; 696 pp  |  Available
  ISBN-10: 0136076890  |  ISBN-13: 9780136076896
  Online purchase price: $49.99Brief Description  | 

  

  CourseSmart eTextbooks are a creative digital solution that offers the freedom and convenience of online, offline, and mobile access using a single platform. With a CourseSmart eTextbook, students can:

  • search the text

  • make notes online

  • print out reading assignments that incorporate lecture notes

  • bookmark important passages for later review

  • save money. As an alternative to purchasing the print textbook, students can subscribe to the same content online for a significant discount off the suggested list price of the print text.

  For more information, or to subscribe to the CourseSmart eTextbook, visit www.coursesmart.com (for customers in U.S. and Canada) or www.coursesmart.co.uk (for customers in Europe, Middle East, and Africa).

  More Info  |  Students, buy access
  

• Pearson Custom Computer Science
  Pearson
  ©2009  |  Addison-Wesley  |  On-line Supplement  |  Live
  ISBN-10: 0135075483  |  ISBN-13: 9780135075487
  This online resource is available at no cost at http://www.pearsoncustom.com/custom-library/pearson-custom-computer-science.
  Brief Description  | 

  

  Create your own customized textbook for introductory computing, Visual Basic, introduction to programming, data structures, and computer ethics using this exciting new custom publishing program.

   

  With Pearson Custom Computer Science, you can select just the chapters you need, in the sequence you want, from 27 best-selling textbooks from Pearson Education’s Prentice Hall and Addison Wesley. Using our online book-building system, you have direct control over the content and cost of your course materials. Add chapters on programming logic, Alice or Python to help introduce your students to programming. Develop your own custom text for non-majors courses with chapters on scripting languages, Alice, Python, labs, and other topics. Incorporate coverage of computer ethics topics throughout your custom book. Remove chapters you don’t cover from your favorite Java or C++ text. Or change the sequence of the presentation of objects (early or late) to suit your teaching approach.

   

  The choice is yours. Your book matches your course organization exactly, and your students pay only for the chapters you choose.
  
  Program features include:

  • You’re in full control of the cost. Custom CS texts are $8.00 + $.09/pg for black and white, $8.00 + $.14/pg for color.
  • Your custom book is sequentially paginated, with a custom index and table of contents.
  • Your cover and title page can be customized with your name, school and course information.
  • Include your own materials - up to 20% of the custom book can be your own writing or come from outside sources such as course materials, questions and syllabi. We handle all necessary permissions.
  • Free evaluation copy! Create your custom text online and request a free evaluation copy of your book in 7-10 days for black and white content, or 10-15 days for color.
  • 25-copy minimum for a new order; 10 copies for a re-order.

  Your custom book is published in 4-6 weeks (for black and white, 6-8 for color) from the time we receive your order from your bookstore. If you are including outside material, please allow 8-10 weeks.

  More Info
  

This product is a member of the following series. Click on the series name to see the full list of products in the series.

• Pearson Custom Computer Science

Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students contact your Pearson Higher Education representative.