can you help me by implementing a recursive subroutines in assembly to run on LC 3 simulator A recursive programming of displaying the Fibonacci Sequence The Fibonacci sequence is defined as F ( n ) F ( n 1 ) F ( n 2 ) Where, F ( 0 ) 0 and F ( 1 ) 1 I think im close but i have a problem on line 1 1 6 right now i have ORIG x 3 0 0 0 LD R 6 , STACK PTR LEA R 4 , GLOBAL VARS ADD R 6 , R 6 , 1 STR R 7 , R 6 , 0 push return address ADD R 6 , R 6 , 1 STR R 5 , R 6 , 0 push prev frame ptr ADD R 5 , R 6 , 0 set frame ptr ADD R 6 , R 6 , 1 AND R 0 , R 0 , 0 STR R 0 , R 6 , 0 push int input 0 ADD R 6 , R 6 , 1 STR R 0 , R 6 , 0 push int result 0 ADD R 0 , R 4 , 0 ADD R 0 , R 0 , 2 globals offset PUTS ADD R 6 , R 6 , 1 push getnum's rv JSR GETNUM LDR R 0 , R 6 , 0 STR R 0 , R 5 , 1 int input getnum ( ) ADD R 6 , R 6 , 1 pop getnum's rv ADD R 6 , R 6 , 1 LDR R 0 , R 5 , 1 STR R 0 , R 6 , 0 push FIB's arg ADD R 6 , R 6 , 1 push FIB's rv JSR FIB LDR R 0 , R 6 , 0 STR R 0 , R 5 , 2 return value FIB ( input ) STR R 0 , R 5 , 2 int result FIB ( input ) ADD R 6 , R 6 , 1 pop arg ADD R 6 , R 6 , 1 pop rv ADD R 0 , R 4 , 0 ADD R 0 , R 0 , 1 5 ADD R 0 , R 0 , 1 3 PUTS first part of response ADD R 6 , R 6 , 1 LDR R 0 , R 5 , 1 STR R 0 , R 6 , 0 push display's arg ( int input ) JSR DISPLAY ADD R 6 , R 6 , 1 pop arg ADD R 0 , R 4 , 0 ADD R 0 , R 0 , 1 5 ADD R 0 , R 0 , 1 5 ADD R 0 , R 0 , 2 PUTS second part of response ADD R 6 , R 6 , 1 LDR R 0 , R 5 , 2 STR R 0 , R 6 , 0 push display's arg ( int result ) JSR DISPLAY ADD R 6 , R 6 , 1 pop arg ADD R 6 , R 6 , 1 pop result ADD R 6 , R 6 , 1 pop input LDR R 5 , R 6 , 0 ADD R 6 , R 6 , 1 pop prev frame ptr LDR R 7 , R 6 , 0 ADD R 6 , R 6 , 1 pop return address HALT GLOBAL VARS NEG ASCII FILL 4 8 0 ASCII FILL x 3 0 1 PROMPT STRINGZ Please enter a number n 2 RESULT 1 STRINGZ F ( 2 8 RESULT 2 STRINGZ ) 3 2 STACK PTR FILL x 6 0 0 0 FIB Fn F ( n 1 ) F ( n 2 ) F ( 0 ) 0 F ( 1 ) 1 3 triangle ( n 1 ) 3 triangle ( n 2 ) triangle ( n 3 ) ADD R 6 , R 6 , 1 STR R 7 , R 6 , 0 push return addr ADD R 6 , R 6 , 1 STR R 5 , R 6 , 0 push prev frame ptr ADD R 5 , R 6 , 0 BASE CASES checking n 0 LDR R 0 , R 5 , 3 BRnp END IF 0 ADD R 0 , R 0 , 0 STR R 0 , R 5 , 2 BRnzp RETURN FIB END IF 0 checking n 1 LDR R 0 , R 5 , 3 ADD R 0 , R 0 , 1 BRnp END IF 1 ADD R 0 , R 0 , 1 STR R 0 , R 5 , 2 BRnzp RETURN FIB END IF 1 i dont understand how if i comment these 2 lines out it breaks the program STR R 0 , R 5 , 2 BRnzp RETURN FIB ADD R 6 , R 6 , 1 LDR R 0 , R 5 , 3 ADD R 0 , R 0 , 1 STR R 0 , R 6 , 0 push argument ( n 1 ) ADD R 6 , R 6 , 1 push return value JSR FIB LDR R 0 , R 6 , 0 return value STR R 0 , R 5 , 2 put in return value x 5 FF 8 2 x 5 FFA ADD R 6 , R 6 , 1 pop return value ADD R 6 , R 6 , 1 pop arg JSR FIB LDR R 1 , R 5 , 2 ADD R 0 , R 0 , R 1 STR R 0 , R 5 , 2 complete calc and put return value x 5 FF 8 2 x 5 FFA RETURN FIB LDR R 5 , R 6 , 0 ADD R 6 , R 6 , 1 pop prev frame ptr LDR R 7 , R 6 , 0 ADD R 6 , R 6 , 1 pop return address RET GETNUM ADD R 6 , R 6 , 1 STR R 7 , R 6 , 0 push return addr ADD R 6 , R 6 , 1 STR R 5 , R 6 , 0 push prev frame ptr ADD R 5 , R 6 , 0 GETC OUT LDR R 1 , R 4 , 0 ADD R 0 , R 1 , R 0 STR R 0 , R 5 , 2 return value LDR R 5 , R 6 , 0 ADD R 6 , R 6 , 1 pop prev frame ptr LDR R 7 , R 6 , 0 ADD R 6 , R 6 , 1 pop return address RET DISPLAY ADD R 6 , R 6 , 1 STR R 7 , R 6 , 0 push return addr ADD R 6 , R 6 , 1 STR R 5 , R 6 , 0 push prev frame ptr ADD R 5 , R 6 , 0 AND R 0 , R 0 , 0 ADD R 6 , R 6 , 1 int tens 0 STR R 0 , R 6 , 0 LDR R 3 , R 4 , 1 ASCII offset AND R 2 , R 2 , 0 tens counter ADD R 2 , R 2 , 1 start at 1 , at beginning of iteration ADD R 0 , R 0 , 1 0 R 0 1 0 LDR R 1 , R 5 , 2 R 1 int n TEN LOOP

The Answer is in the image, click to view ...

Question: can you help me by implementing a recursive subroutines in assembly to run on LC - 3 simulator. A recursive programming of displaying the Fibonacci

can you help me by implementing a recursive subroutines in assembly to run on LC

- 3

simulator. A recursive programming of displaying the Fibonacci Sequence. The Fibonacci sequence is defined as:

(

) =

(

- 1) +

(

- 2)

Where, F

(0) = 0

and F

(1) = 1

I think im close but i have a problem on line

116

right now i have

.

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 FIB's arg

ADD R

6,

6,

- 1

; push FIB's rv

JSR FIB

LDR R

0,

6,

0

STR R

0,

5,

2

; return value

=

FIB

(

input

)

STR R

0,

5,

- 2

; int result

=

FIB

(

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

FIB

;Fn

=

(

- 1) +

(

- 2)

(0) = 0

(1) = 1

;

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,

0

STR R

0,

5,

2

BRnzp RETURN

_

FIB

END

_

_0

; checking n

= = 1

LDR R

0,

5,

3

ADD R

0,

0,

- 1

BRnp END

_

_1

ADD R

0,

0,

1

STR R

0,

5,

2

BRnzp RETURN

_

FIB

END

_

_1

; i dont understand how if i comment these

2

lines out it breaks the program

STR R

0,

5,

2

BRnzp RETURN

_

FIB

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 FIB

LDR R

0,

6,

0

; return value

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

JSR FIB

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

_

FIB

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

RET

GETNUM

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

GETC

OUT

LDR R

1,

4,

0

ADD R

0,

1,

0

STR R

0,

5,

2

; return value

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

RET

DISPLAY

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

AND R

0,

0,

0

ADD R

6,

6,

- 1

; int tens

= 0

STR R

0,

6,

0

LDR R

3,

4,

1

; ASCII offset

AND R

2,

2,

0

; tens counter

ADD R

2,

2,

- 1

; start at

- 1, + +

at beginning of iteration

ADD R

0,

0,

- 10

; R

0 = - 10

LDR R

1,

5,

2

; R

1 =

int n

TEN

_

LOOP

Step by Step Solution There are 3 Steps involved in it 1 Expert Approved Answer Step: 1 Unlock Question Has Been Solved by an Expert! Get step-by-step solutions from verified subject matter experts View Solution Step: 2 Unlock Step: 3 UnlockStudents Have Also Explored These Related Programming Questions! Q: can you help me by implementing a recursive subroutines in assembly. A common exercise in recursive programming is displaying the Fibonacci Sequence. The Fibonacci sequence is defined as: F ( n ) = F... Q: I need to implement a recursive subroutines in assembly. A recursive programming displaying the Fibonacci Sequence. The Fibonacci sequence is defined as: F ( n ) = F ( n - 1 ) + F ( n - 2 ) Where, F... Q: 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... Q: Discrete structure MAC281 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 have... Q: The Fibonacci sequence is a series of numbers where each number is the sum of the two preceding numbers. Here's how a Fibonacci series function works: Functionality: The function typically takes an... Q: The Fibonacci sequence is a series of numbers where each number is the sum of the two preceding numbers. Here's how a Fibonacci series function works: Functionality: The function typically takes an... Q: 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... Q: 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... Q: In HW 1 , you've set up the RISC - V simulator ( rv 3 2 sim ) and modified the example assembly function and test C function to demonstrate copying a string from one memory location to another. In HW... Q:) Consider integer division of one two's-complement binary number by another. Programming languages may vary in the result when one argument is negative. What differing conventions might they be... Q: Discuss how the Internet has made it possible for small businesses to compete with large businesses concerning human resource related matters. Q: Live Racking at B.M.W. Assume that you are the warehouse director for B.M.W. B.M.W. has learned that the 39-second cycle time described in the case is inadequate for 21st century operations and has... Q: Jullan tramderred 1 0 0 percent of his stock in Lemon Company to Apricot Corporation in a Type B stock - for - stock exchange In exchange, he recelved stock in Apricot with a fair market value of 5 4... Q: The total cost of crashing the project by 4 days is 4 (Enter your response as a whole number.) is the cost ot the that Sdaru. at 4 days? Normal Crash Normal Total Cost Activity (days) (days) Cost... Previous Question Next QuestionRecommended Textbook More Books Mobile Communications Authors: Jochen Schiller 2nd edition 978-0321123817, 321123816, 978-8131724262 Ask a Question and Get Instant Help! Get AnswerStudy Help Open in AppServices Sitemap Fun Definitions Become Tutor Used Textbooks Study Help Categories Recent Questions Expert Questions Campus Wear Sell Your Books Company Info Security Copyrights Privacy Policy Terms & Conditions SolutionInn Fee Scholarship Online Quiz Give Feedback, Get Rewards Get In Touch About Us Contact Us Career Jobs FAQ Student Discount Campus Ambassador Secure Payment Download Our App © 2026 SolutionInn. All Rights Reservedwindow.addEventListener("load",function(){jQuery(document).ready(function(t){

        // Clarity tracking
        (function(c,l,a,r,i,t,y){
            c[a]=c[a]||function(){(c[a].q=c[a].q||[]).push(arguments)};
            t=l.createElement(r);t.async=1;t.src="https://www.clarity.ms/tag/"+i;
            y=l.getElementsByTagName(r)[0];y.parentNode.insertBefore(t,y);
        })(window, document, "clarity", "script", "sjv6tuxsok");

        // Helper to read a cookie by name
        function getCookie(name) {
            return document.cookie
                .split('; ')
                .map(v => v.split('='))
                .reduce((acc, [k, val]) => (k === name ? decodeURIComponent(val || '') : acc), '');
        }

                 // Read cookies
         var si  = getCookie('si_u_id');
         var uid = getCookie('u_id');
         var zen = getCookie('zenid');
         // Send to Clarity
         if (si)  clarity('set', 'si_u_id', si);
         if (uid) clarity('set', 'u_id', uid);
         if (zen) clarity('set', 'zenid', zen);
         clarity('set', 'ip_address', '216.73.216.28');

        t.ajax({type:"POST",url:"/",data:{trackUserActivity:!0,reqUri:document.URL,referer:document.referrer},success:function(t){}})})},!1),window.addEventListener("load",function(){jQuery(document).ready(function(t){t.ajax({type:"POST",url:"/",data:{insertCrawler:!0,reqUri:document.URL,parseTime:"0.056",queryTime:"0.01654768548584",queryCount:"30"},success:function(t){}})})},!1),window.addEventListener("load",function(){jQuery(document).ready(function(){function t(t="",n=!1){var i="itms-apps://itunes.apple.com/app/id6462455425",e="openApp://action?"+t;isAndroid()?(setTimeout(function(){return window.location="market://details?id=com.solutioninn.studyhelp",!1},25),window.location=e):isIOS()?(setTimeout(function(){return window.location=i,!1},25),window.location=e):(i="https://apps.apple.com/in/app/id6462455425",n&&(i="https://play.google.com/store/apps/details?id=com.solutioninn.studyhelp"),window.open("about:blank","_blank").location.href=i)}jQuery("#appModal").modal("show"),jQuery(".download-app-btn").click(function(){t(jQuery(this).attr("data-question-open-url"))}),jQuery(".redirection").click(function(){var n=jQuery(this).attr("data-question-open-url"),i=jQuery(this).attr("data-id");void 0!=n?1==i?t(n,!0):t(n,!1):1==i?t("",!0):t("",!1)}),jQuery(".app-notification-close").click(function(){jQuery(".app-notification-section").css("visibility","hidden");var t=new FormData;t.append("hide_notification",!0),jQuery.ajax({type:"POST",url:"/",data:t,cache:!1,contentType:!1,processData:!1,beforeSend:function(){},success:function(t){location.reload()}})})})},!1);