FREE SHIPPING BOTH WAYS
ON EVERY ORDER!
LIST PRICE:
$65.00

Sorry, this item is currently unavailable.

Concepts of Programming Languages

ISBN: 9780805371338 | 0805371338
Edition: 3rd
Format: Hardcover
Publisher: Addison-Wesley
Pub. Date: 12/1/1995

Why Rent from Knetbooks?

Because Knetbooks knows college students. Our rental program is designed to save you time and money. Whether you need a textbook for a semester, quarter or even a summer session, we have an option for you. Simply select a rental period, enter your information and your book will be on its way!

Top 5 reasons to order all your textbooks from Knetbooks:

  • We have the lowest prices on thousands of popular textbooks
  • Free shipping both ways on ALL orders
  • Most orders ship within 48 hours
  • Need your book longer than expected? Extending your rental is simple
  • Our customer support team is always here to help
Table of Contents
CHAPTER 1 PRELIMINARIES
1(34)
1.1 Reasons for Studying Concepts of Programming Languages
2(3)
1.2 Programming Domains... MORE
5(3)
1.3 Language Evaluation Criteria
8(11)
1.4 Influences on Language Design
19(3)
1.5 Language Design Trade-offs
22(1)
1.6 Implementation Methods
23(8)
1.7 Programming Environments
31(1)
Summary
31(1)
Review Questions
32(1)
Problem Set
33(2)
CHAPTER 2 EVOLUTION OF THE MAJOR PROGRAMMING LANGUAGES
35(68)
2.1 Zuse's Plankalkul
37(2)
2.2 Minimal Hardware Programming: Pseudocodes
39(3)
2.3 The IBM 704 and FORTRAN
42(6)
2.4 Functional Programming: LISP
48(5)
2.5 The First Step Toward Sophistication: ALGOL 60
53(7)
2.6 Computerizing Business Records: COBOL
60(5)
2.7 The Beginnings of Timesharing: BASIC
65(3)
2.8 Everything for Everybody: PL/I
68(4)
2.9 Two Early Dynamic Languages: APL and SNOBOL
72(1)
2.10 The Beginnings of Data Abstraction: SIMULA 67
73(1)
2.11 Orthogonal Design: ALGOL 68
74(3)
2.12 Some Important Descendants of the ALGOLs
77(7)
2.13 Programming Based on Logic: Prolog
84(1)
2.14 History's Largest Design Effort: Ada
85(6)
2.15 Object-Oriented Programming: Smalltalk
91(4)
2.16 Combining Imperative and Object-Oriented Features: C++
95(3)
Summary
98(1)
Bibliographic Notes
98(1)
Review Questions
98(2)
Problem Set
100(3)
CHAPTER 3 DESCRIBING SYNTAX AND SEMANTICS
103(48)
3.1 Introduction
104(1)
3.2 The General Problem of Describing Syntax
105(2)
3.3 Formal Methods of Describing Syntax
107(13)
3.4 Recursive Descent Parsing
120(3)
3.5 Attribute Grammars
123(6)
3.6 Describing the Meaning of Programs: Dynamic Semantics
129(16)
Summary
145(1)
Bibliographic Notes
146(1)
Review Questions
146(1)
Problem Set
147(4)
CHAPTER 4 NAMES, BINDINGS, TYPE CHECKING, AND SCOPES
151(40)
4.1 Introduction
152(1)
4.2 Names
153(3)
4.3 Variables
156(2)
4.4 The Concept of Binding
158(8)
4.5 Type Checking
166(1)
4.6 Strong Typing
166(2)
4.7 Type Compatibility
168(3)
4.8 Scope
171(7)
4.9 Scope and Lifetime
178(1)
4.10 Referencing Environments
179(2)
4.11 Named Constants
181(2)
4.12 Variable Initialization
183(1)
Summary
184(1)
Review Questions
185(1)
Problem Set
186(5)
CHAPTER 5 DATA TYPES
191(60)
5.1 Introduction
192(1)
5.2 Primitive Data Types
193(4)
5.3 Character String Types
197(4)
5.4 User-Defined Ordinal Types
201(4)
5.5 Array Types
205(13)
5.6 Record Types
218(5)
5.7 Union Types
223(7)
5.8 Set Types
230(2)
5.9 Pointer Types
232(15)
Summary
247(1)
Bibliographic Notes
248(1)
Review Questions
248(1)
Problem Set
249(2)
CHAPTER 6 EXPRESSIONS AND THE ASSIGNMENT STATEMENT
251(28)
6.1 Introduction
252(1)
6.2 Arithmetic Expressions
253(7)
6.3 Overloaded Operators
260(2)
6.4 Type Conversions
262(3)
6.5 Relational and Boolean Expressions
265(3)
6.6 Short-Circuit Evaluation
268(2)
6.7 Assignment Statements
270(4)
6.8 Mixed-Mode Assignment
274(1)
Summary
274(1)
Review Questions
275(1)
Problem Set
275(4)
CHAPTER 7 STATEMENT-LEVEL CONTROL STRUCTURES
279(44)
7.1 Introduction
280(2)
7.2 Compound Statements
282(1)
7.3 Selection Statements
282(12)
7.4 Iterative Statements
294(15)
7.5 Unconditional Branching
309(4)
7.6 Guarded Commands
313(4)
7.7 Conclusions
317(1)
Summary
318(1)
Review Questions
318(1)
Problem Set
319(4)
CHAPTER 8 SUBPROGRAMS
323(44)
8.1 Introduction
324(1)
8.2 Fundamentals of Subprograms
325(5)
8.3 Design Issues for Subprograms
330(1)
8.4 Local Referencing Environment
331(1)
8.5 Parameter-Passing Methods
332(18)
8.6 Parameters That Are Subprogram Names
350(3)
8.7 Overloaded Subprograms
353(1)
8.8 Generic Subprograms
354(3)
8.9 Separate and Independent Compilation
357(2)
8.10 Design Issues for Functions
359(1)
8.11 Accessing Nonlocal Environments
360(3)
8.12 User-Defined Overloaded Operators
363(1)
Summary
363(1)
Review Questions
364(1)
Problem Set
365(2)
CHAPTER 9 IMPLEMENTING SUBPROGRAMS
367(38)
9.1 The General Semantics of Calls and Returns
368(1)
9.2 Implementing FORTRAN 77 Subprograms
369(3)
9.3 Implementing Subprograms in ALGOL-like Languages
372(19)
9.4 Blocks
391(2)
9.5 Implementing Dynamic Scoping
393(3)
9.6 Implementing Parameters That Are Subprogram Names
396(3)
Summary
399(1)
Bibliographic Notes
400(1)
Problem Set
401(4)
CHAPTER 10 ABSTRACT DATA TYPES
405(26)
10.1 The Concept of Abstraction
406(1)
10.2 Encapsulation
407(1)
10.3 Introduction to Data Abstraction
408(3)
10.4 Design Issues
411(1)
10.5 Language Examples
412(13)
10.6 Parameterized Abstract Data Types
425(3)
Summary
428(1)
Review Questions
428(1)
Problem Set
429(2)
CHAPTER 11 CONCURRENCY
431(42)
11.1 Introduction
432(4)
11.2 Subprogram-Level Concurrency
436(30)
11.3 Statement-Level Concurrency
466(2)
Summary
468(1)
Bibliographic Notes
469(1)
Review Questions
469(1)
Problem Set
470(3)
CHAPTER 12 EXCEPTION HANDLING
473(24)
12.1 Introduction to Exception Handling
474(6)
12.2 Exception Handling in PL/I
480(5)
12.3 Exception Handling in Ada
485(5)
12.4 Exception Handling in C++
490(4)
Summary
494(1)
Bibliographic Notes
495(1)
Review Questions
495(1)
Problem Set
495(2)
CHAPTER 13 FUNCTIONAL PROGRAMMING LANGUAGES
497(36)
13.1 Introduction
498(1)
13.2 Mathematical Functions
499(3)
13.3 Fundamentals of Functional Programming Languages
502(1)
13.4 The First Functional Programming Language: LISP
503(3)
13.5 An Introduction to Scheme
506(15)
13.6 COMMON LISP
521(2)
13.7 ML
523(1)
13.8 Miranda
524(2)
13.9 Applications of Functional Languages
526(1)
13.10 A Comparison of Functional and Imperative Languages
527(1)
Summary
528(1)
Bibliographic Notes
529(1)
Review Questions
530(1)
Problem Set
530(3)
CHAPTER 14 LOGIC PROGRAMMING LANGUAGES
533(36)
14.1 Introduction
534(1)
14.2 A Brief Introduction to Predicate Calculus
535(3)
14.3 Predicate Calculus and Proving Theorems
538(2)
14.4 An Overview of Logic Programming
540(2)
14.5 The Origins of Prolog
542(1)
14.6 The Basic Elements of Prolog
543(14)
14.7 Deficiencies of Prolog
557(5)
14.8 Applications of Logic Programming
562(3)
14.9 Conclusions
565(1)
Summary
565(1)
Bibliographic Notes
566(1)
Review Questions
566(1)
Problem Set
567(2)
CHAPTER 15 OBJECT-ORIENTED PROGRAMMING LANGUAGES
569
15.1 Introduction
570(1)
15.2 Object-Oriented Programming
571(1)
15.3 Fundamental Concepts of Smalltalk
572(2)
15.4 The Smalltalk Language
574(21)
15.5 Support for Object-Oriented Programming in C++
595(7)
15.6 Support for Object-Oriented Programming in Ada 95
602(3)
Summary
605(1)
Review Questions
605(1)
Problem Set
606

Related Products


  • Concepts of Programming Languages
    Concepts of Programming Langua...
  • Concepts of Programming Languages
    Concepts of Programming Langua...
  • Concepts of Programming Languages
    Concepts of Programming Langua...
  • Concepts of Programming Languages
    Concepts of Programming Langua...
  • Concepts of Programming Languages
    Concepts of Programming Langua...
  • Concepts of Programming Languages
    Concepts of Programming Langua...
  • Outlines and Highlights for Concepts of Programming Languages by Robert W Sebesta, Isbn : 9780136073475
    Outlines and Highlights for Co...


Please wait while this item is added to your cart...