Skip to main content

Program 7: Fibonacci Series

 **Program 7: Fibonacci Series**


```assembly

.model small

.stack 100h


.data

    count dw 10

    fib1 dw 0

    fib2 dw 1

    result dw ?


.code

    main proc

        mov cx, count       ; Load 'count' into CX

        

    fib_loop:

        add result, fib1    ; Add fib1 to result

        mov ax, fib1        ; Swap fib1 and fib2

        mov fib1, fib2

        mov fib2, ax

        loop fib_loop       ; Decrement CX and loop if not zero

        

        mov ah, 4Ch          ; Exit program

        int 21h

    main endp

end main

```


Explanation:

1. `.model small` and `.stack 100h`: Memory model and stack size definitions.

2. `.data` section: Declares the data segment.

   - `count dw 10`: Defines a word-sized variable named "count" with value 10.

   - `fib1 dw 0`: Defines a word-sized variable named "fib1" with initial value 0.

   - `fib2 dw 1`: Defines a word-sized variable named "fib2" with initial value 1.

   - `result dw ?`: Defines a word-sized uninitialized variable named "result".

3. `.code` section: Contains the main code.

   - `mov cx, count`: Move the value of "count" into the CX register.

   - `fib_loop:`: Label for


 the Fibonacci loop.

   - `add result, fib1`: Add the value of "fib1" to the "result".

   - `mov ax, fib1`: Swap the values of "fib1" and "fib2".

   - `mov fib1, fib2`: Move the value of "fib2" into "fib1".

   - `mov fib2, ax`: Move the value of "ax" (original "fib1") into "fib2".

   - `loop fib_loop`: Decrement CX and loop if CX is not zero.

   - `mov ah, 4Ch`: Set the exit code for DOS.

   - `int 21h`: Call DOS interrupt to exit the program.
Labels:

Comments

Post a Comment

Popular posts from this blog

Program 6: Finding Prime Numbers in a Range

  ** Program 6: Finding Prime Numbers in a Range ** ```assembly .model small .stack 100h .data     start dw 1     end dw 20 .code     main proc         mov ax, start           ; Load 'start' into AX              find_primes:         inc ax                  ; Move to the next number         cmp ax, end             ; Compare with 'end'         jg end_prog             ; Jump to end if AX > 'end'                  mov cx, ax              ; Copy AX to CX   ...
Post a Comment
Read more

ktu 2019 Cse Complier programing Lab Syllabus

 1Design and implement a lexical analyzer using C language to recognize all valid tokens  in the input program. The lexical analyzer should ignore redundant spaces, tabs and  newlines. It should also ignore comments. 2. Implement a Lexical Analyzer for a given program using Lex Tool. 3. Write a lex program to display the number of lines, words and characters in an input text. 4. Write a LEX Program to convert the substring abc to ABC from the given input string. 5. Write a lex program to find out the total number of vowels and consonants from the given  input string. 6. Generate a YACC specification to recognize a valid arithmetic expression that uses  operators +, – , *,/ and parenthesis. 7. Generate a YACC specification to recognize a valid identifier which starts with a letter  followed by any number of letters or digits.   8. Implementation of Calculator using LEX and YACC  9. Convert the BNF rules into YACC form and write code to generat...
Post a Comment
Read more

11. Write a program to convert NFA with ε transition to NFA without ε transition

  Converting an NFA with ε transitions to an NFA without ε transitions involves removing ε transitions and appropriately updating the transitions in the resulting NFA. Below is an example program in Python that performs this conversion. I'll explain each line of the code: ```python class NFA:     def __init__(self, states, alphabet, transitions, start_state, accept_states):         self.states = states         self.alphabet = alphabet         self.transitions = transitions         self.start_state = start_state         self.accept_states = accept_states def epsilon_closure(states, transitions):     epsilon_states = set(states)     stack = list(states)          while stack:   ...
Post a Comment
Read more