Implement a parser that processes sequences of correctly paired ifs and elses in a C++ program.

Implement a parser that processes sequences of correctly paired ifs and elses in a C++ program. There may be ifs without elses, but not elses without ifs. Your parser must simulate a PDA. Specifications for the implementation follow: • You must simulate a PDA to parse the sequences of correctly paired if-else statements. • You can use C, C++ or Java to implement your parser, but make sure that your program compiles and runs in either empress, or windows as installed on campus PCs. • Input to the parser: A file with the sequence of ifs and elses. The input file must be called sequence.txt. A sample file is posted on Cougar Courses. • Output: Display the message Correct sequence if the sequence is accepted by the PDA, or display the message Sequence is syntactically incorrect if the sequence is NOT accepted by the PDA. • Document your program. (provide detail comments ) • Type one page describing the design and implementation of your parser in terms of PDAs terminology. Include the formal description of the PDA and the formal description of the Context Free Grammar to generate such sequences.