Bültmann & Gerriets
Formal Languages and Compilation
von Stefano Crespi Reghizzi
Verlag: Springer London
Reihe: Texts in Computer Science
Hardcover
ISBN: 978-1-84996-817-1
Auflage: Softcover reprint of hardcover 1st ed. 2009
Erschienen am 21.10.2010
Sprache: Englisch
Format: 235 mm [H] x 155 mm [B] x 21 mm [T]
Gewicht: 569 Gramm
Umfang: 376 Seiten

Preis: 74,89 €
keine Versandkosten (Inland)


Dieser Titel wird erst bei Bestellung gedruckt. Eintreffen bei uns daher ca. am 29. Oktober.

Der Versand innerhalb der Stadt erfolgt in Regel am gleichen Tag.
Der Versand nach außerhalb dauert mit Post/DHL meistens 1-2 Tage.

74,89 €
merken
klimaneutral
Der Verlag produziert nach eigener Angabe noch nicht klimaneutral bzw. kompensiert die CO2-Emissionen aus der Produktion nicht. Daher übernehmen wir diese Kompensation durch finanzielle Förderung entsprechender Projekte. Mehr Details finden Sie in unserer Klimabilanz.
Klappentext
Inhaltsverzeichnis

State of books on compilers The book collects and condenses the experience of years of teaching compiler courses and doing research on formal language theory, on compiler and l- guage design, and to a lesser extent on natural language processing. In the turmoil of information technology developments, the subject of the book has kept the same fundamental principles over half a century, and its relevance for theory and practice is as important as in the early days. This state of a?airs of a topic, which is central to computer science and is based on consolidated principles, might lead us to believe that the acc- panying textbooks are by now consolidated, much as the classical books on mathematics. In fact this is rather not true: there exist ?ne books on the mathematical aspects of language and automata theory, but the best books on translators are sort of encyclopaedias of algorithms, design methods, and practical know-how used in compiler design. Indeed a compiler is a mic- cosm,featuring avarietyofaspectsrangingfromalgorithmicwisdomto CPU andmemoryexploitation.Asaconsequencethetextbookshavegrowninsize, and compete with respect to their coverage of the last developments on p- gramming languages, processor architectures and clever mappings from the former to the latter.



Syntax.- Finite Automata as Regular Language Recognizers.- Pushdown Automata and Top-down Parsing.- Bottom-Up and General Parsing.- Translation Semantics and Static Analysis.


weitere Titel der Reihe