Articles liés à Compiler design (2nd edition)(Chinese Edition)
- ISBN 10 7115301948
- ISBN 13 9787115301949
- ReliureBroché
- Languechinois
- Coordonnées du fabricantnon disponible
Acheter neuf
Afficher cet article
EUR 112,51
EUR 13,03 expédition depuis Chine vers France
Destinations, frais et délaisRésultats de recherche pour Compiler design (2nd edition)(Chinese Edition)
Image d'archives
Compiler design (2nd edition)(Chinese Edition)
Vendeur : liu xing, Nanjing, JS, Chine
Évaluation du vendeur 5 sur 5 étoiles
paperback. Etat : New. Ship out in 2 business day, And Fast shipping, Free Tracking number will be provided after the shipment.Paperback. Pub Date: 2013 Language: Chinese in Publisher: People's Posts and Telecommunications Press 1952 birth of the first compiler. has already passed more than half a century. the development of the compiler maturity. the writings on compiler design publishing a lot of attention to design details. but both. they have the bigger picture of classic rare. compiler design (2nd edition) is such a rare masterpiece. The two authors over the years has been fighting in the front line of the R & D and teaching on the theoretical and practical experience have condensed in compiler design (2nd edition) . The book discusses a series of core technologies necessary to build a modern compiler. compiler designers need to face many problems. and interpretation of the knowledge used to solve these problems. The second edition is newly revised version. after a lapse of eight years to fully demonstrate the latest progress of compiler construction techniques. Of rewriting all the examples in the book. and in particular to improve the elaborate sequence. making the content more continuity between chapters. and more suitable for professionals this the college textbook as a reference. Contents: Chapter 1 compiler compiler structure Overview 1.1 Introduction 1.2 1.3 Conversion Overview 1.3.1 front-end 1.3.2 Optimizer 1.3.3 backend 1.4 Summary and Outlook Chapter 2 lexical analyzer 2.1 Introduction 2.2 2.2.1 recognize words recognizer formalized 2.2.2 identify more complex word 2.3 regex lexer 2.4.1 2.3.1 notation the formalization 2.3.2 Example 2.3.3 RE closure properties of 2.4 from the regular expression to determine Finite Automata Machine 2.4.2 from a regular expression to the NFA: Thompson constructor method 2.4.3 from NFA to DFA: subset construction method 2.4.4 from the DFA to the minimum DFA: Hopcroft algorithm 2.4.5 DFA used to identify 2.5 2.5.1 Table-driven lexical analyzer the lexer 2.5.2 direct encoding the lexical analyzer 2.5.3 hand-coded lexical analyzer from DFA to handle 2.6 Advanced keyword theme 2.6.1 2.5.4 regex 2.6. 2 DFA minimization another way: zozowski algorithm 2.6.3 no closure Regular Expressions 2.7 Summary and Outlook Chapter 3 parser 3.1 Introduction 3.2 syntax representation 3.2.1 Why do not you use regular expressions 3.2.2 context-free grammar 3.2.3 A more complex example 3.2.4 semantic encoding structure 3.2.5 to find the derivation of the input string of symbols 3.3 top-down syntax analysis 3.3.1 for top-down parsing and transformational grammar 3.3 .2 top-down recursive descent parser 3.3.3 table-driven LL (1) parser 3.4 3.4.1 LR (1) parsing algorithm 3.4.2 build LR (1) table bottom-up syntax analysis 3.4.3 Table tectonic processes of the practical problems of error 3.5 3.5.1 3.5.3 the processing context related ambiguity 3.5.4 left recursion and right recursion error recovery 3.5.2 one yuan operator 3.6.1 optimization syntax 3.6 3.6 Advanced Topics .2 reduce the size of the table of the LR (1) 3.7 Summary and Outlook Chapter 4 context-sensitive analysis 4.3.1 4.2.2 4.2.1 Introduction 4.1 Introduction 4.2 Type type system target type system components 4.3 attribute grammar framework seeking value method 4.3.2 ring 4.3.3 Extensions 4.4 Ad Hoc Syntax-conversion 4.4.1 Ad Hoc Syntax-conversion method instance 4.3.4 attribute syntax 4.5 Advanced Topics 4.4.2 example 4.5.1 type inference more difficult problem 4.5.2 change associativity 4.6 Summary and Outlook Chapter 5 intermediate representation 5.1 Introduction 5.2 Figure IR5.2.1 with syntax tree 5.2.2 Figure 5.3 linear IR5.3.1 stack machine code 5.3.2 three-address code 5.3 .3 linear representation of the code 5.5.1 5.3.4 linear code to establish a control flow graph 5.4 the value mapped to the naming of the interim value of the name 5.4.1 5.4.2 static single assignment forms 5.4.3 memory model 5.5 symbol table scattered establish other uses of the symbol table. N° de réf. du vendeur NE044296
Quantité disponible : 1 disponible(s)