-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathnotes2
More file actions
123 lines (82 loc) · 1.96 KB
/
notes2
File metadata and controls
123 lines (82 loc) · 1.96 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
data Tree = Node(Int,Tree,Tree) | Leaf
type MyList = List
dec
female(Atom)
age(Atom, Int)
married_(Atom, Atom)
married(Var, Var)
eq(Var, Var)
tree(Tree)
isTree(Tree)
sumTree(Tree, Int )
listLength(MyList, Int)
end
%%%% valid program
female(mona).
female(jacki).
female(marge).
age(mona, 6).
age(jacki, 19).
age(marge,20).
doubleAge(A,T):- age(A,Y) , T is Y *2.
married_(abe,mona).
married_(clancy,jackie).
married_(homer,marge).
married(X,Y) :- married_(X,Y).
married(X,Y) :- married_(Y,X).
isEqual(X, Y) :- X = Y.
double(X, Y) :- Y is X * 2.
tree(leaf).
tree(node(4,leaf, leaf)).
tree(node(4, leaf, node(3,leaf, node(4,leaf, leaf)))).
isTree(leaf).
isTree(node(_, L, R)):- isTree(L),isTree(R).
sumTree(leaf, 0 ).
sumTree(node(I, L, R), T ):- sumTree(L, N1), sumTree(R, N2), T is N1 + N2 + I.
listLength([], 0).
listLength([_|T], Total):- listLength(T, N) , Total is 1 + N.
%%%%%
%%%%% invalid program
married_(abe,mona).
married_(clancy,jackie).
married_(homer,marge).
age(marge,20).
ageWrong(6,mona).
ageWrong('jacki4', 19).
femaleWrong(4).
femaleWrong('Ghadeer').
femaleWrong([5,6]).
doubleAgeWrong(A,T):- age(A,_) , T is A *2.
marriedWrong(_,Y) :- married_('mona4',Y).
marriedWrong(_,Y) :- married_(Y,'mona4').
doubleWrong(X, Y) :- X * 2 is Y.
treeWrong(leaf(5)).
treeWrong(node(4,5, nil)).
treeWrong(4, leaf, node(3,leaf, node(leaf,leaf, leaf))).
isTreeWrong(leaf).
isTreeWrong(node(leaf, L, R)):- isTree(L),isTree(R).
sumTreeWrong(leaf(0), 0 ).
sumTreeWrong(node(I, L, R), T ):- sumTree(L, N1), sumTree(R, N2), T is N1 + N2 + I.
listLength([], 0).
listLength([H|T], T):- listLength(T, N) , T is 1 + N.
%%%%%
%%%%% test units
?- isTree(leaf).
true.
?- isTree(4).
false.
?- isTree(node(4,4,3)).
false.
?- isTree(node(4, leaf, leaf)).
true.
?- isTree(node(4, leaf, node(3,4,5))).
false.
?- isTree(node(4, leaf, node(3,leaf, node(4,leaf, leaf)))).
true.
?- listLength([5,6,6],X).
X = 3.
?- listLength([5,6,6,"S"],X).
X = 4.
?- listLength([],X).
X = 0.
%%%%%