Parsing Techniques: A Practical Guide (Monographs in Computer Science) | 
enlarge | Authors: Dick Grune, Ceriel J. H. Jacobs Publisher: Springer Category: Book
List Price: $69.95 Buy New: $52.45 You Save: $17.50 (25%)
New (23) Used (10) from $44.95
Rating: 4 reviews Sales Rank: 320157
Media: Hardcover Edition: 2nd Pages: 662 Number Of Items: 1 Shipping Weight (lbs): 2.3 Dimensions (in): 9.3 x 6.3 x 1.4
ISBN: 038720248X Dewey Decimal Number: 005 EAN: 9780387202488
Publication Date: November 28, 2007 Availability: Usually ships in 1-2 business days Shipping: Expedited shipping available Shipping: International shipping available Condition: New book, ships out within 24 hours, 100% satisfaction guaranteed, may have slight shelf wear
| |
| Similar Items:
|
| Editorial Reviews:
Product Description
Parsing, also referred to as syntax analysis, has been and continues to be an essential part of computer science and linguistics. Today, parsing techniques are also implemented in a number of other disciplines, including but not limited to, document preparation and conversion, typesetting chemical formulae, and chromosome recognition. This second edition presents new developments and discoveries that have been made in the field. Parsing techniques have grown considerably in importance, both in computational linguistics where such parsers are the only option, and computer science, where advanced compilers often use general CF parsers. Parsing techniques provide a solid basis for compiler construction and contribute to all existing software: enabling Web browsers to analyze HTML pages and PostScript printers to analyze PostScript. Some of the more advanced techniques are used in code generation in compilers and in data compression. In linguistics, the importance of formal grammars was recognized early on, but only recently have the corresponding parsing techniques been applied. Also their importance as general pattern recognizers is slowly being acknowledged. This text Parsing Techniques explores new developments, such as generalized deterministic parsing, linear-time substring parsing, parallel parsing, parsing as intersection, non-canonical methods, and non-Chomsky systems. To provide readers with low-threshold access to the full field of parsing techniques, this new edition uses a two-tiered structure. The basic ideas behind the dozen or so existing parsing techniques are explained in an intuitive and narrative style, and problems are presented at the conclusion of each chapter, allowing the reader to step outside the bounds of the covered material and explore parsing techniques at various levels. The reader is also provided with an extensive annotated bibliography as well as hints and partial solutions to a number of problems. In the bibliography, hundreds of realizations and improvements of parsing techniques are explained in a much terser, yet still informal, style, improving its readability and usability. The reader should have an understanding of algorithmic thinking, especially recursion; however, knowledge of any particular programming language is not required.
|
| Customer Reviews:
This edition is NOT available on-line January 22, 2008 Robert L. Knighten (The Dalles, Oregon United States) 5 out of 5 found this review helpful
The first edition is available at Grune's web site but this very much expanded second edition is not.
The clearest, most comprehensive survey of the field January 26, 2008 Joshua Haberman (Seattle, WA USA) 14 out of 14 found this review helpful
I have spent the last six months of my life learning as much as I can about parsing. I own half a shelf of compiler books, and I have flipped through the pages of half a shelf more. No other book approaches the clarity and comprehensiveness of this book. When you try to read most literature about parsing, authors tend to throw around a lot of terms without explaining them. What exactly is a "deterministic" parser, a "canonical" parser, a "directional" parser? Grune and Jacobs explain every one of these distinctions lucidly, and put all known algorithms in context of how they compare to the rest of the field. How do the algorithms compare in what languages they can parse, how fast they are, and how much of the work can be done ahead of time? The book addresses all of these trade-offs, but doesn't stop at asymptotic complexity: in chapter 17 (the comparative survey), they note that general parsers may be a factor of ten or so slower than deterministic methods, even though both are linear. This high-level overview and comparative survey are something I was desperately seeking, and I've found nothing comparable to them anywhere. There is also a lot of important background information that other authors tend to assume you know: for example, did you know that when authors say "LL" they almost always mean "strong LL" unless they specifically say "full LL?" Are you totally clear on the difference between strong LL, simple LL, and full LL? If you're not sure, Grune and Jacobs will give you all the explanation you need to fully understand. This book strikes a perfect balance between breadth and depth. All significant algorithms are covered, most with enough detail to fully understand and implement them, but Grune and Jacobs punt on less practical material like proofs or rigorous formal descriptions. That information is never more than a citation away though, thanks to the 417-entry annotated bibliography, which gives you not only references to source material but a paragraph or two describing their key results. I couldn't be happier about adding this book to my bookshelf of compiler books -- it quickly became the book I refer to most often, and I thank Grune and Jacobs for this superb guide to this vast and diverse field of computer science.
available for free online January 5, 2006 Roger (New York, USA) 6 out of 9 found this review helpful
just google the first author. he has the pdf version online.
make it approachable October 7, 2002 Dhiren (India) 3 out of 5 found this review helpful
After searching all over for a way to understand the translation field and looking the dragon book and all, this is a great find. I am a practicing software engineer with training in electronics (good old forgotten days) and did not like math classes. This book is a great way to make this topic approachable for a practicing industry developer. Admittedly is a difficult read but if you want to understand something it needs the effort. If you cannot read the # * + etc in the other compiler books this books makes it comprehendible.
|
|
|