ps-estructure de politja

\begin{ps-estructure}
\case{(-1)}
{
\caixa{not(x-m),y-m}{m_{1}}
\corda{0+(-r),y}{not(x-m),y-m}
\vector-vertical-negatiu{not(x-m),y}{q_{1}·g}
\vector-vertical-positiu{not(x-m),y}{T_{1}}
}
\case{not(0)}
{
\semi-cercle-negatiu{not(not(0)),y}{r}
\vector-vertical-negatiu{not(not(0)),y}{q_{0}·g}
}
\case{0}
{
\semi-cercle-positiu{0,y}{r}
\vector-vertical-positiu{0,y}{F_{0}}
}
\case{1}
{
\caixa{x-m,y-m}{m_{2}}
\corda{0+r,y}{x-m,y-m}
\vector-vertical-negatiu{x-m,y}{q_{2}·g}
\vector-vertical-positiu{x-m,y}{T_{2}}
}
\end{ps-estructure}

tex print-cursive

n-x=1;
k=1;
while( text-x[1] == [ \cursive{ ] ; text-x[k] != [ } ] ; k++ )
{
print-tex-positiu(text-y[k],\cursive);
n-x++;
}
k=(-1);
while( text-y[(-1)] == [ } ] ; text-y[k] != [ \cursive{ ] ; k-- )
{
print-tex-negatiu(text-y[k],\cursive);
}
avanç-text-positiu(n-x);


k=1;
while( text-x[1] == [ \dual-cursive{ ] ; text-x[k] != [ } ] ; k++ )
{
print-tex-positiu(text-y[k],\dual-cursive);
}
n-y=(-1);
k=(-1);
while( text-y[(-1)] == [ } ] ; text-y[k] != [ \dual-cursive{ ] ; k-- )
{
print-tex-negatiu(text-y[k],\dual-cursive);
n-y--;
}
avanç-text-negatiu(n-y);

tex matriu

n-x=1;
n-y=(-1);
i=1;
array-x[1][1]=scan-tex-positiu();
while( array-x[1][1] == [ \begin{array} ] ; array-x[i][j] != [ \end{array} ] ; i++ )
{
si i == 1 ==>
{
tamany-x[1]=scan-tex-positiu();
while( tamany-x[1] == [ { ] ; tamany-x[k] != [ } ] ; k++ )
{
tamany-x[k]=scan-tex-positiu();
n-x++;
}
tamany-y[(-1)]=scan-tex-negatiu();
while( tamany-y[(-1)] == [ } ] ; tamany-y[k] != [ { ] ; k-- )
{
tamany-y[k]=scan-tex-negatiu();
n-y--;
}
}
avanç-text-positiu(n-x);
for( j=1 ; j [< n-x ; j++ )
{
int array-x[i][j];
array-x[i][j]=scan-tex-positiu();
}
for( j=(-1) ; j >] n-y ; j-- )
{
int array-x[i][j];
array-x[i][j]=scan-tex-negatiu();
}
}


n-x=1;
n-y=(-1);
i=(-1);
array-x[(-1)][(-1)]=scan-tex-negatiu();
while( array-y[(-1)][(-1)] == [ \begin{dual-array} ] ; array-y[i][j] != [ \end{dual-array} ] ; i-- )
{
si i == (-1) ==>
{
tamany-x[1]=scan-tex-positiu();
while( tamany-x[1] == [ { ] ; tamany-x[k] != [ } ] ; k++ )
{
tamany-x[k]=scan-tex-positiu();
n-x++;
}
tamany-y[(-1)]=scan-tex-negatiu();
while( tamany-y[(-1)] == [ } ] ; tamany-y[k] != [ { ] ; k-- )
{
tamany-y[k]=scan-tex-negatiu();
n-y--;
}
}
avanç-text-negatiu(n-y);
for( j=(-1) ; j >] n-y ; j-- )
{
int array-y[i][j];
array-y[i][j]=scan-tex-negatiu();
}
for( j=1 ; j [< n-x ; j++ )
{
int array-y[i][j];
array-y[i][j]=scan-tex-positiu();
}
}

tex

n-x=1;
k=1;
text-x[1]=scan-tex-positiu();
while( text-x[1] == [ \nom{ ] ; text-x[k] != [ } ] ; k++ )
{
int text-x[k];
text-x[k]=scan-tex-positiu();
n-x++;
}
k=(-1);
text-y[(-1)]=scan-tex-negatiu();
while( text-y[(-1)] == [ } ] ; text-y[k] != [ \nom{ ] ; k-- )
{
int text-y[k];
text-y[k]=scan-tex-negatiu();
}
avanç-text-positiu(n-x);


k=1;
text-x[1]=scan-tex-positiu();
while( text-x[1] == [ \dual-nom{ ] ; text-x[k] != [ } ] ; k++ )
{
int text-x[k];
text-x[k]=scan-tex-positiu();
}
n-y=(-1);
k=(-1);
text-y[(-1)]=scan-tex-negatiu();
while( text-y[(-1)] == [ } ] ; text-y[k] != [ \dual-nom{ ] ; k-- )
{
int text-y[k];
text-y[k]=scan-tex-negatiu();
n-y--;
}
avanç-text-negatiu(n-y);