Become a Readings Member to make your shopping experience even easier. Sign in or sign up for free!

Become a Readings Member. Sign in or sign up for free!

Hello Readings Member! Go to the member centre to view your orders, change your details, or view your lists, or sign out.

Hello Readings Member! Go to the member centre or sign out.

Parsing Theory: Volume I Languages and Parsing
Hardback

Parsing Theory: Volume I Languages and Parsing

$138.99
Sign in or become a Readings Member to add this title to your wishlist.

This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.

The entire work Parsing Theory appears in two volumes, Volume I: Languages and Parsing and Volume II: LR(k) and LL(k) Parsing . The two volumes form an integral work. Volume I is an introduction to the basic concepts of languages and parsing, and it also contains the relevant mathematical and computer scientific background needed in the development of the theory of deterministic parsing; it deals with topics such as algorithms on relations and graphs, regular languages and lexical analysis, context-free languages, left parsers and right parsers, strong LL(k) parsers and their implementation, simple precedence parsers. Volume II contains a thorough treatment of the theory of LR(k) and LL(k) parsing. Parsing Theory is a contemporary reference work on the theory of deterministic parsing of context-free languages. It emphasizes the LR(k) and LL(k) methods, which are developed in a uniform manner and pays special attention to their efficient implementation. Construction algorithms for parsers are derived from general graph-theoretic methods. Complexity questions about parsable grammars are analyzed. The work can be used as a textbook for graduate-level and senior undergraduate-level courses on parsing theory and compiler design. A one-semester course on the basic theory of languages and parsing can be taught from Volume I.

Read More
In Shop
Out of stock
Shipping & Delivery

$9.00 standard shipping within Australia
FREE standard shipping within Australia for orders over $100.00
Express & International shipping calculated at checkout

MORE INFO
Format
Hardback
Publisher
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Country
Germany
Date
1 July 1988
Pages
228
ISBN
9783540137207

This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.

The entire work Parsing Theory appears in two volumes, Volume I: Languages and Parsing and Volume II: LR(k) and LL(k) Parsing . The two volumes form an integral work. Volume I is an introduction to the basic concepts of languages and parsing, and it also contains the relevant mathematical and computer scientific background needed in the development of the theory of deterministic parsing; it deals with topics such as algorithms on relations and graphs, regular languages and lexical analysis, context-free languages, left parsers and right parsers, strong LL(k) parsers and their implementation, simple precedence parsers. Volume II contains a thorough treatment of the theory of LR(k) and LL(k) parsing. Parsing Theory is a contemporary reference work on the theory of deterministic parsing of context-free languages. It emphasizes the LR(k) and LL(k) methods, which are developed in a uniform manner and pays special attention to their efficient implementation. Construction algorithms for parsers are derived from general graph-theoretic methods. Complexity questions about parsable grammars are analyzed. The work can be used as a textbook for graduate-level and senior undergraduate-level courses on parsing theory and compiler design. A one-semester course on the basic theory of languages and parsing can be taught from Volume I.

Read More
Format
Hardback
Publisher
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Country
Germany
Date
1 July 1988
Pages
228
ISBN
9783540137207