Description
Parsing Schemata, Softcover reprint of the original 1st ed. 1997
A Framework for Specification and Analysis of Parsing Algorithms
Texts in Theoretical Computer Science. An EATCS Series
Author: Sikkel Klaas
Language: EnglishSubject for Parsing Schemata:
Publication date: 11-2013
366 p. · 15.5x23.5 cm · Paperback
366 p. · 15.5x23.5 cm · Paperback
Description
/li>Contents
/li>
Parsing, the syntactic analysis of language, has been studied extensively in computer science and computational linguistics. Computer programs and natural languages share an underlying theory of formal languages and require efficient parsing algorithms. This introduction reviews the theory of parsing from a novel perspective. It provides a formalism to capture the essential traits of a parser that abstracts from the fine detail and allows a uniform description and comparison of a variety of parsers, including Earley, Tomita, LR, Left-Corner, and Head-Corner parsers. The emphasis is on context-free phrase structure grammar and how these parsers can be extended to unification formalisms. The book combines mathematical rigor with high readability and is suitable as a graduate course text.
Foreword.- Acknowledgements.- I. Exposition.- 1. Introduction.- 2. The primordial soup framework.- II. Foundation.- 3. Tree-based parsing schemata.- 4. Item-based parsing schemata.- 5. Refinement and generalization.- 6. Filtering.- III. Application.- 7. An introduction to unification grammars.- 8. Parsing schemata for unification grammars.- 9. Topics in unification grammar parsing.- 10. Left-Corner chart parsing.- 11. Head-Corner chart parsing.- 12. Generalized LR parsing.- 13. Parallel Bottom-up Tomita parsing.- 14. Boolean circuit parsing.- 15. Conclusions.
© 2024 LAVOISIER S.A.S.