f(n)

12. Consider the following EBNF gramma bes is known as expressions in prefix form, since the binary operators + and -come efore er wo arguments. This grammar is known to be unambiguous (and hence does not mbiguation parentheses). Determine if each of the following strings belongs t th e category Eif it does, give a parse tree for it abc + abc xyz + abc xyz ABC -abc+ xyz abc abc xyz