Return to evall.c CVS log

Up to [local] / OpenXM_contrib2 / asir2000 / parse

Annotation of OpenXM_contrib2/asir2000/parse/evall.c, Revision 1.2

1.2     ! noro        1: /*
        !             2:  * Copyright (c) 1994-2000 FUJITSU LABORATORIES LIMITED
        !             3:  * All rights reserved.
        !             4:  *
        !             5:  * FUJITSU LABORATORIES LIMITED ("FLL") hereby grants you a limited,
        !             6:  * non-exclusive and royalty-free license to use, copy, modify and
        !             7:  * redistribute, solely for non-commercial and non-profit purposes, the
        !             8:  * computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and
        !             9:  * conditions of this Agreement. For the avoidance of doubt, you acquire
        !            10:  * only a limited right to use the SOFTWARE hereunder, and FLL or any
        !            11:  * third party developer retains all rights, including but not limited to
        !            12:  * copyrights, in and to the SOFTWARE.
        !            13:  *
        !            14:  * (1) FLL does not grant you a license in any way for commercial
        !            15:  * purposes. You may use the SOFTWARE only for non-commercial and
        !            16:  * non-profit purposes only, such as academic, research and internal
        !            17:  * business use.
        !            18:  * (2) The SOFTWARE is protected by the Copyright Law of Japan and
        !            19:  * international copyright treaties. If you make copies of the SOFTWARE,
        !            20:  * with or without modification, as permitted hereunder, you shall affix
        !            21:  * to all such copies of the SOFTWARE the above copyright notice.
        !            22:  * (3) An explicit reference to this SOFTWARE and its copyright owner
        !            23:  * shall be made on your publication or presentation in any form of the
        !            24:  * results obtained by use of the SOFTWARE.
        !            25:  * (4) In the event that you modify the SOFTWARE, you shall notify FLL by
        !            26:  * e-mail at risa-admin@flab.fujitsu.co.jp of the detailed specification
        !            27:  * for such modification or the source code of the modified part of the
        !            28:  * SOFTWARE.
        !            29:  *
        !            30:  * THE SOFTWARE IS PROVIDED AS IS WITHOUT ANY WARRANTY OF ANY KIND. FLL
        !            31:  * MAKES ABSOLUTELY NO WARRANTIES, EXPRESSED, IMPLIED OR STATUTORY, AND
        !            32:  * EXPRESSLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS
        !            33:  * FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT OF THIRD PARTIES'
        !            34:  * RIGHTS. NO FLL DEALER, AGENT, EMPLOYEES IS AUTHORIZED TO MAKE ANY
        !            35:  * MODIFICATIONS, EXTENSIONS, OR ADDITIONS TO THIS WARRANTY.
        !            36:  * UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, TORT, CONTRACT,
        !            37:  * OR OTHERWISE, SHALL FLL BE LIABLE TO YOU OR ANY OTHER PERSON FOR ANY
        !            38:  * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, PUNITIVE OR CONSEQUENTIAL
        !            39:  * DAMAGES OF ANY CHARACTER, INCLUDING, WITHOUT LIMITATION, DAMAGES
        !            40:  * ARISING OUT OF OR RELATING TO THE SOFTWARE OR THIS AGREEMENT, DAMAGES
        !            41:  * FOR LOSS OF GOODWILL, WORK STOPPAGE, OR LOSS OF DATA, OR FOR ANY
        !            42:  * DAMAGES, EVEN IF FLL SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF
        !            43:  * SUCH DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY. EVEN IF A PART
        !            44:  * OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY
        !            45:  * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,
        !            46:  * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.
        !            47:  *
        !            48:  * $OpenXM: OpenXM_contrib2/asir2000/parse/evall.c,v 1.1.1.1 1999/12/03 07:39:12 noro Exp $
        !            49: */
1.1       noro       50: #include <ctype.h>
                     51: #include "ca.h"
                     52: #include "parse.h"
                     53: #include "base.h"
                     54: #include "al.h"
                     55: #if !defined(THINK_C)
                     56: #include <sys/types.h>
                     57: #include <sys/stat.h>
                     58: #endif
                     59:
                     60: pointer evall();
                     61:
                     62: pointer evall(id,a1,a2)
                     63: lid id;
                     64: Obj a1,a2;
                     65: {
                     66:        F f;
                     67:        Obj d;
                     68:        oFOP op;
                     69:        NODE n1,n2;
                     70:
                     71:        switch ( id ) {
                     72:                case L_EQ:
                     73:                        op = AL_EQUAL; break;
                     74:                case L_NE:
                     75:                        op = AL_NEQ; break;
                     76:                case L_GT:
                     77:                        op = AL_GREATERP; break;
                     78:                case L_LT:
                     79:                        op = AL_LESSP; break;
                     80:                case L_GE:
                     81:                        op = AL_GEQ; break;
                     82:                case L_LE:
                     83:                        op = AL_LEQ; break;
                     84:                case L_AND:
                     85:                        op = AL_AND; break;
                     86:                case L_OR:
                     87:                        op = AL_OR; break;
                     88:                case L_NOT:
                     89:                        op = AL_NOT; break;
                     90:                case L_IMPL:
                     91:                        op = AL_IMPL; break;
                     92:                case L_REPL:
                     93:                        op = AL_REPL; break;
                     94:                case L_EQUIV:
                     95:                        op = AL_EQUIV; break;
                     96:                default:
                     97:                        error("evall : unknown id");
                     98:        }
                     99:        if ( AL_ATOMIC(op) ) {
                    100:                arf_sub(CO,a1,a2,&d);
                    101:                MKAF(f,op,(P)d);
                    102:        } else if ( AL_JUNCT(op) ) {
                    103:                if ( FOP((F)a1) == op ) {
                    104:                        if ( FOP((F)a2) == op )
                    105:                                n2 = FJARG((F)a2);
                    106:                        else
                    107:                                MKNODE(n2,(F)a2,0);
                    108:                        node_concat_dup(FJARG((F)a1),n2,&n1);
                    109:                } else if ( FOP((F)a2) == op )
                    110:                        MKNODE(n1,a1,FJARG((F)a2));
                    111:                else {
                    112:                        MKNODE(n2,a2,0); MKNODE(n1,a1,n2);
                    113:                }
                    114:                MKJF(f,op,n1);
                    115:        } else if ( AL_UNI(op) )
                    116:                MKUF(f,op,(F)a1);
                    117:        else if ( AL_EXT(op) )
                    118:                MKBF(f,op,(F)a1,(F)a2);
                    119:        return (pointer)f;
                    120: }
                    121:
                    122: node_concat_dup(n1,n2,nr)
                    123: NODE n1,n2,*nr;
                    124: {
                    125:        NODE r0,r,n;
                    126:
                    127:        for ( r0 = 0, n = n1; n; n = NEXT(n) ) {
                    128:                NEXTNODE(r0,r); BDY(r) = BDY(n);
                    129:        }
                    130:        if ( !r0 )
                    131:                *nr = n2;
                    132:        else {
                    133:                NEXT(r) = n2; *nr = r0;
                    134:        }
                    135: }