Take the following program and translate it into PEP/9 assembly language: #include <iostream> using namespace std; int fib(int n){int temp;if (n <= 0) return 0;else if (n <= 2) return 1;else { temp = fib(n – 1); return temp + fib(n-2);}} int main(){ int num; cout << "Which fibonacci number? "; cin >> num; cout << fib(num) << endl; return 0;} You must use equates to access the stack and follow the call to the function as discussed in the book (pass the parameter, return address, return a value and so on). There are NO global variables in the resulting code (except a global message of "Range num? "). It must be able to do sum a range greater than 2. comments would be appreciated Take the following program and translate it into PEP/9 assembly language:#include using namespace std;int fib(int n){int temp:if (n <= 0)return 0;else if (n <= 2)return 1;else {temp = fib(n - 1);return temp + fib(n-2):}}int main()int num;cout << "Which fibonacci number? ";cin >> num;cout << fib(num) << endl;return 0;}You must use equates to access the stack and follow the call to the function as discussed in the book (pass the parameter, return address, return a value and so on). There are NO global variables in the resulting code (except a global message of"Range num? "). It must be able to do sum a range greater than 2.Submit source code.

GetFibo where we are getting f1 and f2 value which will move to stack a1, b1. Count will produce…

Answered: Take the following program and…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

Take the following program and translate it into PEP/9 assembly language:

#include <iostream>

using namespace std;

int fib(int n)

{

int temp;

if (n <= 0)

return 0;

else if (n <= 2)

return 1;

else {

temp = fib(n – 1);

return temp + fib(n-2);

}

int main()

{

int num;

cout << "Which fibonacci number? ";

cin >> num;

cout << fib(num) << endl;

return 0;

}

You must use equates to access the stack and follow the call to the function as discussed in the book (pass the parameter, return address, return a value and so on). There are NO global variables in the resulting code (except a global message of "Range num? "). It must be able to do sum a range greater than 2.

comments would be appreciated

Take the following program and translate it into PEP/9 assembly language:
#include <iostream>
using namespace std;
int fib(int n)
{
int temp:
if (n <= 0)
return 0;
else if (n <= 2)
return 1;
else {
temp = fib(n - 1);
return temp + fib(n-2):
}
}
int main()
int num;
cout << "Which fibonacci number? ";
cin >> num;
cout << fib(num) << endl;
return 0;
}
You must use equates to access the stack and follow the call to the function as discussed in the book (pass the parameter, return address, return a value and so on). There are NO global variables in the resulting code (except a global message of
"Range num? "). It must be able to do sum a range greater than 2.
Submit source code.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions