MARC Record from harvard_bibliographic_metadata

LEADER: 03383nam a22004455a 4500
001 013818844-0
005 20131206191646.0
008 131016s2013 xxk| s ||0| 0|eng d
020 $a9781447155140
020 $a9781447155140
020 $a9781447155133
024 7 $a10.1007/978-1-4471-5514-0$2doi
035 $a(Springer)9781447155140
040 $aSpringer
050 4 $aQA8.9-QA10.3
072 7 $aUYA$2bicssc
072 7 $aMAT018000$2bisacsh
072 7 $aCOM051010$2bisacsh
082 04 $a005.131$223
100 1 $aCrespi-Reghizzi, Stefano,$eauthor.
245 10 $aFormal Languages and Compilation /$cby Stefano Crespi Reghizzi, Luca Breveglieri, Angelo Morzenti.
250 $a2nd ed. 2013.
264 1 $aLondon :$bSpringer London :$bImprint: Springer,$c2013.
300 $aXII, 399 p. 171 illus., 1 illus. in color.$bonline resource.
336 $atext$btxt$2rdacontent
337 $acomputer$bc$2rdamedia
338 $aonline resource$bcr$2rdacarrier
347 $atext file$bPDF$2rda
490 1 $aTexts in Computer Science,$x1868-0941
505 0 $aIntroduction -- Syntax -- Finite Automata as Regular Language Recognizers -- Pushdown Automata and Parsing -- Translation Semantics and Static Analysis.
520 $aThis fully revised and expanded new edition elucidates the elegance and simplicity of the fundamental theory underlying Formal Languages and Compilation. Retaining the reader-friendly, minimalist style of the first edition, this uniquely versatile textbook describes the essential principles and methods used for defining the syntax of artificial languages, and for designing efficient parsing algorithms and syntax-directed translators with semantic attributes. A comprehensive selection of topics is presented within a rigorous, unified framework, illustrated by numerous practical examples. Features and topics: Presents a novel conceptual approach to parsing algorithms that applies to extended BNF grammars, together with a parallel parsing algorithm (NEW) Supplies supplementary teaching tools, including course slides and exercises with solutions, at an associated website Unifies the concepts and notations used in different approaches, enabling an extended coverage of methods with a reduced number of definitions Systematically discusses ambiguous forms, allowing readers to avoid pitfalls when designing grammars Describes all algorithms in pseudocode, so that detailed knowledge of a specific programming language is not necessary Makes extensive usage of theoretical models of automata, transducers and formal grammars Includes concise coverage of algorithms for processing regular expressions and finite automata Introduces static program analysis based on flow equations This clearly-written, classroom-tested textbook is an ideal guide to the fundamentals of this field for advanced undergraduate and graduate students in computer science and computer engineering. Some background in programming is required, and readers should also be familiar with basic set theory, algebra and logic.
650 10 $aComputer science.
650 0 $aComputer science.
650 24 $aMathematical Logic and Formal Languages.
700 1 $aMorzenti, Angelo,$eauthor.
700 1 $aBreveglieri, Luca,$eauthor.
776 08 $iPrinted edition:$z9781447155133
830 0 $aTexts in Computer Science.
988 $a20131102
906 $0VEN