The document outlines a task to implement a recursive descent parser for a specified BNF grammar. Input data should be read from a file named 'input.dat' and results outputted to the console. The implementation must be in C++, and whitespace will not be handled during parsing, making certain characters illegal.

1. Consider the followingBNF grammar:
implement a recursive descent parser that recognizesstrings inthis language. Input should be froma file calledinput.dat and output should be to the
console. Anexample sessionmight look like this:
Youmust implement the project inC++ . To simplifythingsyouwillnot have to handle whitespace whenparsingthe string,i.e. ""and similiar are
illegalcharacters inthislanguage.