國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Techniques for searching, parsing, a...

Pettorossi, A.

Techniques for searching, parsing, and matching

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Techniques for searching, parsing, and matchingby Alberto Pettorossi.
作者:	Pettorossi, A.
出版者:	Cham :Springer International Publishing :2021.
面頁冊數:	viii, 310 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Graph theory.
電子資源:	https://doi.org/10.1007/978-3-030-63189-5
ISBN:	9783030631895$q(electronic bk.)

Techniques for searching, parsing, and matching
Pettorossi, A.

Techniques for searching, parsing, and matching[electronic resource] /by Alberto Pettorossi. - Cham :Springer International Publishing :2021. - viii, 310 p. :ill. (some col.), digital ;24 cm.

Preliminary Definitions on Languages and Grammars -- Exploring Search Spaces -- Chop-and-Expand Parsers for Context-Free Languages -- Parsers for Deterministic Context-Free Languages: LL(k) Parsers -- Parsers for Deterministic Context-Free Languages: LR(k) Parsers -- Parsers for Operator Grammars and Parser Generators -- Visits of Trees and Graphs and Evaluation of Expressions -- Path Problems in Directed Graphs -- String Matching -- Supplementary Topics -- List of Algorithms and Programs -- Index -- Bibliography.

In this book the author presents some techniques for exploring trees and graphs. He illustrates the linear search technique and the backtracking technique, and as instances of tree exploration methods he presents various algorithms for parsing subclasses of context-free languages. He also illustrates some tree and graph exploration and manipulation methods by presenting, among others, algorithms for visiting trees, evaluating Boolean expressions, proving propositional formulas, computing paths in graphs, and performing string matching. This book has been used for advanced undergraduate and graduate courses on automata and formal languages, and assumes some prior exposure to the basic notions in that area. Sample programs are presented in Java and Prolog.

ISBN: 9783030631895$q(electronic bk.)

Standard No.: 10.1007/978-3-030-63189-5doiSubjects--Topical Terms:

181880
Graph theory.

LC Class. No.: QA166 / .P48 2021

Dewey Class. No.: 511.5

Techniques for searching, parsing, and matching
LDR:02286nmm a2200337 a 4500 001 612279
003 DE-He213
005 20220103140115.0
006 m d
007 cr nn 008maaau
008 220526s2021 sz s 0 eng d
020 $a 9783030631895$q(electronic bk.)
020 $a 9783030631888$q(paper)
024 7 $a 10.1007/978-3-030-63189-5 $2 doi
035 $a 978-3-030-63189-5
040 $a GP $c GP
041 0 $a eng
050 4 $a QA166 $b .P48 2021
072 7 $a UY $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UY $2 thema
072 7 $a UYA $2 thema
082 0 4 $a 511.5 $2 23
090 $a QA166 $b .P511 2021
100 1 $a Pettorossi, A. $3 910687
245 1 0 $a Techniques for searching, parsing, and matching $h [electronic resource] / $c by Alberto Pettorossi.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a viii, 310 p. : $b ill. (some col.), digital ; $c 24 cm.
505 0 $a Preliminary Definitions on Languages and Grammars -- Exploring Search Spaces -- Chop-and-Expand Parsers for Context-Free Languages -- Parsers for Deterministic Context-Free Languages: LL(k) Parsers -- Parsers for Deterministic Context-Free Languages: LR(k) Parsers -- Parsers for Operator Grammars and Parser Generators -- Visits of Trees and Graphs and Evaluation of Expressions -- Path Problems in Directed Graphs -- String Matching -- Supplementary Topics -- List of Algorithms and Programs -- Index -- Bibliography.
520 $a In this book the author presents some techniques for exploring trees and graphs. He illustrates the linear search technique and the backtracking technique, and as instances of tree exploration methods he presents various algorithms for parsing subclasses of context-free languages. He also illustrates some tree and graph exploration and manipulation methods by presenting, among others, algorithms for visiting trees, evaluating Boolean expressions, proving propositional formulas, computing paths in graphs, and performing string matching. This book has been used for advanced undergraduate and graduate courses on automata and formal languages, and assumes some prior exposure to the basic notions in that area. Sample programs are presented in Java and Prolog.
650 0 $a Graph theory. $3 181880
650 0 $a Parsing (Computer grammar) $3 274468
650 1 4 $a Theory of Computation. $3 274475
650 2 4 $a Software Engineering/Programming and Operating Systems. $3 273711
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
856 4 0 $u https://doi.org/10.1007/978-3-030-63189-5
950 $a Computer Science (SpringerNature-11645)