Please, i need Unique answer, Use your own words (don't copy and paste).

*Please, don't use handwriting. *Please, don't use handwriting.*Please, don't use handwriting.*Please, don't use handwriting.*Please, don't use handwriting.*Please, don't use handwriting.*Please, don't use handwriting.*Please, don't use handwriting.*Please, don't use handwriting.*Please, don't use handwriting.

Please help me to answer all Questions

1. Using the following BNF grammar, + | () show a parse tree and a leftmost derivation for each of the following statements: 1. A - A * (B (C* A)) 2. B (A CB) 3. A -A (B + (c)) 2. Convert the BNF grammar (in question 1) to EBNF 3. Write EBNF grammar for a c/c++/Java for-loop statement The following is an example for statement: for (int k=0,m=100; k , , , , , and . 4. Prove that the following grammar is ambiguous Then, Rewrite the grammar to be Unambiguous 5. Write an attribute grammar for the given BNF + | () I 6. Prove the following program is correct: (n > o) count = n; sum0 while count 0 do sum = sum + count; count = count- 1; end (sum = 1 + 2 + + n}