Question: I need to implement a recursive subroutines in assembly. A recursive programming displaying the Fibonacci Sequence. The Fibonacci sequence is defined as: F ( n

I need to implement a recursive subroutines in assembly. A recursive programming displaying the Fibonacci Sequence. The Fibonacci sequence is defined as:

(

) =

(

- 1) +

(

- 2)

Where, F

(0) = 0

and F

(1) = 1

'

m doing it by editing the triangle function in the below code

.

ORIG x

3000

LD R

6,

STACK

_

PTR

LEA R

4,

GLOBAL

_

VARS

ADD R

6,

6,

- 1

STR R

7,

6,

0

; push return address

ADD R

6,

6,

- 1

STR R

5,

6,

0

; push prev frame ptr

ADD R

5,

6,

0

; set frame ptr

ADD R

6,

6,

- 1

AND R

0,

0,

0

STR R

0,

6,

0

; push int input

= 0

ADD R

6,

6,

- 1

STR R

0,

6,

0

; push int result

= 0

ADD R

0,

4,

0

ADD R

0,

0,

2

; globals offset

PUTS

ADD R

6,

6,

- 1

; push getnum's rv

JSR GETNUM

LDR R

0,

6,

0

STR R

0,

5,

- 1

; int input

=

getnum

()

ADD R

6,

6,

1

; pop getnum's rv

ADD R

6,

6,

- 1

LDR R

0,

5,

- 1

STR R

0,

6,

0

; push triangle's arg

ADD R

6,

6,

- 1

; push triangle's rv

JSR TRIANGLE

LDR R

0,

6,

0

STR R

0,

5,

2

; return value

=

triangle

(

input

)

STR R

0,

5,

- 2

; int result

=

triangle

(

input

)

ADD R

6,

6,

1

; pop arg

ADD R

6,

6,

1

; pop rv

ADD R

0,

4,

0

ADD R

0,

0,

15

ADD R

0,

0,

13

PUTS ; first part of response

ADD R

6,

6,

- 1

LDR R

0,

5,

- 1

STR R

0,

6,

0

; push display's arg

(

int input

)

JSR DISPLAY

ADD R

6,

6,

1

; pop arg

ADD R

0,

4,

0

ADD R

0,

0,

15

ADD R

0,

0,

15

ADD R

0,

0,

2

PUTS ; second part of response

ADD R

6,

6,

- 1

LDR R

0,

5,

- 2

STR R

0,

6,

0

; push display's arg

(

int result

)

JSR DISPLAY

ADD R

6,

6,

1

; pop arg

ADD R

6,

6,

1

; pop result

ADD R

6,

6,

1

; pop input

LDR R

5,

6,

0

ADD R

6,

6,

1

; pop prev frame ptr

LDR R

7,

6,

0

ADD R

6,

6,

1

; pop return address

HALT

GLOBAL

_

VARS

NEG

_

ASCII

.

FILL #

- 48

; #

0

ASCII

.

FILL x

30

; #

1

PROMPT

.

STRINGZ "Please enter a number n:

"

; #

2

RESULT

_1 .

STRINGZ

"

("

; #

28

RESULT

_2 .

STRINGZ

") = "

; #

32

STACK

_

PTR

.

FILL x

6000

TRIANGLE

;

3 *

triangle

(

- 1) - 3 *

triangle

(

- 2) +

triangle

(

- 3)

ADD R

6,

6,

- 1

STR R

7,

6,

0

; push return addr

ADD R

6,

6,

- 1

STR R

5,

6,

0

; push prev frame ptr

ADD R

5,

6,

0

; BASE CASES

; checking n

= = 0

LDR R

0,

5,

3

BRnp END

_

_0

ADD R

0,

0,

1

STR R

0,

5,

2

BRnzp RETURN

_

TRIANGLE

END

_

_0

; checking n

= = 1

LDR R

0,

5,

3

ADD R

0,

0,

- 1

BRnp END

_

_1

ADD R

0,

0,

3

STR R

0,

5,

2

BRnzp RETURN

_

TRIANGLE

END

_

_1

; checking n

= = 2

LDR R

0,

5,

3

ADD R

0,

0,

- 2

BRnp END

_

_2

ADD R

0,

0,

6

STR R

0,

5,

2

BRnzp RETURN

_

TRIANGLE

END

_

_2

ADD R

6,

6,

- 1

LDR R

0,

5,

3

ADD R

0,

0,

- 1

STR R

0,

6,

0

; push argument

(

- 1)

ADD R

6,

6,

- 1

; push return value

JSR TRIANGLE

LDR R

0,

6,

0

; return value

ADD R

1,

0,

0

ADD R

0,

0,

1

;

3 *

triangle

(

- 1)

STR R

0,

5,

2

; put in return value x

5

8 + 2 =

5

FFA

ADD R

6,

6,

1

; pop return value

ADD R

6,

6,

1

; pop arg

ADD R

6,

6,

- 1

LDR R

0,

5,

3

ADD R

0,

0,

- 2

STR R

0,

6,

0

; push argument

(

- 2)

ADD R

6,

6,

- 1

; push return value

JSR TRIANGLE

LDR R

0,

6,

0

; return value

ADD R

1,

0,

0

ADD R

0,

1,

0

;

3 *

return value

;

3 *

triangle

(

- 1) - 3 *

triangle

(

- 2)

LDR R

1,

5,

2

NOT R

0,

0

ADD R

0,

0,

1

; two's

ADD R

0,

0,

1

STR R

0,

5,

2

; x

5

8 + 2 =

5

FFA

ADD R

6,

6,

1

; pop return value

ADD R

6,

6,

1

; pop arg

ADD R

6,

6,

- 1

LDR R

0,

5,

3

ADD R

0,

0,

- 3

STR R

0,

6,

0

; push arg

(

- 3)

ADD R

6,

6,

- 1

; return value

JSR TRIANGLE

LDR R

0,

6,

0

; return value

ADD R

6,

6,

1

; popping rv

ADD R

6,

6,

1

; pop arg

LDR R

1,

5,

2

ADD R

0,

0,

1

STR R

0,

5,

2

; complete calc and put return value x

5

8 + 2 =

5

FFA

RETURN

_

TRIANGLE

LDR R

5,

6,

0

ADD R

6,

6,

1

; pop prev frame ptr

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!

public class FibModule { public static long fib(int n) { //TODO : COMPLETE BODY OF RECURSIVE METHOD return 0; } public static long ifib(int n) { //TODO : COMPLETE BODY OF ITERATIVE METHOD return 0; }...

1 Recursion in Assembly Programming Lab # 5 CEG 3 3 1 0 / 5 3 1 0 : Computer Organization PURPOSE In this lab you will learn how to implement recursive subroutines in assembly. ASSIGNMENT You will be...

ARM assembly: Fibonacci (recursive) Due date: Friday, 16 November 2018, 11:55 PM Requested files: fib_rec.asm (Download) Type of work: Individual work Assume that XO contains a positive integer...

USING C++ LANGUAGE ONLY. There are many problems that have a recursive component to them. In addition, most things that are done recursively can also be done with recursion. This homework is not...

I need help making this using the MIPS assembly language. 4. Implement a recursive function that calculates nth number in the Catalan number sequence. Catalan number sequence occurs in various...

Subject:Discrete structures Discrete Structures Project (Integrative learning, written) Goal: The main goal of the project is to let students use their prior knowledge, try to use the skills they...

subject: Discrete structu Project Goal: The main goal of the project is to let students use their prior knowledge, try to use the skills they have learnt to solve real world problems. Using this...

I will post the codes to work with at the end of the qestions. Use PYTHON programing. Thank you! starterfile.py # PART A def factorial(n): """ Recursive factorial function. """ pass def C(n,k): """...

can someone solve this Modern workstations typically have memory systems that incorporate two or three levels of caching. Explain why they are designed like this. [4 marks] In order to investigate...

Programming Assignment (Submission required: 50 points) In this assignment, you will be learning Scheme through the use of DrRacket. We start with some basic concepts; trying to understand prefix...

Select an example of group conflict from your professional experience on which to base this assignment. Write a critical analysis of an example of group conflict. Include at least four concepts from...

In Example 14.16, a basic hydrogenoxygen fuel cell reaction was analyzed at 25C, 100 kPa. Repeat this calculation, assuming that the fuel cell operates on air at 25C, 100 kPa, instead of on pure...

Which of the following is NOT an element of an action for fraudulent misrepresentation ( fraud ) : Intentional misrepresentation or omission of an important fact. The innocent party relies on the...

You should place the education section of your rsum before the work experience section when You should place the education section of your rsum before the work experience section when you were