000 | 00875camuuu2002778a 4500 | |
001 | 000000425240 | |
003 | OCoLC | |
005 | 19960807135655.0 | |
008 | 890926s1990 enk b 001 0 eng | |
010 | ▼a 89037070 | |
015 | ▼a GB89-53620 | |
019 | ▼a 20636104 | |
020 | ▼a 0077072154 : ▼c $12.95 | |
040 | ▼a DLC ▼c DLC ▼d UKM | |
049 | ▼a ACSL ▼l 121000992 | |
050 | 0 0 | ▼a QA76.76.C65 ▼b B46 1990 |
082 | 0 0 | ▼a 005.4/53 ▼2 20 |
090 | ▼a 005.453 ▼b B471i | |
100 | 1 | ▼a Bennett, J. P. ▼q (Jeremy Peter), ▼d 1960- |
245 | 1 0 | ▼a Introduction to compiling techniques : ▼b a first course using ANSI C, LEX, and YACC / ▼c J.P. Bennett. |
260 | ▼a London ; ▼a New York : ▼b McGraw-Hill, ▼c c1990. | |
263 | ▼a 9002 | |
300 | ▼a x, 242 p. : ▼b ill. ; ▼c 23 cm. | |
504 | ▼a Includes bibliographical references. | |
650 | 0 | ▼a Compiling (Electronic computers) |
653 | ▼a Computer systems ▼a Compilers ▼a Writing |
소장정보
No. | 소장처 | 청구기호 | 등록번호 | 도서상태 | 반납예정일 | 예약 | 서비스 |
---|---|---|---|---|---|---|---|
No. 1 | 소장처 과학도서관/Sci-Info(2층서고)/ | 청구기호 005.453 B471i | 등록번호 121000992 | 도서상태 대출가능 | 반납예정일 | 예약 | 서비스 |
컨텐츠정보
목차
CONTENTS Preface = ix 1. What is a compiler? = 1 1.1 The need for machine translation = 1 1.2 The structure of a compiler = 4 1.3 A demonstration compiler = 10 Exercises = 11 Further reading = 12 2. Target languages = 13 2.1 Types of target machine = 13 2.2 Implementation methods = 16 Exercises = 26 Further reading = 26 3. Formal grammars = 28 3.1 Defining the structure of a language = 29 3.2 Properties of grammars = 35 3.3 Syntax-directed translation = 40 Exercises = 43 Further reading = 44 4. Intermediate representations = 45 4.1 Types of intermediate representations = 45 4.2 Abstract machines = 58 Exercises = 58 Further reading = 59 5. Lexical analysis = 60 5.1 Why have a separate lexical analyser? = 60 5.2 Ad hoc lexical analysers = 66 5.3 Lexical analysis with finite state machines = 69 Exercises = 76 Further reading = 77 6. Syntax analysis methods = 78 6.1 Approaches to parsing = 78 6.2 Top-down parsing methods = 80 6.3 Bottom-up parsing = 92 Exercises = 110 Further reading = 111 7. Error handling = 112 7.1 Compile-time error handling = 113 7.2 Run-time errors = 115 Exercises = 116 Further reading = 116 8. Parser generators = 117 8.1 YACC = 117 8.2 YACC and ambiguous grammars = 120 8.3 Type consiste6cy in YACC = 125 8.4 Error handling = 126 Exercises = 127 Further reading = 128 9. Semantic checking = 129 9.1 Type checking = 129 9.2 Other semantic checks = 136 Exercises = 136 Further reading = 137 10. Code generation = 138 10.1 Edclarations and storage allocation = 139 10.2 Expressions and assignment = 142 10.3 Flow of control = 145 Exercises = 149 Further reading = 150 11. Code optimization = 151 11.1 Basic blocks = 151 11.2 Loop optimizations = 160 11.3 Register optimization = 165 11.4 Other optimizations = 166 Exercises = 169 Further reading = 70 12. A complete compiler for VSL = 171 12.1 The VC compiler for VSL = 171 12.2 Description of the compiler = 172 12.3 Building the compiler = 223 12.4 Running the compiler = 224 Exercises = 228 Appendix. VSL, VAM, and VAS = 230 A.1 The grammar of VSL = 230 A.2 The VSL Abstract Machine = 231 A.3 A mnemonic assembler for VAM = 233 Index = 234