Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
LR parsing: theory and practice
Chapman N., Cambridge University Press, New York, NY, 1987. Type: Book (9789780521304139)
Date Reviewed: Sep 1 1988

In judging this work, it is important to take into account its intended audience:

LR parsing has become a widely used method of syntax analysis; this is largely due to the availability of parser generators and compiler-compilers based on LR techniques. . . . [This text] is aimed primarily at users of LR parsers who believe that it is undesirable to use complex tools without understanding how they work (from the Preface).

This, then, is not a textbook; in an academic setting, it would only be useful as a reference for compiler writing projects. The reader should have a background of undergraduate courses in both formal languages and compiler design or the equivalent and intend to write an LR parser (probably for production purposes), possibly with the aid of a parser-writing tool such as Yacc.

Chapters 2–5 concentrate on LR theory. This book, like many recent publications in formal languages and compiler design, attempts to tie the two subjects closer together. Despite the statement in the preface that other books on LR parsing “are either superficial or are weighed down with tedious mathematical detail of a merely technical nature,” this book tends to get bogged down in mathematics in these chapters, more so than some of the other recent compiler textbooks. However, it is possible that the author was trying to find a level of mathematical detail that, while not too difficult, would also not be seen as talking down to his audience; remember that the reader should have already had a course in compilers.

The remaining chapters (6 through 10) concentrate on implementation and are much more readable. The level of detail in these chapters allows the reader to understand more fully how to write a parser for production purposes. The final chapter, on LR parser generators, gives a state-of-the-art view of this topic. The author makes some intelligent predictions on the future of LR parser generators at the end of this chapter.

The book is long enough to cover the subject in detail, yet short enough that it has a chance to gain a wide audience with the aid of its (hopefully) inexpensive price tag. This work is for the most part readable, with an adequate index and bibliography. Overall, it will make a good reference for compiler writers and academicians teaching in this area.

Reviewer:  Donald Bagert Review #: CR112648
Bookmark and Share
 
Parsing (F.4.2 ... )
 
 
Classes Defined By Grammars Or Automata (F.4.3 ... )
 
 
Parsing (D.3.4 ... )
 
 
Translator Writing Systems And Compiler Generators (D.3.4 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Parsing": Date
Parsing theory volume 2: LR(K) and LL(K) parsing
Sippu S., Soisalon-Soininen E., Springer-Verlag New York, Inc., New York, NY, 1990. Type: Book (9780387517322)
Oct 1 1991
Upper bounds on the size of LR(k) parsers
Ukkonen E. Information Processing Letters 20(2): 99-103, 1985. Type: Article
Nov 1 1985
Parsing theory. Vol. 1: languages and parsing
Sippu S., Soisalon-Soininen E., Springer-Verlag New York, Inc., New York, NY, 1988. Type: Book (9789780387137209)
Jul 1 1989
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy