Fundamentals of automata theory and compiler construction:
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
New Delhi
IK International Publishing House
2022
|
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Physical Description: | xii, 377 Seiten Illustrationen Diagramme |
Staff View
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV048630662 | ||
| 003 | DE-604 | ||
| 005 | 20230505 | ||
| 007 | t | ||
| 008 | 230104s2022 a||| |||| 00||| eng d | ||
| 015 | |a GBC241116 |2 dnb | ||
| 020 | |z 9789386768728 |9 978-93-86768-72-8 | ||
| 020 | |z 9386768720 |9 93-86768-72-0 | ||
| 035 | |a (OCoLC)1378495807 | ||
| 035 | |a (DE-599)BVBBV048630662 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-739 | ||
| 084 | |a ST 255 |0 (DE-625)143629: |2 rvk | ||
| 100 | 1 | |a Kumar, Narendra |e Verfasser |0 (DE-588)171362888 |4 aut | |
| 245 | 1 | 0 | |a Fundamentals of automata theory and compiler construction |c Narendra Kumar, Santosh Kumar Sharma, Alok Agarwal, Er. Mayank Kumar Jain |
| 264 | 1 | |a New Delhi |b IK International Publishing House |c 2022 | |
| 300 | |a xii, 377 Seiten |b Illustrationen Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 610 | 2 | 7 | |a Compiler |0 (DE-588)1065285353 |2 gnd |9 rswk-swf |
| 650 | 4 | |a Machine theory | |
| 650 | 4 | |a Compilers (Computer programs) | |
| 650 | 7 | |a Compilers (Computer programs) |2 fast | |
| 650 | 7 | |a Machine theory |2 fast | |
| 650 | 0 | 7 | |a Automat |g Automatentheorie |0 (DE-588)4831958-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Automat |g Automatentheorie |0 (DE-588)4831958-2 |D s |
| 689 | 0 | 1 | |a Compiler |0 (DE-588)1065285353 |D b |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Sharma, Santosh Kumar |d ca. 20./21. Jh. |e Sonstige |0 (DE-588)1288239734 |4 oth | |
| 700 | 1 | |a Agarwal, Alok |d ca. 20./21. Jh. |e Sonstige |0 (DE-588)1288241631 |4 oth | |
| 700 | 1 | |a Jain, Er. Mayank Kumar |d ca. 20./21. Jh. |e Sonstige |0 (DE-588)1288242611 |4 oth | |
| 856 | 4 | 2 | |m Digitalisierung UB Passau - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=034005700&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-034005700 | ||
Record in the Search Index
| _version_ | 1804184762746667008 |
|---|---|
| adam_text | Contents Preface Acknowledgements 1. Basics of Compiler 1.1 Introduction 1.2 Language Categories 1.3 Translators 1.4 Analysis/Synthesis Model of Compilation 1.5 Phases of Compiler 1.6 Grouping of Phases 1.7 Types of Compiler Summary Exercise Multiple-Choice Questions 2. Phases of Writing a Compiler 2.1 Introduction 2.2 Frontend vs Backend of Compilers 2.3 Compiler Construction Tools 2.4 Bootstrapping 2.5 Quick and Dirty Compiler 2.6 Planning of Compiler 2.7 Multiple Approaches 2.8 Cross Compiler 2.9 Development Environment 2.10 Research Objectives 2.11 Framework Overview 2.12 Testing and Maintenance Summary Exercise Multiple-Choice Questions 3. Lexical Analyzer 3.1 Introduction 3.2 Role of a Lexical Analyser v vii 1 1 1 3 10 11 21 24 24 25 25 29 29 30 31 32 33 33 36 38 39 39 40 47 50 50 51 55 55 56
x Contents 3.3 Definition ofTokens 3.4 Input Buffering 3.5 Specification of Tokens 3.6 Recognition ofTokens 3.7 Languages for Specifying the Lexical Analyzer 3.8 Automata 3.9 Finite Automata 3.10 Conversion of NFA to DFA 3.11 Minimizing Number of States of DFA 3.12 Construction of an NFA from a Regular Expression 3.13 Designing of Lexical Analyzer 3.14 Optimizations of DFA Based Patterns Summary Exercise Multiple-Choice Questions 4. Syntax Analyzer 4.1 Definition of Grammar 4.2 Types of Gammar 4.3 Derivation Tree 4.4 Equivalent Grammars 4.5 Context-Free Grammar (CFG) 4.6 Simplification of Grammar 4.7 Lexical Versus Syntactic Analysis 4.8 Eliminating Ambiguity 4.9 Parsing Techniques 4.10 Ambiguous Grammar 4.11 Parser Generators Summary Exercise Multiple-Choice Questions 5. Syntax-Directed Translation 5.1 Definition 5.2 Types ofAttributes for Grammar Variables 5.3 Construction of Syntax Tree 5.4 L-Attributed Definition 5.5 Top-Down Translation 5.6 Design of Predictive Translator Summary Exercise Multiple-Choice Questions 6. Type Checking 6.1 Introduction 6.2 Definition 6.3 Dynamic Type Checking 57 59 60 62 66 70 71 76 81 84 85 86 123 123 125 129 129 132 134 138 139 141 144 144 153 180 182 183 184 187 193 193 194 196 198 201 203 204 204 205 209 209 209 212
Contents 6.4 Specification of Type Checking 6.5 Equivalence of Type Checking 6.6 Overloading of Function and Operator 6.7 Polymorphic Function Summary Exercise Multiple-Choice Questions 7. Runtime Environment 7.1 Source Languages Issue 7.2 Storage Optimization 7.3 Storage-Allocation Techniques 7.4 Access of Non-Local Names 7.5 Parameter Passing 7.6 Introduction to Symbol Table 7.7 Hash Table 7.8 Storage-Allocation Techniques Summary Exercise Multiple-Choice Questions 8. Intermediate Code Generators 8.1 Introduction to Intermediate Languages 8.2 Different Kinds of Intermediate Language 8.3 High-Level Intermediate Representations 8.4 Intermediate Code Generation 8.5 Postfix Notation 8.6 Syntax-Directed Translation Scheme to Postfix Code 8.7 Translation of Assignment Statement 8.8 Boolean Expression 8.9 Intermediate Code Generation for Case Statement 8.10 Backpatching 8.11 Code Generation for Function Calls and Procedural Calls Summary Exercise Multiple-Choice Questions 9. Code Generations 9.1 Introduction 9.2 Object Programs 9.3 Issues to Design Code Generator 9.4 A Simple Target Machine Model 9.5 Machine Model 9.6 Basic Blocks and Flow Graphs 9.7 A Simple Code Generator 9.8 Register Allocation and Assignment 9.9 Peephole Optimization xi 214 219 223 224 226 227 228 231 231 232 233 235 236 238 242 243 244 244 245 255 255 256 256 257 258 260 270 274 275 276 277 281 282 283 289 289 289 290 292 292 295 299 302 305
xii Contents Summary Exercise Multiple-Choice Questions 1. Code Optimization 10.1 10.2 10.3 10.4 10.5 10.6 10.7 10.8 10.9 10.10 10.11 10.12 10.13 10.14 10.15 10.16 10.17 10.18 Introduction Classification of Code Optimization Principal Sources of Optimization Optimization of Basic Blocks Optimization of Building Blocks Loop in Flow Graph Analysis of Program for Loop Optimization Identifying the Dominators Reducible Flow Graph Global Optimizations, Data-Flow Analysis Solution of Data Flow Equations Data Flow Equation for Liveness Analysis Basic Blocks One Variable at a Time Representation of Sets Code Improving Transformation Data Flow Algorithms Debugging of Optimized Code 307 308 309 313 313 314 315 316 318 319 320 322 324 325 327 328 330 330 330 331 334 339 Summary Exercise Multiple-Choice Questions . One-Pass Compiler 340 341 343 347 11.1 11.2 11.3 11.4 11.5 11.6 11.7 11.8 11.9 11.10 11.11 11.12 11.13 11.14 347 348 349 350 350 351 352 353 354 355 356 357 357 360 Introduction One-Pass Compiler Definition of Compiler Compilers in Education Compilation The Structure of a Compiler Syntax-Directed Translation Syntax-Directed Definitions Parsing Programming Languages Types of Parser A Translator for Expressions Lexical Analyser Abstract Stack Machine Summary Exercise Multiple-Choice Questions References Index 364 365 366 369 373
|
| adam_txt |
Contents Preface Acknowledgements 1. Basics of Compiler 1.1 Introduction 1.2 Language Categories 1.3 Translators 1.4 Analysis/Synthesis Model of Compilation 1.5 Phases of Compiler 1.6 Grouping of Phases 1.7 Types of Compiler Summary Exercise Multiple-Choice Questions 2. Phases of Writing a Compiler 2.1 Introduction 2.2 Frontend vs Backend of Compilers 2.3 Compiler Construction Tools 2.4 Bootstrapping 2.5 Quick and Dirty Compiler 2.6 Planning of Compiler 2.7 Multiple Approaches 2.8 Cross Compiler 2.9 Development Environment 2.10 Research Objectives 2.11 Framework Overview 2.12 Testing and Maintenance Summary Exercise Multiple-Choice Questions 3. Lexical Analyzer 3.1 Introduction 3.2 Role of a Lexical Analyser v vii 1 1 1 3 10 11 21 24 24 25 25 29 29 30 31 32 33 33 36 38 39 39 40 47 50 50 51 55 55 56
x Contents 3.3 Definition ofTokens 3.4 Input Buffering 3.5 Specification of Tokens 3.6 Recognition ofTokens 3.7 Languages for Specifying the Lexical Analyzer 3.8 Automata 3.9 Finite Automata 3.10 Conversion of NFA to DFA 3.11 Minimizing Number of States of DFA 3.12 Construction of an NFA from a Regular Expression 3.13 Designing of Lexical Analyzer 3.14 Optimizations of DFA Based Patterns Summary Exercise Multiple-Choice Questions 4. Syntax Analyzer 4.1 Definition of Grammar 4.2 Types of Gammar 4.3 Derivation Tree 4.4 Equivalent Grammars 4.5 Context-Free Grammar (CFG) 4.6 Simplification of Grammar 4.7 Lexical Versus Syntactic Analysis 4.8 Eliminating Ambiguity 4.9 Parsing Techniques 4.10 Ambiguous Grammar 4.11 Parser Generators Summary Exercise Multiple-Choice Questions 5. Syntax-Directed Translation 5.1 Definition 5.2 Types ofAttributes for Grammar Variables 5.3 Construction of Syntax Tree 5.4 L-Attributed Definition 5.5 Top-Down Translation 5.6 Design of Predictive Translator Summary Exercise Multiple-Choice Questions 6. Type Checking 6.1 Introduction 6.2 Definition 6.3 Dynamic Type Checking 57 59 60 62 66 70 71 76 81 84 85 86 123 123 125 129 129 132 134 138 139 141 144 144 153 180 182 183 184 187 193 193 194 196 198 201 203 204 204 205 209 209 209 212
Contents 6.4 Specification of Type Checking 6.5 Equivalence of Type Checking 6.6 Overloading of Function and Operator 6.7 Polymorphic Function Summary Exercise Multiple-Choice Questions 7. Runtime Environment 7.1 Source Languages Issue 7.2 Storage Optimization 7.3 Storage-Allocation Techniques 7.4 Access of Non-Local Names 7.5 Parameter Passing 7.6 Introduction to Symbol Table 7.7 Hash Table 7.8 Storage-Allocation Techniques Summary Exercise Multiple-Choice Questions 8. Intermediate Code Generators 8.1 Introduction to Intermediate Languages 8.2 Different Kinds of Intermediate Language 8.3 High-Level Intermediate Representations 8.4 Intermediate Code Generation 8.5 Postfix Notation 8.6 Syntax-Directed Translation Scheme to Postfix Code 8.7 Translation of Assignment Statement 8.8 Boolean Expression 8.9 Intermediate Code Generation for Case Statement 8.10 Backpatching 8.11 Code Generation for Function Calls and Procedural Calls Summary Exercise Multiple-Choice Questions 9. Code Generations 9.1 Introduction 9.2 Object Programs 9.3 Issues to Design Code Generator 9.4 A Simple Target Machine Model 9.5 Machine Model 9.6 Basic Blocks and Flow Graphs 9.7 A Simple Code Generator 9.8 Register Allocation and Assignment 9.9 Peephole Optimization xi 214 219 223 224 226 227 228 231 231 232 233 235 236 238 242 243 244 244 245 255 255 256 256 257 258 260 270 274 275 276 277 281 282 283 289 289 289 290 292 292 295 299 302 305
xii Contents Summary Exercise Multiple-Choice Questions 1. Code Optimization 10.1 10.2 10.3 10.4 10.5 10.6 10.7 10.8 10.9 10.10 10.11 10.12 10.13 10.14 10.15 10.16 10.17 10.18 Introduction Classification of Code Optimization Principal Sources of Optimization Optimization of Basic Blocks Optimization of Building Blocks Loop in Flow Graph Analysis of Program for Loop Optimization Identifying the Dominators Reducible Flow Graph Global Optimizations, Data-Flow Analysis Solution of Data Flow Equations Data Flow Equation for Liveness Analysis Basic Blocks One Variable at a Time Representation of Sets Code Improving Transformation Data Flow Algorithms Debugging of Optimized Code 307 308 309 313 313 314 315 316 318 319 320 322 324 325 327 328 330 330 330 331 334 339 Summary Exercise Multiple-Choice Questions . One-Pass Compiler 340 341 343 347 11.1 11.2 11.3 11.4 11.5 11.6 11.7 11.8 11.9 11.10 11.11 11.12 11.13 11.14 347 348 349 350 350 351 352 353 354 355 356 357 357 360 Introduction One-Pass Compiler Definition of Compiler Compilers in Education Compilation The Structure of a Compiler Syntax-Directed Translation Syntax-Directed Definitions Parsing Programming Languages Types of Parser A Translator for Expressions Lexical Analyser Abstract Stack Machine Summary Exercise Multiple-Choice Questions References Index 364 365 366 369 373 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Kumar, Narendra |
| author_GND | (DE-588)171362888 (DE-588)1288239734 (DE-588)1288241631 (DE-588)1288242611 |
| author_facet | Kumar, Narendra |
| author_role | aut |
| author_sort | Kumar, Narendra |
| author_variant | n k nk |
| building | Verbundindex |
| bvnumber | BV048630662 |
| classification_rvk | ST 255 |
| ctrlnum | (OCoLC)1378495807 (DE-599)BVBBV048630662 |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01946nam a2200445 c 4500</leader><controlfield tag="001">BV048630662</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230505 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">230104s2022 a||| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">GBC241116</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9789386768728</subfield><subfield code="9">978-93-86768-72-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9386768720</subfield><subfield code="9">93-86768-72-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1378495807</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV048630662</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-739</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">Kumar, Narendra</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)171362888</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Fundamentals of automata theory and compiler construction</subfield><subfield code="c">Narendra Kumar, Santosh Kumar Sharma, Alok Agarwal, Er. Mayank Kumar Jain</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New Delhi</subfield><subfield code="b">IK International Publishing House</subfield><subfield code="c">2022</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xii, 377 Seiten</subfield><subfield code="b">Illustrationen Diagramme</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="610" ind1="2" ind2="7"><subfield code="a">Compiler</subfield><subfield code="0">(DE-588)1065285353</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Compilers (Computer programs)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Compilers (Computer programs)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Machine theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Automat</subfield><subfield code="g">Automatentheorie</subfield><subfield code="0">(DE-588)4831958-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Automat</subfield><subfield code="g">Automatentheorie</subfield><subfield code="0">(DE-588)4831958-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Compiler</subfield><subfield code="0">(DE-588)1065285353</subfield><subfield code="D">b</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sharma, Santosh Kumar</subfield><subfield code="d">ca. 20./21. Jh.</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)1288239734</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Agarwal, Alok</subfield><subfield code="d">ca. 20./21. Jh.</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)1288241631</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Jain, Er. Mayank Kumar</subfield><subfield code="d">ca. 20./21. Jh.</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)1288242611</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau - ADAM Catalogue Enrichment</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=034005700&sequence=000001&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-034005700</subfield></datafield></record></collection> |
| id | DE-604.BV048630662 |
| illustrated | Illustrated |
| index_date | 2024-07-03T21:15:55Z |
| indexdate | 2024-07-10T09:44:30Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-034005700 |
| oclc_num | 1378495807 |
| open_access_boolean | |
| owner | DE-739 |
| owner_facet | DE-739 |
| physical | xii, 377 Seiten Illustrationen Diagramme |
| publishDate | 2022 |
| publishDateSearch | 2022 |
| publishDateSort | 2022 |
| publisher | IK International Publishing House |
| record_format | marc |
| spelling | Kumar, Narendra Verfasser (DE-588)171362888 aut Fundamentals of automata theory and compiler construction Narendra Kumar, Santosh Kumar Sharma, Alok Agarwal, Er. Mayank Kumar Jain New Delhi IK International Publishing House 2022 xii, 377 Seiten Illustrationen Diagramme txt rdacontent n rdamedia nc rdacarrier Compiler (DE-588)1065285353 gnd rswk-swf Machine theory Compilers (Computer programs) Compilers (Computer programs) fast Machine theory fast Automat Automatentheorie (DE-588)4831958-2 gnd rswk-swf Automat Automatentheorie (DE-588)4831958-2 s Compiler (DE-588)1065285353 b DE-604 Sharma, Santosh Kumar ca. 20./21. Jh. Sonstige (DE-588)1288239734 oth Agarwal, Alok ca. 20./21. Jh. Sonstige (DE-588)1288241631 oth Jain, Er. Mayank Kumar ca. 20./21. Jh. Sonstige (DE-588)1288242611 oth Digitalisierung UB Passau - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=034005700&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Kumar, Narendra Fundamentals of automata theory and compiler construction Compiler (DE-588)1065285353 gnd Machine theory Compilers (Computer programs) Compilers (Computer programs) fast Machine theory fast Automat Automatentheorie (DE-588)4831958-2 gnd |
| subject_GND | (DE-588)1065285353 (DE-588)4831958-2 |
| title | Fundamentals of automata theory and compiler construction |
| title_auth | Fundamentals of automata theory and compiler construction |
| title_exact_search | Fundamentals of automata theory and compiler construction |
| title_exact_search_txtP | Fundamentals of automata theory and compiler construction |
| title_full | Fundamentals of automata theory and compiler construction Narendra Kumar, Santosh Kumar Sharma, Alok Agarwal, Er. Mayank Kumar Jain |
| title_fullStr | Fundamentals of automata theory and compiler construction Narendra Kumar, Santosh Kumar Sharma, Alok Agarwal, Er. Mayank Kumar Jain |
| title_full_unstemmed | Fundamentals of automata theory and compiler construction Narendra Kumar, Santosh Kumar Sharma, Alok Agarwal, Er. Mayank Kumar Jain |
| title_short | Fundamentals of automata theory and compiler construction |
| title_sort | fundamentals of automata theory and compiler construction |
| topic | Compiler (DE-588)1065285353 gnd Machine theory Compilers (Computer programs) Compilers (Computer programs) fast Machine theory fast Automat Automatentheorie (DE-588)4831958-2 gnd |
| topic_facet | Compiler Machine theory Compilers (Computer programs) Automat Automatentheorie |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=034005700&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT kumarnarendra fundamentalsofautomatatheoryandcompilerconstruction AT sharmasantoshkumar fundamentalsofautomatatheoryandcompilerconstruction AT agarwalalok fundamentalsofautomatatheoryandcompilerconstruction AT jainermayankkumar fundamentalsofautomatatheoryandcompilerconstruction |