C/C++ Expert - A program must be written in C or C ++ language

A program written in C or C ++ language must be developed that is capable of reading from a text file the definition of a stack automaton. To read the file you must have the option to ask at the beginning of the program the name of the .txt you want to open. Once the definition is loaded, the program will display the battery on the screen, allowing the user to enter a string of characters of the alphabet contained in the previously charged definition from the keyboard. The program must NOT accept the entry of symbols that do not belong to the alphabet, this is deduced from the definition of the automaton previously loaded. The entry of the characters will be terminated when the user presses the ENTER key. At the end of entering the chain and pressing ENTER, two options should appear: 1. Show Automatic Processing. (Automatically simulate battery behavior.) 2. Show Manual Processing. (Pressing each ENTER has to show the next step of the battery processing.) The program must show on the screen the processing of the input characters, as well as the behavior of the stack, until an acceptance state is reached or a point is reached at which no other movement can be made. ENTRY FILE FORMAT The definition of the AP will be by reading a transition table from a text file, there will be one transition per line in the file and the elements of the transition will be separated by blank spaces or tabs. In the input file you can add comments, these comments will start with the / + symbols, taking as a comment all the characters that come next until the end of line symbol is found. The empty string will be represented with the $ symbol. Below is an example of the input file format: EXAMPLE OF THE TEXT FILE / + This is a definition of a Pile Automaton / + for the course of Formal Languages ​​and Automata / + This automaton recognizes a palindrome string of a’s and b’s symbols and a c al / + center of the chain S = {q0, q1, q2} + / States S0 = {q0} + / Initial Status A = {a, b, c} + / Alphabet AC = {Z0} + / Stack alphabet T = {q2} + / Final Status Z0 = {Z0} q0 to Z0 (a, Z0, q0) q0 a a (a, a, q0) q0 c Z0 ($, Z0, q1) q0 c a (a, Z0, q1) q1 b a ($, $, q1) q1 $ Z0 ($, Z0, q2)