X-Git-Url: https://git.martlubbers.net/?a=blobdiff_plain;f=examples%2Fexample.spl;h=ee36ff365032a8a060c26d54407b06b215208919;hb=42f469bb622f254f8008b064bdb720c72daaf2e3;hp=6cebe905f39b6109104862e965f051a0f6c1d5b6;hpb=90e3f306b5813ff66f8249ba243a8a4220c915fe;p=cc1516.git

diff --git a/examples/example.spl b/examples/example.spl
index 6cebe90..ee36ff3 100644
--- a/examples/example.spl
+++ b/examples/example.spl
@@ -2,6 +2,11 @@
 	Three ways to implement the f acto rial function in SPL.
 	First the recursive version .
 */
+var r = 1;
+var facN = 1;
+var ok = True;
+
+
 facR(n) :: Int -> Int {
 	if (n < 2) {
 		return 1;
@@ -84,7 +89,7 @@ append(l1, l2) :: [t] [t] -> [t] {
 
 //square the odd numbers in a list and remove the even members
 squareOddNumbers(list) :: [Int] -> [Int] {
-	while(!isEmpty (list) && list.hd % 2=0){
+	while(!isEmpty (list) && list.hd % 2==0){
 		list=list.tl;
 	}
 	if(!isEmpty(list)){