YAZ 5.35.1
stem_UTF_8_dutch.c
Go to the documentation of this file.
1
2/* This file was generated automatically by the Snowball to ANSI C compiler */
3
4#include "../runtime/header.h"
5
6#ifdef __cplusplus
7extern "C"
8{
9#endif
10 extern int dutch_UTF_8_stem (struct SN_env *z);
11#ifdef __cplusplus
12}
13#endif
14static int r_standard_suffix (struct SN_env *z);
15static int r_undouble (struct SN_env *z);
16static int r_R2 (struct SN_env *z);
17static int r_R1 (struct SN_env *z);
18static int r_mark_regions (struct SN_env *z);
19static int r_en_ending (struct SN_env *z);
20static int r_e_ending (struct SN_env *z);
21static int r_postlude (struct SN_env *z);
22static int r_prelude (struct SN_env *z);
23#ifdef __cplusplus
24extern "C"
25{
26#endif
27
28
29 extern struct SN_env *dutch_UTF_8_create_env (void);
30 extern void dutch_UTF_8_close_env (struct SN_env *z);
31
32
33#ifdef __cplusplus
34}
35#endif
36static const symbol s_0_1[2] = { 0xC3, 0xA1 };
37static const symbol s_0_2[2] = { 0xC3, 0xA4 };
38static const symbol s_0_3[2] = { 0xC3, 0xA9 };
39static const symbol s_0_4[2] = { 0xC3, 0xAB };
40static const symbol s_0_5[2] = { 0xC3, 0xAD };
41static const symbol s_0_6[2] = { 0xC3, 0xAF };
42static const symbol s_0_7[2] = { 0xC3, 0xB3 };
43static const symbol s_0_8[2] = { 0xC3, 0xB6 };
44static const symbol s_0_9[2] = { 0xC3, 0xBA };
45static const symbol s_0_10[2] = { 0xC3, 0xBC };
46
47static const struct among a_0[11] = {
48/* 0 */ {0, 0, -1, 6, 0},
49/* 1 */ {2, s_0_1, 0, 1, 0},
50/* 2 */ {2, s_0_2, 0, 1, 0},
51/* 3 */ {2, s_0_3, 0, 2, 0},
52/* 4 */ {2, s_0_4, 0, 2, 0},
53/* 5 */ {2, s_0_5, 0, 3, 0},
54/* 6 */ {2, s_0_6, 0, 3, 0},
55/* 7 */ {2, s_0_7, 0, 4, 0},
56/* 8 */ {2, s_0_8, 0, 4, 0},
57/* 9 */ {2, s_0_9, 0, 5, 0},
58/* 10 */ {2, s_0_10, 0, 5, 0}
59};
60
61static const symbol s_1_1[1] = { 'I' };
62static const symbol s_1_2[1] = { 'Y' };
63
64static const struct among a_1[3] = {
65/* 0 */ {0, 0, -1, 3, 0},
66/* 1 */ {1, s_1_1, 0, 2, 0},
67/* 2 */ {1, s_1_2, 0, 1, 0}
68};
69
70static const symbol s_2_0[2] = { 'd', 'd' };
71static const symbol s_2_1[2] = { 'k', 'k' };
72static const symbol s_2_2[2] = { 't', 't' };
73
74static const struct among a_2[3] = {
75/* 0 */ {2, s_2_0, -1, -1, 0},
76/* 1 */ {2, s_2_1, -1, -1, 0},
77/* 2 */ {2, s_2_2, -1, -1, 0}
78};
79
80static const symbol s_3_0[3] = { 'e', 'n', 'e' };
81static const symbol s_3_1[2] = { 's', 'e' };
82static const symbol s_3_2[2] = { 'e', 'n' };
83static const symbol s_3_3[5] = { 'h', 'e', 'd', 'e', 'n' };
84static const symbol s_3_4[1] = { 's' };
85
86static const struct among a_3[5] = {
87/* 0 */ {3, s_3_0, -1, 2, 0},
88/* 1 */ {2, s_3_1, -1, 3, 0},
89/* 2 */ {2, s_3_2, -1, 2, 0},
90/* 3 */ {5, s_3_3, 2, 1, 0},
91/* 4 */ {1, s_3_4, -1, 3, 0}
92};
93
94static const symbol s_4_0[3] = { 'e', 'n', 'd' };
95static const symbol s_4_1[2] = { 'i', 'g' };
96static const symbol s_4_2[3] = { 'i', 'n', 'g' };
97static const symbol s_4_3[4] = { 'l', 'i', 'j', 'k' };
98static const symbol s_4_4[4] = { 'b', 'a', 'a', 'r' };
99static const symbol s_4_5[3] = { 'b', 'a', 'r' };
100
101static const struct among a_4[6] = {
102/* 0 */ {3, s_4_0, -1, 1, 0},
103/* 1 */ {2, s_4_1, -1, 2, 0},
104/* 2 */ {3, s_4_2, -1, 1, 0},
105/* 3 */ {4, s_4_3, -1, 3, 0},
106/* 4 */ {4, s_4_4, -1, 4, 0},
107/* 5 */ {3, s_4_5, -1, 5, 0}
108};
109
110static const symbol s_5_0[2] = { 'a', 'a' };
111static const symbol s_5_1[2] = { 'e', 'e' };
112static const symbol s_5_2[2] = { 'o', 'o' };
113static const symbol s_5_3[2] = { 'u', 'u' };
114
115static const struct among a_5[4] = {
116/* 0 */ {2, s_5_0, -1, -1, 0},
117/* 1 */ {2, s_5_1, -1, -1, 0},
118/* 2 */ {2, s_5_2, -1, -1, 0},
119/* 3 */ {2, s_5_3, -1, -1, 0}
120};
121
122static const unsigned char g_v[] =
123 { 17, 65, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 128 };
124
125static const unsigned char g_v_I[] =
126 { 1, 0, 0, 17, 65, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 128 };
127
128static const unsigned char g_v_j[] =
129 { 17, 67, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 128 };
130
131static const symbol s_0[] = { 'a' };
132static const symbol s_1[] = { 'e' };
133static const symbol s_2[] = { 'i' };
134static const symbol s_3[] = { 'o' };
135static const symbol s_4[] = { 'u' };
136static const symbol s_5[] = { 'y' };
137static const symbol s_6[] = { 'Y' };
138static const symbol s_7[] = { 'i' };
139static const symbol s_8[] = { 'I' };
140static const symbol s_9[] = { 'y' };
141static const symbol s_10[] = { 'Y' };
142static const symbol s_11[] = { 'y' };
143static const symbol s_12[] = { 'i' };
144static const symbol s_13[] = { 'e' };
145static const symbol s_14[] = { 'g', 'e', 'm' };
146static const symbol s_15[] = { 'h', 'e', 'i', 'd' };
147static const symbol s_16[] = { 'h', 'e', 'i', 'd' };
148static const symbol s_17[] = { 'c' };
149static const symbol s_18[] = { 'e', 'n' };
150static const symbol s_19[] = { 'i', 'g' };
151static const symbol s_20[] = { 'e' };
152static const symbol s_21[] = { 'e' };
153
154static int
155r_prelude (struct SN_env *z)
156{
157 int among_var;
158 {
159 int c_test = z->c; /* test, line 42 */
160 while (1)
161 { /* repeat, line 42 */
162 int c1 = z->c;
163 z->bra = z->c; /* [, line 43 */
164 if (z->c + 1 >= z->l || z->p[z->c + 1] >> 5 != 5
165 || !((340306450 >> (z->p[z->c + 1] & 0x1f)) & 1))
166 among_var = 6;
167 else
168 among_var = find_among (z, a_0, 11); /* substring, line 43 */
169 if (!(among_var))
170 goto lab0;
171 z->ket = z->c; /* ], line 43 */
172 switch (among_var)
173 {
174 case 0:
175 goto lab0;
176 case 1:
177 {
178 int ret = slice_from_s (z, 1, s_0); /* <-, line 45 */
179 if (ret < 0)
180 return ret;
181 }
182 break;
183 case 2:
184 {
185 int ret = slice_from_s (z, 1, s_1); /* <-, line 47 */
186 if (ret < 0)
187 return ret;
188 }
189 break;
190 case 3:
191 {
192 int ret = slice_from_s (z, 1, s_2); /* <-, line 49 */
193 if (ret < 0)
194 return ret;
195 }
196 break;
197 case 4:
198 {
199 int ret = slice_from_s (z, 1, s_3); /* <-, line 51 */
200 if (ret < 0)
201 return ret;
202 }
203 break;
204 case 5:
205 {
206 int ret = slice_from_s (z, 1, s_4); /* <-, line 53 */
207 if (ret < 0)
208 return ret;
209 }
210 break;
211 case 6:
212 {
213 int ret = skip_utf8 (z->p, z->c, 0, z->l, 1);
214 if (ret < 0)
215 goto lab0;
216 z->c = ret; /* next, line 54 */
217 }
218 break;
219 }
220 continue;
221 lab0:
222 z->c = c1;
223 break;
224 }
225 z->c = c_test;
226 }
227 {
228 int c_keep = z->c; /* try, line 57 */
229 z->bra = z->c; /* [, line 57 */
230 if (!(eq_s (z, 1, s_5)))
231 {
232 z->c = c_keep;
233 goto lab1;
234 }
235 z->ket = z->c; /* ], line 57 */
236 {
237 int ret = slice_from_s (z, 1, s_6); /* <-, line 57 */
238 if (ret < 0)
239 return ret;
240 }
241 lab1:
242 ;
243 }
244 while (1)
245 { /* repeat, line 58 */
246 int c2 = z->c;
247 while (1)
248 { /* goto, line 58 */
249 int c3 = z->c;
250 if (in_grouping_U (z, g_v, 97, 232, 0))
251 goto lab3;
252 z->bra = z->c; /* [, line 59 */
253 {
254 int c4 = z->c; /* or, line 59 */
255 if (!(eq_s (z, 1, s_7)))
256 goto lab5;
257 z->ket = z->c; /* ], line 59 */
258 if (in_grouping_U (z, g_v, 97, 232, 0))
259 goto lab5;
260 {
261 int ret = slice_from_s (z, 1, s_8); /* <-, line 59 */
262 if (ret < 0)
263 return ret;
264 }
265 goto lab4;
266 lab5:
267 z->c = c4;
268 if (!(eq_s (z, 1, s_9)))
269 goto lab3;
270 z->ket = z->c; /* ], line 60 */
271 {
272 int ret = slice_from_s (z, 1, s_10); /* <-, line 60 */
273 if (ret < 0)
274 return ret;
275 }
276 }
277 lab4:
278 z->c = c3;
279 break;
280 lab3:
281 z->c = c3;
282 {
283 int ret = skip_utf8 (z->p, z->c, 0, z->l, 1);
284 if (ret < 0)
285 goto lab2;
286 z->c = ret; /* goto, line 58 */
287 }
288 }
289 continue;
290 lab2:
291 z->c = c2;
292 break;
293 }
294 return 1;
295}
296
297static int
299{
300 z->I[0] = z->l;
301 z->I[1] = z->l;
302 { /* gopast *//* grouping v, line 69 */
303 int ret = out_grouping_U (z, g_v, 97, 232, 1);
304 if (ret < 0)
305 return 0;
306 z->c += ret;
307 }
308 { /* gopast *//* non v, line 69 */
309 int ret = in_grouping_U (z, g_v, 97, 232, 1);
310 if (ret < 0)
311 return 0;
312 z->c += ret;
313 }
314 z->I[0] = z->c; /* setmark p1, line 69 */
315 /* try, line 70 */
316 if (!(z->I[0] < 3))
317 goto lab0;
318 z->I[0] = 3;
319lab0:
320 { /* gopast *//* grouping v, line 71 */
321 int ret = out_grouping_U (z, g_v, 97, 232, 1);
322 if (ret < 0)
323 return 0;
324 z->c += ret;
325 }
326 { /* gopast *//* non v, line 71 */
327 int ret = in_grouping_U (z, g_v, 97, 232, 1);
328 if (ret < 0)
329 return 0;
330 z->c += ret;
331 }
332 z->I[1] = z->c; /* setmark p2, line 71 */
333 return 1;
334}
335
336static int
338{
339 int among_var;
340 while (1)
341 { /* repeat, line 75 */
342 int c1 = z->c;
343 z->bra = z->c; /* [, line 77 */
344 if (z->c >= z->l || (z->p[z->c + 0] != 73 && z->p[z->c + 0] != 89))
345 among_var = 3;
346 else
347 among_var = find_among (z, a_1, 3); /* substring, line 77 */
348 if (!(among_var))
349 goto lab0;
350 z->ket = z->c; /* ], line 77 */
351 switch (among_var)
352 {
353 case 0:
354 goto lab0;
355 case 1:
356 {
357 int ret = slice_from_s (z, 1, s_11); /* <-, line 78 */
358 if (ret < 0)
359 return ret;
360 }
361 break;
362 case 2:
363 {
364 int ret = slice_from_s (z, 1, s_12); /* <-, line 79 */
365 if (ret < 0)
366 return ret;
367 }
368 break;
369 case 3:
370 {
371 int ret = skip_utf8 (z->p, z->c, 0, z->l, 1);
372 if (ret < 0)
373 goto lab0;
374 z->c = ret; /* next, line 80 */
375 }
376 break;
377 }
378 continue;
379 lab0:
380 z->c = c1;
381 break;
382 }
383 return 1;
384}
385
386static int
387r_R1 (struct SN_env *z)
388{
389 if (!(z->I[0] <= z->c))
390 return 0;
391 return 1;
392}
393
394static int
395r_R2 (struct SN_env *z)
396{
397 if (!(z->I[1] <= z->c))
398 return 0;
399 return 1;
400}
401
402static int
404{
405 {
406 int m_test = z->l - z->c; /* test, line 91 */
407 if (z->c - 1 <= z->lb || z->p[z->c - 1] >> 5 != 3
408 || !((1050640 >> (z->p[z->c - 1] & 0x1f)) & 1))
409 return 0;
410 if (!(find_among_b (z, a_2, 3)))
411 return 0; /* among, line 91 */
412 z->c = z->l - m_test;
413 }
414 z->ket = z->c; /* [, line 91 */
415 {
416 int ret = skip_utf8 (z->p, z->c, z->lb, 0, -1);
417 if (ret < 0)
418 return 0;
419 z->c = ret; /* next, line 91 */
420 }
421 z->bra = z->c; /* ], line 91 */
422 {
423 int ret = slice_del (z); /* delete, line 91 */
424 if (ret < 0)
425 return ret;
426 }
427 return 1;
428}
429
430static int
432{
433 z->B[0] = 0; /* unset e_found, line 95 */
434 z->ket = z->c; /* [, line 96 */
435 if (!(eq_s_b (z, 1, s_13)))
436 return 0;
437 z->bra = z->c; /* ], line 96 */
438 {
439 int ret = r_R1 (z);
440 if (ret == 0)
441 return 0; /* call R1, line 96 */
442 if (ret < 0)
443 return ret;
444 }
445 {
446 int m_test = z->l - z->c; /* test, line 96 */
447 if (out_grouping_b_U (z, g_v, 97, 232, 0))
448 return 0;
449 z->c = z->l - m_test;
450 }
451 {
452 int ret = slice_del (z); /* delete, line 96 */
453 if (ret < 0)
454 return ret;
455 }
456 z->B[0] = 1; /* set e_found, line 97 */
457 {
458 int ret = r_undouble (z);
459 if (ret == 0)
460 return 0; /* call undouble, line 98 */
461 if (ret < 0)
462 return ret;
463 }
464 return 1;
465}
466
467static int
469{
470 {
471 int ret = r_R1 (z);
472 if (ret == 0)
473 return 0; /* call R1, line 102 */
474 if (ret < 0)
475 return ret;
476 }
477 {
478 int m1 = z->l - z->c;
479 (void) m1; /* and, line 102 */
480 if (out_grouping_b_U (z, g_v, 97, 232, 0))
481 return 0;
482 z->c = z->l - m1;
483 {
484 int m2 = z->l - z->c;
485 (void) m2; /* not, line 102 */
486 if (!(eq_s_b (z, 3, s_14)))
487 goto lab0;
488 return 0;
489 lab0:
490 z->c = z->l - m2;
491 }
492 }
493 {
494 int ret = slice_del (z); /* delete, line 102 */
495 if (ret < 0)
496 return ret;
497 }
498 {
499 int ret = r_undouble (z);
500 if (ret == 0)
501 return 0; /* call undouble, line 103 */
502 if (ret < 0)
503 return ret;
504 }
505 return 1;
506}
507
508static int
510{
511 int among_var;
512 {
513 int m1 = z->l - z->c;
514 (void) m1; /* do, line 107 */
515 z->ket = z->c; /* [, line 108 */
516 if (z->c <= z->lb || z->p[z->c - 1] >> 5 != 3
517 || !((540704 >> (z->p[z->c - 1] & 0x1f)) & 1))
518 goto lab0;
519 among_var = find_among_b (z, a_3, 5); /* substring, line 108 */
520 if (!(among_var))
521 goto lab0;
522 z->bra = z->c; /* ], line 108 */
523 switch (among_var)
524 {
525 case 0:
526 goto lab0;
527 case 1:
528 {
529 int ret = r_R1 (z);
530 if (ret == 0)
531 goto lab0; /* call R1, line 110 */
532 if (ret < 0)
533 return ret;
534 }
535 {
536 int ret = slice_from_s (z, 4, s_15); /* <-, line 110 */
537 if (ret < 0)
538 return ret;
539 }
540 break;
541 case 2:
542 {
543 int ret = r_en_ending (z);
544 if (ret == 0)
545 goto lab0; /* call en_ending, line 113 */
546 if (ret < 0)
547 return ret;
548 }
549 break;
550 case 3:
551 {
552 int ret = r_R1 (z);
553 if (ret == 0)
554 goto lab0; /* call R1, line 116 */
555 if (ret < 0)
556 return ret;
557 }
558 if (out_grouping_b_U (z, g_v_j, 97, 232, 0))
559 goto lab0;
560 {
561 int ret = slice_del (z); /* delete, line 116 */
562 if (ret < 0)
563 return ret;
564 }
565 break;
566 }
567 lab0:
568 z->c = z->l - m1;
569 }
570 {
571 int m2 = z->l - z->c;
572 (void) m2; /* do, line 120 */
573 {
574 int ret = r_e_ending (z);
575 if (ret == 0)
576 goto lab1; /* call e_ending, line 120 */
577 if (ret < 0)
578 return ret;
579 }
580 lab1:
581 z->c = z->l - m2;
582 }
583 {
584 int m3 = z->l - z->c;
585 (void) m3; /* do, line 122 */
586 z->ket = z->c; /* [, line 122 */
587 if (!(eq_s_b (z, 4, s_16)))
588 goto lab2;
589 z->bra = z->c; /* ], line 122 */
590 {
591 int ret = r_R2 (z);
592 if (ret == 0)
593 goto lab2; /* call R2, line 122 */
594 if (ret < 0)
595 return ret;
596 }
597 {
598 int m4 = z->l - z->c;
599 (void) m4; /* not, line 122 */
600 if (!(eq_s_b (z, 1, s_17)))
601 goto lab3;
602 goto lab2;
603 lab3:
604 z->c = z->l - m4;
605 }
606 {
607 int ret = slice_del (z); /* delete, line 122 */
608 if (ret < 0)
609 return ret;
610 }
611 z->ket = z->c; /* [, line 123 */
612 if (!(eq_s_b (z, 2, s_18)))
613 goto lab2;
614 z->bra = z->c; /* ], line 123 */
615 {
616 int ret = r_en_ending (z);
617 if (ret == 0)
618 goto lab2; /* call en_ending, line 123 */
619 if (ret < 0)
620 return ret;
621 }
622 lab2:
623 z->c = z->l - m3;
624 }
625 {
626 int m5 = z->l - z->c;
627 (void) m5; /* do, line 126 */
628 z->ket = z->c; /* [, line 127 */
629 if (z->c - 1 <= z->lb || z->p[z->c - 1] >> 5 != 3
630 || !((264336 >> (z->p[z->c - 1] & 0x1f)) & 1))
631 goto lab4;
632 among_var = find_among_b (z, a_4, 6); /* substring, line 127 */
633 if (!(among_var))
634 goto lab4;
635 z->bra = z->c; /* ], line 127 */
636 switch (among_var)
637 {
638 case 0:
639 goto lab4;
640 case 1:
641 {
642 int ret = r_R2 (z);
643 if (ret == 0)
644 goto lab4; /* call R2, line 129 */
645 if (ret < 0)
646 return ret;
647 }
648 {
649 int ret = slice_del (z); /* delete, line 129 */
650 if (ret < 0)
651 return ret;
652 }
653 {
654 int m6 = z->l - z->c;
655 (void) m6; /* or, line 130 */
656 z->ket = z->c; /* [, line 130 */
657 if (!(eq_s_b (z, 2, s_19)))
658 goto lab6;
659 z->bra = z->c; /* ], line 130 */
660 {
661 int ret = r_R2 (z);
662 if (ret == 0)
663 goto lab6; /* call R2, line 130 */
664 if (ret < 0)
665 return ret;
666 }
667 {
668 int m7 = z->l - z->c;
669 (void) m7; /* not, line 130 */
670 if (!(eq_s_b (z, 1, s_20)))
671 goto lab7;
672 goto lab6;
673 lab7:
674 z->c = z->l - m7;
675 }
676 {
677 int ret = slice_del (z); /* delete, line 130 */
678 if (ret < 0)
679 return ret;
680 }
681 goto lab5;
682 lab6:
683 z->c = z->l - m6;
684 {
685 int ret = r_undouble (z);
686 if (ret == 0)
687 goto lab4; /* call undouble, line 130 */
688 if (ret < 0)
689 return ret;
690 }
691 }
692 lab5:
693 break;
694 case 2:
695 {
696 int ret = r_R2 (z);
697 if (ret == 0)
698 goto lab4; /* call R2, line 133 */
699 if (ret < 0)
700 return ret;
701 }
702 {
703 int m8 = z->l - z->c;
704 (void) m8; /* not, line 133 */
705 if (!(eq_s_b (z, 1, s_21)))
706 goto lab8;
707 goto lab4;
708 lab8:
709 z->c = z->l - m8;
710 }
711 {
712 int ret = slice_del (z); /* delete, line 133 */
713 if (ret < 0)
714 return ret;
715 }
716 break;
717 case 3:
718 {
719 int ret = r_R2 (z);
720 if (ret == 0)
721 goto lab4; /* call R2, line 136 */
722 if (ret < 0)
723 return ret;
724 }
725 {
726 int ret = slice_del (z); /* delete, line 136 */
727 if (ret < 0)
728 return ret;
729 }
730 {
731 int ret = r_e_ending (z);
732 if (ret == 0)
733 goto lab4; /* call e_ending, line 136 */
734 if (ret < 0)
735 return ret;
736 }
737 break;
738 case 4:
739 {
740 int ret = r_R2 (z);
741 if (ret == 0)
742 goto lab4; /* call R2, line 139 */
743 if (ret < 0)
744 return ret;
745 }
746 {
747 int ret = slice_del (z); /* delete, line 139 */
748 if (ret < 0)
749 return ret;
750 }
751 break;
752 case 5:
753 {
754 int ret = r_R2 (z);
755 if (ret == 0)
756 goto lab4; /* call R2, line 142 */
757 if (ret < 0)
758 return ret;
759 }
760 if (!(z->B[0]))
761 goto lab4; /* Boolean test e_found, line 142 */
762 {
763 int ret = slice_del (z); /* delete, line 142 */
764 if (ret < 0)
765 return ret;
766 }
767 break;
768 }
769 lab4:
770 z->c = z->l - m5;
771 }
772 {
773 int m9 = z->l - z->c;
774 (void) m9; /* do, line 146 */
775 if (out_grouping_b_U (z, g_v_I, 73, 232, 0))
776 goto lab9;
777 {
778 int m_test = z->l - z->c; /* test, line 148 */
779 if (z->c - 1 <= z->lb || z->p[z->c - 1] >> 5 != 3
780 || !((2129954 >> (z->p[z->c - 1] & 0x1f)) & 1))
781 goto lab9;
782 if (!(find_among_b (z, a_5, 4)))
783 goto lab9; /* among, line 149 */
784 if (out_grouping_b_U (z, g_v, 97, 232, 0))
785 goto lab9;
786 z->c = z->l - m_test;
787 }
788 z->ket = z->c; /* [, line 152 */
789 {
790 int ret = skip_utf8 (z->p, z->c, z->lb, 0, -1);
791 if (ret < 0)
792 goto lab9;
793 z->c = ret; /* next, line 152 */
794 }
795 z->bra = z->c; /* ], line 152 */
796 {
797 int ret = slice_del (z); /* delete, line 152 */
798 if (ret < 0)
799 return ret;
800 }
801 lab9:
802 z->c = z->l - m9;
803 }
804 return 1;
805}
806
807extern int
809{
810 {
811 int c1 = z->c; /* do, line 159 */
812 {
813 int ret = r_prelude (z);
814 if (ret == 0)
815 goto lab0; /* call prelude, line 159 */
816 if (ret < 0)
817 return ret;
818 }
819 lab0:
820 z->c = c1;
821 }
822 {
823 int c2 = z->c; /* do, line 160 */
824 {
825 int ret = r_mark_regions (z);
826 if (ret == 0)
827 goto lab1; /* call mark_regions, line 160 */
828 if (ret < 0)
829 return ret;
830 }
831 lab1:
832 z->c = c2;
833 }
834 z->lb = z->c;
835 z->c = z->l; /* backwards, line 161 */
836
837 {
838 int m3 = z->l - z->c;
839 (void) m3; /* do, line 162 */
840 {
841 int ret = r_standard_suffix (z);
842 if (ret == 0)
843 goto lab2; /* call standard_suffix, line 162 */
844 if (ret < 0)
845 return ret;
846 }
847 lab2:
848 z->c = z->l - m3;
849 }
850 z->c = z->lb;
851 {
852 int c4 = z->c; /* do, line 163 */
853 {
854 int ret = r_postlude (z);
855 if (ret == 0)
856 goto lab3; /* call postlude, line 163 */
857 if (ret < 0)
858 return ret;
859 }
860 lab3:
861 z->c = c4;
862 }
863 return 1;
864}
865
866extern struct SN_env *
868{
869 return SN_create_env (0, 2, 1);
870}
871
872extern void
874{
875 SN_close_env (z, 0);
876}
struct SN_env * SN_create_env(int S_size, int I_size, int B_size)
Definition api.c:6
void SN_close_env(struct SN_env *z, int S_size)
Definition api.c:50
unsigned char symbol
Definition api.h:2
int find_among_b(struct SN_env *z, const struct among *v, int v_size)
Definition utilities.c:400
int out_grouping_U(struct SN_env *z, const unsigned char *s, int min, int max, int repeat)
Definition utilities.c:170
int slice_del(struct SN_env *z)
Definition utilities.c:573
int in_grouping_U(struct SN_env *z, const unsigned char *s, int min, int max, int repeat)
Definition utilities.c:134
int eq_s(struct SN_env *z, int s_size, const symbol *s)
Definition utilities.c:280
int skip_utf8(const symbol *p, int c, int lb, int l, int n)
Definition utilities.c:42
int eq_s_b(struct SN_env *z, int s_size, const symbol *s)
Definition utilities.c:290
int out_grouping_b_U(struct SN_env *z, const unsigned char *s, int min, int max, int repeat)
Definition utilities.c:187
int find_among(struct SN_env *z, const struct among *v, int v_size)
Definition utilities.c:312
int slice_from_s(struct SN_env *z, int s_size, const symbol *s)
Definition utilities.c:559
static const struct among a_5[4]
static const symbol s_2[]
static const symbol s_0_4[2]
void dutch_UTF_8_close_env(struct SN_env *z)
static const symbol s_2_2[2]
static const symbol s_0_5[2]
static const symbol s_4[]
static const unsigned char g_v_I[]
static const unsigned char g_v_j[]
static const symbol s_0_8[2]
static const symbol s_5_3[2]
static const symbol s_4_3[4]
static const symbol s_3_1[2]
static const symbol s_5_0[2]
static int r_standard_suffix(struct SN_env *z)
static const symbol s_0_1[2]
static int r_en_ending(struct SN_env *z)
static const symbol s_4_1[2]
static const symbol s_4_4[4]
static const symbol s_2_0[2]
int dutch_UTF_8_stem(struct SN_env *z)
static const struct among a_4[6]
static const symbol s_6[]
static const symbol s_21[]
static const symbol s_3[]
static const symbol s_3_0[3]
static const symbol s_0_7[2]
static int r_R2(struct SN_env *z)
static const symbol s_7[]
static const symbol s_13[]
static const symbol s_20[]
static int r_undouble(struct SN_env *z)
static const symbol s_19[]
static const symbol s_4_5[3]
static int r_R1(struct SN_env *z)
static const symbol s_1_2[1]
static const symbol s_16[]
static int r_postlude(struct SN_env *z)
static const symbol s_14[]
static int r_prelude(struct SN_env *z)
static const symbol s_10[]
static const symbol s_1_1[1]
static const struct among a_1[3]
static const symbol s_1[]
static const struct among a_2[3]
static const symbol s_5_2[2]
static const symbol s_3_3[5]
struct SN_env * dutch_UTF_8_create_env(void)
static int r_mark_regions(struct SN_env *z)
static const symbol s_11[]
static const symbol s_12[]
static const struct among a_0[11]
static const symbol s_0_6[2]
static const symbol s_3_4[1]
static const struct among a_3[5]
static const symbol s_5_1[2]
static int r_e_ending(struct SN_env *z)
static const symbol s_0_2[2]
static const symbol s_18[]
static const symbol s_17[]
static const symbol s_0_10[2]
static const symbol s_0_3[2]
static const symbol s_2_1[2]
static const unsigned char g_v[]
static const symbol s_8[]
static const symbol s_9[]
static const symbol s_0_9[2]
static const symbol s_3_2[2]
static const symbol s_5[]
static const symbol s_15[]
static const symbol s_4_2[3]
static const symbol s_4_0[3]
static const symbol s_0[]
Definition api.h:14
unsigned char * B
Definition api.h:19
int lb
Definition api.h:16
symbol * p
Definition api.h:15
int * I
Definition api.h:18
int ket
Definition api.h:16
int c
Definition api.h:16
int bra
Definition api.h:16
int l
Definition api.h:16
Definition header.h:16