root/binary.c

/* */

DEFINITIONS

1. matchword
2. push
3. pop

   1 /*
   2  *   Compound Text word statistics and search report
   3  *
   4  *   binary.c : multilingal word matching -- binary matching
   5  *
   6  *                                           Copyright(c) isao yasuda, 1998 
   7  */
   8 static char *rcs_id = "$Id: binary.c,v 1.2 2007/09/09 11:19:56 isao Exp $";
  10 #include <stdio.h>
  11 #include "staslova.h"
  12 #include "table.h"
  14 int mstck[MAXSTACK];
  15 int msp = 0;
  16 int stackop;
  18 int
matchword(unsigned char *wd, struct cdent *cp)
  20 {
  21   void push(int);
  22   int pop(void);
  24   unsigned char **polp = cp->cdpolish;
  25   int op2, ans;
stackop = 0;
  28   while (*polp != NULL && stackop == 0) {
  29     switch (**polp) {
  30     case EXP :
push(unarymatch(wd, *polp + 2));
  32       break;
  33     case '+' :
push(pop() | pop());
  35       break;
  36     case '*' :
push(pop() * pop());
  38       break;
  39     case '#' :
op2 = pop();
push(pop() * (!op2));
  42       break;
  43     default :
fprintf(stderr, "Unknown expression.(matchword)\n");
  45       return UNMATCH; /* when error occurred return UNMATCH */
  46     }
polp++;
  48   }
ans = pop();
  50   if (stackop != 0)
  51     return UNMATCH; /* when error occurred return UNMATCH */
  52   return ans;
  53 }
  55 void
push(int val)
  57 {
  58   if (msp < MAXSTACK) {
mstck[msp++] = val;
stackop |= 0;
  61   } else { 
fprintf(stderr, "Expression stack full.(push)\n");
stackop |= 1;
  64   }
  65 }
  67 int
pop(void)
  69 {
  70   if (msp > 0) {
  71     return mstck[--msp];
stackop |= 0; 
  73   } else {
fprintf(stderr, "Expression stack empty," \
  75             "probably problems in your multiple operations.(pop)\n");
stackop |= 2;
  77   }
  78 }

/*

*/