===================================================================
RCS file: /home/cvs/OpenXM_contrib2/asir2000/builtin/print.c,v
retrieving revision 1.2
retrieving revision 1.7
diff -u -p -r1.2 -r1.7
--- OpenXM_contrib2/asir2000/builtin/print.c	2000/08/21 08:31:21	1.2
+++ OpenXM_contrib2/asir2000/builtin/print.c	2001/08/22 04:20:45	1.7
@@ -23,7 +23,7 @@
  * shall be made on your publication or presentation in any form of the
  * results obtained by use of the SOFTWARE.
  * (4) In the event that you modify the SOFTWARE, you shall notify FLL by
- * e-mail at risa-admin@flab.fujitsu.co.jp of the detailed specification
+ * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
  * for such modification or the source code of the modified part of the
  * SOFTWARE.
  * 
@@ -45,15 +45,17 @@
  * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,
  * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.
  *
- * $OpenXM: OpenXM_contrib2/asir2000/builtin/print.c,v 1.1.1.1 1999/12/03 07:39:07 noro Exp $ 
+ * $OpenXM: OpenXM_contrib2/asir2000/builtin/print.c,v 1.6 2001/08/22 00:54:29 noro Exp $ 
 */
 #include "ca.h"
 #include "parse.h"
 
 void Pprint();
+void Pquotetolist();
 
 struct ftab print_tab[] = {
 	{"print",Pprint,-2},
+	{"quotetolist",Pquotetolist,1},
 	{0,0,0},
 };
 
@@ -75,4 +77,192 @@ pointer *rp;
 	else
 		putc('\n',asir_out);
 	*rp = 0;
+}
+
+void fnodetotree();
+
+void Pquotetolist(arg,rp)
+NODE arg;
+Obj *rp;
+{
+	asir_assert(ARG0(arg),O_QUOTE,"quotetolist");	
+	fnodetotree((FNODE)BDY((QUOTE)(ARG0(arg))),rp);
+}
+
+/* fnode -> [tag,name,arg0,arg1,...] */
+
+void fnodetotree(f,rp)
+FNODE f;
+Obj *rp;
+{
+	Obj a1,a2,a3;
+	NODE n,t,t0;
+	STRING head,op,str;
+	LIST r,arg;
+	char *opname;
+
+	if ( !f ) {
+		MKSTR(head,"internal");
+		n = mknode(2,head,0);
+		MKLIST(r,n);
+		*rp = (Obj)r;
+		return;
+	}
+	switch ( f->id ) {
+		/* unary operators */
+		case I_NOT: case I_PAREN:
+			MKSTR(head,"u_op");
+			switch ( f->id ) {
+				case I_NOT:
+					MKSTR(op,"!");
+					break;
+				case I_PAREN:
+					MKSTR(op,"()");
+					break;
+			}
+			fnodetotree((FNODE)FA0(f),&a1);
+			n = mknode(3,head,op,a1);
+			MKLIST(r,n);
+			*rp = (Obj)r;
+			break;
+
+		/* binary operators */
+		case I_BOP: case I_COP: case I_LOP: case I_AND: case I_OR:
+			/* head */
+			MKSTR(head,"b_op");
+
+			/* arg list */
+			switch ( f->id ) {
+				case I_AND: case I_OR:
+					fnodetotree((FNODE)FA0(f),&a1);
+					fnodetotree((FNODE)FA1(f),&a2);
+					break;
+				default:
+					fnodetotree((FNODE)FA1(f),&a1);
+					fnodetotree((FNODE)FA2(f),&a2);
+					break;
+			}
+
+			/* op */
+			switch ( f->id ) {
+				case I_BOP:
+					MKSTR(op,((ARF)FA0(f))->name); break;
+
+				case I_COP:
+					switch( (cid)FA0(f) ) {
+						case C_EQ: opname = "=="; break;
+						case C_NE: opname = "!="; break;
+						case C_GT: opname = ">"; break;
+						case C_LT: opname = "<"; break;
+						case C_GE: opname = ">="; break;
+						case C_LE: opname = "<="; break;
+					}
+					MKSTR(op,opname); break;
+
+				case I_LOP:
+					switch( (lid)FA0(f) ) {
+						case L_EQ: opname = "@=="; break;
+						case L_NE: opname = "@!="; break;
+						case L_GT: opname = "@>"; break;
+						case L_LT: opname = "@<"; break;
+						case L_GE: opname = "@>="; break;
+						case L_LE: opname = "@<="; break;
+						case L_AND: opname = "@&&"; break;
+						case L_OR: opname = "@||"; break;
+
+						case L_NOT: opname = "@!";
+							/* XXX : L_NOT is a unary operator */
+							MKSTR(head,"u_op");
+							MKSTR(op,opname);
+							n = mknode(3,head,op,a1);
+							MKLIST(r,n);
+							*rp = (Obj)r;
+							return;
+					}
+					MKSTR(op,opname); break;
+
+				case I_AND:
+					MKSTR(op,"&&"); break;
+
+				case I_OR:
+					MKSTR(op,"||"); break;
+			}
+			n = mknode(4,head,op,a1,a2);
+			MKLIST(r,n);
+			*rp = (Obj)r;
+			break;
+
+		/* ternary operators */
+		case I_CE:
+			MKSTR(head,"t_op");
+			MKSTR(op,"?:");
+			fnodetotree((FNODE)FA0(f),&a1);
+			fnodetotree((FNODE)FA1(f),&a2);
+			fnodetotree((FNODE)FA2(f),&a3);
+			n = mknode(5,head,op,a1,a2,a3);
+			MKLIST(r,n);
+			*rp = (Obj)r;
+			break;
+
+		/* lists */
+		case I_EV: case I_LIST:
+			n = (NODE)FA0(f);
+			for ( t0 = 0; n; n = NEXT(n) ) {
+				NEXTNODE(t0,t);
+				fnodetotree(BDY(n),&BDY(t));
+			}
+			if ( t0 )
+				NEXT(t) = 0;
+			switch ( f->id ) {
+				case I_LIST:
+					MKSTR(head,"list"); break;
+				case I_EV:
+					MKSTR(head,"exponent_vector"); break;
+			}
+			MKNODE(n,head,t0);
+			MKLIST(r,n);
+			*rp = (Obj)r;
+			break;
+
+		/* function */
+		case I_FUNC: case I_CAR: case I_CDR:
+			MKSTR(head,"function");
+			switch ( f->id ) {
+				case I_FUNC:
+					MKSTR(op,((FUNC)FA0(f))->name);
+					fnodetotree((FNODE)FA1(f),&arg);
+					break;
+				case I_CAR:
+					MKSTR(op,"car");
+					fnodetotree((FNODE)FA0(f),&arg);
+					break;
+				case I_CDR:
+					MKSTR(op,"cdr");
+					fnodetotree((FNODE)FA0(f),&arg);
+					break;
+			}
+			t0 = NEXT(BDY(arg)); /* XXX : skip the headers */
+			MKNODE(t,op,t0);
+			MKNODE(n,head,t);
+			MKLIST(r,n);
+			*rp = (Obj)r;
+			break;
+
+		case I_STR:
+			MKSTR(head,"internal");
+			MKSTR(str,FA0(f));
+			n = mknode(2,head,str);
+			MKLIST(r,n);
+			*rp = (Obj)r;
+			break;
+
+		case I_FORMULA:
+			MKSTR(head,"internal");
+			n = mknode(2,head,FA0(f));
+			MKLIST(r,n);
+			*rp = (Obj)r;
+			break;
+		default:
+			error("fnodetotree : not implemented yet");
+	}
 }