SHOULD BE WRITTEN IN MIPS LANGUAGE ONLY THAT WORKS WITH MARS
SIMULATOR
( PLEASE DON'T COPY PASTE FROM CHATGPT AS SOMEONE DID THE SAME WITH
PREVIOUS QUESTION, CHATGPT WILL GIVE WRONG ANSWER!!!)
Write a program that does the following:
Request a string from the user. If it is zero length (the first character is \n) exit the program.
Determine if the string is a palindrome. If so, print Palindrome. If not, print Not a palindrome.
Return to request another string.
Program structure:
You can assume no input string is longer than 200 characters. You must write a function that
determines whether the string is a palindrome. Call this with the address of the string in $a0. This
function must be recursive. That is, it must test whether the initial string might be a palindrome
and return true if it the outer two characters match and false if they dont, meaning if you return
false at any level, stop the recursive calls and return false. Within this function, you must call
another function that removes anything that isnt a letter or a number. Within the second function,
call a third function that converts lower case to upper case so your comparisons work properly.
Finally, call your recursive palindrome function. You should have two files. The first has the
main body of your code that requests a string, calls a function that checks a palindrome, which is
item 2, above plus initialization code. The second file has any subroutines you may need, such as
removing punctuation and converting case..
SHOULD BE WRITTEN IN MIPS LANGUAGE ONLY THAT WORKS WITH MARS SIMULAT.pdf
1. SHOULD BE WRITTEN IN MIPS LANGUAGE ONLY THAT WORKS WITH MARS
SIMULATOR
( PLEASE DON'T COPY PASTE FROM CHATGPT AS SOMEONE DID THE SAME WITH
PREVIOUS QUESTION, CHATGPT WILL GIVE WRONG ANSWER!!!)
Write a program that does the following:
Request a string from the user. If it is zero length (the first character is n) exit the program.
Determine if the string is a palindrome. If so, print Palindrome. If not, print Not a palindrome.
Return to request another string.
Program structure:
You can assume no input string is longer than 200 characters. You must write a function that
determines whether the string is a palindrome. Call this with the address of the string in $a0. This
function must be recursive. That is, it must test whether the initial string might be a palindrome
and return true if it the outer two characters match and false if they dont, meaning if you return
false at any level, stop the recursive calls and return false. Within this function, you must call
another function that removes anything that isnt a letter or a number. Within the second function,
call a third function that converts lower case to upper case so your comparisons work properly.
Finally, call your recursive palindrome function. You should have two files. The first has the
main body of your code that requests a string, calls a function that checks a palindrome, which is
item 2, above plus initialization code. The second file has any subroutines you may need, such as
removing punctuation and converting case.
