Parsing Schemata
A Framework for Specification and Analysis of Parsing Algorithms
by Klaas Sikkel
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.
Check nearby libraries
Buy this book
| Edition | Availability |
|---|---|
1
Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms
1997, Springer Berlin Heidelberg
electronic resource :
in English
3642644511 9783642644511
|
aaaa
|
2
|
zzzz
|
Book Details
Edition Notes
Online full text is restricted to subscribers.
Also available in print.
Mode of access: World Wide Web.
Classifications
The Physical Object
Edition Identifiers
Work Identifiers
Source records
Community Reviews (0)
Lists
History
- Created July 6, 2019
- 4 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
| March 28, 2025 | Edited by ImportBot | Redacting ocaids |
| December 25, 2021 | Edited by ImportBot | import existing book |
| October 5, 2021 | Edited by ImportBot | import existing book |
| July 6, 2019 | Created by MARC Bot | Imported from Internet Archive item record |