Formal Languages and Compilation
Seiten
2009
Springer London Ltd (Verlag)
978-1-84882-049-4 (ISBN)
Springer London Ltd (Verlag)
978-1-84882-049-4 (ISBN)
- Titel erscheint in neuer Auflage
- Artikel merken
Zu diesem Artikel existiert eine Nachauflage
This comprehensive book covers the fundamental concepts of formal languages and compilation. It presents the subject in a minimalist way, using illustrated examples throughout and providing pedagogical tools, such as slides for lecturers via website.
This book covers the fundamentals concepts of formal languages and compilation. The book presents the subject in a clear, reader-friendly and simple minimalist way, presenting the principles and methods used for defining the syntax of artificial languages and to implement simple translators, as well as in designing syntax-directed translators. Features: 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 application; theoretical models of automata, transducers and formal grammars are used extensively; algorithms are described in a pseudo-code to avoid the disturbing details of a programming language, yet they are straightforward to convert to executable procedures; problems and solutions are available via an author website. This comprehensive and clearly written text will be welcomed by graduate students as the ideal guide to the fundamentals of this field.
This book covers the fundamentals concepts of formal languages and compilation. The book presents the subject in a clear, reader-friendly and simple minimalist way, presenting the principles and methods used for defining the syntax of artificial languages and to implement simple translators, as well as in designing syntax-directed translators. Features: 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 application; theoretical models of automata, transducers and formal grammars are used extensively; algorithms are described in a pseudo-code to avoid the disturbing details of a programming language, yet they are straightforward to convert to executable procedures; problems and solutions are available via an author website. This comprehensive and clearly written text will be welcomed by graduate students as the ideal guide to the fundamentals of this field.
Introduction.- Syntax.- Finite Automata and Recognition of Regular Languages.- Phrases Recognition and Parsing.- Translation, Semantic, and Static Analysis.- Appendix: Case Studies.- Index.
| Reihe/Serie | Texts in Computer Science |
|---|---|
| Zusatzinfo | 1, black & white illustrations |
| Verlagsort | England |
| Sprache | englisch |
| Maße | 156 x 234 mm |
| Gewicht | 708 g |
| Themenwelt | Informatik ► Theorie / Studium ► Compilerbau |
| ISBN-10 | 1-84882-049-6 / 1848820496 |
| ISBN-13 | 978-1-84882-049-4 / 9781848820494 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
a beginner's guide to learning llvm compiler tools and core …
Buch | Softcover (2024)
Packt Publishing Limited (Verlag)
CHF 69,80
