國立虎尾科技大學 |

Techniques for Searching, Parsing, and Matching

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Techniques for Searching, Parsing, and Matching/ by Alberto Pettorossi.
Author:	Pettorossi, Alberto.
Description:	VIII, 310 p. 97 illus., 3 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computer science. -
Online resource:	https://doi.org/10.1007/978-3-030-63189-5
ISBN:	9783030631895

Techniques for Searching, Parsing, and Matching
Pettorossi, Alberto.

Techniques for Searching, Parsing, and Matching[electronic resource] /by Alberto Pettorossi. - 1st ed. 2021. - VIII, 310 p. 97 illus., 3 illus. in color.online resource.

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

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

573171
Computer science.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004.0151

Techniques for Searching, Parsing, and Matching
LDR:02628nam a22003975i 4500 001 1059510
003 DE-He213
005 20220110071552.0
007 cr nn 008mamaa
008 220414s2021 sz | s |||| 0|eng d
020 $a 9783030631895 $9 978-3-030-63189-5
024 7 $a 10.1007/978-3-030-63189-5 $2 doi
035 $a 978-3-030-63189-5
050 4 $a QA75.5-76.95
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 004.0151 $2 23
100 1 $a Pettorossi, Alberto. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1366212
245 1 0 $a Techniques for Searching, Parsing, and Matching $h [electronic resource] / $c by Alberto Pettorossi.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a VIII, 310 p. 97 illus., 3 illus. in color. $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
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 Computer science. $3 573171
650 0 $a Software engineering. $3 562952
650 1 4 $a Theory of Computation. $3 669322
650 2 4 $a Software Engineering. $3 669632
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030631888
776 0 8 $i Printed edition: $z 9783030631901
776 0 8 $i Printed edition: $z 9783030631918
856 4 0 $u https://doi.org/10.1007/978-3-030-63189-5
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)