000			04477nam a22003615i 4500
001			291164
003			MX-SnUAN
005			20160429154834.0
007			cr nn 008mamaa
008			150903s2009 xxk| o |||| 0|eng d
020			_a9781848820500 _99781848820500
024	7		_a10.1007/9781848820500 _2doi
035			_avtls000344346
039		9	_a201509030358 _bVLOAD _c201405050306 _dVLOAD _y201402061254 _zstaff
040			_aMX-SnUAN _bspa _cMX-SnUAN _erda
100	1		_aCrespi Reghizzi, Stefano. _eautor _9315195
245	1	0	_aFormal Languages and Compilation / _cby Stefano Crespi Reghizzi.
264		1	_aLondon : _bSpringer London, _c2009.
300			_axii, 368 páginas 100 ilustraciones _brecurso en línea.
336			_atexto _btxt _2rdacontent
337			_acomputadora _bc _2rdamedia
338			_arecurso en línea _bcr _2rdacarrier
347			_aarchivo de texto _bPDF _2rda
490	0		_aTexts in Computer Science, _x1868-0941
500			_aSpringer eBooks
505	0		_aSyntax -- Finite Automata as Regular Language Recognizers -- Pushdown Automata and Top-down Parsing -- Bottom-Up and General Parsing -- Translation Semantics and Static Analysis.
520			_aWhereas 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 finite automata 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
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9781848820494
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-1-84882-050-0 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c291164 _d291164