So you have created an Enigma machine that enciphers and deciphers uncrackable messages. Good Job! (If you haven't gotten the Enigma to work, you must get it working before proceeding on this project.) Notice that the output of a deciphered message looks something like:

While this is acceptable for most cryptologists, we do not want important people like the president of the college to have to read such a long crunched string. We would ideally like a parser that can divide this sentence into words. This will be the goal of Project 3.

The parser should be fast and accurate. Speed is of the essence which is why we will be implementing our dictionary of words as a Binary Search Tree, allowing us to find the words in the dictionary in O(log(n)) time (assuming a height-balanced tree). Furthermore, accuracy is crucial. We do not want President Mote to receive "The terrapins' core sat midnight.". All of the preceding words are valid English words. We would, however, prefer for the president to read "The terrapin scores at midnight."

• Node.h Stores a plaintext character and pointers.
• Coder.h The header file for Coder.cpp. Updated
• Enigma.h The header file for Enigma.cpp. Updated
• Entry.h The header file for Entry.cpp.
• Bst.h The header file for Bst.cpp.
• Dictionary.h The header file for Dictionary.cpp.
• ConstIterator.h The header file for ConstIterator.cpp

• Node.h and Node.cpp
• Coder.h and Coder.cpp
• Enigma.h and Enigma.cpp
• Entry.h and Entry.cpp
• Bst.h and Bst.cpp
• Dictionary.h and Dictionary.cpp
• Parser.h and Parser.cpp
• ConstIterator.h and ConstIterator.cpp
• test files
• testNode.cpp
Added
• testEntry.cpp
• testEnigma.cpp
Added
• testCoder.cpp
Added
• testBst.cpp
• testDictionary.cpp
• testParser.cpp
• testConstIterator.cpp
• myExcept.cpp
• Has a total of 10 exceptions.
• Makefile
  • Your makefile, spelled exactly this way (not "makefile" or anything else).

Task 1

Make sure your Enigma from project 2 is working correctly
and can encipher and decipher with:

• wheels rotating
• letters deleted

Task 2

There have been a few updates to P2.
Make certain that you have made the changes to

• Coder.h
• Coder.cpp
• Enigma.h
• Enigma.cpp

Enigma must be working before proceeding because your
output from Enigma will be the input to your parser.

Update testCoder.cpp and testEnigma.cpp.

Task 3

Create Entry.cpp (the nodes in the BST) and Bst.cpp
Create testEntry.cpp and testBst.cpp
Test these thoroughly before proceeding.

Task 4

Create Dictionary.cpp and testDictionary.cpp
It reads from a file: dictionary.txt
Correct file reading functions are expected.
Hardcode the file name that Dictionary reads as "dictionary.txt".
You can test it on your own dictionary file.

Task 5

Create Parser.h, Parser.cpp and testParser.cpp
Parser works on a deciphered message without any blanks
Note: we will still test your Enigma with letters removed
from the wheels but the message you parse will not contain blanks.

New Parser takes the deciphered message, such as "wearehear", and
locates words in the Bst to insert blanks between the words.
Let's assume that the following words are in your dictionary.txt:

• a
• are
• ear
• he
• hear
• we
• wear

You start looking for the first letter 'w' in your Dictionary.

You find "we" and "wear". Assume you choose "wear". Keep this word until
you have examined the next few words to make certain you are 'reading'
the message correctly. The next letter in the message is 'e'. So in your
Dictionary, you look for the word "e". It is not there, so look for the word
"eh". There is no such word and no word that begins with "eh" so you must
backtrack to the previous word and select a different one, "we" (instead of "wear").
Then begin again with "we" and look for words that begin with "a" - "a" and
"are". If you choose the wrong one, again you will have to backtrack. Continue
to do this until you have only words from your dictionary.txt in your message.
You might have to backtrack through several words to get the message
separated correctly (i.e. containing only words in the Dictionary.)

Comment your Parser code very well, stating what heuristic you
followed to successfully separate the words.

Task 6

Create ConstIterator.cpp and testConstIterator.cpp
This is a constant iterator that is bidirectional
whose purpose it is to walk from a node in the tree to the
next node in the tree, beginning with the node with smallest
value to the node with largest value. It can traverse both
forward (++) and backwards (--).