Question: Java Asap! Stacks Using a stack ADT to create a spell checker. The stack serves as a dictionary and contains a collection of 3000 correctly

Java Asap! Stacks  Java Asap! Stacks Using a stack ADT to create a spell
checker. The stack serves as a dictionary and contains a collection of

Using a stack ADT to create a spell checker. The stack serves as a dictionary and contains a collection of 3000 correctly spelled common English words. To see whether a word is spelled correctly, you see whether it is contained in the dictionary. Use this scheme to create a spell checker for a word. Step 1: Using the provide interface called StackInterface to implement a stack called First_Last_Words_Stack where First is your first name and Last is your last name. Step 2: Create a client program call First_Last_StackSpellChecker where First is your first name and Last is your last name. Your First_Last_StackSpellChecker will need to do the following tasks: 1. Create a stack of string called stackSpellChecker 2. Read each word from the provided file called dictionary.txt and add it to the stack. Your program needs to count the total words were added to the stack and display it to the console. 3. Ask the user to enter an English word for spell checking then check to see if the word has a correct spelling based on the words contain in the stackSpellChecker stack. If the word is spell correctly, then display to the console "Good spelling". If the word is not spelled correctly, then display to the console "Incorrect spelling". 4. Your program then needs to ask the user to see if they want to check for another word. If the user wants to do spell check for another word, then repeat task 3 above. If the user does not want to do spell check for another word, display "THANK YOU" and terminate the program

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!