Skip to content
Related Articles

Related Articles

Improve Article

8085 program to convert a hexadecimal number into ASCII code

  • Last Updated : 26 May, 2019

Problem: Write an assembly level language program to convert HEX code to its respective ASCII code.
Assume that starting address of program and input memory location are 2000 and 2050 respectively.

Example:

Input: 2050 E4 (Hex data)

Output:
2051 34 (ASCII code for 4)
2052 45 (ASCII code for E) 

Algorithm:

  1. Load the given data in accumulator and move to B register
  2. Mask the most significant 4 bits(upper nibble) of the Hexa decimal number in accumulator.
  3. Call subroutine to get ASCII of least significant 4 bits.
  4. Store it in memory
  5. Move B register to accumulator and mask the least significant 4 bits(lower nibble).
  6. Rotate the upper and lower nibble position.
  7. Call subroutine to get ASCII of upper nibble
  8. Store it in memory
  9. Terminate the program.

Code:



MEMORY ADDRESSMNEMONICSCOMMENTS
2000LDA 2050HLoad the hex data
2003MOV B, Amove content of accumulator to B
2004ANI OFHmask upper nibble
2006CALL SUB1get ascii code for upper nibble
2009STA 2051H
2012MOV A, Bmove content of B to accumulator
2013ANI F0Hmask lower nibble
2015RLC
2016RLC
2017RLC
2018RLC
2019CALL SUB1get ascii code for lower nibble
2022STA 2052H
2025HLT
SUB1CPI 0AH
JC SKIP
ADI 07H
SKIPADI 30H
RET

Explanation:

  1. LDA 2050H: load the content of memory location 2050H in accumulator.
  2. MOV B, A: copies the content of accumulator to register B.
  3. ANI OFH: AND operation is performed between accumulator and 0FH value.
  4. CALL SUB1: the subroutine at memory location SUB1 is called.
  5. STA 2051H: store the content of accumulator in the memory location 2051H.
  6. MOV A, B: copies the content of register B to accumulator.
  7. ANI F0H: AND operation is performed between accumulator and F0H value.
  8. RLC: rotate accumulator left.
  9. HLT: stops executing the program and halts any further execution.
  10. CPI 0AH: compare accumulator content with 0AH value.
  11. JC SKIP: jump to memory location SKIP if the carry bit is set.
  12. ADI 07H: add 07H value to the content of accumulator.
  13. RET: Return from the subroutine unconditionally.

Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.

 

My Personal Notes arrow_drop_up
Recommended Articles
Page :