Header And Logo

PostgreSQL
| The world's most advanced open source database.

Functions

stem_KOI8_R_russian.h File Reference

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions

struct SN_envrussian_KOI8_R_create_env (void)
void russian_KOI8_R_close_env (struct SN_env *z)
int russian_KOI8_R_stem (struct SN_env *z)

Function Documentation

void russian_KOI8_R_close_env ( struct SN_env z  ) 

Definition at line 699 of file stem_KOI8_R_russian.c.

References SN_close_env().

{ SN_close_env(z, 0); }

struct SN_env* russian_KOI8_R_create_env ( void   )  [read]

Definition at line 697 of file stem_KOI8_R_russian.c.

References SN_create_env().

{ return SN_create_env(0, 2, 0); }

int russian_KOI8_R_stem ( struct SN_env z  ) 

Definition at line 604 of file stem_KOI8_R_russian.c.

References SN_env::bra, SN_env::c, eq_s_b(), SN_env::I, SN_env::ket, SN_env::l, SN_env::lb, r_adjectival(), r_derivational(), r_mark_regions(), r_noun(), r_perfective_gerund(), r_reflexive(), r_tidy_up(), r_verb(), s_9, and slice_del().

                                                  {
    {   int c1 = z->c; /* do, line 203 */
        {   int ret = r_mark_regions(z);
            if (ret == 0) goto lab0; /* call mark_regions, line 203 */
            if (ret < 0) return ret;
        }
    lab0:
        z->c = c1;
    }
    z->lb = z->c; z->c = z->l; /* backwards, line 204 */

    {   int mlimit; /* setlimit, line 204 */
        int m2 = z->l - z->c; (void)m2;
        if (z->c < z->I[0]) return 0;
        z->c = z->I[0]; /* tomark, line 204 */
        mlimit = z->lb; z->lb = z->c;
        z->c = z->l - m2;
        {   int m3 = z->l - z->c; (void)m3; /* do, line 205 */
            {   int m4 = z->l - z->c; (void)m4; /* or, line 206 */
                {   int ret = r_perfective_gerund(z);
                    if (ret == 0) goto lab3; /* call perfective_gerund, line 206 */
                    if (ret < 0) return ret;
                }
                goto lab2;
            lab3:
                z->c = z->l - m4;
                {   int m_keep = z->l - z->c;/* (void) m_keep;*/ /* try, line 207 */
                    {   int ret = r_reflexive(z);
                        if (ret == 0) { z->c = z->l - m_keep; goto lab4; } /* call reflexive, line 207 */
                        if (ret < 0) return ret;
                    }
                lab4:
                    ;
                }
                {   int m5 = z->l - z->c; (void)m5; /* or, line 208 */
                    {   int ret = r_adjectival(z);
                        if (ret == 0) goto lab6; /* call adjectival, line 208 */
                        if (ret < 0) return ret;
                    }
                    goto lab5;
                lab6:
                    z->c = z->l - m5;
                    {   int ret = r_verb(z);
                        if (ret == 0) goto lab7; /* call verb, line 208 */
                        if (ret < 0) return ret;
                    }
                    goto lab5;
                lab7:
                    z->c = z->l - m5;
                    {   int ret = r_noun(z);
                        if (ret == 0) goto lab1; /* call noun, line 208 */
                        if (ret < 0) return ret;
                    }
                }
            lab5:
                ;
            }
        lab2:
        lab1:
            z->c = z->l - m3;
        }
        {   int m_keep = z->l - z->c;/* (void) m_keep;*/ /* try, line 211 */
            z->ket = z->c; /* [, line 211 */
            if (!(eq_s_b(z, 1, s_9))) { z->c = z->l - m_keep; goto lab8; }
            z->bra = z->c; /* ], line 211 */
            {   int ret = slice_del(z); /* delete, line 211 */
                if (ret < 0) return ret;
            }
        lab8:
            ;
        }
        {   int m6 = z->l - z->c; (void)m6; /* do, line 214 */
            {   int ret = r_derivational(z);
                if (ret == 0) goto lab9; /* call derivational, line 214 */
                if (ret < 0) return ret;
            }
        lab9:
            z->c = z->l - m6;
        }
        {   int m7 = z->l - z->c; (void)m7; /* do, line 215 */
            {   int ret = r_tidy_up(z);
                if (ret == 0) goto lab10; /* call tidy_up, line 215 */
                if (ret < 0) return ret;
            }
        lab10:
            z->c = z->l - m7;
        }
        z->lb = mlimit;
    }
    z->c = z->lb;
    return 1;
}