Please Please Please Let an Experts Man, Doctor in Compiler Design To solve this Question

Don't use AI I WANT ONLY EXPERT PERSONS TO SOLVE IT

Question In Theory of Compilers

Q$1$ generate target code for the following source language statements :

$x=a+b+c**(d-e)$

Solve it like this Example

target code for the assignment statement $d$:$=(a-b)+(a-c)+(a-c)$ can be translated into the foll sequence of three address code:

Three Address Code:

$t$:$=a-b$

$u$:$=a-c$

$v$:$=t+u$

$\backslash$table$[[$Statement$,$Code Generated,$\backslash$table$[[$Register$],[$descriptor$],[$Register empty$]],$Address descriptor$],[t$:$=a-b,\backslash$table$[[$MOV a$,$ RO$],[$SUB b$,$ RO$]],$RO contains t$,t$ in $RO$