摘要
本文以Z80机为例,给出了一种反汇编目标代码的算法。借助于加权有向图这一数学工具,将机器代码的反汇编问题转化成有向图的遍历问题,可很快地反汇编出目的码的符号指令码及数据区代码,大大地提高工作效率。该算法在本文中虽是以Z80机为例给出,但不难推广到其它机种。
Taking Z-80 for example, this paper presents an algorithm which disa ssembles the object codes into mnemonics. By means of the weighted-direct graph, the issue of disassembling object code is transformed into travelling weighted-directed graph. Therefore, the instruction mnemonics and data area codes can be obtained easily and quickly, making the process of disassembling much shortened. Although the algorithm is develoed for Z-80 machine in the paper, it is not difficult to extend it to other machine instructions.
出处
《西南石油学院学报》
CSCD
1989年第2期120-125,共6页
Journal of Southwest Petroleum Institute
关键词
算法语言
反汇编
Algorithm
Disassembling