Title: Definite clause grammars for language analysis—A survey of the formalism and a comparison with augmented transition networks
Abstract: A ciear and powerful formalism for describing languages, both natural and artificial, follows from a method for expressing grammars in logic due to Colmerauer and Kowalski. This formalism, which is a natural extension of context-free grammars, we call "definite clause grammars" (DCGs). A DCG provides not only a description of a language, but also an effective means for analysing strings of that language, since the DCG, as it stands, is an executable program of the programming language Prolog. Using a standard Prolog compiler, the DCG can be compiled into efficient code, making it feasible to implement practical language analysers directly as DCGs. This paper compares DCGs with the successful and widely used augmented transition network (ATN) formalism, and indicates how ATNs can be translated into DCGs. It is argued that DCGs can be at least as efficient as ATNs, whilst the DCG formalism is clearer, more concise and in practice more powerful.
Publication Year: 1980
Publication Date: 1980-05-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 985
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot