東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Formal languages and compilation

Crespi Reghizzi, Stefano.

FindBook

Google Book

Amazon

博客來

Formal languages and compilation

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Formal languages and compilation/ by Stefano Crespi Reghizzi, Luca Breveglieri, Angelo Morzenti.
作者:	Crespi Reghizzi, Stefano.
其他作者:	Breveglieri, Luca.
出版者:	Cham :Springer International Publishing : : 2019.,
面頁冊數:	xiii, 499 p. :ill., digital ;24 cm.
內容註:	Introduction -- Syntax -- Finite Automata as Regular Language Recognizers -- Pushdown Automata and Parsing -- Translation Semantics and Static Analysis.
Contained By:	Springer eBooks
標題:	Formal languages. -
電子資源:	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. - Cham :Springer International Publishing :2019. - xiii, 499 p. :ill., digital ;24 cm. - 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:

579700
Formal languages.

LC Class. No.: QA267.3

Dewey Class. No.: 005.131

Formal languages and compilation
LDR:03218nmm a2200349 a 4500 001 2190416
003 DE-He213
005 20190418153002.0
006 m d
007 cr nn 008maaau
008 200501s2019 gw s 0 eng d
020 $a 9783030048792 $q (electronic bk.)
020 $a 9783030048785 $q (paper)
024 7 $a 10.1007/978-3-030-04879-2 $2 doi
035 $a 978-3-030-04879-2
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267.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
090 $a QA267.3 $b .C921 2019
100 1 $a Crespi Reghizzi, Stefano. $3 1005645
245 1 0 $a Formal languages and compilation $h [electronic resource] / $c by Stefano Crespi Reghizzi, Luca Breveglieri, Angelo Morzenti.
250 $a 3rd ed.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a xiii, 499 p. : $b ill., digital ; $c 24 cm.
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 Formal languages. $3 579700
650 0 $a Compiling (Electronic computers) $3 950178
650 1 4 $a Mathematical Logic and Formal Languages. $3 892517
650 2 4 $a Programming Languages, Compilers, Interpreters. $3 891123
700 1 $a Breveglieri, Luca. $3 3408864
700 1 $a Morzenti, Angelo. $3 1620916
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Texts in computer science. $3 1567573
856 4 0 $u https://doi.org/10.1007/978-3-030-04879-2
950 $a Computer Science (Springer-11645)