w ;
SYMB a ,
t ;
- SYMB *rule_start ,
- *r ,
- *r_s ;
+ SYMB *rule_start , *r ;
NODE u ;
NODE **Trie ;
KW *keyw ,
/* get local copies of stuff saved in RULES */
o_l = rules -> r_p -> output_link ;
k_s = rules -> r_p -> key_space ;
- r_s = rules -> r_p -> rule_space ;
+
Trie = rules -> Trie ;
r = rules -> r ;
int rules_ready(RULES *rules);
void rules_free(RULES *rules);
-STANDARDIZER *std_init();
+STANDARDIZER *std_init(void);
int std_use_lex(STANDARDIZER *std, LEXICON *lex);
int std_use_gaz(STANDARDIZER *std, LEXICON *gaz);
int std_use_rules(STANDARDIZER *std, RULES *rules);
struct morph * morph_p ,
DEF *d ) {
/* -- combine the current Lexeme with the previous one -- */
- int n ;
LEXEME *CurLexVector, *PrevLexVector ;
/* -- find the two lexemes to combine -- */
PrevLexVector -> EndMorph = CurLexVector -> EndMorph ; /* the new end */
PrevLexVector -> Text[ 0 ] = SENTINEL ;
- n = phrase_from_morphs( morph_p ,
+ phrase_from_morphs( morph_p ,
PrevLexVector -> Text ,
PrevLexVector -> StartMorph ,
PrevLexVector -> EndMorph ) ;