Contact US

Log In

Come Join Us!

Are you a
Computer / IT professional?
Join Tek-Tips Forums!
  • Talk With Other Members
  • Be Notified Of Responses
    To Your Posts
  • Keyword Search
  • One-Click Access To Your
    Favorite Forums
  • Automated Signatures
    On Your Posts
  • Best Of All, It's Free!

*Tek-Tips's functionality depends on members receiving e-mail. By joining you are opting in to receive e-mail.

Posting Guidelines

Promoting, selling, recruiting, coursework and thesis posting is forbidden.

Students Click Here

DCG problem

DCG problem

DCG problem

I have to write a DCG that generates strings from the alphabet a E {0,1,2} the strings have to have the form nn. This means queries like ?- s([0,2,1,0,2,1],[]). and s([1,1,2,0,1,1,2,0],[]). would return true.

This is the code I have so far. I'm so close. Can someone help me further?

s --> s(X), s(X).
s --> [].

s(0) --> zero, s(X).
s(1) --> one,  s(X).
s(2) --> two,  s(X).
s(3) --> [].

zero --> [0].
one  --> [1].
two  --> [2].

Many thanks ;)

RE: DCG problem


s --> [].
s --> sx, s.

sx --> [0].
sx --> [1].
sx --> [2].

RE: DCG problem

You are very close to the solution !

Just look at these rules
s --> s(X), s(X).
s(0) --> zero, s(X).

In the first rule, what is the type of X, an atom or a list ?
In the second rule you use an atom 0, and you introduce X in the body of the rule. You don't have a lot of things to change/add.

RE: DCG problem

No kahleen  the production must have the form nn, you accept [0,1,2] for example.

RE: DCG problem

Great! Thanks joel! I got it!

Red Flag This Post

Please let us know here why this post is inappropriate. Reasons such as off-topic, duplicates, flames, illegal, vulgar, or students posting their homework.

Red Flag Submitted

Thank you for helping keep Tek-Tips Forums free from inappropriate posts.
The Tek-Tips staff will check this out and take appropriate action.

Reply To This Thread

Posting in the Tek-Tips forums is a member-only feature.

Click Here to join Tek-Tips and talk with other members! Already a Member? Login

Close Box

Join Tek-Tips® Today!

Join your peers on the Internet's largest technical computer professional community.
It's easy to join and it's free.

Here's Why Members Love Tek-Tips Forums:

Register now while it's still free!

Already a member? Close this window and log in.

Join Us             Close