Formal Languages and Compilation:
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
London
Springer London
2009
|
| Edition: | 1st ed. 2009 |
| Series: | Texts in Computer Science
|
| Subjects: | |
| Online Access: | DE-355 Volltext |
| Physical Description: | 1 Online-Ressource (XII, 368 Seiten 100 illus.) |
| ISBN: | 9781848820500 |
| ISSN: | 1868-095X |
| DOI: | 10.1007/978-1-84882-050-0 |
Staff View
MARC
| LEADER | 00000nam a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV050122752 | ||
| 003 | DE-604 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 250115s2009 xx o|||| 00||| eng d | ||
| 020 | |a 9781848820500 |9 978-1-84882-050-0 | ||
| 024 | 7 | |a 10.1007/978-1-84882-050-0 |2 doi | |
| 035 | |a (ZDB-2-SCS)978-1-84882-050-0 | ||
| 035 | |a (OCoLC)1492136362 | ||
| 035 | |a (DE-599)BVBBV050122752 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-355 | ||
| 082 | 0 | |a 004.0151 |2 23 | |
| 100 | 1 | |a Crespi Reghizzi, Stefano |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Formal Languages and Compilation |c by Stefano Crespi Reghizzi |
| 250 | |a 1st ed. 2009 | ||
| 264 | 1 | |a London |b Springer London |c 2009 | |
| 300 | |a 1 Online-Ressource (XII, 368 Seiten 100 illus.) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Texts in Computer Science |x 1868-095X | |
| 505 | 8 | |a Whereas many textbooks on formal languages and compilation focus on technological aspects, it is the elegance and simplicity of the underlying *theory* that allows students to acquire the fundamental paradigms of language structures, to avoid pitfalls such as ambiguity, and to adequately map structure to meaning. Formal Languages and Compilation covers the fundamental concepts of formal languages and compilation, which are central to computer science and based on well-consolidated principles. It presents a comprehensive selection of topics and is based on rigorous definitions and algorithms, illustrated by many motivating examples, with a focus on the importance of combining theoretical concepts with practical applications. | |
| 505 | 8 | |a In a clear, reader-friendly and simple minimalist way, this uniquely versatile textbook provides the essential principles and methods used for defining the syntax of artificial languages and implementing simple translators, as well as for designing syntax-directed translators. Readers require some background in programming, although detailed knowledge of a specific programming language is not necessary; they should also be somewhat familiar with basic set theory, algebra and logic. | |
| 505 | 8 | |a Features and topics: • Provides many pedagogical tools, such as slides and solutions for lecturers via the author's website • Unifies the concepts and notations used in the various approaches of parsing algorithms • Concepts are illustrated with many realistic examples, to ease the understanding of the theory and the transfer to applications • Theoretical models of automata, transducers and formal grammars are used extensively • Algorithms are described in a pseudocode to avoid the disturbing details of a programming language, yet they are straightforward to convert to executable procedures • Coverage of the algorithms for processing regular expressions and finiteautomata is concise and complete • Systematically discusses ambiguous forms, allowing readers to avoid pitfalls when designing grammars • Unifies the concepts and notations used in different approaches, | |
| 505 | 8 | |a thus extending methods coverage with a reduced definitional apparatus • Introduces static program analysis, moving from the baseline reached with finite automata and local languages This comprehensive and clearly written text, based on many years of course instruction, will be welcomed as the ideal guide to the fundamentals of this field by advanced undergraduate and graduate students in computer science and computer engineering. Stefano Crespi Reghizzi is a full professor of computer science at the Politecnico di Milano, Milan, Italy, where he has numerous years of experience teaching formal languages and compiler technology. In addition, he leads the department's compiler research group. [Barcode] ISBN 978-1-84882-049-4 [URL] springer.com | |
| 650 | 4 | |a Computer Science Logic and Foundations of Programming | |
| 650 | 4 | |a Compilers and Interpreters | |
| 650 | 4 | |a Formal Languages and Automata Theory | |
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Compilers (Computer programs) | |
| 650 | 4 | |a Machine theory | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781848820494 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781848820562 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781849968171 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-84882-050-0 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-1-SCS | ||
| 940 | 1 | |q ZDB-2-SCS_2009 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-035459622 | |
| 966 | e | |u https://doi.org/10.1007/978-1-84882-050-0 |l DE-355 |p ZDB-2-SCS |q UBR Paketkauf 2024 |x Verlag |3 Volltext | |
Record in the Search Index
| _version_ | 1823676063570460672 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Crespi Reghizzi, Stefano |
| author_facet | Crespi Reghizzi, Stefano |
| author_role | aut |
| author_sort | Crespi Reghizzi, Stefano |
| author_variant | r s c rs rsc |
| building | Verbundindex |
| bvnumber | BV050122752 |
| collection | ZDB-1-SCS |
| contents | Whereas many textbooks on formal languages and compilation focus on technological aspects, it is the elegance and simplicity of the underlying *theory* that allows students to acquire the fundamental paradigms of language structures, to avoid pitfalls such as ambiguity, and to adequately map structure to meaning. Formal Languages and Compilation covers the fundamental concepts of formal languages and compilation, which are central to computer science and based on well-consolidated principles. It presents a comprehensive selection of topics and is based on rigorous definitions and algorithms, illustrated by many motivating examples, with a focus on the importance of combining theoretical concepts with practical applications. In a clear, reader-friendly and simple minimalist way, this uniquely versatile textbook provides the essential principles and methods used for defining the syntax of artificial languages and implementing simple translators, as well as for designing syntax-directed translators. Readers require some background in programming, although detailed knowledge of a specific programming language is not necessary; they should also be somewhat familiar with basic set theory, algebra and logic. Features and topics: • Provides many pedagogical tools, such as slides and solutions for lecturers via the author's website • Unifies the concepts and notations used in the various approaches of parsing algorithms • Concepts are illustrated with many realistic examples, to ease the understanding of the theory and the transfer to applications • Theoretical models of automata, transducers and formal grammars are used extensively • Algorithms are described in a pseudocode to avoid the disturbing details of a programming language, yet they are straightforward to convert to executable procedures • Coverage of the algorithms for processing regular expressions and finiteautomata is concise and complete • Systematically discusses ambiguous forms, allowing readers to avoid pitfalls when designing grammars • Unifies the concepts and notations used in different approaches, thus extending methods coverage with a reduced definitional apparatus • Introduces static program analysis, moving from the baseline reached with finite automata and local languages This comprehensive and clearly written text, based on many years of course instruction, will be welcomed as the ideal guide to the fundamentals of this field by advanced undergraduate and graduate students in computer science and computer engineering. Stefano Crespi Reghizzi is a full professor of computer science at the Politecnico di Milano, Milan, Italy, where he has numerous years of experience teaching formal languages and compiler technology. In addition, he leads the department's compiler research group. [Barcode] ISBN 978-1-84882-049-4 [URL] springer.com |
| ctrlnum | (ZDB-2-SCS)978-1-84882-050-0 (OCoLC)1492136362 (DE-599)BVBBV050122752 |
| dewey-full | 004.0151 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.0151 |
| dewey-search | 004.0151 |
| dewey-sort | 14.0151 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| doi_str_mv | 10.1007/978-1-84882-050-0 |
| edition | 1st ed. 2009 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000zcb4500</leader><controlfield tag="001">BV050122752</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">250115s2009 xx o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781848820500</subfield><subfield code="9">978-1-84882-050-0</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-84882-050-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)978-1-84882-050-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1492136362</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV050122752</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-355</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.0151</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Crespi Reghizzi, Stefano</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Formal Languages and Compilation</subfield><subfield code="c">by Stefano Crespi Reghizzi</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2009</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">London</subfield><subfield code="b">Springer London</subfield><subfield code="c">2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XII, 368 Seiten 100 illus.)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Texts in Computer Science</subfield><subfield code="x">1868-095X</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Whereas many textbooks on formal languages and compilation focus on technological aspects, it is the elegance and simplicity of the underlying *theory* that allows students to acquire the fundamental paradigms of language structures, to avoid pitfalls such as ambiguity, and to adequately map structure to meaning. Formal Languages and Compilation covers the fundamental concepts of formal languages and compilation, which are central to computer science and based on well-consolidated principles. It presents a comprehensive selection of topics and is based on rigorous definitions and algorithms, illustrated by many motivating examples, with a focus on the importance of combining theoretical concepts with practical applications.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">In a clear, reader-friendly and simple minimalist way, this uniquely versatile textbook provides the essential principles and methods used for defining the syntax of artificial languages and implementing simple translators, as well as for designing syntax-directed translators. Readers require some background in programming, although detailed knowledge of a specific programming language is not necessary; they should also be somewhat familiar with basic set theory, algebra and logic.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Features and topics: • Provides many pedagogical tools, such as slides and solutions for lecturers via the author's website • Unifies the concepts and notations used in the various approaches of parsing algorithms • Concepts are illustrated with many realistic examples, to ease the understanding of the theory and the transfer to applications • Theoretical models of automata, transducers and formal grammars are used extensively • Algorithms are described in a pseudocode to avoid the disturbing details of a programming language, yet they are straightforward to convert to executable procedures • Coverage of the algorithms for processing regular expressions and finiteautomata is concise and complete • Systematically discusses ambiguous forms, allowing readers to avoid pitfalls when designing grammars • Unifies the concepts and notations used in different approaches,</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">thus extending methods coverage with a reduced definitional apparatus • Introduces static program analysis, moving from the baseline reached with finite automata and local languages This comprehensive and clearly written text, based on many years of course instruction, will be welcomed as the ideal guide to the fundamentals of this field by advanced undergraduate and graduate students in computer science and computer engineering. Stefano Crespi Reghizzi is a full professor of computer science at the Politecnico di Milano, Milan, Italy, where he has numerous years of experience teaching formal languages and compiler technology. In addition, he leads the department's compiler research group. [Barcode] ISBN 978-1-84882-049-4 [URL] springer.com</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Science Logic and Foundations of Programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Compilers and Interpreters</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Formal Languages and Automata Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Compilers (Computer programs)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781848820494</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781848820562</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781849968171</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-84882-050-0</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-SCS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2009</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-035459622</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-84882-050-0</subfield><subfield code="l">DE-355</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="q">UBR Paketkauf 2024</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV050122752 |
| illustrated | Not Illustrated |
| indexdate | 2025-02-10T13:10:23Z |
| institution | BVB |
| isbn | 9781848820500 |
| issn | 1868-095X |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-035459622 |
| oclc_num | 1492136362 |
| open_access_boolean | |
| owner | DE-355 DE-BY-UBR |
| owner_facet | DE-355 DE-BY-UBR |
| physical | 1 Online-Ressource (XII, 368 Seiten 100 illus.) |
| psigel | ZDB-1-SCS ZDB-2-SCS_2009 ZDB-2-SCS UBR Paketkauf 2024 |
| publishDate | 2009 |
| publishDateSearch | 2009 |
| publishDateSort | 2009 |
| publisher | Springer London |
| record_format | marc |
| series2 | Texts in Computer Science |
| spelling | Crespi Reghizzi, Stefano Verfasser aut Formal Languages and Compilation by Stefano Crespi Reghizzi 1st ed. 2009 London Springer London 2009 1 Online-Ressource (XII, 368 Seiten 100 illus.) txt rdacontent c rdamedia cr rdacarrier Texts in Computer Science 1868-095X Whereas many textbooks on formal languages and compilation focus on technological aspects, it is the elegance and simplicity of the underlying *theory* that allows students to acquire the fundamental paradigms of language structures, to avoid pitfalls such as ambiguity, and to adequately map structure to meaning. Formal Languages and Compilation covers the fundamental concepts of formal languages and compilation, which are central to computer science and based on well-consolidated principles. It presents a comprehensive selection of topics and is based on rigorous definitions and algorithms, illustrated by many motivating examples, with a focus on the importance of combining theoretical concepts with practical applications. In a clear, reader-friendly and simple minimalist way, this uniquely versatile textbook provides the essential principles and methods used for defining the syntax of artificial languages and implementing simple translators, as well as for designing syntax-directed translators. Readers require some background in programming, although detailed knowledge of a specific programming language is not necessary; they should also be somewhat familiar with basic set theory, algebra and logic. Features and topics: • Provides many pedagogical tools, such as slides and solutions for lecturers via the author's website • Unifies the concepts and notations used in the various approaches of parsing algorithms • Concepts are illustrated with many realistic examples, to ease the understanding of the theory and the transfer to applications • Theoretical models of automata, transducers and formal grammars are used extensively • Algorithms are described in a pseudocode to avoid the disturbing details of a programming language, yet they are straightforward to convert to executable procedures • Coverage of the algorithms for processing regular expressions and finiteautomata is concise and complete • Systematically discusses ambiguous forms, allowing readers to avoid pitfalls when designing grammars • Unifies the concepts and notations used in different approaches, thus extending methods coverage with a reduced definitional apparatus • Introduces static program analysis, moving from the baseline reached with finite automata and local languages This comprehensive and clearly written text, based on many years of course instruction, will be welcomed as the ideal guide to the fundamentals of this field by advanced undergraduate and graduate students in computer science and computer engineering. Stefano Crespi Reghizzi is a full professor of computer science at the Politecnico di Milano, Milan, Italy, where he has numerous years of experience teaching formal languages and compiler technology. In addition, he leads the department's compiler research group. [Barcode] ISBN 978-1-84882-049-4 [URL] springer.com Computer Science Logic and Foundations of Programming Compilers and Interpreters Formal Languages and Automata Theory Computer science Compilers (Computer programs) Machine theory Erscheint auch als Druck-Ausgabe 9781848820494 Erscheint auch als Druck-Ausgabe 9781848820562 Erscheint auch als Druck-Ausgabe 9781849968171 https://doi.org/10.1007/978-1-84882-050-0 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Crespi Reghizzi, Stefano Formal Languages and Compilation Whereas many textbooks on formal languages and compilation focus on technological aspects, it is the elegance and simplicity of the underlying *theory* that allows students to acquire the fundamental paradigms of language structures, to avoid pitfalls such as ambiguity, and to adequately map structure to meaning. Formal Languages and Compilation covers the fundamental concepts of formal languages and compilation, which are central to computer science and based on well-consolidated principles. It presents a comprehensive selection of topics and is based on rigorous definitions and algorithms, illustrated by many motivating examples, with a focus on the importance of combining theoretical concepts with practical applications. In a clear, reader-friendly and simple minimalist way, this uniquely versatile textbook provides the essential principles and methods used for defining the syntax of artificial languages and implementing simple translators, as well as for designing syntax-directed translators. Readers require some background in programming, although detailed knowledge of a specific programming language is not necessary; they should also be somewhat familiar with basic set theory, algebra and logic. Features and topics: • Provides many pedagogical tools, such as slides and solutions for lecturers via the author's website • Unifies the concepts and notations used in the various approaches of parsing algorithms • Concepts are illustrated with many realistic examples, to ease the understanding of the theory and the transfer to applications • Theoretical models of automata, transducers and formal grammars are used extensively • Algorithms are described in a pseudocode to avoid the disturbing details of a programming language, yet they are straightforward to convert to executable procedures • Coverage of the algorithms for processing regular expressions and finiteautomata is concise and complete • Systematically discusses ambiguous forms, allowing readers to avoid pitfalls when designing grammars • Unifies the concepts and notations used in different approaches, thus extending methods coverage with a reduced definitional apparatus • Introduces static program analysis, moving from the baseline reached with finite automata and local languages This comprehensive and clearly written text, based on many years of course instruction, will be welcomed as the ideal guide to the fundamentals of this field by advanced undergraduate and graduate students in computer science and computer engineering. Stefano Crespi Reghizzi is a full professor of computer science at the Politecnico di Milano, Milan, Italy, where he has numerous years of experience teaching formal languages and compiler technology. In addition, he leads the department's compiler research group. [Barcode] ISBN 978-1-84882-049-4 [URL] springer.com Computer Science Logic and Foundations of Programming Compilers and Interpreters Formal Languages and Automata Theory Computer science Compilers (Computer programs) Machine theory |
| title | Formal Languages and Compilation |
| title_auth | Formal Languages and Compilation |
| title_exact_search | Formal Languages and Compilation |
| title_full | Formal Languages and Compilation by Stefano Crespi Reghizzi |
| title_fullStr | Formal Languages and Compilation by Stefano Crespi Reghizzi |
| title_full_unstemmed | Formal Languages and Compilation by Stefano Crespi Reghizzi |
| title_short | Formal Languages and Compilation |
| title_sort | formal languages and compilation |
| topic | Computer Science Logic and Foundations of Programming Compilers and Interpreters Formal Languages and Automata Theory Computer science Compilers (Computer programs) Machine theory |
| topic_facet | Computer Science Logic and Foundations of Programming Compilers and Interpreters Formal Languages and Automata Theory Computer science Compilers (Computer programs) Machine theory |
| url | https://doi.org/10.1007/978-1-84882-050-0 |
| work_keys_str_mv | AT crespireghizzistefano formallanguagesandcompilation |