⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 stem_utf_8_italian.c

📁 firtext搜索引擎源码
💻 C
📖 第 1 页 / 共 3 页
字号:
static int r_R2(struct SN_env * z) {    if (!(z->I[2] <= z->c)) return 0;    return 1;}static int r_attached_pronoun(struct SN_env * z) {    int among_var;    z->ket = z->c; /* [, line 87 */    if (z->c <= z->lb || z->p[z->c - 1] >> 5 != 3 || !((33314 >> (z->p[z->c - 1] & 0x1f)) & 1)) return 0;    if (!(find_among_b(z, a_2, 37))) return 0; /* substring, line 87 */    z->bra = z->c; /* ], line 87 */    if (z->c <= z->lb || (z->p[z->c - 1] != 111 && z->p[z->c - 1] != 114)) return 0;    among_var = find_among_b(z, a_3, 5); /* among, line 97 */    if (!(among_var)) return 0;    {   int ret = r_RV(z);        if (ret == 0) return 0; /* call RV, line 97 */        if (ret < 0) return ret;    }    switch(among_var) {        case 0: return 0;        case 1:            {   int ret;                ret = slice_del(z); /* delete, line 98 */                if (ret < 0) return ret;            }            break;        case 2:            {   int ret;                ret = slice_from_s(z, 1, s_12); /* <-, line 99 */                if (ret < 0) return ret;            }            break;    }    return 1;}static int r_standard_suffix(struct SN_env * z) {    int among_var;    z->ket = z->c; /* [, line 104 */    among_var = find_among_b(z, a_6, 51); /* substring, line 104 */    if (!(among_var)) return 0;    z->bra = z->c; /* ], line 104 */    switch(among_var) {        case 0: return 0;        case 1:            {   int ret = r_R2(z);                if (ret == 0) return 0; /* call R2, line 111 */                if (ret < 0) return ret;            }            {   int ret;                ret = slice_del(z); /* delete, line 111 */                if (ret < 0) return ret;            }            break;        case 2:            {   int ret = r_R2(z);                if (ret == 0) return 0; /* call R2, line 113 */                if (ret < 0) return ret;            }            {   int ret;                ret = slice_del(z); /* delete, line 113 */                if (ret < 0) return ret;            }            {   int m = z->l - z->c; (void) m; /* try, line 114 */                z->ket = z->c; /* [, line 114 */                if (!(eq_s_b(z, 2, s_13))) { z->c = z->l - m; goto lab0; }                z->bra = z->c; /* ], line 114 */                {   int ret = r_R2(z);                    if (ret == 0) { z->c = z->l - m; goto lab0; } /* call R2, line 114 */                    if (ret < 0) return ret;                }                {   int ret;                    ret = slice_del(z); /* delete, line 114 */                    if (ret < 0) return ret;                }            lab0:                ;            }            break;        case 3:            {   int ret = r_R2(z);                if (ret == 0) return 0; /* call R2, line 117 */                if (ret < 0) return ret;            }            {   int ret;                ret = slice_from_s(z, 3, s_14); /* <-, line 117 */                if (ret < 0) return ret;            }            break;        case 4:            {   int ret = r_R2(z);                if (ret == 0) return 0; /* call R2, line 119 */                if (ret < 0) return ret;            }            {   int ret;                ret = slice_from_s(z, 1, s_15); /* <-, line 119 */                if (ret < 0) return ret;            }            break;        case 5:            {   int ret = r_R2(z);                if (ret == 0) return 0; /* call R2, line 121 */                if (ret < 0) return ret;            }            {   int ret;                ret = slice_from_s(z, 4, s_16); /* <-, line 121 */                if (ret < 0) return ret;            }            break;        case 6:            {   int ret = r_RV(z);                if (ret == 0) return 0; /* call RV, line 123 */                if (ret < 0) return ret;            }            {   int ret;                ret = slice_del(z); /* delete, line 123 */                if (ret < 0) return ret;            }            break;        case 7:            {   int ret = r_R1(z);                if (ret == 0) return 0; /* call R1, line 125 */                if (ret < 0) return ret;            }            {   int ret;                ret = slice_del(z); /* delete, line 125 */                if (ret < 0) return ret;            }            {   int m = z->l - z->c; (void) m; /* try, line 126 */                z->ket = z->c; /* [, line 127 */                if (z->c <= z->lb || z->p[z->c - 1] >> 5 != 3 || !((4722696 >> (z->p[z->c - 1] & 0x1f)) & 1)) { z->c = z->l - m; goto lab1; }                among_var = find_among_b(z, a_4, 4); /* substring, line 127 */                if (!(among_var)) { z->c = z->l - m; goto lab1; }                z->bra = z->c; /* ], line 127 */                {   int ret = r_R2(z);                    if (ret == 0) { z->c = z->l - m; goto lab1; } /* call R2, line 127 */                    if (ret < 0) return ret;                }                {   int ret;                    ret = slice_del(z); /* delete, line 127 */                    if (ret < 0) return ret;                }                switch(among_var) {                    case 0: { z->c = z->l - m; goto lab1; }                    case 1:                        z->ket = z->c; /* [, line 128 */                        if (!(eq_s_b(z, 2, s_17))) { z->c = z->l - m; goto lab1; }                        z->bra = z->c; /* ], line 128 */                        {   int ret = r_R2(z);                            if (ret == 0) { z->c = z->l - m; goto lab1; } /* call R2, line 128 */                            if (ret < 0) return ret;                        }                        {   int ret;                            ret = slice_del(z); /* delete, line 128 */                            if (ret < 0) return ret;                        }                        break;                }            lab1:                ;            }            break;        case 8:            {   int ret = r_R2(z);                if (ret == 0) return 0; /* call R2, line 134 */                if (ret < 0) return ret;            }            {   int ret;                ret = slice_del(z); /* delete, line 134 */                if (ret < 0) return ret;            }            {   int m = z->l - z->c; (void) m; /* try, line 135 */                z->ket = z->c; /* [, line 136 */                if (z->c <= z->lb || z->p[z->c - 1] >> 5 != 3 || !((4198408 >> (z->p[z->c - 1] & 0x1f)) & 1)) { z->c = z->l - m; goto lab2; }                among_var = find_among_b(z, a_5, 3); /* substring, line 136 */                if (!(among_var)) { z->c = z->l - m; goto lab2; }                z->bra = z->c; /* ], line 136 */                switch(among_var) {                    case 0: { z->c = z->l - m; goto lab2; }                    case 1:                        {   int ret = r_R2(z);                            if (ret == 0) { z->c = z->l - m; goto lab2; } /* call R2, line 137 */                            if (ret < 0) return ret;                        }                        {   int ret;                            ret = slice_del(z); /* delete, line 137 */                            if (ret < 0) return ret;                        }                        break;                }            lab2:                ;            }            break;        case 9:            {   int ret = r_R2(z);                if (ret == 0) return 0; /* call R2, line 142 */                if (ret < 0) return ret;            }            {   int ret;                ret = slice_del(z); /* delete, line 142 */                if (ret < 0) return ret;            }            {   int m = z->l - z->c; (void) m; /* try, line 143 */                z->ket = z->c; /* [, line 143 */                if (!(eq_s_b(z, 2, s_18))) { z->c = z->l - m; goto lab3; }                z->bra = z->c; /* ], line 143 */                {   int ret = r_R2(z);                    if (ret == 0) { z->c = z->l - m; goto lab3; } /* call R2, line 143 */                    if (ret < 0) return ret;                }                {   int ret;                    ret = slice_del(z); /* delete, line 143 */                    if (ret < 0) return ret;                }                z->ket = z->c; /* [, line 143 */                if (!(eq_s_b(z, 2, s_19))) { z->c = z->l - m; goto lab3; }                z->bra = z->c; /* ], line 143 */                {   int ret = r_R2(z);                    if (ret == 0) { z->c = z->l - m; goto lab3; } /* call R2, line 143 */                    if (ret < 0) return ret;                }                {   int ret;                    ret = slice_del(z); /* delete, line 143 */                    if (ret < 0) return ret;                }            lab3:                ;            }            break;    }    return 1;}static int r_verb_suffix(struct SN_env * z) {    int among_var;    {   int m3; /* setlimit, line 148 */        int m = z->l - z->c; (void) m;        if (z->c < z->I[0]) return 0;        z->c = z->I[0]; /* tomark, line 148 */        m3 = z->lb; z->lb = z->c;        z->c = z->l - m;        z->ket = z->c; /* [, line 149 */        among_var = find_among_b(z, a_7, 87); /* substring, line 149 */        if (!(among_var)) { z->lb = m3; return 0; }        z->bra = z->c; /* ], line 149 */        switch(among_var) {            case 0: { z->lb = m3; return 0; }            case 1:                {   int ret;                    ret = slice_del(z); /* delete, line 163 */                    if (ret < 0) return ret;                }                break;        }        z->lb = m3;    }    return 1;}static int r_vowel_suffix(struct SN_env * z) {    {   int m = z->l - z->c; (void) m; /* try, line 171 */        z->ket = z->c; /* [, line 172 */        if (!(in_grouping_b_U(z, g_AEIO, 97, 242))) { z->c = z->l - m; goto lab0; }        z->bra = z->c; /* ], line 172 */        {   int ret = r_RV(z);            if (ret == 0) { z->c = z->l - m; goto lab0; } /* call RV, line 172 */            if (ret < 0) return ret;        }        {   int ret;            ret = slice_del(z); /* delete, line 172 */            if (ret < 0) return ret;        }        z->ket = z->c; /* [, line 173 */        if (!(eq_s_b(z, 1, s_20))) { z->c = z->l - m; goto lab0; }        z->bra = z->c; /* ], line 173 */        {   int ret = r_RV(z);            if (ret == 0) { z->c = z->l - m; goto lab0; } /* call RV, line 173 */            if (ret < 0) return ret;        }        {   int ret;            ret = slice_del(z); /* delete, line 173 */            if (ret < 0) return ret;        }    lab0:        ;    }    {   int m = z->l - z->c; (void) m; /* try, line 175 */        z->ket = z->c; /* [, line 176 */        if (!(eq_s_b(z, 1, s_21))) { z->c = z->l - m; goto lab1; }        z->bra = z->c; /* ], line 176 */        if (!(in_grouping_b_U(z, g_CG, 99, 103))) { z->c = z->l - m; goto lab1; }        {   int ret = r_RV(z);            if (ret == 0) { z->c = z->l - m; goto lab1; } /* call RV, line 176 */            if (ret < 0) return ret;        }        {   int ret;            ret = slice_del(z); /* delete, line 176 */            if (ret < 0) return ret;        }    lab1:        ;    }    return 1;}extern int italian_UTF_8_stem(struct SN_env * z) {    {   int c = z->c; /* do, line 182 */        {   int ret = r_prelude(z);            if (ret == 0) goto lab0; /* call prelude, line 182 */            if (ret < 0) return ret;        }    lab0:        z->c = c;    }    {   int c = z->c; /* do, line 183 */        {   int ret = r_mark_regions(z);            if (ret == 0) goto lab1; /* call mark_regions, line 183 */            if (ret < 0) return ret;        }    lab1:        z->c = c;    }    z->lb = z->c; z->c = z->l; /* backwards, line 184 */    {   int m = z->l - z->c; (void) m; /* do, line 185 */        {   int ret = r_attached_pronoun(z);            if (ret == 0) goto lab2; /* call attached_pronoun, line 185 */            if (ret < 0) return ret;        }    lab2:        z->c = z->l - m;    }    {   int m = z->l - z->c; (void) m; /* do, line 186 */        {   int m = z->l - z->c; (void) m; /* or, line 186 */            {   int ret = r_standard_suffix(z);                if (ret == 0) goto lab5; /* call standard_suffix, line 186 */                if (ret < 0) return ret;            }            goto lab4;        lab5:            z->c = z->l - m;            {   int ret = r_verb_suffix(z);                if (ret == 0) goto lab3; /* call verb_suffix, line 186 */                if (ret < 0) return ret;            }        }    lab4:    lab3:        z->c = z->l - m;    }    {   int m = z->l - z->c; (void) m; /* do, line 187 */        {   int ret = r_vowel_suffix(z);            if (ret == 0) goto lab6; /* call vowel_suffix, line 187 */            if (ret < 0) return ret;        }    lab6:        z->c = z->l - m;    }    z->c = z->lb;    {   int c = z->c; /* do, line 189 */        {   int ret = r_postlude(z);            if (ret == 0) goto lab7; /* call postlude, line 189 */            if (ret < 0) return ret;        }    lab7:        z->c = c;    }    return 1;}extern struct SN_env * italian_UTF_8_create_env(void) { return SN_create_env(0, 3, 0); }extern void italian_UTF_8_close_env(struct SN_env * z) { SN_close_env(z, 0); }

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -