Annotation of OpenXM_contrib2/asir2000/parse/evall.c, Revision 1.4
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
1.3 noro 26: * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
1.2 noro 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: *
1.4 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2000/parse/evall.c,v 1.3 2000/08/22 05:04:26 noro Exp $
1.2 noro 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: #include <sys/types.h>
56: #include <sys/stat.h>
57:
58: pointer evall();
59:
60: pointer evall(id,a1,a2)
61: lid id;
62: Obj a1,a2;
63: {
64: F f;
65: Obj d;
66: oFOP op;
67: NODE n1,n2;
68:
69: switch ( id ) {
70: case L_EQ:
71: op = AL_EQUAL; break;
72: case L_NE:
73: op = AL_NEQ; break;
74: case L_GT:
75: op = AL_GREATERP; break;
76: case L_LT:
77: op = AL_LESSP; break;
78: case L_GE:
79: op = AL_GEQ; break;
80: case L_LE:
81: op = AL_LEQ; break;
82: case L_AND:
83: op = AL_AND; break;
84: case L_OR:
85: op = AL_OR; break;
86: case L_NOT:
87: op = AL_NOT; break;
88: case L_IMPL:
89: op = AL_IMPL; break;
90: case L_REPL:
91: op = AL_REPL; break;
92: case L_EQUIV:
93: op = AL_EQUIV; break;
94: default:
95: error("evall : unknown id");
96: }
97: if ( AL_ATOMIC(op) ) {
98: arf_sub(CO,a1,a2,&d);
99: MKAF(f,op,(P)d);
100: } else if ( AL_JUNCT(op) ) {
101: if ( FOP((F)a1) == op ) {
102: if ( FOP((F)a2) == op )
103: n2 = FJARG((F)a2);
104: else
105: MKNODE(n2,(F)a2,0);
106: node_concat_dup(FJARG((F)a1),n2,&n1);
107: } else if ( FOP((F)a2) == op )
108: MKNODE(n1,a1,FJARG((F)a2));
109: else {
110: MKNODE(n2,a2,0); MKNODE(n1,a1,n2);
111: }
112: MKJF(f,op,n1);
113: } else if ( AL_UNI(op) )
114: MKUF(f,op,(F)a1);
115: else if ( AL_EXT(op) )
116: MKBF(f,op,(F)a1,(F)a2);
117: return (pointer)f;
118: }
119:
120: node_concat_dup(n1,n2,nr)
121: NODE n1,n2,*nr;
122: {
123: NODE r0,r,n;
124:
125: for ( r0 = 0, n = n1; n; n = NEXT(n) ) {
126: NEXTNODE(r0,r); BDY(r) = BDY(n);
127: }
128: if ( !r0 )
129: *nr = n2;
130: else {
131: NEXT(r) = n2; *nr = r0;
132: }
133: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>