Programming language pragmatics:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam : Boston ; Heidelberg ; [und 9 andere]
Elsevier , Morgan Kaufmann Publlishers
[2009]
|
| Ausgabe: | 3. ed. |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | CD enthält: "...advanced/optional topics and the complete text of chapter 5, Target Machine Architecture, and chapter 16, Code Improvement." - Hier auch später erschienene, unveränderte Nachdrucke. - Nachdrucke ohne die CD-ROM-Beilage erschienen; der Inhalt der CD-ROM ist unter folgender Adresse verfügbar: http://www.elsevierdirect.com/9780123745149 |
| Beschreibung: | XXX, 910 Seiten Diagramme CD-ROM (12 cm) |
| ISBN: | 9780123750327 9780123745149 0123745144 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV035408061 | ||
| 003 | DE-604 | ||
| 005 | 20160115 | ||
| 007 | t | ||
| 008 | 090402s2009 |||| |||| 00||| eng d | ||
| 020 | |a 9780123750327 |c CDROM |9 978-0-12-375032-7 | ||
| 020 | |a 9780123745149 |9 978-0-12-374514-9 | ||
| 020 | |a 0123745144 |9 0-12-374514-4 | ||
| 035 | |a (OCoLC)310154527 | ||
| 035 | |a (DE-599)BSZ290857767 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-92 |a DE-824 |a DE-83 |a DE-861 |a DE-188 |a DE-11 |a DE-863 |a DE-473 | ||
| 050 | 0 | |a QA76.7 | |
| 082 | 0 | |a 005.13 |2 22 | |
| 084 | |a ST 240 |0 (DE-625)143625: |2 rvk | ||
| 084 | |a ST 250 |0 (DE-625)143626: |2 rvk | ||
| 100 | 1 | |a Scott, Michael Lee |d 1959- |e Verfasser |0 (DE-588)131591398 |4 aut | |
| 245 | 1 | 0 | |a Programming language pragmatics |c Michael L. Scott |
| 250 | |a 3. ed. | ||
| 264 | 1 | |a Amsterdam : Boston ; Heidelberg ; [und 9 andere] |b Elsevier , Morgan Kaufmann Publlishers |c [2009] | |
| 300 | |a XXX, 910 Seiten |b Diagramme |e CD-ROM (12 cm) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a CD enthält: "...advanced/optional topics and the complete text of chapter 5, Target Machine Architecture, and chapter 16, Code Improvement." - Hier auch später erschienene, unveränderte Nachdrucke. - Nachdrucke ohne die CD-ROM-Beilage erschienen; der Inhalt der CD-ROM ist unter folgender Adresse verfügbar: http://www.elsevierdirect.com/9780123745149 | ||
| 650 | 4 | |a Programming languages (Electronic computers) | |
| 650 | 0 | 7 | |a Programmiersprache |0 (DE-588)4047409-4 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4123623-3 |a Lehrbuch |2 gnd-content | |
| 689 | 0 | 0 | |a Programmiersprache |0 (DE-588)4047409-4 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017328605&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-017328605 | ||
Datensatz im Suchindex
| DE-BY-863_location | 1340 1000 |
|---|---|
| DE-BY-FWS_call_number | 1340/ST 240 S428(3)st 1000/ST 240 S428(3)st |
| DE-BY-FWS_katkey | 445059 |
| DE-BY-FWS_media_number | 083101251051 083101254112 |
| _version_ | 1824553863955349504 |
| adam_text | Titel: Programming language pragmatics
Autor: Scott, Michael L.
Jahr: 2009
Contents
Foreword xxi
Preface xxiii
FOUNDATIONS 3
1 Introduction 5
I. I The Art of Language Design 7
1.2 The Programming Language Spectrum 10
1.3 Why Study Programming Languages? 14
1.4 Compilation and Interpretation 16
1.5 Programming Environments 24
1.6 An Overview of Compilation 25
1.6.1 Lexical and Syntax Analysis 27
1.6.2 Semantic Analysis and Intermediate Code Generation 29
1.6.3 Target Code Generation 33
1.6.4 Code Improvement 33
1.7 Summary and Concluding Remarks 35
1.8 Exercises 36
1.9 Explorations 37
1.10 Bibliographic Notes 39
2 Programming Language Syntax 41
2.1 Specifying Syntax: Regular Expressions and Context-Free Grammars 42
2.1.1 Tokens and Regular Expressions 43
2.1.2 Context-Free Grammars 46
2.1.3 Derivations and Parse Trees 48
2.2 Scanning 51
2.2.1 Generating a Finite Automaton 55
2.2.2 Scanner Code 60
2.2.3 Table-Driven Scanning 63
2.2.4 Lexical Errors 63
2.2.5 Pragmas 65
2.3 Parsing 67
2.3.1 Recursive Descent 70
2.3.2 Table-Driven Top-Down Parsing 76
2.3.3 Bottom-Up Parsing 87
2.3.4 Syntax Errors ©I -99
2.4 Theoretical Foundations ©13 • 100
2.4.1 Finite Automata © 3
2.4.2 Push-Down Automata ©18
2.4.3 Grammar and Language Classes © 19
2.5 Summary and Concluding Remarks 101
2.6 Exercises 102
2.7 Explorations 108
2.8 Bibliographic Notes 109
3 Names, Scopes, and Bindings 111
3.1 The Notion of Binding Time 112
3.2 Object Lifetime and Storage Management 114
3.2.1 Static Allocation 115
3.2.2 Stack-Based Allocation 117
3.2.3 Heap-Based Allocation 118
3.2.4 Garbage Collection 120
3.3 Scope Rules 121
3.3.1 Static Scoping 123
3.3.2 Nested Subroutines 124
3.3.3 Declaration Order 127
3.3.4 Modules 132
3.3.5 Module Types and Classes 136
3.3.6 Dynamic Scoping 139
3.4 Implementing Scope ©29 • 143
3.4.1 Symbol Tables ©29
3.4.2 Association Lists and Central Reference Tables ©33
3.5 The Meaning of Names within a Scope 144
3.5.1 Aliases 144
3.5.2 Overloading 146
3.5.3 Polymorphism and Related Concepts 148
3.6 The Binding of Referencing Environments 151
3.6.1 Subroutine Closures 153
3.6.2 First-Class Values and Unlimited Extent 154
3.6.3 Object Closures 157
3.7 Macro Expansion 159
3.8 Separate Compilation ©39 • 161
3.8.1 Separate Compilation in C ©40
3.8.2 Packages and Automatic Header Inference ©42
3.8.3 Module Hierarchies ©43
3.9 Summary and Concluding Remarks 162
3.10 Exercises 163
3.11 Explorations 171
3.12 Bibliographic Notes 172
4 Semantic Analysis 175
4.1 The Role of the Semantic Analyzer 176
4.2 Attribute Grammars 180
4.3 Evaluating Attributes 182
4.4 Action Routines 191
4.5 Space Management for Attributes ©49 • 196
4.5.1 Bottom-Up Evaluation ©49
4.5.2 Top-Down Evaluation ©54
4.6 Decorating a Syntax Tree 197
4.7 Summary and Concluding Remarks 204
4.8 Exercises 205
4.9 Explorations 209
4.10 Bibliographic Notes 210
5 Target Machine Architecture ©65 • 213
5.1 The Memory Hierarchy ©66
5.2 Data Representation ©68
5.2.1 Integer Arithmetic ©69
5.2.2 Floating-Point Arithmetic ©72
5.3 Instruction Set Architecture ©75
5.3.1 Addressing Modes ©75
5.3.2 Conditions and Branches ©76
5.4 Architecture and Implementation ©78
5.4.1 Microprogramming ©79
5.4.2 Microprocessors ©80
5.4.3 RISC ©81
5.4.4 Multithreading and Multicore ©82
5.4.5 Two Example Architectures: The x86 and MIPS ©84
5.5 Compiling for Modern Processors ©91
5.5.1 Keeping the Pipeline Full ©91
5.5.2 Register Allocation ©96
5.6 Summary and Concluding Remarks ©101
5.7 Exercises ©103
5.8 Explorations ©107
5.9 Bibliographic Notes © 109
CORE ISSUES IN LANGUAGE DESIGN 217
6 Control Flow 219
6.1 Expression Evaluation 220
6.1.1 Precedence and Associativity 222
6.1.2 Assignments 224
6.1.3 Initialization 233
6.1.4 Ordering within Expressions 235
6.1.5 Short-Circuit Evaluation 238
6.2 Structured and Unstructured Flow 241
6.2.1 Structured Alternatives to goto 242
6.2.2 Continuations 245
6.3 Sequencing 246
6.4 Selection 247
6.4.1 Short-Circuited Conditions 248
6.4.2 Case/Switch Statements 251
6.5 Iteration 256
6.5.1 Enumeration-Controlled Loops 256
6.5.2 Combination Loops 261
6.5.3 Iterators 262
6.5.4 Generators in Icon ©III * 268
6.5.5 Logically Controlled Loops 268
6.6 Recursion 270
6.6.1 Iteration and Recursion 271
6.6.2 Applicative- and Normal-Order Evaluation 275
6.7 Nondeterminacy ©115 • 277
6.8 Summary and Concluding Remarks 278
6.9 Exercises 279
6.10 Explorations 285
6.1 I Bibliographic Notes 287
7 Data Types 289
7.1 Type Systems 290
7.1.1 Type Checking 291
7.1.2 Polymorphism 291
7.1.3 The Meaning of Type 293
7.1.4 Classification of Types 294
7.1.5 Orthogonality 301
7.2 Type Checking 303
7.2.1 Type Equivalence 303
7.2.2 Type Compatibility 310
7.2.3 Type Inference 314
7.2.4 The ML Type System ©125 • 316
7.3 Records (Structures) and Variants (Unions) 317
7.3.1 Syntax and Operations 318
7.3.2 Memory Layout and Its Impact 319
7.3.3 With Statements f) 135 • 323
7.3.4 Variant Records (Unions) ©139 • 324
7.4 Arrays 325
7.4.1 Syntax and Operations 326
7.4.2 Dimensions, Bounds, and Allocation 330
7.4.3 Memory Layout 335
7.5 Strings 342
7.6 Sets 344
7.7 Pointers and Recursive Types 345
7.7.1 Syntax and Operations 346
7.7.2 Dangling References ©149 • 356
7.7.3 Garbage Collection 357
7.8 Lists 364
7.9 Files and Input/Output ©153 • 367
7.9.1 Interactive I/O ©153
7.9.2 File-Based I/O ©154
7.9.3 Text I/O ©156
7.10 Equality Testing and Assignment 368
7.11 Summary and Concluding Remarks 371
7.12 Exercises 373
7.13 Explorations 379
7.14 Bibliographic Notes 380
8 Subroutines and Control Abstraction 383
8.1 Review of Stack Layout 384
8.2 Calling Sequences 386
8.2.1 Displays ©169 • 389
8.2.2 Case Studies: C on the MIPS; Pascal on the x86 © 173 • 389
8.2.3 Register Windows ©181 • 390
8.2.4 In-Line Expansion 391
8.3 Parameter Passing 393
8.3.1 Parameter Modes 394
8.3.2 Call-by-Name ©185 • 402
8.3.3 Special-Purpose Parameters 403
8.3.4 Function Returns 408
8.4 Generic Subroutines and Modules 410
8.4.1 Implementation Options 412
8.4.2 Generic Parameter Constraints 414
8.4.3 Implicit Instantiation 416
8.4.4 Generics in C++, Java, and C# ©189 • 417
8.5 Exception Handling 418
8.5.1 Defining Exceptions 421
8.5.2 Exception Propagation 423
8.5.3 Implementation of Exceptions 425
8.6 Coroutines 428
8.6.1 Stack Allocation 430
8.6.2 Transfer 432
8.6.3 Implementation of Iterators ©201 • 433
8.6.4 Discrete Event Simulation ©205 • 433
8.7 Events 434
8.7.1 Sequential Handlers 434
8.7.2 Thread-Based Handlers 436
8.8 Summary and Concluding Remarks 438
8.9 Exercises 439
8.10 Explorations 446
8.1 I Bibliographic Notes 447
9 Data Abstraction and Object Orientation 449
9.1 Object-Oriented Programming 451
9.2 Encapsulation and Inheritance 460
9.2.1 Modules 460
9.2.2 Classes 463
9.2.3 Nesting (Inner Classes) 465
9.2.4 Type Extensions 466
9.2.5 Extending without Inheritance 468
9.3 Initialization and Finalization 469
9.3.1 Choosing a Constructor 470
9.3.2 References and Values 472
9.3.3 Execution Order 475
9.3.4 Garbage Collection 477
9.4 Dynamic Method Binding 478
9.4.1 Virtual and Nonvirtual Methods 480
9.4.2 Abstract Classes 482
9.4.3 Member Lookup 482
9.4.4 Polymorphism 486
9.4.5 Object Closures 489
9.5 Multiple Inheritance ©215 • 491
9.5.1 Semantic Ambiguities ©217
9.5.2 Replicated Inheritance ©220
9.5.3 Shared Inheritance ©222
9.5.4 Mix-ln Inheritance ©223
9.6 Object-Oriented Programming Revisited 492
9.6.1 The Object Model of Smalltalk ©227 • 493
9.7 Summary and Concluding Remarks 494
9.8 Exercises 495
9.9 Explorations 498
9.10 Bibliographic Notes 499
ALTERNATIVE PROGRAMMING MODELS 503
10 Functional Languages 505
10.1 Historical Origins 506
10.2 Functional Programming Concepts 507
10.3 A Review/Overview of Scheme 509
10.3.1 Bindings 512
10.3.2 Lists and Numbers 513
10.3.3 Equality Testing and Searching 514
10.3.4 Control Flow and Assignment 515
10.3.5 Programs as Lists 517
10.3.6 Extended Example: DFA Simulation 519
10.4 Evaluation Order Revisited 521
10.4.1 Strictness and Lazy Evaluation 523
10.4.2 I/O: Streams and Monads 525
10.5 Higher-Order Functions 530
10.6 Theoretical Foundations ©237 • 534
10.6.1 Lambda Calculus ©239
10.6.2 Control Flow ©242
10.6.3 Structures ©244
10.7 Functional Programming in Perspective 534
10.8 Summary and Concluding Remarks 537
10.9 Exercises 538
10.10 Explorations 542
10.1 I Bibliographic Notes 543
11 Logic Languages 545
11.1 Logic Programming Concepts 546
11.2 Prolog 547
I 1.2.1 Resolution and Unification 549
I 1.2.2 Lists 550
I 1.2.3 Arithmetic 551
I 1.2.4 Search/Execution Order 552
I 1.2.5 Extended Example: Tic-Tac-Toe 554
I 1.2.6 Imperative Control Flow 557
I 1.2.7 Database Manipulation 561
11.3 Theoretical Foundations ©253 • 566
I 1.3.1 Clausal Form ©254
I 1.3.2 Limitations ©255
11.3.3 Skolemization ©257
11.4 Logic Programming in Perspective 566
I 1.4.1 Parts of Logic Not Covered 566
I 1.4.2 Execution Order 567
11.4.3 Negation and the Closed World Assumption 568
11.5 Summary and Concluding Remarks 570
11.6 Exercises 571
I 1.7 Explorations 573
11.8 Bibliographic Notes 573
12 Concurrency 575
12.1 Background and Motivation 576
12.1.1 The Case for Multithreaded Programs 579
12.1.2 Multiprocessor Architecture 581
12.2 Concurrent Programming Fundamentals 586
12.2.1 Communication and Synchronization 587
12.2.2 Languages and Libraries 588
12.2.3 Thread Creation Syntax 589
12.2.4 Implementation of Threads 598
12.3 Implementing Synchronization 603
12.3.1 Busy-Wait Synchronization 604
12.3.2 Nonblocking Algorithms 607
12.3.3 Memory Consistency Models 610
12.3.4 Scheduler Implementation 613
12.3.5 Semaphores 617
12.4 Language-Level Mechanisms 619
12.4.1 Monitors 619
12.4.2 Conditional Critical Regions 624
12.4.3 Synchronization in Java 626
12.4.4 Transactional Memory 629
12.4.5 Implicit Synchronization 633
12.5 Message Passing ©263 • 637
12.5.1 Naming Communication Partners ©263
12.5.2 Sending ©267
12.5.3 Receiving ©272
12.5.4 Remote Procedure Call ©278
12.6 Summary and Concluding Remarks 638
12.7 Exercises 640
12.8 Explorations 645
12.9 Bibliographic Notes 647
13 Scripting Languages 649
13.1 What Is a Scripting Language? 650
13.1.1 Common Characteristics 652
13.2 Problem Domains 655
13.2.1 Shell (Command) Languages 655
13.2.2 Text Processing and Report Generation 663
13.2.3 Mathematics and Statistics 667
13.2.4 Glue Languages and General-Purpose Scripting 668
13.2.5 Extension Languages 676
13.3 Scripting the World Wide Web 680
13.3.1 CGi Scripts 680
13.3.2 Embedded Server-Side Scripts 681
13.3.3 Client-Side Scripts 686
13.3.4 Java Applets 686
13.3.5 XSLT ©287 • 689
13.4 Innovative Features 691
13.4.1 Names and Scopes 691
13.4.2 String and Pattern Manipulation 696
13.4.3 Data Types 704
13.4.4 Object Orientation 710
13.5 Summary and Concluding Remarks 717
13.6 Exercises 718
13.7 Explorations 723
13.8 Bibliographic Notes 724
A CLOSER LOOK AT IMPLEMENTATION 727
14 Building a Runnable Program 729
14.1 Back-End Compiler Structure 729
14.1.1 A Plausible Set of Phases 730
14.1.2 Phases and Passes 734
14.2 Intermediate Forms ©303 • 734
14.2.1 Diana ©303
14.2.2 The gcc IFs ©306
14.2.3 Stack-Based Intermediate Forms 736
14.3 Code Generation 738
14.3.1 An Attribute Grammar Example 738
14.3.2 Register Allocation 741
14.4 Address Space Organization 744
14.5 Assembly 746
14.5.1 Emitting Instructions 748
14.5.2 Assigning Addresses to Names 749
14.6 Linking 750
14.6.1 Relocation and Name Resolution 751
14.6.2 Type Checking 751
14.7 Dynamic Linking ©311 • 754
14.7.1 Position-Independent Code © 312
14.7.2 Fully Dynamic (Lazy) Linking ©313
14.8 Summary and Concluding Remarks 755
14.9 Exercises 756
14.10 Explorations 758
14.11 Bibliographic Notes 759
15 Run-time Program Management 761
15.1 Virtual Machines 764
15.1.1 The Java Virtual Machine 766
15.1.2 The Common Language Infrastructure 775
15.2 Late Binding of Machine Code 784
15.2.1 Just-in-Time and Dynamic Compilation 785
15.2.2 Binary Translation 791
15.2.3 Binary Rewriting 795
15.2.4 Mobile Code and Sandboxing 797
15.3 Inspection/Introspection 799
15.3.1 Reflection 799
15.3.2 Symbolic Debugging 806
15.3.3 Performance Analysis 809
15.4 Summary and Concluding Remarks 811
15.5 Exercises 812
15.6 Explorations 815
15.7 Bibliographic Notes 816
16 Code Improvement ©321 • 817
16.1 Phases of Code Improvement © 323
16.2 Peephole Optimization ©325
16.3 Redundancy Elimination in Basic Blocks ©328
16.3.1 A Running Example ©328
16.3.2 Value Numbering © 331
16.4 Global Redundancy and Data Flow Analysis ©336
16.4.1 SSA Form and Global Value Numbering © 336
16.4.2 Global Common Subexpression Elimination ©339
16.5 Loop Improvement I ©346
16.5.1 Loop Invariants ©347
16.5.2 Induction Variables ©348
16.6 Instruction Scheduling ©351
16.7 Loop Improvement II ©355
16.7.1 Loop Unrolling and Software Pipelining ©355
i 6.7.2 Loop Reordering ©359
16.8 Register Allocation ©366
16.9 Summary and Concluding Remarks ©370
16.10 Bibliographic Notes © 377
A Programming Languages Mentioned 819
B Language Design and Language Implementation 831
C Numbered Examples 835
Bibliography 849
Index 867
|
| any_adam_object | 1 |
| author | Scott, Michael Lee 1959- |
| author_GND | (DE-588)131591398 |
| author_facet | Scott, Michael Lee 1959- |
| author_role | aut |
| author_sort | Scott, Michael Lee 1959- |
| author_variant | m l s ml mls |
| building | Verbundindex |
| bvnumber | BV035408061 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.7 |
| callnumber-search | QA76.7 |
| callnumber-sort | QA 276.7 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 240 ST 250 |
| ctrlnum | (OCoLC)310154527 (DE-599)BSZ290857767 |
| dewey-full | 005.13 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.13 |
| dewey-search | 005.13 |
| dewey-sort | 15.13 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| edition | 3. ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02017nam a2200421 c 4500</leader><controlfield tag="001">BV035408061</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20160115 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090402s2009 |||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780123750327</subfield><subfield code="c">CDROM</subfield><subfield code="9">978-0-12-375032-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780123745149</subfield><subfield code="9">978-0-12-374514-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0123745144</subfield><subfield code="9">0-12-374514-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)310154527</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BSZ290857767</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-92</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-861</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-863</subfield><subfield code="a">DE-473</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.7</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.13</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 240</subfield><subfield code="0">(DE-625)143625:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 250</subfield><subfield code="0">(DE-625)143626:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Scott, Michael Lee</subfield><subfield code="d">1959-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)131591398</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Programming language pragmatics</subfield><subfield code="c">Michael L. Scott</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">3. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam : Boston ; Heidelberg ; [und 9 andere]</subfield><subfield code="b">Elsevier , Morgan Kaufmann Publlishers</subfield><subfield code="c">[2009]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXX, 910 Seiten</subfield><subfield code="b">Diagramme</subfield><subfield code="e">CD-ROM (12 cm)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">CD enthält: "...advanced/optional topics and the complete text of chapter 5, Target Machine Architecture, and chapter 16, Code Improvement." - Hier auch später erschienene, unveränderte Nachdrucke. - Nachdrucke ohne die CD-ROM-Beilage erschienen; der Inhalt der CD-ROM ist unter folgender Adresse verfügbar: http://www.elsevierdirect.com/9780123745149</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming languages (Electronic computers)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmiersprache</subfield><subfield code="0">(DE-588)4047409-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4123623-3</subfield><subfield code="a">Lehrbuch</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Programmiersprache</subfield><subfield code="0">(DE-588)4047409-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017328605&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017328605</subfield></datafield></record></collection> |
| genre | (DE-588)4123623-3 Lehrbuch gnd-content |
| genre_facet | Lehrbuch |
| id | DE-604.BV035408061 |
| illustrated | Not Illustrated |
| indexdate | 2025-02-20T06:42:38Z |
| institution | BVB |
| isbn | 9780123750327 9780123745149 0123745144 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017328605 |
| oclc_num | 310154527 |
| open_access_boolean | |
| owner | DE-92 DE-824 DE-83 DE-861 DE-188 DE-11 DE-863 DE-BY-FWS DE-473 DE-BY-UBG |
| owner_facet | DE-92 DE-824 DE-83 DE-861 DE-188 DE-11 DE-863 DE-BY-FWS DE-473 DE-BY-UBG |
| physical | XXX, 910 Seiten Diagramme CD-ROM (12 cm) |
| publishDate | 2009 |
| publishDateSearch | 2009 |
| publishDateSort | 2009 |
| publisher | Elsevier , Morgan Kaufmann Publlishers |
| record_format | marc |
| spellingShingle | Scott, Michael Lee 1959- Programming language pragmatics Programming languages (Electronic computers) Programmiersprache (DE-588)4047409-4 gnd |
| subject_GND | (DE-588)4047409-4 (DE-588)4123623-3 |
| title | Programming language pragmatics |
| title_auth | Programming language pragmatics |
| title_exact_search | Programming language pragmatics |
| title_full | Programming language pragmatics Michael L. Scott |
| title_fullStr | Programming language pragmatics Michael L. Scott |
| title_full_unstemmed | Programming language pragmatics Michael L. Scott |
| title_short | Programming language pragmatics |
| title_sort | programming language pragmatics |
| topic | Programming languages (Electronic computers) Programmiersprache (DE-588)4047409-4 gnd |
| topic_facet | Programming languages (Electronic computers) Programmiersprache Lehrbuch |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017328605&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT scottmichaellee programminglanguagepragmatics |
Inhaltsverzeichnis
THWS Würzburg Teilbibliothek SHL, Raum I.2.11
| Signatur: |
1340 ST 240 S428(3)st |
|---|---|
| Exemplar 1 | nicht ausleihbar Verfügbar Bestellen |
THWS Würzburg Zentralbibliothek Lesesaal
| Signatur: |
1000 ST 240 S428(3)st |
|---|---|
| Exemplar 1 | ausleihbar Verfügbar Bestellen |