Stack machine | Computer Science homework help

Need your ASSIGNMENT done? Use our paper writing service to score better and meet your deadline.

Order a Similar Paper HERE Order a Different Paper HERE


Implement a stack machine in the language of your choice to that a string is a palindrome. this is the string XXR The SM rules for this are as follows:

You may use the class in your program, but you must use the Stack Machine to determine if the input string is a palindrome or not. Also, you may use the length of the input string to determine the mid-point of the string. Output from your program must be similar to that shown in the book: