Interpreter Programming Project CS 3361 Concepts of Programming Languages Below is the syntax and semantics for a single Boolean expression followed by a period. Write a program which prompts the user to input a file name which contains the Boolean expression or simply to input the string to be checked (indicate which input method you will use in your comments). You may assume that no input will be longer than 100 characters in length. Expressions may contain white spaces and white spaces should be considered to be delimiters (i.e. a white space between the -and > of the implication symbol would be a syntax error). The program should check if the expression in the file is of valid syntax and (if valid) compute the value of the expression. The output should either be an error message or a a message that gives the value of the expression. You must use the techniques taught in the class this is a recursive descent interpreter Syntax: (note: for V use the lowercase letter "v" and for use the caret symbol) Selection Sets ~,T, F, ~, T, F, O IT) (IT,Tail) OT) IT Tail) -> ::= (0T) ::-(AT) OT_Tail) ~, T, F, ( ~, T, F, O (AT) (AT-Tail) L)(AT-Tail) ^ L) AT-Tail) - :: Syntactic Domains: (B): Boo!stmt (IT) Imply term (OT): Or term (AT): And term (IT Tail) Imply tail (OT-Tail): Or.tail (AT Tail) : And tail (L) : Literal (A) : Atonm Interpreter Programming Project CS 3361 Concepts of Programming Languages Below is the syntax and semantics for a single Boolean expression followed by a period. Write a program which prompts the user to input a file name which contains the Boolean expression or simply to input the string to be checked (indicate which input method you will use in your comments). You may assume that no input will be longer than 100 characters in length. Expressions may contain white spaces and white spaces should be considered to be delimiters (i.e. a white space between the -and > of the implication symbol would be a syntax error). The program should check if the expression in the file is of valid syntax and (if valid) compute the value of the expression. The output should either be an error message or a a message that gives the value of the expression. You must use the techniques taught in the class this is a recursive descent interpreter Syntax: (note: for V use the lowercase letter "v" and for use the caret symbol) Selection Sets ~,T, F, ~, T, F, O IT) (IT,Tail) OT) IT Tail) -> ::= (0T) ::-(AT) OT_Tail) ~, T, F, ( ~, T, F, O (AT) (AT-Tail) L)(AT-Tail) ^ L) AT-Tail) - :: Syntactic Domains: (B): Boo!stmt (IT) Imply term (OT): Or term (AT): And term (IT Tail) Imply tail (OT-Tail): Or.tail (AT Tail) : And tail (L) : Literal (A) : Atonm