001441468 000__ 03142cam\a2200529Ii\4500
001441468 001__ 1441468
001441468 003__ OCoLC
001441468 005__ 20230309004741.0
001441468 006__ m\\\\\o\\d\\\\\\\\
001441468 007__ cr\un\nnnunnun
001441468 008__ 220105s2021\\\\sz\a\\\\ob\\\\001\0\eng\d
001441468 019__ $$a1291147558$$a1291172185$$a1291319090$$a1292517617
001441468 020__ $$a9783030631895$$q(electronic bk.)
001441468 020__ $$a3030631893$$q(electronic bk.)
001441468 020__ $$z9783030631888
001441468 020__ $$z3030631885
001441468 0247_ $$a10.1007/978-3-030-63189-5$$2doi
001441468 035__ $$aSP(OCoLC)1290839586
001441468 040__ $$aYDX$$beng$$erda$$epn$$cYDX$$dGW5XE$$dEBLCP$$dOCLCO$$dDKU$$dOCLCF$$dOCLCO$$dUKAHL$$dOCLCQ
001441468 049__ $$aISEA
001441468 050_4 $$aQA166$$b.P48 2021
001441468 08204 $$a511/.5$$223
001441468 1001_ $$aPettorossi, A.$$q(Alberto),$$d1947-$$eauthor.
001441468 24510 $$aTechniques for searching, parsing, and matching /$$cAlberto Pettorossi.
001441468 264_1 $$aCham :$$bSpringer,$$c[2021]
001441468 264_4 $$c©2021
001441468 300__ $$a1 online resource :$$billustrations (some color)
001441468 336__ $$atext$$btxt$$2rdacontent
001441468 337__ $$acomputer$$bc$$2rdamedia
001441468 338__ $$aonline resource$$bcr$$2rdacarrier
001441468 347__ $$atext file$$bPDF$$2rda
001441468 504__ $$aIncludes bibliographical references and index.
001441468 5050_ $$aPreliminary 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.
001441468 506__ $$aAccess limited to authorized users.
001441468 520__ $$aIn 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.
001441468 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed January 24, 2022).
001441468 650_0 $$aGraph theory.
001441468 650_0 $$aParsing (Computer grammar)
001441468 650_6 $$aAnalyse automatique (Linguistique)
001441468 655_0 $$aElectronic books.
001441468 77608 $$iPrint version: $$z3030631885$$z9783030631888$$w(OCoLC)1199328781
001441468 852__ $$bebk
001441468 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-030-63189-5$$zOnline Access$$91397441.1
001441468 909CO $$ooai:library.usi.edu:1441468$$pGLOBAL_SET
001441468 980__ $$aBIB
001441468 980__ $$aEBOOK
001441468 982__ $$aEbook
001441468 983__ $$aOnline
001441468 994__ $$a92$$bISE