Imagine that your top-down, recursive-descent parser generated the tree as illustrated in Figure 2 [2]. What is the expression, S, that your lexical analyzer and parser received as the input? Does this expression, S, belong to the language defined by the following context-free grammar? Prove your answer. {(+ / -) } + {(* 1/) } id int_constant | ) sum 47 total ) Figure 2. A parse tree generated during syntax analysis of an expression based on some CFG