Techniques for Searching, Parsing, and Matching
- 320 Seiten
- 12 Lesestunden
The book delves into techniques for exploring trees and graphs, showcasing methods like linear search and backtracking. It provides algorithms for parsing context-free languages and explores tree and graph manipulation, including visiting trees, evaluating Boolean expressions, proving propositional formulas, computing graph paths, and string matching. Through practical examples and illustrations, the author offers a comprehensive guide to understanding and applying various exploration methods in computer science.