Parsing, the syntactic analysis of language, has been extensively studied 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 new perspective. Combining mathematical rigor with high readability, the book emphasizes context-free phrase structure grammar ami how these parsers can be extended to unification formalisms.
Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms
Klaas Sikkel
Springer
2002
366 páginas
12h 12m
ISBN-13: 9783540616504
Estatísticas
Avaliações
0 / 0- 5 estrelas0%
- 4 estrelas0%
- 3 estrelas0%
- 2 estrelas0%
- 1 estrelas0%