Name
Abstract | ||
|---|---|---|
This article provides detailed constructions demonstrating that the class of indexed grammars introduced as a simple extension of context-free grammars has essentially the same expressive power as the class of logic programs with unary predicates and functions and exactly one variable symbol. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1016/0743-1066(94)90042-6 | The Journal of Logic Programming |
Keywords | Field | DocType |
indexation,theorem proving,indexed grammar,logic programming,context free grammar | Tree-adjoining grammar,Discrete mathematics,Programming language,L-attributed grammar,Unary operation,Definite clause grammar,Phrase structure grammar,Indexed language,Indexed grammar,Algorithm,Parsing,Mathematics | Journal |
Volume | Issue | ISSN |
18 | 1 | 0743-1066 |
Citations | PageRank | References |
1 | 0.43 | 8 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eberhard Bertsch | 1 | 63 | 26.54 |