Implement the syntax-checking parser application involving a stack. Read in a string that may include the symbols ‘(’, ‘{’ and ‘[’ and their “closed” counterparts. If they are closed out of order, or if a close is missing, or if there is an extra close symbol, the program should report an error. In the sample below, the bold text is user input. You may assume a maximum string size of 25 characters.
Zip this with your completed document and upload to the link provided on Moodle.
Sample Output
This program checks for syntax errors involving open-close pair symbols.
Please enter a string, with “quit” allowing the user to exit the program:
(a + b) * g
The above string is correct.
Please enter a string, with “quit” allowing the user to exit the program:
(a + b) – random string }
There is an error in the above string.
Please enter a string, with “quit” allowing the user to exit the program:
((a * b) + u
There is an error in the above string.
Please enter a string, with “quit” allowing the user to exit the program:
{a + [g * f }]
There is an error in the above string.
Please enter a string, with “quit” allowing the user to exit the program:
quit
Bonus: 5% if the parser can identify the kind of error (open with no close, close with no open, closings out of order).
DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma
Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t
Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th
1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of
1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of