This assignment builds on the parser provided as an example on the course$$s Web site. You

are asked to implement type and scope checking on top of this parser. The output of the resulting

program should be empty if both checks are correct and should print appropriate error messages

for any type or scope error.

Note that the class currently used for AST nodes is minimal and particularly tailored to printing. You will have to add more attributes and probably more member functions to it$.$ You are free

to use any organization you like for your symbol table. I will not insist on any optimization for

the symbol table operations.