import ListStack
import ListQueue

if __name__ == '__main__':

# Write a program that asks for a string from the keyboard.
# This program will continue to ask for a string
# until the user enters an empty string.
a_string = input('Enter a string: ')
while len(a_string) > 0:
   # For each input you should echo out the original string and whether
   # or not it is a palindrome.

   # For each string that is entered, you will need to determine if it is a palindrome.
   # A palindrome is a word,
   # phrase, or sentence that reads the same forward and backwards.
   # There are many ways to determine if a
   # string is a palindrome; however, for this assignment you MUST use a stack
   # and a queue as described below.

   # Access each character in a string. Each character should be added to both a
   # stack and a queue. Use the stack and queue developed in class.
   # You can safely assume that each string will be less than 100
   # characters long - you will need this information when creating the stack and the queue
   stack = ListStack.ListStack(100)
   queue = ListQueue.ListQueue(100)
   for letter in a_string:
         stack.push(letter)
         queue.enqueue(letter)

   # . Once all the characters have been added to the data structures,
   # proceed to remove characters from each data
   # structure, one at a time, and compare them. If at any time they are not the same,
   # you do not have a
   # palindrome. If you have exhausted both the stack and the queue without finding
   # a pair that is different, you have a palindrome.
   palindrome = True
   while not stack.isEmpty() and palindrome is True:
         top = stack.pop()

We have a list [3, 8, 26, 230, 2, 7, 34, 89, 102, 76] Please cre...