Cantitate/Preț
Produs
Total produse
Vezi coșul
Techniques for Searching, Parsing, and Matching de Alberto Pettorossi

Techniques for Searching, Parsing, and Matching

Autor Alberto Pettorossi
en Limba Engleză Paperback – 5 ian 2023
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 40835 lei  43-57 zile
  Springer – 5 ian 2023 40835 lei  43-57 zile
Hardback (1) 57924 lei  43-57 zile
  Springer – 4 ian 2022 57924 lei  43-57 zile

Preț: 40835 lei

Preț vechi: 51043 lei
-20% Nou

Puncte Express: 613
Preț estimativ în valută:
7225€ • 8417$ • 6309£

Carte tipărită la comandă

Livrare economică 19 ianuarie-02 februarie 26

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030631918
ISBN-10: 3030631915
Pagini: 320
Ilustrații: VIII, 310 p. 97 illus., 3 illus. in color.
Dimensiuni: 178 x 254 x 18 mm
Greutate: 0.61 kg
Ediția:1st ed. 2021
Editura: Springer
Locul publicării:Cham, Switzerland

Cuprins

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.

Notă biografică

Prof. Alberto Pettorossi is a professor of Theoretical Computer Science at the Università di Roma, Tor Vergata. He has extensive experience teaching automata, languages, algorithms, data structures, and verification to undergraduate and graduate students. His research interests and academic publications are in the areas of program transformation, program verification, and software model checking.

Textul de pe ultima copertă

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.

Caracteristici

Presents techniques for exploring trees and graphs, with particular focus on linear search and backtracking Useful for advanced undergraduate and graduate courses on automata and formal languages Sample code presented in Java and Prolog