languages/hungarian.cc

Go to the documentation of this file.

/* This file was generated automatically by the Snowball to ISO C++ compiler */

#include <limits.h>
#include "hungarian.h"

static const symbol s_pool[] = {
#define s_0_0 0
'c', 's',
#define s_0_1 2
'd', 'z', 's',
#define s_0_2 5
'g', 'y',
#define s_0_3 7
'l', 'y',
#define s_0_4 9
'n', 'y',
#define s_0_5 11
's', 'z',
#define s_0_6 13
't', 'y',
#define s_0_7 (s_0_1 + 1)
#define s_1_0 15
0xC3, 0xA1,
#define s_1_1 17
0xC3, 0xA9,
#define s_2_0 19
'b', 'b',
#define s_2_1 s_2_12
#define s_2_2 21
'd', 'd',
#define s_2_3 23
'f', 'f',
#define s_2_4 s_2_17
#define s_2_5 25
'j', 'j',
#define s_2_6 27
'k', 'k',
#define s_2_7 s_2_18
#define s_2_8 29
'm', 'm',
#define s_2_9 s_2_19
#define s_2_10 31
'p', 'p',
#define s_2_11 33
'r', 'r',
#define s_2_12 35
'c', 'c', 's',
#define s_2_13 s_2_21
#define s_2_14 38
'z', 'z', 's',
#define s_2_15 s_2_20
#define s_2_16 41
'v', 'v',
#define s_2_17 43
'g', 'g', 'y',
#define s_2_18 46
'l', 'l', 'y',
#define s_2_19 49
'n', 'n', 'y',
#define s_2_20 52
't', 't', 'y',
#define s_2_21 55
's', 's', 'z',
#define s_2_22 s_2_14
#define s_3_0 58
'a', 'l',
#define s_3_1 60
'e', 'l',
#define s_4_0 s_4_21
#define s_4_1 62
'r', 'a',
#define s_4_2 s_4_23
#define s_4_3 64
'r', 'e',
#define s_4_4 66
'i', 'g',
#define s_4_5 68
'n', 'a', 'k',
#define s_4_6 71
'n', 'e', 'k',
#define s_4_7 74
'v', 'a', 'l',
#define s_4_8 77
'v', 'e', 'l',
#define s_4_9 80
'u', 'l',
#define s_4_10 82
'n', 0xC3, 0xA1, 'l',
#define s_4_11 86
'n', 0xC3, 0xA9, 'l',
#define s_4_12 90
'b', 0xC3, 0xB3, 'l',
#define s_4_13 94
'r', 0xC3, 0xB3, 'l',
#define s_4_14 98
't', 0xC3, 0xB3, 'l',
#define s_4_15 102
'b', 0xC3, 0xB5, 'l',
#define s_4_16 106
'r', 0xC3, 0xB5, 'l',
#define s_4_17 110
't', 0xC3, 0xB5, 'l',
#define s_4_18 114
0xC3, 0xBC, 'l',
#define s_4_19 s_4_5
#define s_4_20 (s_4_21 + 1)
#define s_4_21 117
'b', 'a', 'n',
#define s_4_22 (s_4_23 + 1)
#define s_4_23 120
'b', 'e', 'n',
#define s_4_24 123
'k', 0xC3, 0xA9, 'p', 'p', 'e', 'n',
#define s_4_25 s_4_35
#define s_4_26 130
0xC3, 0xB6, 'n',
#define s_4_27 s_4_24
#define s_4_28 133
'k', 'o', 'r',
#define s_4_29 s_4_14
#define s_4_30 136
'a', 't',
#define s_4_31 138
'e', 't',
#define s_4_32 (s_4_33 + 2)
#define s_4_33 140
'a', 'n', 'k', 0xC3, 0xA9, 'n', 't',
#define s_4_34 147
'e', 'n', 'k', 0xC3, 0xA9, 'n', 't',
#define s_4_35 154
'o', 'n', 'k', 0xC3, 0xA9, 'n', 't',
#define s_4_36 161
'o', 't',
#define s_4_37 163
0xC3, 0xA9, 'r', 't',
#define s_4_38 167
0xC3, 0xB6, 't',
#define s_4_39 170
'h', 'e', 'z',
#define s_4_40 173
'h', 'o', 'z',
#define s_4_41 176
'h', 0xC3, 0xB6, 'z',
#define s_4_42 180
'v', 0xC3, 0xA1,
#define s_4_43 183
'v', 0xC3, 0xA9,
#define s_5_0 s_5_2
#define s_5_1 (s_5_2 + 4)
#define s_5_2 186
0xC3, 0xA1, 'n', 'k', 0xC3, 0xA9, 'n', 't',
#define s_6_0 (s_6_1 + 1)
#define s_6_1 194
'a', 's', 't', 'u', 'l',
#define s_6_2 199
0xC3, 0xA1, 's', 't', 'u', 'l',
#define s_6_3 (s_6_4 + 1)
#define s_6_4 205
'e', 's', 't', 0xC3, 0xBC, 'l',
#define s_6_5 211
0xC3, 0xA9, 's', 't', 0xC3, 0xBC, 'l',
#define s_7_0 218
0xC3, 0xA1,
#define s_7_1 220
0xC3, 0xA9,
#define s_8_0 (s_8_1 + 1)
#define s_8_1 222
'a', 'k',
#define s_8_2 224
'e', 'k',
#define s_8_3 226
'o', 'k',
#define s_8_4 228
0xC3, 0xA1, 'k',
#define s_8_5 231
0xC3, 0xA9, 'k',
#define s_8_6 234
0xC3, 0xB6, 'k',
#define s_9_0 (s_9_1 + 2)
#define s_9_1 237
0xC3, 0xA1, 0xC3, 0xA9, 'i',
#define s_9_2 242
0xC3, 0xA9, 0xC3, 0xA9, 'i',
#define s_9_3 s_9_0
#define s_9_4 (s_9_5 + 1)
#define s_9_5 247
'a', 'k', 0xC3, 0xA9,
#define s_9_6 251
'e', 'k', 0xC3, 0xA9,
#define s_9_7 255
'o', 'k', 0xC3, 0xA9,
#define s_9_8 259
0xC3, 0xA1, 'k', 0xC3, 0xA9,
#define s_9_9 264
0xC3, 0xA9, 'k', 0xC3, 0xA9,
#define s_9_10 269
0xC3, 0xB6, 'k', 0xC3, 0xA9,
#define s_9_11 s_9_2
#define s_10_0 (s_10_1 + 1)
#define s_10_1 274
'j', 'a',
#define s_10_2 (s_10_3 + 1)
#define s_10_3 276
'a', 'd',
#define s_10_4 278
'e', 'd',
#define s_10_5 280
'o', 'd',
#define s_10_6 282
0xC3, 0xA1, 'd',
#define s_10_7 285
0xC3, 0xA9, 'd',
#define s_10_8 288
0xC3, 0xB6, 'd',
#define s_10_9 s_10_4
#define s_10_10 291
'j', 'e',
#define s_10_11 (s_10_12 + 1)
#define s_10_12 293
'u', 'n', 'k',
#define s_10_13 296
0xC3, 0xA1, 'n', 'k',
#define s_10_14 300
0xC3, 0xA9, 'n', 'k',
#define s_10_15 304
0xC3, 0xBC, 'n', 'k',
#define s_10_16 (s_10_17 + 1)
#define s_10_17 (s_10_18 + 2)
#define s_10_18 308
0xC3, 0xA1, 'j', 'u', 'k',
#define s_10_19 (s_10_20 + 1)
#define s_10_20 (s_10_21 + 2)
#define s_10_21 313
0xC3, 0xA9, 'j', 0xC3, 0xBC, 'k',
#define s_10_22 (s_10_23 + 1)
#define s_10_23 319
'a', 'm',
#define s_10_24 321
'e', 'm',
#define s_10_25 323
'o', 'm',
#define s_10_26 325
0xC3, 0xA1, 'm',
#define s_10_27 328
0xC3, 0xA9, 'm',
#define s_10_28 s_10_5
#define s_10_29 s_10_6
#define s_10_30 s_10_7
#define s_11_0 (s_11_1 + 1)
#define s_11_1 (s_11_2 + 1)
#define s_11_2 331
'j', 'a', 'i', 'd',
#define s_11_3 (s_11_4 + 1)
#define s_11_4 335
'j', 'e', 'i', 'd',
#define s_11_5 339
0xC3, 0xA1, 'i', 'd',
#define s_11_6 343
0xC3, 0xA9, 'i', 'd',
#define s_11_7 s_11_0
#define s_11_8 s_11_1
#define s_11_9 s_11_2
#define s_11_10 s_11_3
#define s_11_11 s_11_4
#define s_11_12 s_11_5
#define s_11_13 s_11_6
#define s_11_14 (s_11_15 + 1)
#define s_11_15 (s_11_16 + 1)
#define s_11_16 347
'j', 'e', 'i', 't', 'e', 'k',
#define s_11_17 353
0xC3, 0xA9, 'i', 't', 'e', 'k',
#define s_11_18 (s_11_19 + 1)
#define s_11_19 (s_11_20 + 1)
#define s_11_20 359
'j', 'a', 'i', 'k',
#define s_11_21 (s_11_22 + 1)
#define s_11_22 363
'j', 'e', 'i', 'k',
#define s_11_23 367
0xC3, 0xA1, 'i', 'k',
#define s_11_24 371
0xC3, 0xA9, 'i', 'k',
#define s_11_25 (s_11_26 + 1)
#define s_11_26 (s_11_27 + 1)
#define s_11_27 375
'j', 'a', 'i', 'n', 'k',
#define s_11_28 (s_11_29 + 1)
#define s_11_29 380
'j', 'e', 'i', 'n', 'k',
#define s_11_30 385
0xC3, 0xA1, 'i', 'n', 'k',
#define s_11_31 390
0xC3, 0xA9, 'i', 'n', 'k',
#define s_11_32 (s_11_33 + 1)
#define s_11_33 395
'j', 'a', 'i', 't', 'o', 'k',
#define s_11_34 401
0xC3, 0xA1, 'i', 't', 'o', 'k',
#define s_11_35 (s_11_36 + 1)
#define s_11_36 (s_11_37 + 1)
#define s_11_37 407
'j', 'a', 'i', 'm',
#define s_11_38 (s_11_39 + 1)
#define s_11_39 411
'j', 'e', 'i', 'm',
#define s_11_40 415
0xC3, 0xA1, 'i', 'm',
#define s_11_41 419
0xC3, 0xA9, 'i', 'm',
};


static const struct among a_0[8] =
{
/*  0 */ { 2, s_0_0, -1, -1},
/*  1 */ { 3, s_0_1, -1, -1},
/*  2 */ { 2, s_0_2, -1, -1},
/*  3 */ { 2, s_0_3, -1, -1},
/*  4 */ { 2, s_0_4, -1, -1},
/*  5 */ { 2, s_0_5, -1, -1},
/*  6 */ { 2, s_0_6, -1, -1},
/*  7 */ { 2, s_0_7, -1, -1}
};


static const struct among a_1[2] =
{
/*  0 */ { 2, s_1_0, -1, 1},
/*  1 */ { 2, s_1_1, -1, 2}
};


static const struct among a_2[23] =
{
/*  0 */ { 2, s_2_0, -1, -1},
/*  1 */ { 2, s_2_1, -1, -1},
/*  2 */ { 2, s_2_2, -1, -1},
/*  3 */ { 2, s_2_3, -1, -1},
/*  4 */ { 2, s_2_4, -1, -1},
/*  5 */ { 2, s_2_5, -1, -1},
/*  6 */ { 2, s_2_6, -1, -1},
/*  7 */ { 2, s_2_7, -1, -1},
/*  8 */ { 2, s_2_8, -1, -1},
/*  9 */ { 2, s_2_9, -1, -1},
/* 10 */ { 2, s_2_10, -1, -1},
/* 11 */ { 2, s_2_11, -1, -1},
/* 12 */ { 3, s_2_12, -1, -1},
/* 13 */ { 2, s_2_13, -1, -1},
/* 14 */ { 3, s_2_14, -1, -1},
/* 15 */ { 2, s_2_15, -1, -1},
/* 16 */ { 2, s_2_16, -1, -1},
/* 17 */ { 3, s_2_17, -1, -1},
/* 18 */ { 3, s_2_18, -1, -1},
/* 19 */ { 3, s_2_19, -1, -1},
/* 20 */ { 3, s_2_20, -1, -1},
/* 21 */ { 3, s_2_21, -1, -1},
/* 22 */ { 2, s_2_22, -1, -1}
};


static const struct among a_3[2] =
{
/*  0 */ { 2, s_3_0, -1, 1},
/*  1 */ { 2, s_3_1, -1, 2}
};


static const struct among a_4[44] =
{
/*  0 */ { 2, s_4_0, -1, -1},
/*  1 */ { 2, s_4_1, -1, -1},
/*  2 */ { 2, s_4_2, -1, -1},
/*  3 */ { 2, s_4_3, -1, -1},
/*  4 */ { 2, s_4_4, -1, -1},
/*  5 */ { 3, s_4_5, -1, -1},
/*  6 */ { 3, s_4_6, -1, -1},
/*  7 */ { 3, s_4_7, -1, -1},
/*  8 */ { 3, s_4_8, -1, -1},
/*  9 */ { 2, s_4_9, -1, -1},
/* 10 */ { 4, s_4_10, -1, -1},
/* 11 */ { 4, s_4_11, -1, -1},
/* 12 */ { 4, s_4_12, -1, -1},
/* 13 */ { 4, s_4_13, -1, -1},
/* 14 */ { 4, s_4_14, -1, -1},
/* 15 */ { 4, s_4_15, -1, -1},
/* 16 */ { 4, s_4_16, -1, -1},
/* 17 */ { 4, s_4_17, -1, -1},
/* 18 */ { 3, s_4_18, -1, -1},
/* 19 */ { 1, s_4_19, -1, -1},
/* 20 */ { 2, s_4_20, 19, -1},
/* 21 */ { 3, s_4_21, 20, -1},
/* 22 */ { 2, s_4_22, 19, -1},
/* 23 */ { 3, s_4_23, 22, -1},
/* 24 */ { 7, s_4_24, 22, -1},
/* 25 */ { 2, s_4_25, 19, -1},
/* 26 */ { 3, s_4_26, 19, -1},
/* 27 */ { 5, s_4_27, -1, -1},
/* 28 */ { 3, s_4_28, -1, -1},
/* 29 */ { 1, s_4_29, -1, -1},
/* 30 */ { 2, s_4_30, 29, -1},
/* 31 */ { 2, s_4_31, 29, -1},
/* 32 */ { 5, s_4_32, 29, -1},
/* 33 */ { 7, s_4_33, 32, -1},
/* 34 */ { 7, s_4_34, 32, -1},
/* 35 */ { 7, s_4_35, 32, -1},
/* 36 */ { 2, s_4_36, 29, -1},
/* 37 */ { 4, s_4_37, 29, -1},
/* 38 */ { 3, s_4_38, 29, -1},
/* 39 */ { 3, s_4_39, -1, -1},
/* 40 */ { 3, s_4_40, -1, -1},
/* 41 */ { 4, s_4_41, -1, -1},
/* 42 */ { 3, s_4_42, -1, -1},
/* 43 */ { 3, s_4_43, -1, -1}
};


static const struct among a_5[3] =
{
/*  0 */ { 3, s_5_0, -1, 2},
/*  1 */ { 3, s_5_1, -1, 1},
/*  2 */ { 8, s_5_2, -1, 3}
};


static const struct among a_6[6] =
{
/*  0 */ { 4, s_6_0, -1, 2},
/*  1 */ { 5, s_6_1, 0, 1},
/*  2 */ { 6, s_6_2, 0, 3},
/*  3 */ { 5, s_6_3, -1, 2},
/*  4 */ { 6, s_6_4, 3, 1},
/*  5 */ { 7, s_6_5, 3, 4}
};


static const struct among a_7[2] =
{
/*  0 */ { 2, s_7_0, -1, 1},
/*  1 */ { 2, s_7_1, -1, 2}
};


static const struct among a_8[7] =
{
/*  0 */ { 1, s_8_0, -1, 7},
/*  1 */ { 2, s_8_1, 0, 4},
/*  2 */ { 2, s_8_2, 0, 6},
/*  3 */ { 2, s_8_3, 0, 5},
/*  4 */ { 3, s_8_4, 0, 1},
/*  5 */ { 3, s_8_5, 0, 2},
/*  6 */ { 3, s_8_6, 0, 3}
};


static const struct among a_9[12] =
{
/*  0 */ { 3, s_9_0, -1, 7},
/*  1 */ { 5, s_9_1, 0, 6},
/*  2 */ { 5, s_9_2, 0, 5},
/*  3 */ { 2, s_9_3, -1, 9},
/*  4 */ { 3, s_9_4, 3, 4},
/*  5 */ { 4, s_9_5, 4, 1},
/*  6 */ { 4, s_9_6, 4, 1},
/*  7 */ { 4, s_9_7, 4, 1},
/*  8 */ { 5, s_9_8, 4, 3},
/*  9 */ { 5, s_9_9, 4, 2},
/* 10 */ { 5, s_9_10, 4, 1},
/* 11 */ { 4, s_9_11, 3, 8}
};


static const struct among a_10[31] =
{
/*  0 */ { 1, s_10_0, -1, 18},
/*  1 */ { 2, s_10_1, 0, 17},
/*  2 */ { 1, s_10_2, -1, 16},
/*  3 */ { 2, s_10_3, 2, 13},
/*  4 */ { 2, s_10_4, 2, 13},
/*  5 */ { 2, s_10_5, 2, 13},
/*  6 */ { 3, s_10_6, 2, 14},
/*  7 */ { 3, s_10_7, 2, 15},
/*  8 */ { 3, s_10_8, 2, 13},
/*  9 */ { 1, s_10_9, -1, 18},
/* 10 */ { 2, s_10_10, 9, 17},
/* 11 */ { 2, s_10_11, -1, 4},
/* 12 */ { 3, s_10_12, 11, 1},
/* 13 */ { 4, s_10_13, 11, 2},
/* 14 */ { 4, s_10_14, 11, 3},
/* 15 */ { 4, s_10_15, 11, 1},
/* 16 */ { 2, s_10_16, -1, 8},
/* 17 */ { 3, s_10_17, 16, 7},
/* 18 */ { 5, s_10_18, 17, 5},
/* 19 */ { 3, s_10_19, -1, 8},
/* 20 */ { 4, s_10_20, 19, 7},
/* 21 */ { 6, s_10_21, 20, 6},
/* 22 */ { 1, s_10_22, -1, 12},
/* 23 */ { 2, s_10_23, 22, 9},
/* 24 */ { 2, s_10_24, 22, 9},
/* 25 */ { 2, s_10_25, 22, 9},
/* 26 */ { 3, s_10_26, 22, 10},
/* 27 */ { 3, s_10_27, 22, 11},
/* 28 */ { 1, s_10_28, -1, 18},
/* 29 */ { 2, s_10_29, -1, 19},
/* 30 */ { 2, s_10_30, -1, 20}
};


static const struct among a_11[42] =
{
/*  0 */ { 2, s_11_0, -1, 10},
/*  1 */ { 3, s_11_1, 0, 9},
/*  2 */ { 4, s_11_2, 1, 6},
/*  3 */ { 3, s_11_3, 0, 9},
/*  4 */ { 4, s_11_4, 3, 6},
/*  5 */ { 4, s_11_5, 0, 7},
/*  6 */ { 4, s_11_6, 0, 8},
/*  7 */ { 1, s_11_7, -1, 15},
/*  8 */ { 2, s_11_8, 7, 14},
/*  9 */ { 3, s_11_9, 8, 11},
/* 10 */ { 2, s_11_10, 7, 14},
/* 11 */ { 3, s_11_11, 10, 11},
/* 12 */ { 3, s_11_12, 7, 12},
/* 13 */ { 3, s_11_13, 7, 13},
/* 14 */ { 4, s_11_14, -1, 24},
/* 15 */ { 5, s_11_15, 14, 21},
/* 16 */ { 6, s_11_16, 15, 20},
/* 17 */ { 6, s_11_17, 14, 23},
/* 18 */ { 2, s_11_18, -1, 29},
/* 19 */ { 3, s_11_19, 18, 26},
/* 20 */ { 4, s_11_20, 19, 25},
/* 21 */ { 3, s_11_21, 18, 26},
/* 22 */ { 4, s_11_22, 21, 25},
/* 23 */ { 4, s_11_23, 18, 27},
/* 24 */ { 4, s_11_24, 18, 28},
/* 25 */ { 3, s_11_25, -1, 20},
/* 26 */ { 4, s_11_26, 25, 17},
/* 27 */ { 5, s_11_27, 26, 16},
/* 28 */ { 4, s_11_28, 25, 17},
/* 29 */ { 5, s_11_29, 28, 16},
/* 30 */ { 5, s_11_30, 25, 18},
/* 31 */ { 5, s_11_31, 25, 19},
/* 32 */ { 5, s_11_32, -1, 21},
/* 33 */ { 6, s_11_33, 32, 20},
/* 34 */ { 6, s_11_34, -1, 22},
/* 35 */ { 2, s_11_35, -1, 5},
/* 36 */ { 3, s_11_36, 35, 4},
/* 37 */ { 4, s_11_37, 36, 1},
/* 38 */ { 3, s_11_38, 35, 4},
/* 39 */ { 4, s_11_39, 38, 1},
/* 40 */ { 4, s_11_40, 35, 2},
/* 41 */ { 4, s_11_41, 35, 3}
};

static const unsigned char g_v[] = { 17, 65, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 17, 52, 14 };

static const symbol s_0[] = { 'a' };
static const symbol s_1[] = { 'e' };
static const symbol s_2[] = { 'e' };
static const symbol s_3[] = { 'a' };
static const symbol s_4[] = { 'a' };
static const symbol s_5[] = { 'a' };
static const symbol s_6[] = { 'e' };
static const symbol s_7[] = { 'a' };
static const symbol s_8[] = { 'e' };
static const symbol s_9[] = { 'e' };
static const symbol s_10[] = { 'a' };
static const symbol s_11[] = { 'e' };
static const symbol s_12[] = { 'a' };
static const symbol s_13[] = { 'e' };
static const symbol s_14[] = { 'a' };
static const symbol s_15[] = { 'e' };
static const symbol s_16[] = { 'a' };
static const symbol s_17[] = { 'e' };
static const symbol s_18[] = { 'a' };
static const symbol s_19[] = { 'e' };
static const symbol s_20[] = { 'a' };
static const symbol s_21[] = { 'e' };
static const symbol s_22[] = { 'a' };
static const symbol s_23[] = { 'e' };
static const symbol s_24[] = { 'a' };
static const symbol s_25[] = { 'e' };
static const symbol s_26[] = { 'a' };
static const symbol s_27[] = { 'e' };
static const symbol s_28[] = { 'a' };
static const symbol s_29[] = { 'e' };
static const symbol s_30[] = { 'a' };
static const symbol s_31[] = { 'e' };
static const symbol s_32[] = { 'a' };
static const symbol s_33[] = { 'e' };
static const symbol s_34[] = { 'a' };
static const symbol s_35[] = { 'e' };

int Xapian::InternalStemHungarian::r_mark_regions() { /* forwardmode */
    I_p1 = l; /* p1 = <integer expression>, line 46 */
    {   int c1 = c; /* or, line 51 */
        if (in_grouping_U(g_v, 97, 252, 0)) goto lab1; /* grouping v, line 48 */
        if (in_grouping_U(g_v, 97, 252, 1) < 0) goto lab1; /* goto */ /* non v, line 48 */
        {   int c2 = c; /* or, line 49 */
            if (c + 1 >= l || p[c + 1] >> 5 != 3 || !((101187584 >> (p[c + 1] & 0x1f)) & 1)) goto lab3; /* among, line 49 */
            if (!(find_among(s_pool, a_0, 8, 0, 0))) goto lab3;
            goto lab2;
        lab3:
            c = c2;
            {   int ret = skip_utf8(p, c, 0, l, 1);
                if (ret < 0) goto lab1;
                c = ret; /* next, line 49 */
            }
        }
    lab2:
        I_p1 = c; /* setmark p1, line 50 */
        goto lab0;
    lab1:
        c = c1;
        if (out_grouping_U(g_v, 97, 252, 0)) return 0; /* non v, line 53 */
        {   int ret = out_grouping_U(g_v, 97, 252, 1); /* gopast */ /* grouping v, line 53 */
            if (ret < 0) return 0;
            c += ret;
        }
        I_p1 = c; /* setmark p1, line 53 */
    }
lab0:
    return 1;
}

int Xapian::InternalStemHungarian::r_R1() { /* backwardmode */
    if (!(I_p1 <= c)) return 0; /* p1 <= <integer expression>, line 58 */
    return 1;
}

int Xapian::InternalStemHungarian::r_v_ending() { /* backwardmode */
    int among_var;
    ket = c; /* [, line 61 */
    if (c - 1 <= lb || (p[c - 1] != 161 && p[c - 1] != 169)) return 0; /* substring, line 61 */
    among_var = find_among_b(s_pool, a_1, 2, 0, 0);
    if (!(among_var)) return 0;
    bra = c; /* ], line 61 */
    {   int ret = r_R1(); /* call R1, line 61 */
        if (ret <= 0) return ret;
    }
    switch(among_var) { /* among, line 61 */
        case 0: return 0;
        case 1:
            {   int ret = slice_from_s(1, s_0); /* <-, line 62 */
                if (ret < 0) return ret;
            }
            break;
        case 2:
            {   int ret = slice_from_s(1, s_1); /* <-, line 63 */
                if (ret < 0) return ret;
            }
            break;
    }
    return 1;
}

int Xapian::InternalStemHungarian::r_double() { /* backwardmode */
    {   int m_test1 = l - c; /* test, line 68 */
        if (c - 1 <= lb || p[c - 1] >> 5 != 3 || !((106790108 >> (p[c - 1] & 0x1f)) & 1)) return 0; /* among, line 68 */
        if (!(find_among_b(s_pool, a_2, 23, 0, 0))) return 0;
        c = l - m_test1;
    }
    return 1;
}

int Xapian::InternalStemHungarian::r_undouble() { /* backwardmode */
    {   int ret = skip_utf8(p, c, lb, 0, -1);
        if (ret < 0) return 0;
        c = ret; /* next, line 73 */
    }
    ket = c; /* [, line 73 */
    {   int ret = skip_utf8(p, c, lb, l, - 1); /* hop, line 73 */
        if (ret < 0) return 0;
        c = ret;
    }
    bra = c; /* ], line 73 */
    if (slice_del() == -1) return -1; /* delete, line 73 */
    return 1;
}

int Xapian::InternalStemHungarian::r_instrum() { /* backwardmode */
    int among_var;
    ket = c; /* [, line 77 */
    if (c - 1 <= lb || p[c - 1] != 108) return 0; /* substring, line 77 */
    among_var = find_among_b(s_pool, a_3, 2, 0, 0);
    if (!(among_var)) return 0;
    bra = c; /* ], line 77 */
    {   int ret = r_R1(); /* call R1, line 77 */
        if (ret <= 0) return ret;
    }
    switch(among_var) { /* among, line 77 */
        case 0: return 0;
        case 1:
            {   int ret = r_double(); /* call double, line 78 */
                if (ret <= 0) return ret;
            }
            break;
        case 2:
            {   int ret = r_double(); /* call double, line 79 */
                if (ret <= 0) return ret;
            }
            break;
    }
    if (slice_del() == -1) return -1; /* delete, line 81 */
    {   int ret = r_undouble(); /* call undouble, line 82 */
        if (ret <= 0) return ret;
    }
    return 1;
}

int Xapian::InternalStemHungarian::r_case() { /* backwardmode */
    ket = c; /* [, line 87 */
    if (!(find_among_b(s_pool, a_4, 44, 0, 0))) return 0; /* substring, line 87 */
    bra = c; /* ], line 87 */
    {   int ret = r_R1(); /* call R1, line 87 */
        if (ret <= 0) return ret;
    }
    if (slice_del() == -1) return -1; /* delete, line 111 */
    {   int ret = r_v_ending(); /* call v_ending, line 112 */
        if (ret <= 0) return ret;
    }
    return 1;
}

int Xapian::InternalStemHungarian::r_case_special() { /* backwardmode */
    int among_var;
    ket = c; /* [, line 116 */
    if (c - 2 <= lb || (p[c - 1] != 110 && p[c - 1] != 116)) return 0; /* substring, line 116 */
    among_var = find_among_b(s_pool, a_5, 3, 0, 0);
    if (!(among_var)) return 0;
    bra = c; /* ], line 116 */
    {   int ret = r_R1(); /* call R1, line 116 */
        if (ret <= 0) return ret;
    }
    switch(among_var) { /* among, line 116 */
        case 0: return 0;
        case 1:
            {   int ret = slice_from_s(1, s_2); /* <-, line 117 */
                if (ret < 0) return ret;
            }
            break;
        case 2:
            {   int ret = slice_from_s(1, s_3); /* <-, line 118 */
                if (ret < 0) return ret;
            }
            break;
        case 3:
            {   int ret = slice_from_s(1, s_4); /* <-, line 119 */
                if (ret < 0) return ret;
            }
            break;
    }
    return 1;
}

int Xapian::InternalStemHungarian::r_case_other() { /* backwardmode */
    int among_var;
    ket = c; /* [, line 124 */
    if (c - 3 <= lb || p[c - 1] != 108) return 0; /* substring, line 124 */
    among_var = find_among_b(s_pool, a_6, 6, 0, 0);
    if (!(among_var)) return 0;
    bra = c; /* ], line 124 */
    {   int ret = r_R1(); /* call R1, line 124 */
        if (ret <= 0) return ret;
    }
    switch(among_var) { /* among, line 124 */
        case 0: return 0;
        case 1:
            if (slice_del() == -1) return -1; /* delete, line 125 */
            break;
        case 2:
            if (slice_del() == -1) return -1; /* delete, line 126 */
            break;
        case 3:
            {   int ret = slice_from_s(1, s_5); /* <-, line 127 */
                if (ret < 0) return ret;
            }
            break;
        case 4:
            {   int ret = slice_from_s(1, s_6); /* <-, line 128 */
                if (ret < 0) return ret;
            }
            break;
    }
    return 1;
}

int Xapian::InternalStemHungarian::r_factive() { /* backwardmode */
    int among_var;
    ket = c; /* [, line 133 */
    if (c - 1 <= lb || (p[c - 1] != 161 && p[c - 1] != 169)) return 0; /* substring, line 133 */
    among_var = find_among_b(s_pool, a_7, 2, 0, 0);
    if (!(among_var)) return 0;
    bra = c; /* ], line 133 */
    {   int ret = r_R1(); /* call R1, line 133 */
        if (ret <= 0) return ret;
    }
    switch(among_var) { /* among, line 133 */
        case 0: return 0;
        case 1:
            {   int ret = r_double(); /* call double, line 134 */
                if (ret <= 0) return ret;
            }
            break;
        case 2:
            {   int ret = r_double(); /* call double, line 135 */
                if (ret <= 0) return ret;
            }
            break;
    }
    if (slice_del() == -1) return -1; /* delete, line 137 */
    {   int ret = r_undouble(); /* call undouble, line 138 */
        if (ret <= 0) return ret;
    }
    return 1;
}

int Xapian::InternalStemHungarian::r_plural() { /* backwardmode */
    int among_var;
    ket = c; /* [, line 142 */
    if (c <= lb || p[c - 1] != 107) return 0; /* substring, line 142 */
    among_var = find_among_b(s_pool, a_8, 7, 0, 0);
    if (!(among_var)) return 0;
    bra = c; /* ], line 142 */
    {   int ret = r_R1(); /* call R1, line 142 */
        if (ret <= 0) return ret;
    }
    switch(among_var) { /* among, line 142 */
        case 0: return 0;
        case 1:
            {   int ret = slice_from_s(1, s_7); /* <-, line 143 */
                if (ret < 0) return ret;
            }
            break;
        case 2:
            {   int ret = slice_from_s(1, s_8); /* <-, line 144 */
                if (ret < 0) return ret;
            }
            break;
        case 3:
            if (slice_del() == -1) return -1; /* delete, line 145 */
            break;
        case 4:
            if (slice_del() == -1) return -1; /* delete, line 146 */
            break;
        case 5:
            if (slice_del() == -1) return -1; /* delete, line 147 */
            break;
        case 6:
            if (slice_del() == -1) return -1; /* delete, line 148 */
            break;
        case 7:
            if (slice_del() == -1) return -1; /* delete, line 149 */
            break;
    }
    return 1;
}

int Xapian::InternalStemHungarian::r_owned() { /* backwardmode */
    int among_var;
    ket = c; /* [, line 154 */
    if (c - 1 <= lb || (p[c - 1] != 105 && p[c - 1] != 169)) return 0; /* substring, line 154 */
    among_var = find_among_b(s_pool, a_9, 12, 0, 0);
    if (!(among_var)) return 0;
    bra = c; /* ], line 154 */
    {   int ret = r_R1(); /* call R1, line 154 */
        if (ret <= 0) return ret;
    }
    switch(among_var) { /* among, line 154 */
        case 0: return 0;
        case 1:
            if (slice_del() == -1) return -1; /* delete, line 155 */
            break;
        case 2:
            {   int ret = slice_from_s(1, s_9); /* <-, line 156 */
                if (ret < 0) return ret;
            }
            break;
        case 3:
            {   int ret = slice_from_s(1, s_10); /* <-, line 157 */
                if (ret < 0) return ret;
            }
            break;
        case 4:
            if (slice_del() == -1) return -1; /* delete, line 158 */
            break;
        case 5:
            {   int ret = slice_from_s(1, s_11); /* <-, line 159 */
                if (ret < 0) return ret;
            }
            break;
        case 6:
            {   int ret = slice_from_s(1, s_12); /* <-, line 160 */
                if (ret < 0) return ret;
            }
            break;
        case 7:
            if (slice_del() == -1) return -1; /* delete, line 161 */
            break;
        case 8:
            {   int ret = slice_from_s(1, s_13); /* <-, line 162 */
                if (ret < 0) return ret;
            }
            break;
        case 9:
            if (slice_del() == -1) return -1; /* delete, line 163 */
            break;
    }
    return 1;
}

int Xapian::InternalStemHungarian::r_sing_owner() { /* backwardmode */
    int among_var;
    ket = c; /* [, line 168 */
    among_var = find_among_b(s_pool, a_10, 31, 0, 0); /* substring, line 168 */
    if (!(among_var)) return 0;
    bra = c; /* ], line 168 */
    {   int ret = r_R1(); /* call R1, line 168 */
        if (ret <= 0) return ret;
    }
    switch(among_var) { /* among, line 168 */
        case 0: return 0;
        case 1:
            if (slice_del() == -1) return -1; /* delete, line 169 */
            break;
        case 2:
            {   int ret = slice_from_s(1, s_14); /* <-, line 170 */
                if (ret < 0) return ret;
            }
            break;
        case 3:
            {   int ret = slice_from_s(1, s_15); /* <-, line 171 */
                if (ret < 0) return ret;
            }
            break;
        case 4:
            if (slice_del() == -1) return -1; /* delete, line 172 */
            break;
        case 5:
            {   int ret = slice_from_s(1, s_16); /* <-, line 173 */
                if (ret < 0) return ret;
            }
            break;
        case 6:
            {   int ret = slice_from_s(1, s_17); /* <-, line 174 */
                if (ret < 0) return ret;
            }
            break;
        case 7:
            if (slice_del() == -1) return -1; /* delete, line 175 */
            break;
        case 8:
            if (slice_del() == -1) return -1; /* delete, line 176 */
            break;
        case 9:
            if (slice_del() == -1) return -1; /* delete, line 177 */
            break;
        case 10:
            {   int ret = slice_from_s(1, s_18); /* <-, line 178 */
                if (ret < 0) return ret;
            }
            break;
        case 11:
            {   int ret = slice_from_s(1, s_19); /* <-, line 179 */
                if (ret < 0) return ret;
            }
            break;
        case 12:
            if (slice_del() == -1) return -1; /* delete, line 180 */
            break;
        case 13:
            if (slice_del() == -1) return -1; /* delete, line 181 */
            break;
        case 14:
            {   int ret = slice_from_s(1, s_20); /* <-, line 182 */
                if (ret < 0) return ret;
            }
            break;
        case 15:
            {   int ret = slice_from_s(1, s_21); /* <-, line 183 */
                if (ret < 0) return ret;
            }
            break;
        case 16:
            if (slice_del() == -1) return -1; /* delete, line 184 */
            break;
        case 17:
            if (slice_del() == -1) return -1; /* delete, line 185 */
            break;
        case 18:
            if (slice_del() == -1) return -1; /* delete, line 186 */
            break;
        case 19:
            {   int ret = slice_from_s(1, s_22); /* <-, line 187 */
                if (ret < 0) return ret;
            }
            break;
        case 20:
            {   int ret = slice_from_s(1, s_23); /* <-, line 188 */
                if (ret < 0) return ret;
            }
            break;
    }
    return 1;
}

int Xapian::InternalStemHungarian::r_plur_owner() { /* backwardmode */
    int among_var;
    ket = c; /* [, line 193 */
    if (c <= lb || p[c - 1] >> 5 != 3 || !((10768 >> (p[c - 1] & 0x1f)) & 1)) return 0; /* substring, line 193 */
    among_var = find_among_b(s_pool, a_11, 42, 0, 0);
    if (!(among_var)) return 0;
    bra = c; /* ], line 193 */
    {   int ret = r_R1(); /* call R1, line 193 */
        if (ret <= 0) return ret;
    }
    switch(among_var) { /* among, line 193 */
        case 0: return 0;
        case 1:
            if (slice_del() == -1) return -1; /* delete, line 194 */
            break;
        case 2:
            {   int ret = slice_from_s(1, s_24); /* <-, line 195 */
                if (ret < 0) return ret;
            }
            break;
        case 3:
            {   int ret = slice_from_s(1, s_25); /* <-, line 196 */
                if (ret < 0) return ret;
            }
            break;
        case 4:
            if (slice_del() == -1) return -1; /* delete, line 197 */
            break;
        case 5:
            if (slice_del() == -1) return -1; /* delete, line 198 */
            break;
        case 6:
            if (slice_del() == -1) return -1; /* delete, line 199 */
            break;
        case 7:
            {   int ret = slice_from_s(1, s_26); /* <-, line 200 */
                if (ret < 0) return ret;
            }
            break;
        case 8:
            {   int ret = slice_from_s(1, s_27); /* <-, line 201 */
                if (ret < 0) return ret;
            }
            break;
        case 9:
            if (slice_del() == -1) return -1; /* delete, line 202 */
            break;
        case 10:
            if (slice_del() == -1) return -1; /* delete, line 203 */
            break;
        case 11:
            if (slice_del() == -1) return -1; /* delete, line 204 */
            break;
        case 12:
            {   int ret = slice_from_s(1, s_28); /* <-, line 205 */
                if (ret < 0) return ret;
            }
            break;
        case 13:
            {   int ret = slice_from_s(1, s_29); /* <-, line 206 */
                if (ret < 0) return ret;
            }
            break;
        case 14:
            if (slice_del() == -1) return -1; /* delete, line 207 */
            break;
        case 15:
            if (slice_del() == -1) return -1; /* delete, line 208 */
            break;
        case 16:
            if (slice_del() == -1) return -1; /* delete, line 209 */
            break;
        case 17:
            if (slice_del() == -1) return -1; /* delete, line 210 */
            break;
        case 18:
            {   int ret = slice_from_s(1, s_30); /* <-, line 211 */
                if (ret < 0) return ret;
            }
            break;
        case 19:
            {   int ret = slice_from_s(1, s_31); /* <-, line 212 */
                if (ret < 0) return ret;
            }
            break;
        case 20:
            if (slice_del() == -1) return -1; /* delete, line 214 */
            break;
        case 21:
            if (slice_del() == -1) return -1; /* delete, line 215 */
            break;
        case 22:
            {   int ret = slice_from_s(1, s_32); /* <-, line 216 */
                if (ret < 0) return ret;
            }
            break;
        case 23:
            {   int ret = slice_from_s(1, s_33); /* <-, line 217 */
                if (ret < 0) return ret;
            }
            break;
        case 24:
            if (slice_del() == -1) return -1; /* delete, line 218 */
            break;
        case 25:
            if (slice_del() == -1) return -1; /* delete, line 219 */
            break;
        case 26:
            if (slice_del() == -1) return -1; /* delete, line 220 */
            break;
        case 27:
            {   int ret = slice_from_s(1, s_34); /* <-, line 221 */
                if (ret < 0) return ret;
            }
            break;
        case 28:
            {   int ret = slice_from_s(1, s_35); /* <-, line 222 */
                if (ret < 0) return ret;
            }
            break;
        case 29:
            if (slice_del() == -1) return -1; /* delete, line 223 */
            break;
    }
    return 1;
}

int Xapian::InternalStemHungarian::stem() { /* forwardmode */
    {   int c1 = c; /* do, line 229 */
        {   int ret = r_mark_regions(); /* call mark_regions, line 229 */
            if (ret == 0) goto lab0;
            if (ret < 0) return ret;
        }
    lab0:
        c = c1;
    }
    lb = c; c = l; /* backwards, line 230 */

    {   int m2 = l - c; (void)m2; /* do, line 231 */
        {   int ret = r_instrum(); /* call instrum, line 231 */
            if (ret == 0) goto lab1;
            if (ret < 0) return ret;
        }
    lab1:
        c = l - m2;
    }
    {   int m3 = l - c; (void)m3; /* do, line 232 */
        {   int ret = r_case(); /* call case, line 232 */
            if (ret == 0) goto lab2;
            if (ret < 0) return ret;
        }
    lab2:
        c = l - m3;
    }
    {   int m4 = l - c; (void)m4; /* do, line 233 */
        {   int ret = r_case_special(); /* call case_special, line 233 */
            if (ret == 0) goto lab3;
            if (ret < 0) return ret;
        }
    lab3:
        c = l - m4;
    }
    {   int m5 = l - c; (void)m5; /* do, line 234 */
        {   int ret = r_case_other(); /* call case_other, line 234 */
            if (ret == 0) goto lab4;
            if (ret < 0) return ret;
        }
    lab4:
        c = l - m5;
    }
    {   int m6 = l - c; (void)m6; /* do, line 235 */
        {   int ret = r_factive(); /* call factive, line 235 */
            if (ret == 0) goto lab5;
            if (ret < 0) return ret;
        }
    lab5:
        c = l - m6;
    }
    {   int m7 = l - c; (void)m7; /* do, line 236 */
        {   int ret = r_owned(); /* call owned, line 236 */
            if (ret == 0) goto lab6;
            if (ret < 0) return ret;
        }
    lab6:
        c = l - m7;
    }
    {   int m8 = l - c; (void)m8; /* do, line 237 */
        {   int ret = r_sing_owner(); /* call sing_owner, line 237 */
            if (ret == 0) goto lab7;
            if (ret < 0) return ret;
        }
    lab7:
        c = l - m8;
    }
    {   int m9 = l - c; (void)m9; /* do, line 238 */
        {   int ret = r_plur_owner(); /* call plur_owner, line 238 */
            if (ret == 0) goto lab8;
            if (ret < 0) return ret;
        }
    lab8:
        c = l - m9;
    }
    {   int m10 = l - c; (void)m10; /* do, line 239 */
        {   int ret = r_plural(); /* call plural, line 239 */
            if (ret == 0) goto lab9;
            if (ret < 0) return ret;
        }
    lab9:
        c = l - m10;
    }
    c = lb;
    return 1;
}

Xapian::InternalStemHungarian::InternalStemHungarian()
    : I_p1(0)
{
}

Xapian::InternalStemHungarian::~InternalStemHungarian()
{
}

std::string
Xapian::InternalStemHungarian::get_description() const
{
    return "hungarian";
}

---