I have a problem in C++ programming. Im needing to create a parser that follows the BNF rules in the photo. No need to create a lexical analyzer, Im just needing help in actually doing a parser

In programming, is it preferable to use unqualified references to subprograms, variables, and objects or fully qualified ones? Issues with C's primitive encapsulation and how they manifest in C++ are discussed.

a) We have seen different reduction strategies and evaluation forms in lambda calculusand in Haskell. What are the key points that you can summarise and how would youcomment on these different evaluation strategies, with reference to normalisation?b) Comment on the ways "typing" is handled in the theory (à-la-Church and à-la-Curry) incomparison to those you have seen in Haskell.

Why is it important for modern programming languages to have both pass-by-value operations as well as pass-by-reference features? Why are we not only able to choose one of these two possibilities? It would be helpful if you could explain, in your answer, both the benefits of having both and the reasons why it would be foolish to have only one or the other.

In programming, is it preferable to use unqualified references to subprograms, variables, and objects or fully qualified ones? Issues with C's primitive encapsulation and how they manifest in C++ are discussed.

You are a member of a standardization committee for a new C++ standard, and there is a proposal on the table to drop C-strings from the language and support only the C++ string class. State whether you would oppose or support the proposal and explain why.

I have tried to run the code, using the example usage as well and I get the error: "L is not a number". I will note that I am using GNU Common Lisp to run the code. Do you know how I could fix that?

Help me with my C++ program. Its a lexical analyzer and Im supposed to find all tokens and file then print the found lexeme and token together. Is there any way to do that with a switch case in that it saves what is found then prints the token and whatever lexeme was found?