NE
token = NE;
while ((op = token) == EQ || op == NE || op == LT || op == GT ||
case NE:
case NE:
| numex NE numex { $$ = $1 != $3; }
%nonassoc EQ NE LT GT LE GE REGEXP
| str NE str {
unsigned short eeul[NE] = {
#if NE == 10
unsigned short ezero[NE] =
unsigned short ehalf[NE] =
unsigned short eone[NE] =
unsigned short etwo[NE] =
unsigned short e32[NE] =
unsigned short elog2[NE] =
unsigned short esqrt2[NE] =
unsigned short epi[NE] =
unsigned short eeul[NE] = {
unsigned short ezero[NE] = {
unsigned short ehalf[NE] = {
unsigned short eone[NE] = {
unsigned short etwo[NE] = {
unsigned short e32[NE] = {
unsigned short elog2[NE] = {
unsigned short esqrt2[NE] = {
unsigned short eoneopi[NE] = {
unsigned short epi[NE] = {
unsigned short num[NE], den[NE], x2[NE];
expchk = x2[NE-1];
x2[NE-1] &= 0x7fff;
#define NI (NE+3)
unsigned short xx[NE], z[NE], a[NE], b[NE], t[NE], qj[NE];
if( x[NE-1] & (unsigned short )0x8000 )
esqrt2[NE-1] -= 1;
esqrt2[NE-1] += 1;
if( a[NE-1] == 0 )
while( ((b[NE-1] & 0x7fff) - (t[NE-1] & 0x7fff)) < NBITS );
signx = w[NE-1] & (unsigned short )0x8000;
w[NE-1] &= (unsigned short )0x7fff;
unsigned short w[NE];
unsigned short w[NE];
if( (x[NE-1] & (unsigned short )0x7fff) == 0 )
unsigned short e[NE], r[NE], j[NE], xx[NE], m2[NE];
r[NE-1] &= (unsigned short )0x7fff;
*(c+(NE-1)) |= 0x8000;
*(c+(NE-1)) &= ~0x8000;
*(c+(NE-1)) |= 0x8000;
*(c+(NE-1)) &= ~0x8000;
for( i=0; i<NE-5; i++ )
p = &yy[0] + (NE-1);
if((yy[NE-1] & 0x7fff) == 0 && (yy[NE-2] & 0x8000) == 0)
p = &yy[NE-1];
for( i=0; i<NE; i++ )
for( i=0; i<NE; i++ )
for( i=0; i<NE; i++ )
x[NE-1] &= 0x7fff; /* sign is top bit of last word of external format */
x[NE-1] ^= 0x8000; /* Toggle the sign bit */
if( x[NE-1] & 0x8000 )
if( (x[NE-1] & 0x7fff) == 0x7fff )
#if NE == 10
static unsigned short etens[NTEN + 1][NE] =
static unsigned short emtens[NTEN + 1][NE] =
static unsigned short etens[NTEN+1][NE] = {
static unsigned short emtens[NTEN+1][NE] = {
if( (x[NE-1] & 0x7fff) != 0x7fff )
for( i=0; i<NE-1; i++ )
if( y[NE-1] & 0x8000 )
y[NE-1] &= 0x7fff;
if( y[NE-1] == 0 )
for( k=0; k<NE-1; k++ )
if( y[NE-1] == 0x7fff )
if( (y[NE-1] != 0) && ((y[NE-2] & 0x8000) == 0) )
u[NE-1] = EXONE + NBITS - 1;
for( j=0; j<NE-1; j++ )
p += NE;
u[NE-1] += y[NE-1] - (unsigned int )(EXONE + NBITS - 1);
p += NE;
if( y[NE-1] == 0 )
while( (y[NE-2] & 0x8000) == 0 )
if( eone[NE-1] <= u[1] )
p += NE;
r += NE;
for( i=0; i<NE-1; i++ )
for( i=0; i<NE-1; i++ )
p -= NE;
p = a + (NE-1); /* point to last word of external number */
unsigned short f[NE];
expon = (int )f[NE-1];
for( i=0; i<NE-1; i++ )
for( i=0; i<NE-2; i++ )
for( i=0; i<NE-1; i++ )
if( j < NE )
q = b + (NE-1); /* point to output exponent */
for( i=0; i<NE-1; i++ )
pvec( print, NE );
pvec( scan, NE );
pvec( tst, NE );
pvec( ref, NE );
pvec( ref, NE );
pvec( tst, NE );
static unsigned short fullp[NE], rounded[NE];
unsigned short e[NE];
unsigned short er[NE];
static unsigned short rprint[NE], rscan[NE];
static unsigned short q1[NE], q2[NE], q5[NE];
unsigned short t[NE], u[NE], v[NE];
static unsigned short e1[NE], e2[NE], e3[NE];
static unsigned short eten[NE], maxm[NE];
static unsigned short LOW[ NE ], WIDTH[NE], e27[NE], e10m13[NE];
unsigned short ea[NE], em[NE], en[NE], ex[NE];
unsigned short ea[NE], ex[NE];
| NE { $$ = PF_OP_NE; }
%token DIVERTTO DIVERTREPLY DIVERTPACKET NATTO AFTO RDRTO RECEIVEDON NE LE GE
return (NE);
| pattern NE pattern { $$ = op2($2, $1, $3); }
case LE: case LT: case EQ: case NE: case GT: case GE:
return op2(NE, n, nullnode);
%token <i> AND BOR APPEND EQ GE GT LE LT NE IN
%nonassoc APPEND EQ GE GT LE LT NE MATCHOP IN '|'
input(); yylval.i = NE; RET(NE);
{ NE, "relop", " != " },
if ((x_is_nan || y_is_nan) && n != NE)
case NE: if (x_is_nan && y_is_nan) return(True);
%left EQ NE
| expr NE expr { $$ = $1 != $3; }
%token NE LE GE XRANGE LONGER MAXLEN MAX
| NE { $$ = OP_NE; }
| NE { $$ = OP_NE; }
return (NE);
| NE
return (NE);
%token HOPPER DELAY NE LE GE ARROW