jyapayne/swig
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

(Preprocessor_expr_init): Use `void' arg instead of empty list.

Browse source 
git-svn-id: https://swig.svn.sourceforge.net/svnroot/swig/trunk@437 626c5289-ae23-0410-ae9c-e8d60b6d4f22
This commit is contained in:
Thien-Thi Nguyen 2000-05-11 07:52:57 +00:00
commit dde5ce2326
1 changed files with 19 additions and 19 deletions
Download patch file Download diff file Expand all files Collapse all files

38
SWIG/Source/Preprocessor/expr.c
View file

@ -1,13 +1,13 @@
/* ----------------------------------------------------------------------------- /* -----------------------------------------------------------------------------
* expr.c * expr.c
* *
* Integer arithmetic expression evaluator used to handle expressions * Integer arithmetic expression evaluator used to handle expressions
* encountered during preprocessing. * encountered during preprocessing.
* *
* Author(s) : David Beazley (beazley@cs.uchicago.edu) * Author(s) : David Beazley (beazley@cs.uchicago.edu)
* *
* Copyright (C) 1999-2000. The University of Chicago * Copyright (C) 1999-2000. The University of Chicago
* See the file LICENSE for information on usage and redistribution. * See the file LICENSE for information on usage and redistribution.
* ----------------------------------------------------------------------------- */ * ----------------------------------------------------------------------------- */
static char cvsroot[] = "$Header$"; static char cvsroot[] = "$Header$";
@ -16,7 +16,7 @@ static char cvsroot[] = "$Header$";
static SwigScanner *scan = 0; static SwigScanner *scan = 0;
typedef struct { typedef struct {
int op; int op;
long value; long value;
} exprval; } exprval;
@ -35,12 +35,12 @@ static char *errmsg = 0; /* Parsing error */
/* Initialize the precedence table for various operators. Low values have higher precedence */ /* Initialize the precedence table for various operators. Low values have higher precedence */
static void init_precedence() { static void init_precedence() {
prec[SWIG_TOKEN_NOT] = 10; prec[SWIG_TOKEN_NOT] = 10;
prec[EXPR_UMINUS] = 10; prec[EXPR_UMINUS] = 10;
prec[SWIG_TOKEN_STAR] = 20; prec[SWIG_TOKEN_STAR] = 20;
prec[SWIG_TOKEN_SLASH] = 20; prec[SWIG_TOKEN_SLASH] = 20;
prec[SWIG_TOKEN_PERCENT] = 20; prec[SWIG_TOKEN_PERCENT] = 20;
prec[SWIG_TOKEN_PLUS] = 30; prec[SWIG_TOKEN_PLUS] = 30;
prec[SWIG_TOKEN_MINUS] = 30; prec[SWIG_TOKEN_MINUS] = 30;
prec[SWIG_TOKEN_LSHIFT] = 40; prec[SWIG_TOKEN_LSHIFT] = 40;
prec[SWIG_TOKEN_RSHIFT] = 40; prec[SWIG_TOKEN_RSHIFT] = 40;
@ -161,12 +161,12 @@ static void reduce_op() {
/* ----------------------------------------------------------------------------- /* -----------------------------------------------------------------------------
* Preprocessor_expr_init() * Preprocessor_expr_init()
* *
* Initialize the expression evaluator * Initialize the expression evaluator
* ----------------------------------------------------------------------------- */ * ----------------------------------------------------------------------------- */
void void
Preprocessor_expr_init() { Preprocessor_expr_init (void) {
if (!expr_init) init_precedence(); if (!expr_init) init_precedence();
if (!scan) scan = NewSwigScanner(); if (!scan) scan = NewSwigScanner();
} }
@ -177,11 +177,11 @@ Preprocessor_expr_init() {
* Evaluates an arithmetic expression. Returns the result and sets an error code. * Evaluates an arithmetic expression. Returns the result and sets an error code.
* ----------------------------------------------------------------------------- */ * ----------------------------------------------------------------------------- */
int int
Preprocessor_expr(DOH *s, int *error) { Preprocessor_expr(DOH *s, int *error) {
int token = 0; int token = 0;
int op = 0; int op = 0;
sp = 0; sp = 0;
assert(s); assert(s);
assert(scan); assert(scan);
@ -270,10 +270,10 @@ Preprocessor_expr(DOH *s, int *error) {
} else { } else {
if (stack[sp-1].op != EXPR_OP) goto syntax_error; if (stack[sp-1].op != EXPR_OP) goto syntax_error;
op = stack[sp-1].value; /* Previous operator */ op = stack[sp-1].value; /* Previous operator */
/* Now, depending on the precedence relationship between the last operator and the current /* Now, depending on the precedence relationship between the last operator and the current
we will reduce or push */ we will reduce or push */
if (prec[op] <= prec[token]) { if (prec[op] <= prec[token]) {
/* Reduce the previous operator */ /* Reduce the previous operator */
reduce_op(); reduce_op();
@ -289,7 +289,7 @@ Preprocessor_expr(DOH *s, int *error) {
break; break;
case SWIG_TOKEN_RPAREN: case SWIG_TOKEN_RPAREN:
if (sp == 0) goto extra_rparen; if (sp == 0) goto extra_rparen;
/* Might have to reduce operators first */ /* Might have to reduce operators first */
while ((sp > 0) && (stack[sp-1].op == EXPR_OP)) reduce_op(); while ((sp > 0) && (stack[sp-1].op == EXPR_OP)) reduce_op();
if ((sp == 0) || (stack[sp-1].op != EXPR_GROUP)) goto extra_rparen; if ((sp == 0) || (stack[sp-1].op != EXPR_GROUP)) goto extra_rparen;
@ -330,8 +330,8 @@ Preprocessor_expr_error() {
} }