Question

Give the JAVA code for the following IJVM :

Answer 1

java code:

if(k<0) //k is pushed into stack and iflt checks if its value is less than 0 the the branching condition is true

{

k=k+5; // branching leads it to perform the l1 part which push 5 onto the stack and adds k and and store it into k and push it onto the stack

// l3 does not perform any function as of now as given in the question image

}

else // when the iflt cannot perform the branching it continues to perform the next instruction

{

i=i+i; // it loads a new local variable onto the stack and copy it two times and pushes it onto the stack and then add the top two values and push that value onto the stack

k=i; // value of addition is stored in local variable k

i=10; //value stored at i is changes to 10 using istore as 10 is the top most on the stack

}