From 88e52e782822c9beba534b0b2e4f26d03c94b5b1 Mon Sep 17 00:00:00 2001 From: Markus Kopp Date: Sun, 31 Mar 2019 17:13:11 +0200 Subject: [PATCH] Fix errors in mC example inputs (thanks Markus) --- examples/factorial/factorial.mc | 8 +++++--- examples/gcd/gcd.mc | 3 ++- examples/is_square/is_square.mc | 3 ++- examples/nonsense/nonsense.mc | 8 +++++--- examples/palindrome/palindrome.mc | 3 ++- examples/slowsort/slowsort.mc | 7 ++++--- .../supersyntaxchecker2000.mc | 15 ++++++++++----- 7 files changed, 30 insertions(+), 17 deletions(-) diff --git a/examples/factorial/factorial.mc b/examples/factorial/factorial.mc index aac4028..bc7f882 100644 --- a/examples/factorial/factorial.mc +++ b/examples/factorial/factorial.mc @@ -1,8 +1,10 @@ int calculateFactorial(int number){ - int factorial = 1; - int i = 1; + int factorial; + factorial = 1; + int i; + i = 1; while (i <= number){ - factorial *= i; + factorial = factorial * i; i = i + 1; } return factorial; diff --git a/examples/gcd/gcd.mc b/examples/gcd/gcd.mc index 12c3aa6..6e1ce4a 100644 --- a/examples/gcd/gcd.mc +++ b/examples/gcd/gcd.mc @@ -33,7 +33,8 @@ int main() { print_nl(); b = read_int(); - int res = gcd(a,b); + int res; + res = gcd(a,b); print("The greatest common divisor is: "); print_int(res); diff --git a/examples/is_square/is_square.mc b/examples/is_square/is_square.mc index 646e5a1..56c98aa 100644 --- a/examples/is_square/is_square.mc +++ b/examples/is_square/is_square.mc @@ -2,7 +2,8 @@ bool is_square(int n) { - int i = 0; + int i; + i = 0; while(i*i < n){ if(i*i == n){ return true; diff --git a/examples/nonsense/nonsense.mc b/examples/nonsense/nonsense.mc index 4515f3b..9752810 100644 --- a/examples/nonsense/nonsense.mc +++ b/examples/nonsense/nonsense.mc @@ -1,5 +1,6 @@ int returnTwo() { - int value = 2; + int value; + value = 2; return value; } @@ -13,7 +14,8 @@ bool isOne(int in) { int main() { int[42] array; int[21] arrayTwo; - int i = 0; + int i; + i = 0; while (i < 21) { array[i] = i*i; i = i + 1; @@ -30,7 +32,7 @@ int main() { if (array[0] == 0) { print_int(array[0]); print_nl(); - } + } if (array[1] == 2) { print_int(0); diff --git a/examples/palindrome/palindrome.mc b/examples/palindrome/palindrome.mc index b32f857..599c77c 100644 --- a/examples/palindrome/palindrome.mc +++ b/examples/palindrome/palindrome.mc @@ -31,7 +31,8 @@ int main() { input = read_int(); print_nl(); - bool result = is_palindrome(input); + bool result; + result = is_palindrome(input); print_int(input); if (result) { diff --git a/examples/slowsort/slowsort.mc b/examples/slowsort/slowsort.mc index eb8ebc1..91d6c9e 100644 --- a/examples/slowsort/slowsort.mc +++ b/examples/slowsort/slowsort.mc @@ -97,12 +97,13 @@ int main(){ print("give a sequence of 10 numbers to be sorted: "); print_nl(); - int arr_size = 10; + int arr_size; + arr_size = 10; int i; i=0; if (is_int){ - int i_arr[arr_size]; + int[10] i_arr; int i_number; while(i < arr_size){ print_int(i); @@ -124,7 +125,7 @@ int main(){ print("output array: "); print_i_array(i_arr, arr_size); }else{ - float f_arr[arr_size]; + float[10] f_arr; float f_number; while(i < arr_size){ diff --git a/examples/supersyntaxchecker2000/supersyntaxchecker2000.mc b/examples/supersyntaxchecker2000/supersyntaxchecker2000.mc index 23c16c1..71d9257 100644 --- a/examples/supersyntaxchecker2000/supersyntaxchecker2000.mc +++ b/examples/supersyntaxchecker2000/supersyntaxchecker2000.mc @@ -4,8 +4,10 @@ int main(){ print_nl(); int n; n = read_int(); - bool a = 1 <= n; - bool b = 2 == n; + bool a; + a = 1 <= n; + bool b; + b = 2 == n; b = 3 >= n; n = n * 2; n = n / 2; @@ -15,9 +17,12 @@ int main(){ a || b; a != !b; int[3] test; - string hi = "Hello"; - float f = -1.0; - bool c = true; + string hi; + hi = "Hello"; + float f; + f = -1.0; + bool c; + c = true; if (c) { while(c){