國立虎尾科技大學 |

Formal Languages and Compilation

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Formal Languages and Compilation/ by Stefano Crespi Reghizzi, Luca Breveglieri, Angelo Morzenti.
作者:	Crespi Reghizzi, Stefano.
其他作者:	Breveglieri, Luca.
面頁冊數:	XIII, 499 p. 486 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Mathematical logic. -
電子資源:	https://doi.org/10.1007/978-3-030-04879-2
ISBN:	9783030048792

Formal Languages and Compilation
Crespi Reghizzi, Stefano.

Formal Languages and Compilation[electronic resource] /by Stefano Crespi Reghizzi, Luca Breveglieri, Angelo Morzenti. - 3rd ed. 2019. - XIII, 499 p. 486 illus.online resource. - Texts in Computer Science,1868-0941. - Texts in Computer Science,.

Introduction -- Syntax -- Finite Automata as Regular Language Recognizers -- Pushdown Automata and Parsing -- Translation Semantics and Static Analysis.

This classroom-tested and clearly-written textbook presents a focused guide to the conceptual foundations of compilation, explaining the fundamental principles and algorithms used for defining the syntax of languages, and for implementing simple translators. This significantly updated and expanded third edition has been enhanced with additional coverage of regular expressions, visibly pushdown languages, bottom-up and top-down deterministic parsing algorithms, and new grammar models. Topics and features: Describes the principles and methods used in designing syntax-directed applications such as parsing and regular expression matching Covers translations, semantic functions (attribute grammars), and static program analysis by data flow equations Introduces an efficient method for string matching and parsing suitable for ambiguous regular expressions (NEW) Presents a focus on extended BNF grammars with their general parser and with LR(1) and LL(1) parsers (NEW) Introduces a parallel parsing algorithm that exploits multiple processing threads to speed up syntax analysis of large files Discusses recent formal models of input-driven automata and languages (NEW) Includes extensive use of theoretical models of automata, transducers and formal grammars, and describes all algorithms in pseudocode Contains numerous illustrative examples, and supplies a large set of exercises with solutions at an associated website Advanced undergraduate and graduate students of computer science will find this reader-friendly textbook to be an invaluable guide to the essential concepts of syntax-directed compilation. The fundamental paradigms of language structures are elegantly explained in terms of the underlying theory, without requiring the use of software tools or knowledge of implementation, and through algorithms simple enough to be practiced by paper and pencil. The authors are Professors (Dr. Stefano Crespi Reghizzi is Emeritus Professor) of Computer Engineering at the Politecnico di Milano, Italy.

ISBN: 9783030048792

Standard No.: 10.1007/978-3-030-04879-2doiSubjects--Topical Terms:

810627
Mathematical logic.

LC Class. No.: QA8.9-10.3

Dewey Class. No.: 005.131

Formal Languages and Compilation
LDR:03520nam a22003975i 4500 001 1006830
003 DE-He213
005 20200702114552.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030048792 $9 978-3-030-04879-2
024 7 $a 10.1007/978-3-030-04879-2 $2 doi
035 $a 978-3-030-04879-2
050 4 $a QA8.9-10.3
072 7 $a UYA $2 bicssc
072 7 $a MAT018000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 005.131 $2 23
100 1 $a Crespi Reghizzi, Stefano. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 897944
245 1 0 $a Formal Languages and Compilation $h [electronic resource] / $c by Stefano Crespi Reghizzi, Luca Breveglieri, Angelo Morzenti.
250 $a 3rd ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XIII, 499 p. 486 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Texts in Computer Science, $x 1868-0941
505 0 $a Introduction -- Syntax -- Finite Automata as Regular Language Recognizers -- Pushdown Automata and Parsing -- Translation Semantics and Static Analysis.
520 $a This classroom-tested and clearly-written textbook presents a focused guide to the conceptual foundations of compilation, explaining the fundamental principles and algorithms used for defining the syntax of languages, and for implementing simple translators. This significantly updated and expanded third edition has been enhanced with additional coverage of regular expressions, visibly pushdown languages, bottom-up and top-down deterministic parsing algorithms, and new grammar models. Topics and features: Describes the principles and methods used in designing syntax-directed applications such as parsing and regular expression matching Covers translations, semantic functions (attribute grammars), and static program analysis by data flow equations Introduces an efficient method for string matching and parsing suitable for ambiguous regular expressions (NEW) Presents a focus on extended BNF grammars with their general parser and with LR(1) and LL(1) parsers (NEW) Introduces a parallel parsing algorithm that exploits multiple processing threads to speed up syntax analysis of large files Discusses recent formal models of input-driven automata and languages (NEW) Includes extensive use of theoretical models of automata, transducers and formal grammars, and describes all algorithms in pseudocode Contains numerous illustrative examples, and supplies a large set of exercises with solutions at an associated website Advanced undergraduate and graduate students of computer science will find this reader-friendly textbook to be an invaluable guide to the essential concepts of syntax-directed compilation. The fundamental paradigms of language structures are elegantly explained in terms of the underlying theory, without requiring the use of software tools or knowledge of implementation, and through algorithms simple enough to be practiced by paper and pencil. The authors are Professors (Dr. Stefano Crespi Reghizzi is Emeritus Professor) of Computer Engineering at the Politecnico di Milano, Italy.
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 0 $a Programming languages (Electronic computers). $3 1127615
650 1 4 $a Mathematical Logic and Formal Languages. $3 670059
650 2 4 $a Programming Languages, Compilers, Interpreters. $3 669782
700 1 $a Breveglieri, Luca. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1078794
700 1 $a Morzenti, Angelo. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1078795
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030048785
776 0 8 $i Printed edition: $z 9783030048808
830 0 $a Texts in Computer Science, $x 1868-0941 $3 1254292
856 4 0 $u https://doi.org/10.1007/978-3-030-04879-2
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)