Excerpt from A Practical Method for Constructing Efficient Lalr(k) Parsers With Automatic Error Recovery: March 1991
One of the most important issues in LR parsing is to find suitable data structures for these parsing tables whose space requirement is. At worst. Proportional to the number of useful entries in the tables but whose time-efficiency is comparable to that of the matrix representation. Another important issue is that of providing an efficient error recovery svstem for this parsing framework. In particular, the lr) variants lose the inherent ability of their canonical counterpart to detect an error at the earliest possible point.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"synopsis" may belong to another edition of this title.
Seller: Forgotten Books, London, United Kingdom
Paperback. Condition: New. Print on Demand. This book delves into the intricate world of LR parsing, a technique pivotal in computer science for analyzing and interpreting programming languages. Emerging from the foundational work of Knuth in the 1960s, LR parsing has evolved into various forms, each with its strengths and limitations. The author meticulously examines LALR(k) parsing, renowned for its efficiency and ability to handle a wide range of programming language constructs. Central to the book's exploration is the challenge of constructing efficient LALR(k) parsers, especially when dealing with the complexities of lookahead, which involves predicting upcoming symbols in the input stream. The author introduces a novel framework for creating LALR(k) parsers with variable-length lookahead strings, optimizing the parsing process. Additionally, the book tackles the critical issue of error recovery in parsing, presenting a fully automated and effective method for identifying and rectifying errors during language processing. Beyond parsing algorithms, the book delves into the optimization and generation of parsing tables, crucial data structures that guide the parser's actions. The author presents innovative techniques for compressing these tables, reducing their memory footprint without compromising parsing speed. Through its comprehensive analysis and practical solutions, this book illuminates the intricacies of LALR(k) parsing, offering invaluable insights for compiler construction, code generation, and language processing applications. The author's contributions pave the way for more robust and efficient parsers, enhancing the reliability and performance of software systems. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Seller Inventory # 9781332180387_0
Quantity: Over 20 available
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332180387
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332180387
Quantity: 15 available