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. Comprehensive textbook written in a clear and reader-friendly style Illustrated with examples throughout Provides many pedagogical tools, such as slides for lecturers via website Based on many years of teaching a course on this topic INDICE: Introduction.- Syntax.- Finite Automata and Recognition of RegularLanguages.- Phrases Recognition and Parsing.- Translation, Semantic, and Static Analysis.- Appendix: Case Studies.- Index.
- ISBN: 978-1-84882-049-4
- Editorial: Springer
- Encuadernacion: Cartoné
- Páginas: 380
- Fecha Publicación: 01/01/2009
- Nº Volúmenes: 1
- Idioma: Inglés