-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathgen.c
More file actions
249 lines (213 loc) · 7.97 KB
/
Copy pathgen.c
File metadata and controls
249 lines (213 loc) · 7.97 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
#include "gen.h"
p_node* gen_phrase_nodes(trees T, int* size) {
int model = rand() % 3;
int l, index = 0;
p_node* res = NULL;
p_node* temp = NULL;
switch (model){
case 0: // nom – adjectif – verbe – nom
l = 4;
res = (p_node*) malloc(sizeof(p_node*) * l);
res[index++] = random_word(T.tree_nom);
res[index++] = random_word(T.tree_adj);
res[index++] = random_word(T.tree_ver);
res[index++] = random_word(T.tree_nom);
break;
case 1: // nom – ‘qui’ – verbe – verbe – nom – adjectif
l = 6;
res = (p_node*) malloc(sizeof(p_node) * l);
res[index++] = random_word(T.tree_nom);
temp = search_word(T, "qui", NULL);
if (temp != NULL) {
res[index++] = temp[0];
free(temp);
} else {
printf("cannot find the word 'qui'\n");
res[index++] = NULL;
}
res[index++] = random_word(T.tree_ver);
res[index++] = random_word(T.tree_ver);
res[index++] = random_word(T.tree_nom);
res[index++] = random_word(T.tree_adj);
break;
case 2: // interjection – nom – adverbe – adjectif – verbe – adjectif – nom – adjectif – 'et' – adverbe – adjectif
l = 11;
res = (p_node*) malloc(sizeof(p_node) * l);
res[index++] = random_word(T.tree_int);
res[index++] = random_word(T.tree_nom);
res[index++] = random_word(T.tree_adv);
res[index++] = random_word(T.tree_adj);
res[index++] = random_word(T.tree_ver);
res[index++] = random_word(T.tree_adj);
res[index++] = random_word(T.tree_nom);
res[index++] = random_word(T.tree_adj);
temp = search_word(T, "et", NULL);
if (temp != NULL) {
res[index++] = temp[0];
free(temp);
} else {
printf("cannot find the word 'et'\n");
res[index++] = NULL;
}
res[index++] = random_word(T.tree_adv);
res[index++] = random_word(T.tree_adj);
break;
default:
break;
}
*size = index;
return res;
}
char* find_flechie_genrenumber(p_node pn, int gender, int number) {
// model: [Nom, Mas, SG, Fem, PL]
char* tab_gender[] = {"Mas", "Fem", "InvGen"};
char* tab_number[] = {"SG", "PL", "InvPL"};
flechi** tab = pn->tab_flechis;
for (int i=0; i < pn->nb_flechis; ++i) {
for (int i_cara=0; i_cara < (int) tab[i]->nb_cara / 2; ++i_cara) {
int cond_genre = (gender == 2 ||
strcmp(tab[i]->tab_caracteristics[i_cara * 2 + 1], tab_gender[gender]) == 0 ||
strcmp(tab[i]->tab_caracteristics[i_cara * 2 + 1], tab_gender[2]) == 0);
int cond_type = (number == 2 ||
strcmp(tab[i]->tab_caracteristics[i_cara * 2 + 2], tab_number[number]) == 0 ||
strcmp(tab[i]->tab_caracteristics[i_cara * 2 + 2], tab_number[2]) == 0);
if (cond_type && cond_genre) {
return tab[i]->word;
}
}
}
return NULL;
}
char* find_flechie_verb(p_node pn, char temps, int gender, int pers) {
// models: [Ver:PPre] | [Ver:IImp+SG+P1:IImp+SG+P2]
char* tab_gender[] = {"SG", "PL", "InvPL"};
char* tab_pers[] = {"P1", "P2", "P3"};
flechi** tab = pn->tab_flechis;
for (int i=0; i < pn->nb_flechis; ++i) {
for (int i_cara=0; i_cara < (int) tab[i]->nb_cara / 3; ++i_cara) {
int cond_temps = (tab[i]->tab_caracteristics[(i_cara * 3) + 1])[0] == temps;
int cond_genre = (gender == 2 || strcmp(tab[i]->tab_caracteristics[(i_cara * 3 + 1) + 1], tab_gender[gender]) == 0 || strcmp(tab[i]->tab_caracteristics[(i_cara * 3 + 1) + 1], tab_gender[2]) == 0);
int cond_pers = strcmp(tab[i]->tab_caracteristics[(i_cara * 3 + 2) + 1], tab_pers[pers]) == 0;
if (cond_temps && cond_genre && cond_pers) return tab[i]->word;
}
}
return NULL;
}
/**
* If pn has a noun flechi form, return a random genre and number that pn has.
* Returns: 1 if pn has at least a noun flechi form; else 0.
*/
int get_random_genrenumber_from_noun(p_node pn, int* genre, int* number) {
int noun_exists = 0;
for (int i=0; i < pn->nb_flechis; ++i) if (strcmp(pn->tab_flechis[i]->tab_caracteristics[0], "Nom") == 0) {
noun_exists = 1;
break;
}
if (noun_exists == 0) return 0;
int r;
flechi* temp = NULL;
while (1) {
r = rand() % pn->nb_flechis;
temp = pn->tab_flechis[r];
if (strcmp(temp->tab_caracteristics[0], "Nom") != 0) continue;
r = rand() % (temp->nb_cara - 1) / 2;
if (strcmp(temp->tab_caracteristics[2*r + 1], "Mas") == 0) *genre = 0;
else if (strcmp(temp->tab_caracteristics[2*r + 1], "Fem") == 0) *genre = 1;
else *genre = rand() % 2;
if (strcmp(temp->tab_caracteristics[2*r + 2], "SG") == 0) *number = 0;
else if (strcmp(temp->tab_caracteristics[2*r + 2], "PL") == 0) *number = 1;
else *number = rand() % 2;
return 1;
}
}
/**
* Makes a string from an array of strings.
* Does not de-allocate the array, nor the strings.
*/
char* transform_from_array(char** array, int size_array) {
char* res = NULL;
int size_res = 0;
for (int i=0; i<size_array; ++i) {
if (array[i] == NULL) continue;
int taille = strlen(array[i]);
res = realloc(res, size_res + taille + 2); // include space and null char
for (int j=0; j < taille; ++j) res[size_res + j] = array[i][j];
res[size_res + taille] = ' ';
res[size_res + taille + 1] = '\0';
size_res += taille + 1; // include space char
}
res[size_res - 1] = '\0';
return res;
}
char* gen_phrase_base(trees T) {
int size_tnode = 0;
p_node* nodes = gen_phrase_nodes(T, &size_tnode);
int size_fl = size_tnode;
char** tab_flechies = malloc(sizeof(char*) * size_fl);
for (int i=0; i<size_tnode; ++i) if (nodes[i] != NULL) tab_flechies[i] = nodes[i]->tab_flechis[0]->baseword;
char* res = transform_from_array(tab_flechies, size_fl);
free(tab_flechies);
free(nodes);
return res;
}
char* gen_phrase_flechie(trees T){
int size_tnode = 0;
p_node* nodes = gen_phrase_nodes(T, &size_tnode);
int index = 0;
int size_fl = size_tnode;
char** tab_flechies = malloc(sizeof(char*) * size_fl);
int gender = rand() % 3, number = rand() % 3;
for (int i=0; i<size_tnode; ++i) {
char* temp = NULL;
if (strcmp(nodes[i]->tab_flechis[0]->tab_caracteristics[0], "Nom") == 0) {
get_random_genrenumber_from_noun(nodes[i], &gender, &number);
size_fl++;
// déterminant
p_node rnd_det = random_word(T.tree_det);
tab_flechies = realloc(tab_flechies, sizeof(char*) * size_fl);
do {
temp = find_flechie_genrenumber(rnd_det, gender, number);
if (temp == NULL) {
printf("missing flechi form for det %s with gender %d and number %d\n", rnd_det->tab_flechis[0]->baseword, gender, number);
rnd_det = random_word(T.tree_det);
}
} while (temp == NULL);
tab_flechies[index++] = temp;
// nom
do {
temp = find_flechie_genrenumber(nodes[i], gender, number);
if (temp == NULL) {
printf("missing flechi form for nom %s with gender %d and number %d\n", nodes[i]->tab_flechis[0]->baseword, gender, number);
nodes[i] = random_word(T.tree_nom);
}
} while (temp == NULL);
tab_flechies[index] = temp;
}
else if (strcmp(nodes[i]->tab_flechis[0]->tab_caracteristics[0], "Adj") == 0) {
do {
temp = find_flechie_genrenumber(nodes[i], gender, number);
if (temp == NULL) {
printf("missing flechi form for adj %s with gender %d and number %d\n", nodes[i]->tab_flechis[0]->baseword, gender, number);
nodes[i] = random_word(T.tree_adj);
}} while (temp == NULL);
tab_flechies[index] = temp;
}
else if (strcmp(nodes[i]->tab_flechis[0]->tab_caracteristics[0], "Ver") == 0) {
do {
temp = find_flechie_verb(nodes[i], 'I', number, 2);
if (temp == NULL) {
printf("missing flechi form for ver %s with time I, number %d and person 2\n", nodes[i]->tab_flechis[0]->baseword, number);
nodes[i] = random_word(T.tree_ver);
}} while (temp == NULL);
tab_flechies[index] = temp;
}
else { // préposition ou pronom indéfini ou interjection
tab_flechies[index] = nodes[i]->tab_flechis[0]->word;
}
index++;
}
char* res = transform_from_array(tab_flechies, size_fl);
free(tab_flechies);
free(nodes);
return res;
}