Verfügbarkeit: Crafting a compiler | Technische Universität München

Crafting a compiler:

Gespeichert in:

Bibliographische Detailangaben
Beteiligte Personen:	Fischer, Charles N. (VerfasserIn), Cytron, Ron K. 1958- (VerfasserIn), LeBlanc, Richard J. 1950- (VerfasserIn)
Format:	Buch
Sprache:	Englisch
Veröffentlicht:	Boston ; Munich [u.a.] Pearson 2010
Ausgabe:	Global ed.
Schlagwörter:	Compiler-Compiler Compiler Übersetzerbau Compilers (Computer programs)
Links:	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020509559&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
Umfang:	715 S. graph. Darst.
ISBN:	9780138017859 0138017859

Internformat

MARC


LEADER	00000nam a2200000 c 4500
001	BV036588812
003	DE-604
005	20100824
007	t\|
008	100728s2010 xx d\|\|\| \|\|\|\| 00\|\|\| eng d
020			\|a 9780138017859 \|c pbk. : GBP 45.99 \|9 978-0-13-801785-9
020			\|a 0138017859 \|9 0-13-801785-9
024	3		\|a 9780138017859
035			\|a (OCoLC)699846712
035			\|a (DE-599)BSZ320645398
040			\|a DE-604 \|b ger
041	0		\|a eng
049			\|a DE-473
084			\|a ST 255 \|0 (DE-625)143629: \|2 rvk
100	1		\|a Fischer, Charles N. \|e Verfasser \|0 (DE-588)140739122 \|4 aut
245	1	0	\|a Crafting a compiler \|c Charles N. Fischer ; Ron K. Cytron ; Richard J. LeBlanc
250			\|a Global ed.
264		1	\|a Boston ; Munich [u.a.] \|b Pearson \|c 2010
300			\|a 715 S. \|b graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
650	0	7	\|a Compiler-Compiler \|0 (DE-588)4113237-3 \|2 gnd \|9 rswk-swf
650	0	7	\|a Compiler \|0 (DE-588)4148248-7 \|2 gnd \|9 rswk-swf
650	0	7	\|a Übersetzerbau \|0 (DE-588)4121803-6 \|2 gnd \|9 rswk-swf
653			\|a Compilers (Computer programs)
689	0	0	\|a Übersetzerbau \|0 (DE-588)4121803-6 \|D s
689	0		\|5 DE-604
689	1	0	\|a Compiler-Compiler \|0 (DE-588)4113237-3 \|D s
689	1		\|8 1\p \|5 DE-604
689	2	0	\|a Compiler \|0 (DE-588)4148248-7 \|D s
689	2		\|8 2\p \|5 DE-604
700	1		\|a Cytron, Ron K. \|d 1958- \|e Verfasser \|0 (DE-588)140739327 \|4 aut
700	1		\|a LeBlanc, Richard J. \|d 1950- \|e Verfasser \|0 (DE-588)140739718 \|4 aut
856	4	2	\|m Digitalisierung UB Bamberg \|q application/pdf \|u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020509559&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
883	1		\|8 1\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 2\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
943	1		\|a oai:aleph.bib-bvb.de:BVB01-020509559

Datensatz im Suchindex

_version_	1819358254363312128
adam_text	Brief Contents 1 Overview 29 2 Design of a Simple Compiler 59 3 Theory and Practice of Scanning 85 4 Formal Grammars and Parsing 143 5 Тор -Down Parsing 175 6 Bottom-Up Parsing 211 7 Syntax-Directed Compilation 267 8 Declaration Processing and Symbol Tables 311 9 Semantic Analysis 375 10 Intermediate Representations 423 11 Code Synthesis for Virtual Machines 449 12 Runtime Support 477 13 larger Corfe Generation 521 14 Program Analysis and Optimization 579 16 Contents 1 Overview 29 1.1 History of Compilation ....................... 30 1.2 What Compilers Do ......................... 32 1.2.1 Machine Code Generated by Compilers ........ 32 1.2.2 Target Code Formats ................... 35 1.3 Interpreters ............................. 37 1.4 Syntax and Semantics ....................... 38 1.4.1 Static Semantics ...................... 39 1.4.2 Runtime Semantics .................... 40 1.5 Organization of a Compiler .................... 42 1.5.1 The Scanner ........................ 44 1.5.2 The Parser ......................... 44 1.5.3 The Type Checker (Semantic Analysis) ......... 45 1.5.4 Translator (Program Synthesis) .............. 45 1.5.5 Symbol Tables ....................... 46 1.5.6 The Optimizer ....................... 46 1.5.7 The Code Generator .................... 47 1.5.8 Compiler Writing Tools .................. 47 1.6 Programming Language and Compiler Design ......... 48 1.7 Computer Architecture and Compiler Design .......... 49 1.8 Compiler Design Considerations ................. 50 1.8.1 Debugging (Development) Compilers .......... 50 1.8.2 Optimizing Compilers ................... 51 1.8.3 Retargetable Compilers .................. 51 1.9 Integrated Development Environments ............. 52 Exercises ................................. 54 17 18 Contents 2 Design of a Simple Compiler 59 2.1 An Informal Definition of the ас Language ............ 60 2.2 Formal Definition of ac ....................... 61 2.2.1 Syntax Specification .................... 61 2.2.2 Token Specification .................... 64 2.3 Phases of a Simple Compiler ................... 65 2.4 Scanning ............................... 66 2.5 Parsing ................................ 67 2.5.1 Predicting a Parsing Procedure ............. 69 2.5.2 Implementing the Production ............... 71 2.6 Abstract Syntax Trees ....................... 73 2.7 Semantic Analysis ......................... 74 2.7.1 Symbol Tables ....................... 75 2.7.2 Type Checking ....................... 76 2.8 Code Generation .......................... 79 Exercises ................................. 82 3 Theory and Practice of Scanning 85 3.1 Overview of a Scanner ....................... 86 3.2 Regular Expressions ........................ 88 3.3 Examples .............................. 91 3.4 Finite Automata and Scanners .................. 92 3.4.1 Deterministic Finite Automata .............. 93 3.5 The Lex Scanner Generator .................... 97 3.5.1 Defining Tokens in Lex .................. 98 3.5.2 The Character Class .................... 100 3.5.3 Using Regular Expressions to Define Tokens ..... 100 3.5.4 Character Processing Using Lex ............. 104 3.6 Other Scanner Generators .................... 105 3.7 Practical Considerations of Building Scanners ......... 107 3.7.1 Processing Identifiers and Literals ............ 108 Contents 19 3.7.2 Using Compiler Directives and Listing Source Lines . . Ill 3.7.3 Terminating the Scanner ................. 113 3.7.4 Multicharacter Lookahead ................. 114 3.7.5 Performance Considerations ............... 115 3.7.6 Lexical Error Recovery .................. 117 3.8 Regular Expressions and Finite Automata ............ 120 3.8.1 Transforming a Regular Expression into an NFA .... 121 3.8.2 Creating the DFA ...................... 122 3.8.3 Optimizing Finite Automata ................ 125 3.8.4 Translating Finite Automata into Regular Expressions . 128 3.9 Summary .............................. 131 Exercises ................................. 134 4 Formal Grammars and Parsing 143 4.1 Context-Free Grammars ...................... 144 4.1.1 Leftmost Derivations .................... 146 4.1.2 Rightmost Derivations ................... 147 4.1.3 Parse Trees ......................... 147 4.1.4 Other Types of Grammars ................. 148 4.2 Properties of CFGs ......................... 150 4.2.1 Reduced Grammars .................... 150 4.2.2 Ambiguity .......................... 151 4.2.3 Faulty Language Definition ................ 152 4.3 Transforming Extended Grammars ................ 152 4.4 Parsers and Recognizers ..................... 153 4.5 Grammar Analysis Algorithms .................. 157 4.5.1 Grammar Representation ................. 157 4.5.2 Deriving the Empty String ................. 158 4.5.3 First Sets .......................... 160 4.5.4 Follow Sets ......................... 164 Exercises ................................. 168 20 Contents 5 Тор -Down Parsing 175 5.1 Overview ...............................176 5.2 LL(fc) Grammars ..........................177 5.3 Recursive-Descent LL(1) Parsers ................181 5.4 Table-Driven LL(1) Parsers ....................182 5.5 Obtaining LL(1) Grammars ....................186 5.5.1 Common Prefixes .....................188 5.5.2 Left Recursion .......................189 5.6 A Non-LL(1) Language .......................191 5.7 Properties of LL(1) Parsers ....................193 5.8 Parse Table Representation ....................195 5.8.1 Compaction .........................196 5.8.2 Compression ........................197 5.9 Syntactic Error Recovery and Repair ..............200 5.9.1 Error Recovery .......................201 5.9.2 Error Repair .........................201 5.9.3 Error Detection in LL(1) Parsers .............203 5.9.4 Error Recovery in LL(1) Parsers .............203 Exercises .................................205 6 Bottom-Up Parsing 211 6.1 Overview ...............................212 6.2 Shift-Reduce Parsers .......................213 6.2.1 LR Parsers and Rightmost Derivations .........214 6.2.2 LR Parsing as Knitting ...................214 6.2.3 LR Parsing Engine .....................216 6.2.4 The LR Parse Table ....................217 6.2.5 LR(fc) Parsing ........................219 6.3 LR(0) Table Construction .....................223 6.4 Conflict Diagnosis .........................229 6.4.1 Ambiguous Grammars ...................231 Contents 21 6.4.2 Grammars that are not LR(fc) ............... 234 6.5 Conflict Resolution and Table Construction ........... 236 6.5.1 SLR(fc) Table Construction ................ 236 6.5.2 LALR(fc) Table Construction ................ 241 6.5.3 LALR Propagation Graph ................. 243 6.5.4 LR(fc) Table Construction ................. 251 Exercises ................................. 256 7 Syntax-Directed Compilation 267 7.1 Overview ...............................267 7.1.1 Semantic Actions and Values ...............268 7.1.2 Synthesized and Inherited Attributes ..........269 7.2 Bottom-Up Syntax-Directed Translation .............271 7.2.1 Example ...........................271 7.2.2 Rule Cloning ........................275 7.2.3 Forcing Semantic Actions .................276 7.2.4 Aggressive Grammar Restructuring ...........278 7.3 Top-Down Syntax-Directed Translation .............279 7.4 Abstract Syntax Trees .......................282 7.4.1 Concrete and Abstract Trees ...............282 7.4.2 An Efficient AST Data Structure .............283 7.4.3 Infrastructure for Creating ASTs .............284 7.5 AST Design and Construction ...................286 7.5.1 Design ............................288 7.5.2 Construction ........................290 7.6 AST Structures for Left and Right Values ............293 7.7 Design Patterns for ASTs .....................296 7.7.1 Node Class Hierarchy ...................296 7.7.2 Visitor Pattern .......................297 7.7.3 Reflective Visitor Pattern .................300 Exercises .................................304 22 Contents 8 Declaration Processing and Symbol Tables 311 8.1 Constructing a Symbol Table ...................312 8.1.1 Static Scoping .......................314 8.1.2 A Symbol Table Interface .................314 8.2 Block-Structured Languages and Scopes ............316 8.2.1 Handling Scopes ......................316 8.2.2 One Symbol Table or Many? ...............317 8.3 Basic Implementation Techniques ................318 8.3.1 Entering and Finding Names ...............318 8.3.2 The Name Space .....................321 8.3.3 An Efficient Symbol Table Implementation .......322 8.4 Advanced Features .........................325 8.4.1 Records and Typenames .................326 8.4.2 Overloading and Type Hierarchies ............326 8.4.3 Implicit Declarations ....................328 8.4.4 Export and Import Directives ...............328 8.4.5 Altered Search Rules ...................329 8.5 Declaration Processing Fundamentals ..............330 8.5.1 Attributes in the Symbol Table ..............330 8.5.2 Type Descriptor Structures ................331 8.5.3 Type Checking Using an Abstract Syntax Tree .....332 8.6 Variable and Type Declarations ..................335 8.6.1 Simple Variable Declarations ...............335 8.6.2 Handling Type Names ...................336 8.6.3 Type Declarations .....................337 8.6.4 Variable Declarations Revisited .............340 8.6.5 Static Array Types .....................343 8.6.6 Struct and Record Types .................344 8.6.7 Enumeration Types ....................345 8.7 Class and Method Declarations ..................348 8.7.1 Processing Class Declarations ..............349 8.7.2 Processing Method Declarations .............353 8.8 An Introduction to Type Checking .................355 8.8.1 Simple Identifiers and Literals ..............359 Contents 23 8.8.2 Assignment Statements.................. 360 8.8.3 Checking Expressions ................... 360 8.8.4 Checking Complex Names ................ 361 8.9 Summary .............................. 366 Exercises ................................. 368 9 Semantic Analysis 375 9.1 Semantic Analysis for Control Structures ............375 9.1.1 Reachability and Termination Analysis .........377 9.1.2 If Statements ........................380 9.1.3 While, Do, and Repeat Loops ..............382 9.1.4 For Loops ..........................385 9.1.5 Break, Continue, Return, and Goto Statements .... 388 9.1.6 Switch and Case Statements ...............396 9.1.7 Exception Handling ....................401 9.2 Semantic Analysis of Calls ....................408 9.3 Summary ..............................416 Exercises .................................417 10 Intermediate Representations 423 10.1 Overview ............................... 424 10.1.1 Examples .......................... 425 10.1.2 The Middle-End ...................... 427 10.2 Java Virtual Machine ........................ 429 10.2.1 Introduction and Design Principles ............ 430 10.2.2 Contents of a Class File .................. 431 10.2.3 JVM Instructions ...................... 433 10.3 Static Single Assignment Form .................. 442 10.3.1 Renaming and (^-functions ................ 443 Exercises ................................. 446 24 Contents 11 Code Synthesis f or Virtual Machines 449 11.1 Visitors for Code Generation ...................450 11.2 Class and Method Declarations ..................452 11.2.1 Class Declarations .....................454 11.2.2 Method Declarations ....................456 11.3 The MethodBodyVisitor ......................457 11.3.1 Constants ..........................457 11.3.2 References to Local Storage ...............458 11.3.3 Static References .....................459 11.3.4 Expressions .........................459 11.3.5 Assignment .........................461 11.3.6 Method Calls ........................462 11.3.7 Field References ......................464 11.3.8 Array References ......................465 11.3.9 Conditional Execution ...................467 11.3.10 Loops ............................468 11.4 The LHSVisitor ...........................469 11.4.1 Local References .....................469 11.4.2 Static References .....................470 11.4.3 Field References ......................471 11.4.4 Array References ......................471 Exercises .................................473 12 Runtime Support £77 12.1 Static Allocation ........................... 478 12.2 Stack Allocation ........................... 479 12.2.1 Field Access in Classes and Structs ........... 481 12.2.2 Accessing Frames at Runtime .............. 482 12.2.3 Handling Classes and Objects .............. 483 12.2.4 Handling Multiple Scopes ................. 485 12.2.5 Block-Level Allocation ................... 487 Contents 25 12.2.6 More About Frames ....................489 12.3 Arrays ................................492 12.3.1 Static One-Dimensional Arrays ..............492 12.3.2 Multidimensional Arrays ..................497 12.4 Heap Management .........................500 12.4.1 Allocation Mechanisms .................. 500 12.4.2 Deallocation Mechanisms ................. 503 12.4.3 Automatic Garbage Collection .............. 504 12.5 Region-Based Memory Management .............. 511 Exercises ................................. 514 13 Target Code Generation 521 13.1 Translating Bytecodes.......................522 13.1.1 Allocating memory addresses ..............525 13.1.2 Allocating Arrays and Objects ..............525 13.1.3 Method Calls ........................528 13.1.4 Example of Bytecode Translation ............530 13.2 Translating Expression Trees ...................533 13.3 Register Allocation .........................537 13.3.1 On-the-Fly Register Allocation ..............538 13.3.2 Register Allocation Using Graph Coloring ........540 13.3.3 Priority-Based Register Allocation ............548 13.3.4 Interprocedural Register Allocation ...........549 13.4 Code Scheduling ..........................551 13.4.1 Improving Code Scheduling ...............555 13.4.2 Global and Dynamic Code Scheduling .........556 13.5 Automatic Instruction Selection ..................558 13.5.1 Instruction Selection Using BURS ............561 13.5.2 Instruction Selection Using Twig .............563 13.5.3 Other Approaches .....................564 13.6 Peephole Optimization .......................564 13.6.1 Levels of Peephole Optimization .............565 13.6.2 Automatic Generation of Peephole Optimizers .....568 Exercises .................................570 26 Contents 14 Program Analysis and Optimization 579 14.1 Overview ...............................580 14.1.1 Why Optimize? .......................581 14.2 Control Flow Analysis .......................587 14.2.1 Control Flow Graphs ....................588 14.2.2 Program and Control Flow Structure ...........591 14.2.3 Direct Procedure Call Graphs ..............592 14.2.4 Depth-First Spanning Tree ................592 14.2.5 Dominance .........................597 14.2.6 Simple Dominance Algorithm ...............599 14.2.7 Fast Dominance Algorithm ................603 14.2.8 Dominance Frontiers ....................613 14.2.9 Intervals ...........................617 14.3 Introduction to Data Flow Analysis ................630 14.3.1 Available Expressions ...................630 14.3.2 Live Variables ........................633 14.4 Data Flow Frameworks .......................636 14.4.1 Data Flow Evaluation Graph ...............636 14.4.2 Meet Lattice .........................638 14.4.3 Transfer Functions .....................640 14.5 Evaluation ..............................643 14.5.1 Iteration ...........................643 14.5.2 Initialization .........................647 14.5.3 Termination and Rapid Frameworks ...........648 14.5.4 Distributive Frameworks ..................652 14.6 Constant Propagation .......................655 14.7 SSA Form ..............................659 14.7.1 Placing ^-Functions ....................661 14.7.2 Renaming ..........................663 Exercises .................................668 Contents 27 Bibliography 683 Abbreviations 693 Pseudocode Guide 695 Index 699
any_adam_object	1
author	Fischer, Charles N. Cytron, Ron K. 1958- LeBlanc, Richard J. 1950-
author_GND	(DE-588)140739122 (DE-588)140739327 (DE-588)140739718
author_facet	Fischer, Charles N. Cytron, Ron K. 1958- LeBlanc, Richard J. 1950-
author_role	aut aut aut
author_sort	Fischer, Charles N.
author_variant	c n f cn cnf r k c rk rkc r j l rj rjl
building	Verbundindex
bvnumber	BV036588812
classification_rvk	ST 255
ctrlnum	(OCoLC)699846712 (DE-599)BSZ320645398
discipline	Informatik
edition	Global ed.
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01967nam a2200481 c 4500</leader><controlfield tag="001">BV036588812</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20100824 </controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">100728s2010 xx d\|\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780138017859</subfield><subfield code="c">pbk. : GBP 45.99</subfield><subfield code="9">978-0-13-801785-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0138017859</subfield><subfield code="9">0-13-801785-9</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9780138017859</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)699846712</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BSZ320645398</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-473</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 255</subfield><subfield code="0">(DE-625)143629:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Fischer, Charles N.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)140739122</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Crafting a compiler</subfield><subfield code="c">Charles N. Fischer ; Ron K. Cytron ; Richard J. LeBlanc</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Global ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston ; Munich [u.a.]</subfield><subfield code="b">Pearson</subfield><subfield code="c">2010</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">715 S.</subfield><subfield code="b">graph. Darst.</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="650" ind1="0" ind2="7"><subfield code="a">Compiler-Compiler</subfield><subfield code="0">(DE-588)4113237-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Compiler</subfield><subfield code="0">(DE-588)4148248-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Übersetzerbau</subfield><subfield code="0">(DE-588)4121803-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Compilers (Computer programs)</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Übersetzerbau</subfield><subfield code="0">(DE-588)4121803-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Compiler-Compiler</subfield><subfield code="0">(DE-588)4113237-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Compiler</subfield><subfield code="0">(DE-588)4148248-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Cytron, Ron K.</subfield><subfield code="d">1958-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)140739327</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">LeBlanc, Richard J.</subfield><subfield code="d">1950-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)140739718</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Bamberg</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=020509559&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-020509559</subfield></datafield></record></collection>
id	DE-604.BV036588812
illustrated	Illustrated
indexdate	2024-12-20T14:37:37Z
institution	BVB
isbn	9780138017859 0138017859
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-020509559
oclc_num	699846712
open_access_boolean
owner	DE-473 DE-BY-UBG
owner_facet	DE-473 DE-BY-UBG
physical	715 S. graph. Darst.
publishDate	2010
publishDateSearch	2010
publishDateSort	2010
publisher	Pearson
record_format	marc
spellingShingle	Fischer, Charles N. Cytron, Ron K. 1958- LeBlanc, Richard J. 1950- Crafting a compiler Compiler-Compiler (DE-588)4113237-3 gnd Compiler (DE-588)4148248-7 gnd Übersetzerbau (DE-588)4121803-6 gnd
subject_GND	(DE-588)4113237-3 (DE-588)4148248-7 (DE-588)4121803-6
title	Crafting a compiler
title_auth	Crafting a compiler
title_exact_search	Crafting a compiler
title_full	Crafting a compiler Charles N. Fischer ; Ron K. Cytron ; Richard J. LeBlanc
title_fullStr	Crafting a compiler Charles N. Fischer ; Ron K. Cytron ; Richard J. LeBlanc
title_full_unstemmed	Crafting a compiler Charles N. Fischer ; Ron K. Cytron ; Richard J. LeBlanc
title_short	Crafting a compiler
title_sort	crafting a compiler
topic	Compiler-Compiler (DE-588)4113237-3 gnd Compiler (DE-588)4148248-7 gnd Übersetzerbau (DE-588)4121803-6 gnd
topic_facet	Compiler-Compiler Compiler Übersetzerbau
url	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020509559&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
work_keys_str_mv	AT fischercharlesn craftingacompiler AT cytronronk craftingacompiler AT leblancrichardj craftingacompiler

Verfügbarkeit

‌

Inhaltsverzeichnis