Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

JAVA Please find all errors in the code and explain why they were lexical, synta

ID: 3905654 • Letter: J

Question

JAVA

Please find all errors in the code and explain why they were lexical, syntatic or semantic errors:

1 public class Fraction 2. private int numerator; 3 private int denoninator; 4. public Fraction(int num, int denom) numerator num; denominator = denom; reduce() 9. public Fraction(int num) 10. this (num, 1); 12. public Fraction) 13. this(0) 14. 15. public int getdenominator 16 retrun denominator; 18. ulbic Int getNumerator( 19 return numerator 20. 21. public double toDoulbe) return (double) nunerator double) denominator; 23. 24. public float toFloat() 25. return (float) numerator / denominator; 26. 27. public String toString) ( 28. 29 30 31. 32. if (denominator1) return numerator + return numerator "/+ denominator; 33. void reduce () 34 35. 36 37 . 38. int g = gdc (numerator , if(gl=0 ) denominator); numerator /- gi denominator /= g; if (denominator

Explanation / Answer

If you have any doubts, please give me comment...

Errors will be modified with correct in bolded text

public class Fraction{

private int numerator;

private int denominator;

public Fraction(int num, int denom){

numerator = num;

denominator = denom;

}

public Fraction(int num){

this(num, 1);

}

public Fraction(){

this(0);

}

public int getdenominator(){

return denominator;

}

public int getNumerator(){

return numerator;

}

public double toDouble(){

return (double)numerator/(double)denominator;

}

public float toFloat(){

return (float)numerator / denominator;

}

public String toString(){

if(denominator ==1)

return numerator + " ";

else{

return numerator + "/"+denominator;

}

}

void reduce(){

int g = gcd(numerator, denominator);

if(g!=0){

numerator /= g;

denominator /= g;

}

if(denominator<0){

numerator = -(numerator);

denominator = -(denominator);

}

}

private int gcd(int m, int n){

int r = 0;

while(n!=0){

r = m%n;

m = n;

n = r;

}

return m;

}

}