"The first program written in the (Prolog) language was a large natural-language processing system."

"notation for DCGs that is used in Prolog today", "a natural extension of context-free grammars":
[html]
Fernando C. N. Pereira, David H. D. Warren, <a href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.458.3226&rep=rep1&type=pdf">Definite Clause Grammars for Language Analysis--A Survey of the Formalism and a Comparison with Augmented Transition Networks</a> (<a href="http://web.archive.org/web/20171107120143/http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.458.3226&rep=rep1&type=pdf">web.archive.org</a>)[/html]

"DCGs are a special case of Colmeraur's metamorphosis grammars"
"DCG can be viewed as a grammar consisting of an infinite number of context-free rules."

[html]1983, <a href="https://www.sri.com/sites/default/files/uploads/publications/pdf/652.pdf">Parsing as Deduction</a> (<a href="http://web.archive.org/web/20171107123640/https://www.sri.com/sites/default/files/uploads/publications/pdf/652.pdf">web.archive.org</a>)[/html]

Отредактировано Лис (2017-11-07 15:51:58)