mj samples reformated to be consistent

diff --git a/samples/RekFac.mj b/samples/RekFac.mj
index 40817fd..674cc14 100644 (file)
--- a/samples/RekFac.mj
+++ b/samples/RekFac.mj
@@ -2,8 +2,10 @@ program RekFac{
 
        int factorial(int f)
        {
-               if (f<0) return 0;
-               if (f<=1) return 1;
+               if (f<0) 
+                       return 0;
+               if (f<=1) 
+                       return 1;
                return factorial(f-1) * f ;
        }
        

diff --git a/samples/RekFib.mj b/samples/RekFib.mj
index f4e3f09..d3a59a5 100644 (file)
--- a/samples/RekFib.mj
+++ b/samples/RekFib.mj
@@ -2,8 +2,10 @@ program RekFib{
 
        int fib(int f)
        {
-               if (f==0) return 0;
-               if (f==1) return 1;
+               if (f==0) 
+                       return 0;
+               if (f==1) 
+                       return 1;
                return fib(f-2)+fib(f-1) ;
        }
        

diff --git a/samples/div0.mj b/samples/div0.mj
index d8fb689..bd92135 100644 (file)
--- a/samples/div0.mj
+++ b/samples/div0.mj
@@ -3,7 +3,8 @@ program test
        void main()\r
                int i, j;\r
        {\r
-               i = 100; j = 0;\r
+               i = 100; \r
+               j = 0;\r
                print(i/j);\r
        }\r
 \r

diff --git a/samples/div2.mj b/samples/div2.mj
index d498e3d..455b4af 100644 (file)
--- a/samples/div2.mj
+++ b/samples/div2.mj
@@ -3,7 +3,8 @@ program test
        void main()\r
                int i, j;\r
        {\r
-               i = 100; j = 2;\r
+               i = 100; \r
+               j = 2;\r
                print(i/j);\r
        }\r
 \r

diff --git a/samples/eratos.mj b/samples/eratos.mj
index 620bd2d..92d28f8 100644 (file)
--- a/samples/eratos.mj
+++ b/samples/eratos.mj
@@ -7,7 +7,11 @@ program Eratos
 {\r
        void put(int x)\r
        {\r
-               if (npp == 10) {print(chr(13)); print(chr(10)); npp = 0;}\r
+               if (npp == 10) {\r
+                       print(chr(13)); \r
+                       print(chr(10)); \r
+                       npp = 0;\r
+               }\r
                print(x, 5);\r
                npp++;\r
        }\r
@@ -17,7 +21,9 @@ program Eratos
        {\r
                put(x);\r
                i = x;\r
-               while (i <= max) {sieve[i] = 'o'; i = i + x;}\r
+               while (i <= max) {\r
+                       sieve[i] = 'o'; i = i + x;\r
+               }\r
        }\r
 \r
        void main()\r
@@ -27,11 +33,14 @@ program Eratos
                npp = 0;\r
                sieve = new char[max+1];\r
                i = 0;\r
-               while (i <= max) {sieve[i] = 'x'; i++;}\r
+               while (i <= max) {\r
+                       sieve[i] = 'x'; i++;\r
+               }\r
                i = 2;\r
                while (i <= max) {\r
                        found(i);\r
-                       while(i <= max && sieve[i] == 'o') i++;\r
+                       while(i <= max && sieve[i] == 'o') \r
+                               i++;\r
                }\r
        }\r
 \r

diff --git a/samples/pos-neg.mj b/samples/pos-neg.mj
index 5bf3771..79fd454 100644 (file)
--- a/samples/pos-neg.mj
+++ b/samples/pos-neg.mj
@@ -10,10 +10,12 @@ program P
                int x, i;
        { //---------- Initialize val
                val = new Table;
-               val.pos = new int[size]; val.neg = new int[size];
+               val.pos = new int[size]; 
+               val.neg = new int[size];
                i = 0;
                while (i < size) {
-                       val.pos[i] = 0; val.neg[i] = 0;
+                       val.pos[i] = 0; 
+                       val.neg[i] = 0;
                        i++;
                }
        //---------- Read values