Implementing an "in" operator

Any ideas on how one would implement an "in" operator?


As in (no pun intended):


        if (a in b,c,d..e)
                statements;


translates to:


        if (a == b or a == c or (a >= d and a <=e))
                statements;


I don't have a problem with unary and binary operators, but
this one has got me stumped. Part of my simple
(integer-only) expression parser is shown below:


static Tree *expr(int p) {
        Tree *t = primary(); /* also handles unary operators */
        while (isBinaryOperator(tok.sym) &&
                        precedence(tok.sym) >= p) {
                const Symtype op = tok.sym;
                getsym();
                t = mkBinaryNode(op, t,
                                expr(associativity(op) == Right ?
                                        precedence(op) : 1 + precedence(op)));
        }
        return t;
}


Any ideas on how "in" might be implemented in the above?
[Treat comma and .. as operators long enough to build up a tree of
stuff you can translate when you deal with the "in", perhaps. -John]

Return to the comp.compilers page.
Search the comp.compilers archives again.