
| Dr. Robert Sebesta is an associate professor of computer science at the University of Colorado at Colorado Springs. Hereceived his Ph. D. in computer science from Pennsylvania State University. His research is in programming language design and software testing. ... .. << 查看详细 |
| chapter 1 preliminaries. 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 2.1 zuse's plankalkoi 2.2 minimal hardware programming: pseudocodes 2.3 the ibm 704 and fortran . 2.4 functional programming: lisp 2.5 the first steptoward 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: javascript, php, and python 2.19 a c-based language for the new millennium: c# 2.20 markup/programming hybrid languages summary · bibliographic notes · review questions ·problem set chapter 3 describing syntax and semantics 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 · programming exercises chapter 4 lexicai and syntax analysis 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 chapter 5 names, bindings, type checking, and scopes 5.1 introduction 5.2 names history note history note 5.3 variables history note 5.4 the concept of binding interview: rasmus lerdorf--scripting languages and other examples of slick solutions 5.5 type checking 5.6 strong typing 5.7 type compatibility history note 5.8 scope 5.9 scope and lifetime 5.10 referencing environments 5.11 named constants summary · review questions · problem set · programming exercises chapter 6 data types 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: rasmus lerdorf--the open source movement and work life 6.7 record types 6.8 union types 6.9 pointer and reference types history note summary · bibliographic notes · review questions · problem set · programming exercises chapter 7 expressions and assignment statements 7.1 introduction 7.2 arithmetic expressions history note 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 8.1 introduction 8.2 selection statements history note history note 8.3 iterative statements history note interview: larry wall--part 1: linguistics and the birth of peri 8.4 unconditional branching history note 8.5 guarded commands 8.6 conclusions summary · review questions · problem set · programming exercises chapter 9 subprograms 9.1 introduction 9.2 fundamentals of subprograms 9.3 design issues for subprograms 9.4 local referencing environments 9.5 parameter-passing methods interview: larry wall--part 2: scripting languages in general.. and peri in particular history note history note history note 9.6 parameters that are subprogram names history note 9.7 overloaded subprograms 9.8 generic subprograms 9.9 design issues for functions 9.10 user-defined overloaded operators 9.11 coroutines history note summary · review questions · problem set · programming exercises chapter 10 implementing subprograms 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 interview: niklaus wlrth--keeping it simple 10.5 blocks 10.6 implementing dynamic scoping summary · review questions · problem set chapter 11 abstract data types and encapsulation constructs 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 datatypes 11.6 encapsulation constructs 11.7 naming encapsulations summary · review questions · problem set · programming exercises chapter 12 support for object-oriented programming 12.1 introduction 12.2 object-oriented programming 12.3 design issues for object-oriented languages 12.4 support for object-oriented programming in smalltalk 12.5 support for object-oriented programming in c++ interview: bjarne stroustrup--on paradigms and better programming 12.6 support for object-oriented programming in java 12.7 support for object-oriented programming in c# 12.8 support for 0bject-oriented programming in ada 95 12.9 the object model of javascript 12.10 implementation of object-oriented constructs summary · review questions · problem set·programming exercises chapter 13 concurrency 13.1 introduction 13.2 introduction to subprogram-level concurrency 13.3 semaphores history note 13.4 monitors 13.5 message passing 13.6 ada support for concurrency 13.7 java threads 13.8 c# threads 13.9 statement-level concurrency summary · bibliographic notes · review questions · problem set · programming exercises chapter 14 exception handling and event handling 14.1 introduction to exception handling history note 14.2 exception handling in ada 14.3 exception handling in c++ 14.4 exception handling in java interview: james gosling--the birth of java 14.5 introduction to event handling 14.6 event handling with java summary · bibliographic notes · review questions · problem set chapter 15 functional programming languages 15.1 introduction 15.2 mathematical functions 15.3 fundamentals of functional programming languages 15.4 the first functional programming language: lisp 15.5 an introduction to scheme 15.6 common lisp 15.7 m l 15.8 haskell 15.9 applications of functional languages 15.10 a comparison of functional and imperative languages summary · bibliographic notes · review questions · problem set · programming exercises chapter 16 logic programming languages 16.1 introduction 16.2 a brief introduction to predicate calculus 16.3 predicate calculus and proving theorems 16.4 an overview of logic programming 16.5 the origins of prolog 16.6 the basic elements of prolog 16.7 the deficiencies of prolog 16.8 applications of logic programming summary · bibliographic notes · review questions · problem set · programming exercises bibliography index... |
商品评论(0条)