Skip to content

Linguistic "Power" of Definite Clause Grammars? #2487

Closed Answered by UWN
jjtolton asked this question in Q&A
Discussion options

You must be logged in to vote

Definite Clause Grammars are capable of parsing Type 1

They are able to describe Type 2 without auxiliary arguments (and without semicontext). Parsing is subject to non-termination issues (just introduce a useless but correct unproductive recursive rule to see the difference).

With auxiliary arguments you get Turing completeness immediately. So it seems a very restricted form of auxiliary arguments is meant to get just Type 1.

However, with semicontext and no auxiliary arguments they are Type 0.

For instance, shouldn't there be a Prolog specification of the Prolog ISO standard?

There is an executable specification written in a (kind-of) subset of Prolog as informative Annex A, but it …

Replies: 2 comments

Comment options

You must be logged in to vote
0 replies
Answer selected by jjtolton
Comment options

You must be logged in to vote
0 replies
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Category
Q&A
Labels
None yet
3 participants