Name
Abstract | ||
|---|---|---|
The present categorial approach to bottom-up parsing context free grammars treats two aspects of determinism. One is an abstraction of grammatical determinism from actual parsing strategies. The other is the transfer of determinism under grammar transformations. The approach is based on the characterization of a parse step as categorial limit, which on the one hand yields a convenient pattern for grammar type definition, and leads on the other hand in a transparent way to invariance results on deterministic grammars under homomorphic transformations. |
Year | DOI | Venue |
|---|---|---|
1986 | 10.1007/BF00288470 | Acta Inf. |
Keywords | Field | DocType |
Data Structure,Communication Network,Information Theory,Computational Mathematic,Computer System | Tree-adjoining grammar,Context-sensitive grammar,Programming language,L-attributed grammar,Extended Affix Grammar,Computer science,Indexed grammar,Combinatory categorial grammar,Categorial grammar,Mildly context-sensitive grammar formalism | Journal |
Volume | Issue | ISSN |
23 | 5 | 0001-5903 |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Johannes Reichardt | 1 | 0 | 0.68 |