test updates woooo

tests/given/test/entry.definition.alpha

@@ -1,4 +1,4 @@
-$$ TEST: [-asc -tc]
+(* TEST: [-asc -tc] *)
 (* type string : 1 -> character *)
 type M : string -> integer
 

tests/given/test/entry.duplicateDifferent.alpha

@@ -1,4 +1,4 @@
-$$ TEST: [-asc -tc]
+(* TEST: [-asc -tc] *)
 type M : string -> integer
 
 function entry : M

tests/given/test/entry.duplicateSame.alpha

@@ -1,4 +1,4 @@
-$$ TEST: [-asc -tc]
+(* TEST: [-asc -tc] *)
 type M : string -> integer
 function entry : M
 

tests/given/test/entry.local.alpha

@@ -1,4 +1,4 @@
-$$ TEST: [-asc -tc]
+(* TEST: [-asc -tc] *)
 type M : string -> integer
 
 function entry : M

tests/given/test/error.entry.undeclaredType.alpha

@@ -0,0 +1,11 @@
+(* TEST: [-asc -tc] *)
+type M : string -> integer
+
+function foo : M
+
+foo (s) := {
+    [
+        int: x
+    ]
+    return 0;
+}

tests/given/test/error.entry.undeclaredVar.alpha

@@ -0,0 +1,8 @@
+(* TEST: [-asc -tc] *)
+type M : string -> integer
+
+function entry : M
+
+entry(s) := {
+    return x;
+}

tests/given/test/error.none.alpha

@@ -1,4 +1,4 @@
-$$ TEST: [-asc -tc]
+(* TEST: [-asc -tc] *)
 type string2int: string -> integer
 
 function entry : string2int

tests/given/test/error.operator.alpha

@@ -0,0 +1,15 @@
+(* TEST: [-asc -tc] *)
+type string2int: string -> integer
+
+function entry : string2int
+
+entry(arg) := {
+    [ integer: i; integer: sum ]
+    sum := 0;
+    i := 0;
+    while (i < 10) {
+        sum = sum + i;
+        i := i + 1;
+    }
+    return 0;
+}

tests/given/test/function.declaration.alpha

@@ -1,4 +1,4 @@
-$$ TEST: [-asc -tc]
+(* TEST: [-asc -tc] *)
 type M : integer -> integer
 
 function f : M

tests/given/test/function.definition.alpha

@@ -1,4 +1,4 @@
-$$ TEST: [-asc -tc]
+(* TEST: [-asc -tc] *)
 type M : integer -> integer
 
 function f : M

tests/given/test/functionValue.alpha

@@ -1,4 +1,4 @@
-$$ TEST: [-asc -tc]
+(* TEST: [-asc -tc] *)
 (* Type definitions *)
 
 (* mapping type *)
@@ -29,7 +29,6 @@ function c: string2int_2_integer
 function d: iic2b
 
 d(x,y,z) := {
-    [string: s;integer: s]
  return (x < y & z < 'm');
 }
 
@@ -58,11 +57,11 @@ c(x) := {
    entry is the first function called
  *)
 entry(arg) := {
-  [integer: result; string2int: f; integer: temp; character: char]
+  [integer: result; string2int: f; integer: temp]
   temp := a("Hello");
   f := b(temp);
   result := c(f);
-  if (d(1,2,char))
+  if (d(1,2,'c'))
   then {
      result := 0;
   }

tests/given/test/sample.good.alpha

@@ -1,4 +1,5 @@
-$$ TEST: [-asc -tc]
+(* TEST: [-asc -tc] *)
+
 (* Type definitions *)
 type int2int: integer -> integer
 type string2int: string -> integer

tests/given/test/selectionSort.alpha

@@ -1,4 +1,4 @@
-$$ TEST: [-asc -tc]
+(* TEST: [-asc -tc] *)
 (* Type definitions *)
 
 type string2int: string -> integer
@@ -46,9 +46,9 @@ selectionSort(data) := {
         data(i) := temp;
         i := i + 1;
     }
-    return true;
+    return true; 
 }
-
+ 
 
 (* Function definition
    entry is the first function called

tests/given/test/type.array.alpha

@@ -1,2 +1,2 @@
-$$ TEST: [-asc -tc]
+(* TEST: [-asc -tc] *)
 type A : 1 -> integer

tests/given/test/type.mapping.alpha

@@ -1,3 +1,3 @@
-$$ TEST: [-asc -tc]
+(* TEST: [-asc -tc] *)
 type M : integer -> character
 

tests/given/test/type.record.alpha

@@ -1,2 +1,2 @@
-$$ TEST: [-asc -tc]
+(* TEST: [-asc -tc] *)
 type R : [ integer : i ; character : c ]

tests/given/test/types.alpha

@@ -1,4 +1,4 @@
-$$ TEST: [-asc -tc]
+(* TEST: [-asc -tc] *)
 (*
 
    At compiler start-up your program should