| version 1.18, 2005/04/28 08:14:46 |
version 1.19, 2005/09/28 08:08:34 |
|
|
| * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
| * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
| * |
* |
| * $OpenXM: OpenXM_contrib2/asir2000/builtin/print.c,v 1.17 2004/05/14 09:20:56 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/print.c,v 1.18 2005/04/28 08:14:46 noro Exp $ |
| */ |
*/ |
| #include "ca.h" |
#include "ca.h" |
| #include "parse.h" |
#include "parse.h" |
| Line 211 void fnodetotree(FNODE f,LIST *rp) |
|
| Line 211 void fnodetotree(FNODE f,LIST *rp) |
|
| MKSTR(op,"||"); break; |
MKSTR(op,"||"); break; |
| } |
} |
| n = mknode(4,head,op,a1,a2); |
n = mknode(4,head,op,a1,a2); |
| |
MKLIST(*rp,n); |
| |
break; |
| |
|
| |
case I_NARYOP: |
| |
/* head */ |
| |
MKSTR(head,"n_op"); |
| |
n = (NODE)FA1(f); |
| |
for ( t0 = 0; n; n = NEXT(n) ) { |
| |
NEXTNODE(t0,t); |
| |
fnodetotree((FNODE)BDY(n),&a1); |
| |
BDY(t) = (pointer)a1; |
| |
} |
| |
MKSTR(op,((ARF)FA0(f))->name); |
| |
MKNODE(t,op,t0); |
| |
MKNODE(n,head,t); |
| MKLIST(*rp,n); |
MKLIST(*rp,n); |
| break; |
break; |
| |
|