version 1.43, 2013/03/20 17:11:43
|
version 1.45, 2013/03/23 16:14:39
|
Line 57 analyse_algebrique(struct_processus *s_e
|
Line 57 analyse_algebrique(struct_processus *s_e
|
logical1 presence_fonction; |
logical1 presence_fonction; |
logical1 presence_liste; |
logical1 presence_liste; |
|
|
long k; |
|
|
|
unsigned char *chaine_arguments; |
unsigned char *chaine_arguments; |
unsigned char *chaine_centrale; |
unsigned char *chaine_centrale; |
unsigned char *chaine_droite; |
unsigned char *chaine_droite; |
Line 88 analyse_algebrique(struct_processus *s_e
|
Line 86 analyse_algebrique(struct_processus *s_e
|
integer8 fin_zone_algebrique; |
integer8 fin_zone_algebrique; |
integer8 i; |
integer8 i; |
integer8 j; |
integer8 j; |
|
integer8 k; |
integer8 longueur_chaine; |
integer8 longueur_chaine; |
integer8 longueur_tampon; |
integer8 longueur_tampon; |
integer8 niveau; |
integer8 niveau; |
Line 178 analyse_algebrique(struct_processus *s_e
|
Line 177 analyse_algebrique(struct_processus *s_e
|
{ |
{ |
if ((*ptr1) == '"') |
if ((*ptr1) == '"') |
{ |
{ |
if (presence_chaine == d_faux) |
if (ptr1 != chaine_travail) |
{ |
{ // Il existe un caractère précédent. |
presence_chaine = d_vrai; |
if ((*(ptr1 - 1)) != '\\') |
|
{ |
|
if (presence_chaine == d_faux) |
|
{ |
|
presence_chaine = d_vrai; |
|
} |
|
else |
|
{ |
|
presence_chaine = d_faux; |
|
} |
|
} |
} |
} |
else |
else |
{ |
{ // Il n'existe pas de caractère précédent. |
presence_chaine = d_faux; |
if (presence_chaine == d_faux) |
|
{ |
|
presence_chaine = d_vrai; |
|
} |
|
else |
|
{ |
|
presence_chaine = d_faux; |
|
} |
} |
} |
} |
} |
|
|
Line 1098 analyse_algebrique(struct_processus *s_e
|
Line 1114 analyse_algebrique(struct_processus *s_e
|
unsigned char * |
unsigned char * |
purification_chaine(unsigned char *chaine) |
purification_chaine(unsigned char *chaine) |
{ |
{ |
long i; |
integer8 i; |
long j; |
integer8 j; |
|
|
unsigned char *chaine_purifiee; |
unsigned char *chaine_purifiee; |
|
|
Line 1137 purification_chaine(unsigned char *chain
|
Line 1153 purification_chaine(unsigned char *chain
|
logical1 |
logical1 |
test_expression_rpn(unsigned char *chaine) |
test_expression_rpn(unsigned char *chaine) |
{ |
{ |
long j; |
|
|
|
int t; |
int t; |
int t0; |
int t0; |
int t1; |
int t1; |
Line 1149 test_expression_rpn(unsigned char *chain
|
Line 1163 test_expression_rpn(unsigned char *chain
|
integer8 compteur; |
integer8 compteur; |
integer8 longueur_chaine; |
integer8 longueur_chaine; |
integer8 i; |
integer8 i; |
|
integer8 j; |
integer8 niveau; |
integer8 niveau; |
|
|
/* |
/* |
Line 1317 extraction_chaine(unsigned char *chaine,
|
Line 1332 extraction_chaine(unsigned char *chaine,
|
unsigned char *sous_chaine; |
unsigned char *sous_chaine; |
|
|
if ((position_1 < 1) || (position_2 < position_1) || |
if ((position_1 < 1) || (position_2 < position_1) || |
(position_1 > ((integer8) strlen(chaine)))) |
(position_2 > ((integer8) strlen(chaine)))) |
{ |
|
if ((sous_chaine = (unsigned char *) malloc(sizeof(unsigned char))) |
|
== NULL) |
|
{ |
|
return(NULL); |
|
} |
|
|
|
(*sous_chaine) = d_code_fin_chaine; |
|
return(sous_chaine); |
|
} |
|
|
|
if (position_2 > ((integer8) strlen(chaine))) |
|
{ |
{ |
if ((sous_chaine = (unsigned char *) malloc(sizeof(unsigned char))) |
if ((sous_chaine = (unsigned char *) malloc(sizeof(unsigned char))) |
== NULL) |
== NULL) |