8 #define s_0_0 (s_0_1 + 2)
11 0xD1, 0x8B, 0xD0, 0xB2, 0xD1, 0x88, 0xD0, 0xB8, 0xD1, 0x81, 0xD1, 0x8C,
13 0xD0, 0xB8, 0xD0, 0xB2, 0xD1, 0x88, 0xD0, 0xB8, 0xD1, 0x81, 0xD1, 0x8C,
21 0xD0, 0xB5, 0xD0, 0xBC, 0xD1, 0x83,
23 0xD0, 0xBE, 0xD0, 0xBC, 0xD1, 0x83,
25 0xD1, 0x8B, 0xD1, 0x85,
27 0xD0, 0xB8, 0xD1, 0x85,
29 0xD1, 0x83, 0xD1, 0x8E,
31 0xD1, 0x8E, 0xD1, 0x8E,
33 0xD0, 0xB5, 0xD1, 0x8E,
35 0xD0, 0xBE, 0xD1, 0x8E,
37 0xD1, 0x8F, 0xD1, 0x8F,
39 0xD0, 0xB0, 0xD1, 0x8F,
41 0xD1, 0x8B, 0xD0, 0xB5,
43 0xD0, 0xB5, 0xD0, 0xB5,
45 0xD0, 0xB8, 0xD0, 0xB5,
47 0xD0, 0xBE, 0xD0, 0xB5,
49 0xD1, 0x8B, 0xD0, 0xBC, 0xD0, 0xB8,
51 0xD0, 0xB8, 0xD0, 0xBC, 0xD0, 0xB8,
53 0xD1, 0x8B, 0xD0, 0xB9,
55 0xD0, 0xB5, 0xD0, 0xB9,
57 0xD0, 0xB8, 0xD0, 0xB9,
59 0xD0, 0xBE, 0xD0, 0xB9,
65 0xD0, 0xB5, 0xD0, 0xB3, 0xD0, 0xBE,
67 0xD0, 0xBE, 0xD0, 0xB3, 0xD0, 0xBE,
68 #define s_2_0 (s_2_1 + 2)
70 0xD1, 0x8B, 0xD0, 0xB2, 0xD1, 0x88,
72 0xD0, 0xB8, 0xD0, 0xB2, 0xD1, 0x88,
73 #define s_2_3 (s_2_4 + 2)
74 #define s_2_4 (s_2_5 + 2)
76 0xD1, 0x83, 0xD1, 0x8E, 0xD1, 0x89,
78 0xD0, 0xB5, 0xD0, 0xBC,
80 0xD0, 0xBD, 0xD0, 0xBD,
82 0xD1, 0x81, 0xD1, 0x8C,
84 0xD1, 0x81, 0xD1, 0x8F,
86 #define s_4_1 (s_4_2 + 2)
88 0xD1, 0x83, 0xD1, 0x8E, 0xD1, 0x82,
90 0xD1, 0x8F, 0xD1, 0x82,
91 #define s_4_4 (s_4_5 + 2)
93 0xD1, 0x83, 0xD0, 0xB5, 0xD1, 0x82,
95 #define s_4_7 (s_4_8 + 2)
97 0xD0, 0xB5, 0xD0, 0xBD, 0xD1, 0x8B,
98 #define s_4_9 (s_4_10 + 2)
100 0xD1, 0x8B, 0xD1, 0x82, 0xD1, 0x8C,
102 0xD0, 0xB8, 0xD1, 0x82, 0xD1, 0x8C,
104 0xD0, 0xB5, 0xD1, 0x88, 0xD1, 0x8C,
106 0xD0, 0xB8, 0xD1, 0x88, 0xD1, 0x8C,
109 #define s_4_16 (s_4_17 + 2)
111 0xD1, 0x8B, 0xD0, 0xBB, 0xD0, 0xB0,
113 0xD0, 0xB8, 0xD0, 0xBB, 0xD0, 0xB0,
114 #define s_4_19 (s_4_20 + 2)
116 0xD0, 0xB5, 0xD0, 0xBD, 0xD0, 0xB0,
118 0xD0, 0xB5, 0xD1, 0x82, 0xD0, 0xB5,
120 0xD0, 0xB8, 0xD1, 0x82, 0xD0, 0xB5,
121 #define s_4_23 (s_4_24 + 2)
123 0xD1, 0x83, 0xD0, 0xB9, 0xD1, 0x82, 0xD0, 0xB5,
125 0xD0, 0xB5, 0xD0, 0xB9, 0xD1, 0x82, 0xD0, 0xB5,
126 #define s_4_26 (s_4_27 + 2)
128 0xD1, 0x8B, 0xD0, 0xBB, 0xD0, 0xB8,
130 0xD0, 0xB8, 0xD0, 0xBB, 0xD0, 0xB8,
131 #define s_4_29 s_4_23
132 #define s_4_30 s_4_24
133 #define s_4_31 s_4_25
134 #define s_4_32 s_4_16
135 #define s_4_33 s_4_17
136 #define s_4_34 s_4_18
138 0xD1, 0x8B, 0xD0, 0xBC,
140 0xD0, 0xB5, 0xD0, 0xBC,
142 0xD0, 0xB8, 0xD0, 0xBC,
145 #define s_4_40 (s_4_41 + 2)
147 0xD1, 0x8B, 0xD0, 0xBB, 0xD0, 0xBE,
149 0xD0, 0xB8, 0xD0, 0xBB, 0xD0, 0xBE,
150 #define s_4_43 (s_4_44 + 2)
152 0xD0, 0xB5, 0xD0, 0xBD, 0xD0, 0xBE,
154 0xD0, 0xBD, 0xD0, 0xBD, 0xD0, 0xBE,
157 #define s_5_1 (s_5_2 + 2)
159 0xD0, 0xB8, 0xD1, 0x8F, 0xD1, 0x85,
161 0xD0, 0xB0, 0xD1, 0x85,
165 #define s_5_6 (s_5_7 + 2)
167 0xD1, 0x8C, 0xD1, 0x8E,
169 0xD0, 0xB8, 0xD1, 0x8E,
172 0xD1, 0x8C, 0xD1, 0x8F,
176 0xD0, 0xB5, 0xD0, 0xB2,
178 0xD0, 0xBE, 0xD0, 0xB2,
179 #define s_5_15 s_5_13
181 0xD1, 0x8C, 0xD0, 0xB5,
182 #define s_5_17 s_5_26
185 0xD0, 0xB5, 0xD0, 0xB8,
187 0xD0, 0xB8, 0xD0, 0xB8,
188 #define s_5_21 (s_5_22 + 2)
190 0xD0, 0xB8, 0xD1, 0x8F, 0xD0, 0xBC, 0xD0, 0xB8,
192 0xD0, 0xB0, 0xD0, 0xBC, 0xD0, 0xB8,
193 #define s_5_24 (s_5_25 + 2)
194 #define s_5_25 (s_5_26 + 2)
196 0xD0, 0xB8, 0xD0, 0xB5, 0xD0, 0xB9,
198 0xD0, 0xB8, 0xD0, 0xB9,
200 0xD0, 0xBE, 0xD0, 0xB9,
201 #define s_5_29 s_5_21
202 #define s_5_30 s_5_22
203 #define s_5_31 s_5_23
204 #define s_5_32 (s_5_33 + 2)
206 0xD0, 0xB8, 0xD0, 0xB5, 0xD0, 0xBC,
208 0xD0, 0xBE, 0xD0, 0xBC,
209 #define s_5_35 s_5_14
212 0xD0, 0xBE, 0xD1, 0x81, 0xD1, 0x82, 0xD1, 0x8C,
217 0xD0, 0xB5, 0xD0, 0xB9, 0xD1, 0x88, 0xD0, 0xB5,
395 static const unsigned char g_v[] = { 33, 65, 8, 232 };
414 if (ret < 0)
goto lab0;
420 if (ret < 0)
goto lab0;
425 if (ret < 0)
goto lab0;
430 if (ret < 0)
goto lab0;
441 if (!(I_p2 <= c))
return 0;
448 among_var = find_among_b(
s_pool,
a_0, 9, 0, 0);
449 if (!(among_var))
return 0;
453 {
int m1 = l - c; (void)m1;
454 if (!(eq_s_b(2,
s_0)))
goto lab1;
458 if (!(eq_s_b(2,
s_1)))
return 0;
461 {
int ret = slice_del();
462 if (ret < 0)
return ret;
466 {
int ret = slice_del();
467 if (ret < 0)
return ret;
476 if (!(find_among_b(
s_pool,
a_1, 26, 0, 0)))
return 0;
478 {
int ret = slice_del();
479 if (ret < 0)
return ret;
486 {
int ret = r_adjective();
487 if (ret <= 0)
return ret;
489 {
int m1 = l - c; (void)m1;
491 among_var = find_among_b(
s_pool,
a_2, 8, 0, 0);
492 if (!(among_var)) { c = l - m1;
goto lab0; }
496 {
int m2 = l - c; (void)m2;
497 if (!(eq_s_b(2,
s_2)))
goto lab2;
501 if (!(eq_s_b(2,
s_3))) { c = l - m1;
goto lab0; }
504 {
int ret = slice_del();
505 if (ret < 0)
return ret;
509 {
int ret = slice_del();
510 if (ret < 0)
return ret;
522 if (c - 3 <= lb || (p[c - 1] != 140 && p[c - 1] != 143))
return 0;
523 if (!(find_among_b(
s_pool,
a_3, 2, 0, 0)))
return 0;
525 {
int ret = slice_del();
526 if (ret < 0)
return ret;
534 among_var = find_among_b(
s_pool,
a_4, 46, 0, 0);
535 if (!(among_var))
return 0;
539 {
int m1 = l - c; (void)m1;
540 if (!(eq_s_b(2,
s_4)))
goto lab1;
544 if (!(eq_s_b(2,
s_5)))
return 0;
547 {
int ret = slice_del();
548 if (ret < 0)
return ret;
552 {
int ret = slice_del();
553 if (ret < 0)
return ret;
562 if (!(find_among_b(
s_pool,
a_5, 36, 0, 0)))
return 0;
564 {
int ret = slice_del();
565 if (ret < 0)
return ret;
572 if (c - 5 <= lb || (p[c - 1] != 130 && p[c - 1] != 140))
return 0;
573 if (!(find_among_b(
s_pool,
a_6, 2, 0, 0)))
return 0;
576 if (ret <= 0)
return ret;
578 {
int ret = slice_del();
579 if (ret < 0)
return ret;
587 among_var = find_among_b(
s_pool,
a_7, 4, 0, 0);
588 if (!(among_var))
return 0;
592 {
int ret = slice_del();
593 if (ret < 0)
return ret;
596 if (!(eq_s_b(2,
s_6)))
return 0;
598 if (!(eq_s_b(2,
s_7)))
return 0;
599 {
int ret = slice_del();
600 if (ret < 0)
return ret;
604 if (!(eq_s_b(2,
s_8)))
return 0;
605 {
int ret = slice_del();
606 if (ret < 0)
return ret;
610 {
int ret = slice_del();
611 if (ret < 0)
return ret;
620 {
int ret = r_mark_regions();
621 if (ret < 0)
return ret;
627 if (c < I_pV)
return 0;
628 mlimit1 = lb; lb = I_pV;
629 {
int m2 = l - c; (void)m2;
630 {
int m3 = l - c; (void)m3;
631 {
int ret = r_perfective_gerund();
632 if (ret == 0)
goto lab2;
633 if (ret < 0)
return ret;
638 {
int m4 = l - c; (void)m4;
639 {
int ret = r_reflexive();
640 if (ret == 0) { c = l - m4;
goto lab3; }
641 if (ret < 0)
return ret;
646 {
int m5 = l - c; (void)m5;
647 {
int ret = r_adjectival();
648 if (ret == 0)
goto lab5;
649 if (ret < 0)
return ret;
654 {
int ret = r_verb();
655 if (ret == 0)
goto lab6;
656 if (ret < 0)
return ret;
661 {
int ret = r_noun();
662 if (ret == 0)
goto lab0;
663 if (ret < 0)
return ret;
673 {
int m6 = l - c; (void)m6;
675 if (!(eq_s_b(2,
s_9))) { c = l - m6;
goto lab7; }
677 {
int ret = slice_del();
678 if (ret < 0)
return ret;
683 {
int m7 = l - c; (void)m7;
684 {
int ret = r_derivational();
685 if (ret < 0)
return ret;
689 {
int m8 = l - c; (void)m8;
690 {
int ret = r_tidy_up();
691 if (ret < 0)
return ret;
std::string get_description() const
Return a string describing this object.
int stem()
Virtual method implemented by the subclass to actually do the work.
int r_perfective_gerund()
int out_grouping_U(const unsigned char *s, int min, int max, int repeat)
int in_grouping_U(const unsigned char *s, int min, int max, int repeat)
static const symbol s_2[]
static const struct among a_7[4]
static const struct among a_3[2]
static const symbol s_4[]
static const symbol s_6[]
static const symbol s_3[]
static const symbol s_7[]
static const struct among a_5[36]
static const struct among a_6[2]
static const struct among a_2[8]
static const struct among a_1[26]
static const struct among a_0[9]
static const symbol s_1[]
static const struct among a_4[46]
static const symbol s_pool[]
static const unsigned char g_v[]
static const symbol s_8[]
static const symbol s_9[]
static const symbol s_5[]
static const symbol s_0[]