Formal Languages and Compilation (Record no. 57959)

000 -LEADER
fixed length control field 03619nam a22004935i 4500
001 - CONTROL NUMBER
control field 978-1-4471-5514-0
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20200421112230.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 131016s2013 xxk| s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9781447155140
-- 978-1-4471-5514-0
082 04 - CLASSIFICATION NUMBER
Call Number 005.131
100 1# - AUTHOR NAME
Author Crespi Reghizzi, Stefano.
245 10 - TITLE STATEMENT
Title Formal Languages and Compilation
250 ## - EDITION STATEMENT
Edition statement 2nd ed. 2013.
300 ## - PHYSICAL DESCRIPTION
Number of Pages XII, 399 p. 171 illus., 1 illus. in color.
490 1# - SERIES STATEMENT
Series statement Texts in Computer Science,
505 0# - FORMATTED CONTENTS NOTE
Remark 2 Introduction -- Syntax -- Finite Automata as Regular Language Recognizers -- Pushdown Automata and Parsing -- Translation Semantics and Static Analysis.
520 ## - SUMMARY, ETC.
Summary, etc This 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.
700 1# - AUTHOR 2
Author 2 Breveglieri, Luca.
700 1# - AUTHOR 2
Author 2 Morzenti, Angelo.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-1-4471-5514-0
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- London :
-- Springer London :
-- Imprint: Springer,
-- 2013.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer science.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Mathematical logic.
650 14 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer Science.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Mathematical Logic and Formal Languages.
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 1868-0941
912 ## -
-- ZDB-2-SCS

No items available.