From cf4e59c9d6bce337514fc7d77120baced0d6d7bc Mon Sep 17 00:00:00 2001
From: Timotej Lazar <timotej.lazar@fri.uni-lj.si>
Date: Thu, 17 Mar 2016 14:19:45 +0100
Subject: Prolog: split lists exercises into two groups
---
prolog/problems/lists_advanced/rev_2/common.py | 52 ++++++++++++++++++++++++++
prolog/problems/lists_advanced/rev_2/en.py | 15 ++++++++
prolog/problems/lists_advanced/rev_2/sl.py | 15 ++++++++
3 files changed, 82 insertions(+)
create mode 100644 prolog/problems/lists_advanced/rev_2/common.py
create mode 100644 prolog/problems/lists_advanced/rev_2/en.py
create mode 100644 prolog/problems/lists_advanced/rev_2/sl.py
(limited to 'prolog/problems/lists_advanced/rev_2')
diff --git a/prolog/problems/lists_advanced/rev_2/common.py b/prolog/problems/lists_advanced/rev_2/common.py
new file mode 100644
index 0000000..408389a
--- /dev/null
+++ b/prolog/problems/lists_advanced/rev_2/common.py
@@ -0,0 +1,52 @@
+# coding=utf-8
+
+from operator import itemgetter
+import prolog.engine
+import server.problems
+
+id = 111
+number = 18
+visible = False
+facts = None
+
+solution = '''\
+conc111([], L, L).
+conc111([H|T], L2, [H|L]) :-
+ conc111(T, L2, L).
+rev([], []).
+rev([H|T], R):-
+ rev(T, R1),
+ conc111(R1, [H], R).
+'''
+
+test_cases = [
+ ('rev([], X)',
+ [{'X': '[]'}]),
+ ('rev([s, k, c, d, d], X)',
+ [{'X': '[d, d, c, k, s]'}]),
+ ('rev(X, [s, k, c, d, d])',
+ [{'X': '[d, d, c, k, s]'}]),
+]
+
+def test(code, aux_code):
+ n_correct = 0
+ engine_id = None
+ try:
+ engine_id, output = prolog.engine.create(code=code+aux_code, timeout=1.0)
+ if engine_id is not None and 'error' not in map(itemgetter(0), output):
+ # Engine successfully created, and no syntax error in program.
+ for query, answers in test_cases:
+ if prolog.engine.check_answers(engine_id, query=query, answers=answers, timeout=1.0):
+ n_correct += 1
+ except socket.timeout:
+ pass
+ finally:
+ if engine_id:
+ prolog.engine.destroy(engine_id)
+
+ hints = [{'id': 'test_results', 'args': {'passed': n_correct, 'total': len(test_cases)}}]
+ return n_correct, len(test_cases), hints
+
+def hint(code, aux_code):
+ # TODO
+ return []
diff --git a/prolog/problems/lists_advanced/rev_2/en.py b/prolog/problems/lists_advanced/rev_2/en.py
new file mode 100644
index 0000000..3ae126e
--- /dev/null
+++ b/prolog/problems/lists_advanced/rev_2/en.py
@@ -0,0 +1,15 @@
+# coding=utf-8
+
+name = 'rev/2'
+slug = 'reverse a list'
+
+description = '''\
+<p><code>rev(L1, L2)</code>: the list <code>L2</code> is obtained from <code>L1</code> by reversing the order of the elements.</p>
+<pre>
+?- rev([1,2,3], X).
+ X = [3,2,1].
+?- rev([], X).
+ X = [].
+</pre>'''
+
+hint = {}
diff --git a/prolog/problems/lists_advanced/rev_2/sl.py b/prolog/problems/lists_advanced/rev_2/sl.py
new file mode 100644
index 0000000..ab58a1c
--- /dev/null
+++ b/prolog/problems/lists_advanced/rev_2/sl.py
@@ -0,0 +1,15 @@
+# coding=utf-8
+
+name = 'rev/2'
+slug = 'Obrni seznam'
+
+description = '''\
+<p><code>rev(L1, L2)</code>: seznam <code>L2</code> ima elemente v obratnem vrstnem redu kot seznam <code>L1</code>.</p>
+<pre>
+?- rev([1,2,3], X).
+ X = [3,2,1].
+?- rev([], X).
+ X = [].
+</pre>'''
+
+hint = {}
--
cgit v1.2.1