No issues found
1 /*
2 * Copyright (c) 2001, Dr Martin Porter
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
6 * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
7 * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
8 * Neither the name of the <ORGANIZATION> nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
9 *
10 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
11 */
12
13
14
15 /* This file was generated automatically by the Snowball to ANSI C compiler */
16
17 #include "header.h"
18
19 extern int swedish_UTF_8_stem(struct SN_env * z);
20 static int r_other_suffix(struct SN_env * z);
21 static int r_consonant_pair(struct SN_env * z);
22 static int r_main_suffix(struct SN_env * z);
23 static int r_mark_regions(struct SN_env * z);
24
25 extern struct SN_env * swedish_UTF_8_create_env(void);
26 extern void swedish_UTF_8_close_env(struct SN_env * z);
27
28 static symbol s_0_0[1] = { 'a' };
29 static symbol s_0_1[4] = { 'a', 'r', 'n', 'a' };
30 static symbol s_0_2[4] = { 'e', 'r', 'n', 'a' };
31 static symbol s_0_3[7] = { 'h', 'e', 't', 'e', 'r', 'n', 'a' };
32 static symbol s_0_4[4] = { 'o', 'r', 'n', 'a' };
33 static symbol s_0_5[2] = { 'a', 'd' };
34 static symbol s_0_6[1] = { 'e' };
35 static symbol s_0_7[3] = { 'a', 'd', 'e' };
36 static symbol s_0_8[4] = { 'a', 'n', 'd', 'e' };
37 static symbol s_0_9[4] = { 'a', 'r', 'n', 'e' };
38 static symbol s_0_10[3] = { 'a', 'r', 'e' };
39 static symbol s_0_11[4] = { 'a', 's', 't', 'e' };
40 static symbol s_0_12[2] = { 'e', 'n' };
41 static symbol s_0_13[5] = { 'a', 'n', 'd', 'e', 'n' };
42 static symbol s_0_14[4] = { 'a', 'r', 'e', 'n' };
43 static symbol s_0_15[5] = { 'h', 'e', 't', 'e', 'n' };
44 static symbol s_0_16[3] = { 'e', 'r', 'n' };
45 static symbol s_0_17[2] = { 'a', 'r' };
46 static symbol s_0_18[2] = { 'e', 'r' };
47 static symbol s_0_19[5] = { 'h', 'e', 't', 'e', 'r' };
48 static symbol s_0_20[2] = { 'o', 'r' };
49 static symbol s_0_21[1] = { 's' };
50 static symbol s_0_22[2] = { 'a', 's' };
51 static symbol s_0_23[5] = { 'a', 'r', 'n', 'a', 's' };
52 static symbol s_0_24[5] = { 'e', 'r', 'n', 'a', 's' };
53 static symbol s_0_25[5] = { 'o', 'r', 'n', 'a', 's' };
54 static symbol s_0_26[2] = { 'e', 's' };
55 static symbol s_0_27[4] = { 'a', 'd', 'e', 's' };
56 static symbol s_0_28[5] = { 'a', 'n', 'd', 'e', 's' };
57 static symbol s_0_29[3] = { 'e', 'n', 's' };
58 static symbol s_0_30[5] = { 'a', 'r', 'e', 'n', 's' };
59 static symbol s_0_31[6] = { 'h', 'e', 't', 'e', 'n', 's' };
60 static symbol s_0_32[4] = { 'e', 'r', 'n', 's' };
61 static symbol s_0_33[2] = { 'a', 't' };
62 static symbol s_0_34[5] = { 'a', 'n', 'd', 'e', 't' };
63 static symbol s_0_35[3] = { 'h', 'e', 't' };
64 static symbol s_0_36[3] = { 'a', 's', 't' };
65
66 static struct among a_0[37] =
67 {
68 /* 0 */ { 1, s_0_0, -1, 1, 0},
69 /* 1 */ { 4, s_0_1, 0, 1, 0},
70 /* 2 */ { 4, s_0_2, 0, 1, 0},
71 /* 3 */ { 7, s_0_3, 2, 1, 0},
72 /* 4 */ { 4, s_0_4, 0, 1, 0},
73 /* 5 */ { 2, s_0_5, -1, 1, 0},
74 /* 6 */ { 1, s_0_6, -1, 1, 0},
75 /* 7 */ { 3, s_0_7, 6, 1, 0},
76 /* 8 */ { 4, s_0_8, 6, 1, 0},
77 /* 9 */ { 4, s_0_9, 6, 1, 0},
78 /* 10 */ { 3, s_0_10, 6, 1, 0},
79 /* 11 */ { 4, s_0_11, 6, 1, 0},
80 /* 12 */ { 2, s_0_12, -1, 1, 0},
81 /* 13 */ { 5, s_0_13, 12, 1, 0},
82 /* 14 */ { 4, s_0_14, 12, 1, 0},
83 /* 15 */ { 5, s_0_15, 12, 1, 0},
84 /* 16 */ { 3, s_0_16, -1, 1, 0},
85 /* 17 */ { 2, s_0_17, -1, 1, 0},
86 /* 18 */ { 2, s_0_18, -1, 1, 0},
87 /* 19 */ { 5, s_0_19, 18, 1, 0},
88 /* 20 */ { 2, s_0_20, -1, 1, 0},
89 /* 21 */ { 1, s_0_21, -1, 2, 0},
90 /* 22 */ { 2, s_0_22, 21, 1, 0},
91 /* 23 */ { 5, s_0_23, 22, 1, 0},
92 /* 24 */ { 5, s_0_24, 22, 1, 0},
93 /* 25 */ { 5, s_0_25, 22, 1, 0},
94 /* 26 */ { 2, s_0_26, 21, 1, 0},
95 /* 27 */ { 4, s_0_27, 26, 1, 0},
96 /* 28 */ { 5, s_0_28, 26, 1, 0},
97 /* 29 */ { 3, s_0_29, 21, 1, 0},
98 /* 30 */ { 5, s_0_30, 29, 1, 0},
99 /* 31 */ { 6, s_0_31, 29, 1, 0},
100 /* 32 */ { 4, s_0_32, 21, 1, 0},
101 /* 33 */ { 2, s_0_33, -1, 1, 0},
102 /* 34 */ { 5, s_0_34, -1, 1, 0},
103 /* 35 */ { 3, s_0_35, -1, 1, 0},
104 /* 36 */ { 3, s_0_36, -1, 1, 0}
105 };
106
107 static symbol s_1_0[2] = { 'd', 'd' };
108 static symbol s_1_1[2] = { 'g', 'd' };
109 static symbol s_1_2[2] = { 'n', 'n' };
110 static symbol s_1_3[2] = { 'd', 't' };
111 static symbol s_1_4[2] = { 'g', 't' };
112 static symbol s_1_5[2] = { 'k', 't' };
113 static symbol s_1_6[2] = { 't', 't' };
114
115 static struct among a_1[7] =
116 {
117 /* 0 */ { 2, s_1_0, -1, -1, 0},
118 /* 1 */ { 2, s_1_1, -1, -1, 0},
119 /* 2 */ { 2, s_1_2, -1, -1, 0},
120 /* 3 */ { 2, s_1_3, -1, -1, 0},
121 /* 4 */ { 2, s_1_4, -1, -1, 0},
122 /* 5 */ { 2, s_1_5, -1, -1, 0},
123 /* 6 */ { 2, s_1_6, -1, -1, 0}
124 };
125
126 static symbol s_2_0[2] = { 'i', 'g' };
127 static symbol s_2_1[3] = { 'l', 'i', 'g' };
128 static symbol s_2_2[3] = { 'e', 'l', 's' };
129 static symbol s_2_3[5] = { 'f', 'u', 'l', 'l', 't' };
130 static symbol s_2_4[5] = { 'l', 0xC3, 0xB6, 's', 't' };
131
132 static struct among a_2[5] =
133 {
134 /* 0 */ { 2, s_2_0, -1, 1, 0},
135 /* 1 */ { 3, s_2_1, 0, 1, 0},
136 /* 2 */ { 3, s_2_2, -1, 1, 0},
137 /* 3 */ { 5, s_2_3, -1, 3, 0},
138 /* 4 */ { 5, s_2_4, -1, 2, 0}
139 };
140
141 static unsigned char g_v[] = { 17, 65, 16, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 24, 0, 32 };
142
143 static unsigned char g_s_ending[] = { 119, 127, 149 };
144
145 static symbol s_0[] = { 'l', 0xC3, 0xB6, 's' };
146 static symbol s_1[] = { 'f', 'u', 'l', 'l' };
147
148 static int r_mark_regions(struct SN_env * z) {
149 z->I[0] = z->l;
150 { int c_test = z->c; /* test, line 29 */
151 { int c = skip_utf8(z->p, z->c, 0, z->l, + 3);
152 if (c < 0) return 0;
153 z->c = c; /* hop, line 29 */
154 }
155 z->I[1] = z->c; /* setmark x, line 29 */
156 z->c = c_test;
157 }
158 while(1) { /* goto, line 30 */
159 int c = z->c;
160 if (!(in_grouping_U(z, g_v, 97, 246))) goto lab0;
161 z->c = c;
162 break;
163 lab0:
164 z->c = c;
165 { int c = skip_utf8(z->p, z->c, 0, z->l, 1);
166 if (c < 0) return 0;
167 z->c = c; /* goto, line 30 */
168 }
169 }
170 while(1) { /* gopast, line 30 */
171 if (!(out_grouping_U(z, g_v, 97, 246))) goto lab1;
172 break;
173 lab1:
174 { int c = skip_utf8(z->p, z->c, 0, z->l, 1);
175 if (c < 0) return 0;
176 z->c = c; /* gopast, line 30 */
177 }
178 }
179 z->I[0] = z->c; /* setmark p1, line 30 */
180 /* try, line 31 */
181 if (!(z->I[0] < z->I[1])) goto lab2;
182 z->I[0] = z->I[1];
183 lab2:
184 return 1;
185 }
186
187 static int r_main_suffix(struct SN_env * z) {
188 int among_var;
189 { int m3; /* setlimit, line 37 */
190 int m = z->l - z->c; (void) m;
191 if (z->c < z->I[0]) return 0;
192 z->c = z->I[0]; /* tomark, line 37 */
193 m3 = z->lb; z->lb = z->c;
194 z->c = z->l - m;
195 z->ket = z->c; /* [, line 37 */
196 among_var = find_among_b(z, a_0, 37); /* substring, line 37 */
197 if (!(among_var)) { z->lb = m3; return 0; }
198 z->bra = z->c; /* ], line 37 */
199 z->lb = m3;
200 }
201 switch(among_var) {
202 case 0: return 0;
203 case 1:
204 { int ret;
205 ret = slice_del(z); /* delete, line 44 */
206 if (ret < 0) return ret;
207 }
208 break;
209 case 2:
210 if (!(in_grouping_b_U(z, g_s_ending, 98, 121))) return 0;
211 { int ret;
212 ret = slice_del(z); /* delete, line 46 */
213 if (ret < 0) return ret;
214 }
215 break;
216 }
217 return 1;
218 }
219
220 static int r_consonant_pair(struct SN_env * z) {
221 { int m3; /* setlimit, line 50 */
222 int m = z->l - z->c; (void) m;
223 if (z->c < z->I[0]) return 0;
224 z->c = z->I[0]; /* tomark, line 50 */
225 m3 = z->lb; z->lb = z->c;
226 z->c = z->l - m;
227 { int m = z->l - z->c; (void) m; /* and, line 52 */
228 if (!(find_among_b(z, a_1, 7))) { z->lb = m3; return 0; } /* among, line 51 */
229 z->c = z->l - m;
230 z->ket = z->c; /* [, line 52 */
231 { int c = skip_utf8(z->p, z->c, z->lb, 0, -1);
232 if (c < 0) { z->lb = m3; return 0; }
233 z->c = c; /* next, line 52 */
234 }
235 z->bra = z->c; /* ], line 52 */
236 { int ret;
237 ret = slice_del(z); /* delete, line 52 */
238 if (ret < 0) return ret;
239 }
240 }
241 z->lb = m3;
242 }
243 return 1;
244 }
245
246 static int r_other_suffix(struct SN_env * z) {
247 int among_var;
248 { int m3; /* setlimit, line 55 */
249 int m = z->l - z->c; (void) m;
250 if (z->c < z->I[0]) return 0;
251 z->c = z->I[0]; /* tomark, line 55 */
252 m3 = z->lb; z->lb = z->c;
253 z->c = z->l - m;
254 z->ket = z->c; /* [, line 56 */
255 among_var = find_among_b(z, a_2, 5); /* substring, line 56 */
256 if (!(among_var)) { z->lb = m3; return 0; }
257 z->bra = z->c; /* ], line 56 */
258 switch(among_var) {
259 case 0: { z->lb = m3; return 0; }
260 case 1:
261 { int ret;
262 ret = slice_del(z); /* delete, line 57 */
263 if (ret < 0) return ret;
264 }
265 break;
266 case 2:
267 { int ret;
268 ret = slice_from_s(z, 4, s_0); /* <-, line 58 */
269 if (ret < 0) return ret;
270 }
271 break;
272 case 3:
273 { int ret;
274 ret = slice_from_s(z, 4, s_1); /* <-, line 59 */
275 if (ret < 0) return ret;
276 }
277 break;
278 }
279 z->lb = m3;
280 }
281 return 1;
282 }
283
284 extern int swedish_UTF_8_stem(struct SN_env * z) {
285 { int c = z->c; /* do, line 66 */
286 { int ret = r_mark_regions(z);
287 if (ret == 0) goto lab0; /* call mark_regions, line 66 */
288 if (ret < 0) return ret;
289 }
290 lab0:
291 z->c = c;
292 }
293 z->lb = z->c; z->c = z->l; /* backwards, line 67 */
294
295 { int m = z->l - z->c; (void) m; /* do, line 68 */
296 { int ret = r_main_suffix(z);
297 if (ret == 0) goto lab1; /* call main_suffix, line 68 */
298 if (ret < 0) return ret;
299 }
300 lab1:
301 z->c = z->l - m;
302 }
303 { int m = z->l - z->c; (void) m; /* do, line 69 */
304 { int ret = r_consonant_pair(z);
305 if (ret == 0) goto lab2; /* call consonant_pair, line 69 */
306 if (ret < 0) return ret;
307 }
308 lab2:
309 z->c = z->l - m;
310 }
311 { int m = z->l - z->c; (void) m; /* do, line 70 */
312 { int ret = r_other_suffix(z);
313 if (ret == 0) goto lab3; /* call other_suffix, line 70 */
314 if (ret < 0) return ret;
315 }
316 lab3:
317 z->c = z->l - m;
318 }
319 z->c = z->lb;
320 return 1;
321 }
322
323 extern struct SN_env * swedish_UTF_8_create_env(void) { return SN_create_env(0, 2, 0); }
324
325 extern void swedish_UTF_8_close_env(struct SN_env * z) { SN_close_env(z); }