MARC details
| 000 -LEADER |
|---|
| fixed length control field |
07868cam a22003374i 4500 |
| 001 - CONTROL NUMBER |
|---|
| control field |
17088960 |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20201222114822.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
111219s2012 maua b 001 0 eng |
| 010 ## - LIBRARY OF CONGRESS CONTROL NUMBER |
|---|
| LC control number |
2011047510 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9780131395312 (alk. paper) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
0131395319 (alk. paper) |
| 040 ## - CATALOGING SOURCE |
|---|
| Original cataloging agency |
DLC |
| Transcribing agency |
DLC |
| Modifying agency |
YDX |
| -- |
YDXCP |
| -- |
BWX |
| -- |
DLC |
| -- |
EG-NcFUE |
| Description conventions |
rda |
| 050 00 - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA76.7 |
| Item number |
.S43 2012 |
| 082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
005.13 |
| Edition number |
23 |
| Item number |
S.R.C |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Sebesta, Robert W. |
| 245 10 - TITLE STATEMENT |
|---|
| Title |
Concepts of programming languages / |
| Statement of responsibility, etc |
Robert W. Sebesta. |
| 250 ## - EDITION STATEMENT |
|---|
| Edition statement |
tenth edition. |
| 264 1# - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Place of publication, distribution, etc |
Boston : |
| Name of publisher, distributor, etc |
Pearson, |
| Date of publication, distribution, etc |
c2012. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xix, 795 pages. : |
| Other physical details |
illustration ; |
| Dimensions |
24 cm. |
| 336 ## - CONTENT TYPE |
|---|
| Source |
rdacontent |
| Content type term |
text |
| 337 ## - MEDIA TYPE |
|---|
| Source |
rdamedia |
| Media type term |
unmediated |
| 338 ## - CARRIER TYPE |
|---|
| Source |
rdacarrier |
| Carrier type term |
volume |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc |
Includes bibliographical references and index. |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Chapter 1 Preliminaries 1<br/>1.1 Reasons for Studying Concepts of Programming Languages<br/>1.2 Programming Domains<br/>1.3 Language Evaluation Criteria<br/>1.4 Influences on Language Design<br/>1.5 Language Categories<br/>1.6 Language Design Trade-Offs<br/>1.7 Implementation Methods<br/>1.8 Programming Environments<br/>Summary • Review Questions • Problem Set<br/>Chapter 2 Evolution of the Major Programming Languages 35<br/>2.1 Zuse’s Plankalkül<br/>2.2 Pseudocodes<br/>2.3 The IBM 704 and Fortran<br/>2.4 Functional Programming: LISP<br/>2.5 The First Step Toward Sophistication: ALGOL 60<br/>2.6 Computerizing Business Records: COBOL<br/>2.7 The Beginnings of Timesharing: BASIC<br/>interview: Alan Cooper–User Design and Language Design<br/>2.8 Everything for Everybody: PL/I<br/>2.9 Two Early Dynamic Languages: APL and SNOBOL<br/>2.10 The Beginnings of Data Abstraction: SIMULA 67<br/>2.11 Orthogonal Design: ALGOL 68<br/>2.12 Some Early Descendants of the ALGOLs<br/>2.13 Programming Based on Logic: Prolog<br/>2.14 History’s Largest Design Effort: Ada<br/>2.15 Object-Oriented Programming: Smalltalk<br/>2.16 Combining Imperative and Object-Oriented Features: C++<br/>2.17 An Imperative-Based Object-Oriented Language: Java<br/>2.18 Scripting Languages<br/>2.19 The Flagship .NET Language: C#<br/>2.20 Markup/Programming Hybrid Languages<br/>Summary • Bibliographic Notes • Review Questions • Problem Set • Programming Exercises<br/>Chapter 3 Describing Syntax and Semantics 113<br/>3.1 Introduction<br/>3.2 The General Problem of Describing Syntax<br/>3.3 Formal Methods of Describing Syntax<br/>3.4 Attribute Grammars<br/>History Note<br/>3.5 Describing the Meanings of Programs: Dynamic Semantics<br/>History Note<br/>Summary • Bibliographic Notes • Review Questions • Problem Set<br/>Chapter 4 Lexical and Syntax Analysis 167<br/>4.1 Introduction<br/>4.2 Lexical Analysis<br/>4.3 The Parsing Problem<br/>4.4 Recursive-Descent Parsing<br/>4.5 Bottom-Up Parsing<br/>Summary • Review Questions • Problem Set • Programming Exercises...... 197<br/>Chapter 5 Names, Bindings, and Scopes 203<br/>5.1 Introduction<br/>5.2 Names<br/>History Note<br/>5.3 Variables<br/>5.4 The Concept of Binding<br/>5.5 Scope<br/>5.6 Scope and Lifetime<br/>5.7 Referencing Environments<br/>5.8 Named Constants<br/>Summary • Review Questions • Problem Set • Programming Exercises...... 234<br/>Chapter 6 Data Types 243<br/>6.1 Introduction<br/>6.2 Primitive Data Types<br/>6.3 Character String Types<br/>History Note<br/>6.4 User-Defined Ordinal Types<br/>6.5 Array Types<br/>History Note<br/>History Note<br/>6.6 Associative Arrays<br/>interview: Roberto Ierusalimschy–Lua<br/>6.7 Record Types<br/>6.8 Tuple Types<br/>6.9 List Types<br/>6.10 Union Types<br/>6.11 Pointer and Reference Types<br/>History Note<br/>6.12 Type Checking<br/>6.13 Strong Typing<br/>6.14 Type Equivalence<br/>6.15 Theory and Data Types<br/>Summary • Bibliographic Notes • Review Questions • Problem Set • Programming Exercises<br/>Chapter 7 Expressions and Assignment Statements 317<br/>7.1 Introduction<br/>7.2 Arithmetic Expressions<br/>7.3 Overloaded Operators<br/>7.4 Type Conversions<br/>History Note<br/>7.5 Relational and Boolean Expressions<br/>History Note<br/>7.6 Short-Circuit Evaluation<br/>7.7 Assignment Statements<br/>History Note<br/>7.8 Mixed-Mode Assignment<br/>Summary • Review Questions • Problem Set • Programming Exercises<br/>Chapter 8 Statement-Level Control Structures 347<br/>8.1 Introduction<br/>8.2 Selection Statements<br/>8.3 Iterative Statements<br/>8.4 Unconditional Branching<br/>History Note<br/>8.5 Guarded Commands<br/>8.6 Conclusions<br/>Summary • Review Questions • Problem Set • Programming Exercises<br/>Chapter 9 Subprograms 387<br/>9.1 Introduction<br/>9.2 Fundamentals of Subprograms<br/>9.3 Design Issues for Subprograms<br/>9.4 Local Referencing Environments<br/>9.5 Parameter-Passing Methods<br/>History Note<br/>History Note<br/>9.6 Parameters That Are Subprograms<br/>9.7 Calling Subprograms Indirectly<br/>History Note<br/>9.8 Overloaded Subprograms<br/>9.9 Generic Subprograms<br/>9.10 Design Issues for Functions<br/>9.11 User-Defined Overloaded Operators<br/>9.12 Closures<br/>9.13 Coroutines<br/>Summary • Review Questions • Problem Set • Programming Exercises<br/>Chapter 10 Implementing Subprograms 441<br/>10.1 The General Semantics of Calls and Returns<br/>10.2 Implementing “Simple” Subprograms<br/>10.3 Implementing Subprograms with Stack-Dynamic Local Variables<br/>10.4 Nested Subprograms<br/>10.5 Blocks<br/>10.6 Implementing Dynamic Scoping<br/>Summary • Review Questions • Problem Set • Programming Exercises<br/>Chapter 11 Abstract Data Types and Encapsulation Constructs 473<br/>11.1 The Concept of Abstraction<br/>11.2 Introduction to Data Abstraction<br/>11.3 Design Issues for Abstract Data Types<br/>11.4 Language Examples<br/>interview: Bjarne Stroustrup–C++: Its Birth, Its Ubiquitousness, and Common Criticisms<br/>11.5 Parameterized Abstract Data Types<br/>11.6 Encapsulation Constructs<br/>11.7 Naming Encapsulations<br/>Summary • Review Questions • Problem Set • Programming Exercises<br/> |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
15.6 Common LISP.............................................................................. 699<br/>15.7 ML............................................................................................... 701<br/>15.8 Haskell......................................................................................... 707<br/>15.9 F#................................................................................................ 712<br/>15.10 Support for Functional Programming in Primarily Imperative Languages................................................................... 715<br/>15.11 A Comparison of Functional and Imperative Languages.................. 717<br/>Summary • Bibliographic Notes • Review Questions • Problem Set • Programming Exercises............................................................................ 720<br/>Chapter 16 Logic Programming Languages 727<br/>16.1 Introduction.................................................................................. 728<br/>16.2 A Brief Introduction to Predicate Calculus..................................... 728<br/>16.3 Predicate Calculus and Proving Theorems...................................... 732<br/>16.4 An Overview of Logic Programming............................................... 734<br/>16.5 The Origins of Prolog.................................................................... 736<br/>16.6 The Basic Elements of Prolog........................................................ 736<br/>16.7 Deficiencies of Prolog................................................................... 751<br/>16.8 Applications of Logic Programming............................................... 757<br/>Summary • Bibliographic Notes • Review Questions • Problem Set •<br/>Programming Exercises............................................................................ 758<br/>Bibliography................................................................................. 763<br/>Index............................................................................................ 773<br/> |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Programming languages (Electronic computers) |
| 856 ## - ELECTRONIC LOCATION AND ACCESS |
|---|
| Materials specified |
Abstract |
| Uniform Resource Identifier |
<a href="http://repository.fue.edu.eg/xmlui/handle/123456789/3499">http://repository.fue.edu.eg/xmlui/handle/123456789/3499</a> |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Koha item type |
Books |
| Source of classification or shelving scheme |
Dewey Decimal Classification |