Sikkel, K.: Parsing schemata : a framework for specification and analysis of parsing algorithms (1996)
0.05
0.048598986 = product of:
0.14579695 = sum of:
0.09632341 = weight(_text_:computer in 685) [ClassicSimilarity], result of:
0.09632341 = score(doc=685,freq=12.0), product of:
0.16231956 = queryWeight, product of:
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.044416238 = queryNorm
0.59341836 = fieldWeight in 685, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
3.6545093 = idf(docFreq=3109, maxDocs=44218)
0.046875 = fieldNorm(doc=685)
0.049473554 = product of:
0.09894711 = sum of:
0.09894711 = weight(_text_:programs in 685) [ClassicSimilarity], result of:
0.09894711 = score(doc=685,freq=2.0), product of:
0.25748047 = queryWeight, product of:
5.79699 = idf(docFreq=364, maxDocs=44218)
0.044416238 = queryNorm
0.38428974 = fieldWeight in 685, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.79699 = idf(docFreq=364, maxDocs=44218)
0.046875 = fieldNorm(doc=685)
0.5 = coord(1/2)
0.33333334 = coord(2/6)
- Abstract
- 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 introductions reviews the thory 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
- LCSH
- Computer algorithms
Parsing (Computer grammar)
- Subject
- Computer algorithms
Parsing (Computer grammar)
