【正文】 入堆棧（逆序）.model small.data.stack dw 100h.codestart:mov ch,4 mov cl,4 mov bx,84f0hnext: ror bx,cl mov ax,bx and ax,0f000h push ax dec ch jnz next pop ax pop bx pop cx pop dx mov al,4ch int 21hend start19. JMP指令.model small.stack 100h.codestart: mov ax,1 jmp a4 a2: mov bx,2 jmp a5 a3: mov cx,3 jmp a2 a4: mov dx,4 jmp a3 a5: int 3end start20. JZ條件轉移指令：.model small.stack 100h.codestart:mov al,39。 。 a=c xchg ax,c mov a,axnext2:mov ax,b cmp ax,c jge next3 。m2 db 39。ax=*p。INT2222Codedata endscode segment assume ss:stack,cs:code,ds:datastart: mov ax,0 mov es,ax mov ax,seg ir mov es:0072h,ax mov ax,offset ir mov es:0070h,ax jmp $ mov ah,4ch int 21hir proc near mov ax,seg str mov ds,ax mov dx,offset str mov ah,9 int 21h iretir endpcode ends end start 。Start30. 時鐘中斷：重復輸出hello到屏幕顯示stack segment stack 39。21H21H21H21Hp++again: mov ax,[bx] cmp ax,max jng lp1 mov max,axlp1: cmp ax,min jnl lp2 mov min,axlp2:add bx,2 loop again lea dx,m1 call dispstr lea bx,a mov cx,10ag2:mov ax,[bx] call disp add bx,2 loop ag2 call crlf lea dx,m2 call dispstr mov ax,max call disp call crlf lea dx,m3 call dispstr mov ax,min call disp call crlf MOV AH,4CH INT 21Hdisp proc push bx push cx mov cx,0 mov bx,2 mov dx,0lp3: cmp ax,0 jz lp4 div bx push dx mov dx,0 inc cx jmp lp3lp4: cmp cx,0 jz exit pop dx add dl,30h mov ah,2 int 21h loop lp4 mov dl,39。m3 db 39。1+2+3+...100.model small.stack 100h.data result dw ?.code start:mov ax,data mov ds,ax mov ax,0 mov cx,100again:add ax,cx loop again mov result,ax mov ah,4ch int 21hend start26. 求1*2*3*4*5.model small.stack.data sum dd 0.codestart:mov ax,data mov ds,ax mov cx,10 mov ax,1again:mul cx loop again mov sum,ax mov sum+2,dx int 3 mov ah,4ch int 21hend start27. LOOP指令：求字符串中某字符出現的次數.model small.stack 100h.data s db 39。 XY MOV BX,Y 。 test al,01000000b jz aa 。 jz bb cmp al,39。039。 lea si,s1 mov