h44z/uibk_703602-Compiler-Construction
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Fix errors in mC example inputs (thanks Markus)

Browse Source
This commit is contained in:
Markus Kopp 2019-03-31 17:13:11 +02:00 committed by Alex Hirsch
parent 14da3497ed
commit 88e52e7828
7 changed files with 30 additions and 17 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
examples/factorial/factorial.mc
View File

@ -1,8 +1,10 @@
int calculateFactorial(int number){ int calculateFactorial(int number){
int factorial = 1; int factorial;
int i = 1; factorial = 1;
int i;
i = 1;
while (i <= number){ while (i <= number){
factorial *= i; factorial = factorial * i;
i = i + 1; i = i + 1;
} }
return factorial; return factorial;

3
examples/gcd/gcd.mc
View File

@ -33,7 +33,8 @@ int main() {
print_nl(); print_nl();
b = read_int(); b = read_int();
int res = gcd(a,b); int res;
res = gcd(a,b);
print("The greatest common divisor is: "); print("The greatest common divisor is: ");
print_int(res); print_int(res);

3
examples/is_square/is_square.mc
View File

@ -2,7 +2,8 @@
bool is_square(int n) bool is_square(int n)
{ {
int i = 0; int i;
i = 0;
while(i*i < n){ while(i*i < n){
if(i*i == n){ if(i*i == n){
return true; return true;

8
examples/nonsense/nonsense.mc
View File

@ -1,5 +1,6 @@
int returnTwo() { int returnTwo() {
int value = 2; int value;
value = 2;
return value; return value;
} }
@ -13,7 +14,8 @@ bool isOne(int in) {
int main() { int main() {
int[42] array; int[42] array;
int[21] arrayTwo; int[21] arrayTwo;
int i = 0; int i;
i = 0;
while (i < 21) { while (i < 21) {
array[i] = i*i; array[i] = i*i;
i = i + 1; i = i + 1;
@ -30,7 +32,7 @@ int main() {
if (array[0] == 0) { if (array[0] == 0) {
print_int(array[0]); print_int(array[0]);
print_nl(); print_nl();
} }
if (array[1] == 2) { if (array[1] == 2) {
print_int(0); print_int(0);

3
examples/palindrome/palindrome.mc
View File

@ -31,7 +31,8 @@ int main() {
input = read_int(); input = read_int();
print_nl(); print_nl();
bool result = is_palindrome(input); bool result;
result = is_palindrome(input);
print_int(input); print_int(input);
if (result) { if (result) {

7
examples/slowsort/slowsort.mc
View File

@ -97,12 +97,13 @@ int main(){
print("give a sequence of 10 numbers to be sorted: "); print("give a sequence of 10 numbers to be sorted: ");
print_nl(); print_nl();
int arr_size = 10; int arr_size;
arr_size = 10;
int i; int i;
i=0; i=0;
if (is_int){ if (is_int){
int i_arr[arr_size]; int[10] i_arr;
int i_number; int i_number;
while(i < arr_size){ while(i < arr_size){
print_int(i); print_int(i);
@ -124,7 +125,7 @@ int main(){
print("output array: "); print("output array: ");
print_i_array(i_arr, arr_size); print_i_array(i_arr, arr_size);
}else{ }else{
float f_arr[arr_size]; float[10] f_arr;
float f_number; float f_number;
while(i < arr_size){ while(i < arr_size){

15
examples/supersyntaxchecker2000/supersyntaxchecker2000.mc
View File

@ -4,8 +4,10 @@ int main(){
print_nl(); print_nl();
int n; int n;
n = read_int(); n = read_int();
bool a = 1 <= n; bool a;
bool b = 2 == n; a = 1 <= n;
bool b;
b = 2 == n;
b = 3 >= n; b = 3 >= n;
n = n * 2; n = n * 2;
n = n / 2; n = n / 2;
@ -15,9 +17,12 @@ int main(){
a || b; a || b;
a != !b; a != !b;
int[3] test; int[3] test;
string hi = "Hello"; string hi;
float f = -1.0; hi = "Hello";
bool c = true; float f;
f = -1.0;
bool c;
c = true;
if (c) if (c)
{ {
while(c){ while(c){