The Task In this project, you will be writing a program that recei...
Question
The Task
In this project, you will be writing a program that receives a string of characters via the UART, checks if this string is a palindrome, and then uses a print function to print either “Yes” or “No”. A palindrome sequence of characters (typically a word or phrase) that is the same both forwards and backwards. For this project, strings will be terminated using a period (‘.’). You may assume that a string will contain at least one character in addition to a period. You will not need to handle empty strings or strings with only a period. Your program should be able to handle multiple strings sent one after another or concatenated together. For example, the string: “abba. data.” should print “Yes” followed by “No” on the next line. Spaces should be ignored when checking for a palindrome and the palindrome should not be case sensitive. For example, “A nut for a jar of Tuna.” would be considered a palindrome.
Print Function
A skeleton PLP project file is available to download. The PLP project includes a second ASM file titled, project3_print.asm. This ASM file contains the print function used in this project. PLPTool concatenates all ASM files within a PLP project into a single location in memory (unless additional .org statements have been added to specify different location for code). No changes to project3_print.asm should be made. When called, depending on the value in register $a0, the following string will be displayed on the simulated UART device’s output. If $a0 contains a zero then “No” will be displayed and if $a0 contains a non-zero value (e.g. one) then “Yes” will be displayed. The print function is called using the following instruction:
call project3_print
To use the print function, your PLP program needs to initialize the stack pointer ($sp) before performing the function call (or any other operations involving the stack pointer). For this reason, the skeleton project file includes an initialization that sets the stack pointer to 0x10fffffc (the last address of RAM).
Palindrome Checking Strategies
There are two strategies I would recommend for saving your string in in memory and checking to see if it is a palindrome. The first would be to use only an array and keep a pointer (a register containing a memory address) for both the first element in the array (commonly referred to as a head pointer) and last element in the array (commonly referred to as a tail pointer). As you add elements to your array, update your tail pointer so that it moves to the new last element in the array. When you have reached the end of your string (a period has been received), you can perform your palindrome check comparing the characters your head and tail pointers point to and, if they point to the same character, move them both inwards towards the center of your array. If the pointers cross and all the characters were the same, your string was a palindrome. The second strategy would be to use an array, treated as a queue, and the stack. You can traverse the array from the start (the first character saved) to the end (the last character saved) while simultaneously popping characters off the stack. The queue will give you the string forwards and the stack will give you the string backwards. For both techniques I described above, keep in mind they are simpler if you perform some conditioning to the characters you receive before saving them. For example you don’t need to save spaces in your data structure(s) since they can be ignored and the comparisons are simpler if, when first receiving character, you convert them all to the same case (either all upper or all lower) before storing them. That way you won’t need to write logic that indicates things like “A” == “a” and “A” == “a”.
In this project, you will be writing a program that receives a string of characters via the UART, checks if this string is a palindrome, and then uses a print function to print either “Yes” or “No”. A palindrome sequence of characters (typically a word or phrase) that is the same both forwards and backwards. For this project, strings will be terminated using a period (‘.’). You may assume that a string will contain at least one character in addition to a period. You will not need to handle empty strings or strings with only a period. Your program should be able to handle multiple strings sent one after another or concatenated together. For example, the string: “abba. data.” should print “Yes” followed by “No” on the next line. Spaces should be ignored when checking for a palindrome and the palindrome should not be case sensitive. For example, “A nut for a jar of Tuna.” would be considered a palindrome.
Print Function
A skeleton PLP project file is available to download. The PLP project includes a second ASM file titled, project3_print.asm. This ASM file contains the print function used in this project. PLPTool concatenates all ASM files within a PLP project into a single location in memory (unless additional .org statements have been added to specify different location for code). No changes to project3_print.asm should be made. When called, depending on the value in register $a0, the following string will be displayed on the simulated UART device’s output. If $a0 contains a zero then “No” will be displayed and if $a0 contains a non-zero value (e.g. one) then “Yes” will be displayed. The print function is called using the following instruction:
call project3_print
To use the print function, your PLP program needs to initialize the stack pointer ($sp) before performing the function call (or any other operations involving the stack pointer). For this reason, the skeleton project file includes an initialization that sets the stack pointer to 0x10fffffc (the last address of RAM).
Palindrome Checking Strategies
There are two strategies I would recommend for saving your string in in memory and checking to see if it is a palindrome. The first would be to use only an array and keep a pointer (a register containing a memory address) for both the first element in the array (commonly referred to as a head pointer) and last element in the array (commonly referred to as a tail pointer). As you add elements to your array, update your tail pointer so that it moves to the new last element in the array. When you have reached the end of your string (a period has been received), you can perform your palindrome check comparing the characters your head and tail pointers point to and, if they point to the same character, move them both inwards towards the center of your array. If the pointers cross and all the characters were the same, your string was a palindrome. The second strategy would be to use an array, treated as a queue, and the stack. You can traverse the array from the start (the first character saved) to the end (the last character saved) while simultaneously popping characters off the stack. The queue will give you the string forwards and the stack will give you the string backwards. For both techniques I described above, keep in mind they are simpler if you perform some conditioning to the characters you receive before saving them. For example you don’t need to save spaces in your data structure(s) since they can be ignored and the comparisons are simpler if, when first receiving character, you convert them all to the same case (either all upper or all lower) before storing them. That way you won’t need to write logic that indicates things like “A” == “a” and “A” == “a”.
Solution Preview
These solutions may offer step-by-step problem-solving explanations or good writing examples that include modern styles of formatting and construction of bibliographies out of text citations and references.
Students may use these solutions for personal skill-building and practice.
Unethical use is strictly forbidden.
plp.metafile100644 000000 000000 00000000104 13571575754 011546 0ustar00000000 000000 PLP-5.0
START=268435456
DIRTY=0
ARCH=0
main.asm
project3_print.asm
main.asm100644 000000 000000 00000006271 13571575754 010704 0ustar00000000 000000 .org 0x10000000
# Initializations
li $sp, 0x10fffffc # stack pointer
li $s0, 0xf0000000 # UART command register
li $s1, 0xf0000004 # UART status register
li $s2, 0xf0000008 # UART receive buffer
li $t0, array_ptr # initialize $t0 to the beginning of the array
li $t1, 0 # used as a temporary register to read UART registers, to hold the character read from UART, and as a front pointer in checking part
li $t2, 0 # used to load constants needed for comparisons, to hold result of comparison from slti instructions, and to hold a character from the back in the checking part
li $t3, 0 # used to hold a character from the front in the checking part
# Initialize any registers you will be using here.
# It can be helpful to include a comment about a register's purpose
# next to an initialization at the start of the program for reference.
j main
nop
START=268435456
DIRTY=0
ARCH=0
main.asm
project3_print.asm
main.asm100644 000000 000000 00000006271 13571575754 010704 0ustar00000000 000000 .org 0x10000000
# Initializations
li $sp, 0x10fffffc # stack pointer
li $s0, 0xf0000000 # UART command register
li $s1, 0xf0000004 # UART status register
li $s2, 0xf0000008 # UART receive buffer
li $t0, array_ptr # initialize $t0 to the beginning of the array
li $t1, 0 # used as a temporary register to read UART registers, to hold the character read from UART, and as a front pointer in checking part
li $t2, 0 # used to load constants needed for comparisons, to hold result of comparison from slti instructions, and to hold a character from the back in the checking part
li $t3, 0 # used to hold a character from the front in the checking part
# Initialize any registers you will be using here.
# It can be helpful to include a comment about a register's purpose
# next to an initialization at the start of the program for reference.
j main
nop
This is only a preview of the solution.
Please use the purchase button to see the entire solution.
Please use the purchase button to see the entire solution.
By purchasing this solution you'll be able to access the following files:
Solution.zip
Purchase Solution
$28.00
View Available
Computer Science Tutors 529 tutors matched
Ionut
(ionut)
Hi! MSc Applied Informatics & Computer Science Engineer. Practical experience in many CS & IT branches.Research work & homework
5/5 (5,654+ sessions)
2 hours avg response
Leo
(Leo)
Hi!
I have been a professor in New York and taught in a math department and in an applied math department.
4.9/5 (5,652+ sessions)
2 hours avg response
Pranay
(math1983)
Ph.D. in mathematics and working as an Assistant Professor in University. I can provide help in mathematics, statistics and allied areas.
4.6/5 (5,512+ sessions)
1 hour avg response