ENGLISH

Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms

By Klaas Sikkel

Book information

Publisher
Springer
Year
1997
ISBN
978-3-642-64451-1, 978-3-642-60541-3
DOI
10.1007/978-3-642-60541-3
Language
english
Format
PDF
Filesize
18 MB (19044711 bytes)
Series
Texts in Theoretical Computer Science. An EATCS Series
Pages
373\373
Orientation
portrait
Paginated
no
Scanned
yes
Time added
2013-08-01 04:00:00
Algorithm Analysis and Problem Complexity; ProgramCompilersInterpreters; Artificial Intelligence (incl. Robot

Description

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.

Similar books