tex y piles de asembler

\sum\limits_{#1}^{#2}

sum-limits( int **a[k] , int **b[k] )

{

put-grafic( a[k] , x-sumatorio , y-sumatorio+y );

put-grafic( sumatorio[i][j] , x-sumatorio , y-sumatorio );

put-grafic( b[k] , x-sumatorio , y-sumatorio+not(y) );

}

\int\limits_{#1}^{#2}

int-limits( int **a[k] , int **b[k] )

{

put-grafic( a[k] , x-integral+x , y-integral+y );

put-grafic( integral[i][j] , x-integral , y-integral );

put-grafic( b[k] , x-integral , y-integral+not(y) );

}

\int\colimits_{#1}^{#2}

int-colimits( int **a[k] , int **b[k] )

{

put-grafic( a[k] , x-integral , y-integral+y );

put-grafic( integral[i][j] , x-integral , y-integral );

put-grafic( b[k] , x-integral+not(x) , y-integral+not(y) );

}

\package\positive

for( k = 1; k == n ; k++ )

nom-B[k] = nom-A[k]( estructura p[k] );

MOV bx,n

MOV cx,[bx]

MOV di,mon-A

MOV si,nom-B

MOV bx,p

cicle

MOV ax,[di]

PUSH bx

CALL ax

POP dx

MOV [si],dx

INC di

INC si

PUSH bx

CALL inc-sizeof

POP bx

DEC cx

JZ final

JMP cicle

final

for( k = 1 , k == n ; k++ )

**nom[k] = nom[i][j][k];

\package\negative

for( k = not(1); k == not(n) ; k-- )

nom-B[k] = nom-A[k]( estructura p[k] );

MOV bx,not(n)

MOV cx,[bx]

MOV di,not(nom-A)

MOV si,not(nom-B)

MOV bx,not(p)

cicle

MOV ax,[di]

PUSH bx

CALL ax

POP dx

MOV [si],dx

DEC di

DEC si

PUSH bx

CALL dec-sizeof

POP bx

INC cx

JF final

JMP cicle

final

for( k = not(1) , k == not(n) ; k-- )

**nom[k] = nom[i][j][k];

\nom-n

{

put-grafic-positive( nom[k], x-nom , y nom );

}

\nom-not(n)

{

put-grafic-negative( nom[k], x-nom , y nom );

}

Asembler:

Pila de datos:

PUSH ax

POP ax

Pila de IP:

CALL ax

RET