I\'d like to solve some online test\'s to see开发者_如何学Python how good do i know prolog, maybe you could recommend any?http://cs.union.edu/~striegnk/learn-prolog-now/lpnpage.php?pageid=online
I am trying to implement an inorder traversal which in every stage I\'ll get the current node. For example:
I wrote this predicate in prolog : list([]). list([X|L]) :- list(L). it works well, but I got开发者_StackOverflow this warning :
My database is: eat(magi,limo). eat(nona,banana). How do I ask: \"Who\'s not eating limo?\" T开发者_如何学JAVAhis:
I\'m writing a Lisp to C translator and I have a problem with handling strings. This is a code that transforms an unary Lisp function to a C equivalent:
Working with SWI-Prolog. I have a list of ranks say: rank(London, 3.5开发者_运维技巧). rank(New York, 3.5).
--th开发者_如何学Pythone question has been edited-- Using this data, I need to create a list: team(milan,1).
Does anyone know of any simpler ways of building completely bala开发者_StackOverflownced trees in Prolog?
I have four sets of algorithms that I want to set up as modules but I need all algorithms executed at the same time within each module, I\'m a complete noob and have no programming experience.I do how
I am trying to build a DCG which recognizes all lists which match this form : a^n b^2m c^2m d^n开发者_Python百科.
加载中,请稍侯......