version 1.53, 2005/07/14 04:07:31 |
version 1.58, 2005/09/18 08:14:22 |
|
|
* 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/strobj.c,v 1.52 2005/04/05 02:29:44 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/strobj.c,v 1.57 2005/09/13 06:54:22 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "parse.h" |
#include "parse.h" |
Line 79 void Pquotetotex_env(); |
|
Line 79 void Pquotetotex_env(); |
|
void Pflatten_quote(); |
void Pflatten_quote(); |
void Pquote_to_funargs(),Pfunargs_to_quote(),Pget_function_name(); |
void Pquote_to_funargs(),Pfunargs_to_quote(),Pget_function_name(); |
void Pquote_unify(); |
void Pquote_unify(); |
|
void do_assign(NODE arg); |
void fnodetotex_tb(FNODE f,TB tb); |
void fnodetotex_tb(FNODE f,TB tb); |
char *symbol_name(char *name); |
char *symbol_name(char *name); |
char *conv_rule(char *name); |
char *conv_rule(char *name); |
Line 88 void tb_to_string(TB tb,STRING *rp); |
|
Line 89 void tb_to_string(TB tb,STRING *rp); |
|
void fnodenodetotex_tb(NODE n,TB tb); |
void fnodenodetotex_tb(NODE n,TB tb); |
void fargstotex_tb(char *opname,FNODE f,TB tb); |
void fargstotex_tb(char *opname,FNODE f,TB tb); |
int top_is_minus(FNODE f); |
int top_is_minus(FNODE f); |
NODE quote_unify(Obj f,Obj pat); |
int quote_unify(Obj f,Obj pat,NODE *rp); |
|
|
struct ftab str_tab[] = { |
struct ftab str_tab[] = { |
{"sprintf",Psprintf,-99999999}, |
{"sprintf",Psprintf,-99999999}, |
Line 507 void Pwrite_to_tb(NODE arg,Q *rp) |
|
Line 508 void Pwrite_to_tb(NODE arg,Q *rp) |
|
*rp = 0; |
*rp = 0; |
} |
} |
|
|
void Pquote_unify(NODE arg,LIST *rp) |
void Pquote_unify(NODE arg,Q *rp) |
{ |
{ |
NODE r; |
NODE r; |
|
int ret; |
|
|
r = quote_unify((Obj)ARG0(arg),(Obj)ARG1(arg)); |
ret = quote_unify((Obj)ARG0(arg),(Obj)ARG1(arg),&r); |
MKLIST(*rp,r); |
if ( ret ) { |
|
do_assign(r); |
|
*rp = ONE; |
|
} else |
|
*rp = 0; |
} |
} |
|
|
|
void do_assign(NODE arg) |
|
{ |
|
NODE t,pair; |
|
int pv; |
|
|
|
QUOTE value; |
|
|
|
for ( t = arg; t; t = NEXT(t) ) { |
|
pair = BDY((LIST)BDY(t)); |
|
pv = (int)FA0((FNODE)BDY((QUOTE)BDY(pair))); |
|
value = (QUOTE)(BDY(NEXT(pair))); |
|
ASSPV(pv,value); |
|
} |
|
} |
|
|
/* |
/* |
/* consistency check and merge */ |
/* consistency check and merge |
|
*/ |
|
|
NODE merge_matching_node(NODE n,NODE a) |
int merge_matching_node(NODE n,NODE a,NODE *rp) |
{ |
{ |
NODE ta,ba,tn,bn; |
NODE ta,ba,tn,bn; |
QUOTE pa,va,pn,vn; |
QUOTE pa,va,pn,vn; |
|
|
if ( !n ) |
if ( !n ) { |
return a; |
*rp = a; |
|
return 1; |
|
} |
for ( ta = a; ta; ta = NEXT(ta) ) { |
for ( ta = a; ta; ta = NEXT(ta) ) { |
ba = BDY((LIST)BDY(ta)); |
ba = BDY((LIST)BDY(ta)); |
|
if ( !ba ) continue; |
pa = (QUOTE)BDY(ba); va = (QUOTE)BDY(NEXT(ba)); |
pa = (QUOTE)BDY(ba); va = (QUOTE)BDY(NEXT(ba)); |
for ( tn = n; tn; tn = NEXT(tn) ) { |
for ( tn = n; tn; tn = NEXT(tn) ) { |
bn = BDY((LIST)BDY(tn)); |
bn = BDY((LIST)BDY(tn)); |
|
if ( !bn ) continue; |
pn = (QUOTE)BDY(bn); vn = (QUOTE)BDY(NEXT(bn)); |
pn = (QUOTE)BDY(bn); vn = (QUOTE)BDY(NEXT(bn)); |
if ( !compquote(CO,pa,pn) && !compquote(CO,va,vn) ) |
if ( !compquote(CO,pa,pn) ) { |
break; |
if ( !compquote(CO,va,vn) ) break; |
|
else return 0; |
|
} |
} |
} |
if ( !tn ) { |
if ( !tn ) { |
MKNODE(tn,(pointer)BDY(ta),n); |
MKNODE(tn,(pointer)BDY(ta),n); |
n = tn; |
n = tn; |
} |
} |
} |
} |
return n; |
*rp = n; |
|
return 1; |
} |
} |
|
|
NODE quote_unify_node(NODE f,NODE pat) { |
int quote_unify_node(NODE f,NODE pat,NODE *rp) { |
NODE r,a,tf,tp; |
NODE r,a,tf,tp,r1; |
|
int ret; |
|
|
if ( length(f) != length(pat) ) return 0; |
if ( length(f) != length(pat) ) return 0; |
r = 0; |
r = 0; |
for ( tf = f, tp = pat; tf; tf = NEXT(tf), tp = NEXT(tp) ) { |
for ( tf = f, tp = pat; tf; tf = NEXT(tf), tp = NEXT(tp) ) { |
a = quote_unify((Obj)BDY(tf),(Obj)BDY(tp)); |
ret = quote_unify((Obj)BDY(tf),(Obj)BDY(tp),&a); |
r = merge_matching_node(r,a); |
if ( !ret ) return 0; |
if ( !r ) return 0; |
ret = merge_matching_node(r,a,&r1); |
|
if ( !ret ) return 0; |
|
else r = r1; |
} |
} |
return r; |
*rp = r; |
|
return 1; |
} |
} |
|
|
void get_quote_id_arg(QUOTE f,int *id,NODE *r) |
void get_quote_id_arg(QUOTE f,int *id,NODE *r) |
Line 564 void get_quote_id_arg(QUOTE f,int *id,NODE *r) |
|
Line 597 void get_quote_id_arg(QUOTE f,int *id,NODE *r) |
|
*id = QTOS((Q)BDY(fab)); *r = NEXT(fab); |
*id = QTOS((Q)BDY(fab)); *r = NEXT(fab); |
} |
} |
|
|
/* ret : [[quote(A),quote(1)],...] */ |
/* *rp : [[quote(A),quote(1)],...] */ |
|
|
NODE quote_unify(Obj f, Obj pat) |
int quote_unify(Obj f, Obj pat, NODE *rp) |
{ |
{ |
NODE tf,tp,head,body; |
NODE tf,tp,head,body; |
NODE parg,farg,r; |
NODE parg,farg,r; |
LIST fa,l; |
LIST fa,l; |
int pid,id; |
int pid,id; |
|
FUNC ff,pf; |
|
int ret; |
|
|
if ( OID(pat) == O_LIST ) { |
if ( OID(pat) == O_LIST ) { |
if ( OID(f) == O_LIST ) |
if ( OID(f) == O_LIST ) |
return quote_unify_node(BDY((LIST)f),BDY((LIST)pat)); |
return quote_unify_node(BDY((LIST)f),BDY((LIST)pat),rp); |
else |
else |
return 0; |
return 0; |
} else if ( OID(pat) == O_QUOTE ) { |
} else if ( OID(pat) == O_QUOTE ) { |
Line 583 NODE quote_unify(Obj f, Obj pat) |
|
Line 618 NODE quote_unify(Obj f, Obj pat) |
|
get_quote_id_arg((QUOTE)pat,&pid,&parg); |
get_quote_id_arg((QUOTE)pat,&pid,&parg); |
get_quote_id_arg((QUOTE)f,&id,&farg); |
get_quote_id_arg((QUOTE)f,&id,&farg); |
switch ( pid ) { |
switch ( pid ) { |
|
case I_FORMULA: |
|
if ( compquote(CO,f,pat) ) |
|
return 0; |
|
else { |
|
*rp = 0; |
|
return 1; |
|
} |
|
break; |
|
case I_LIST: |
|
return quote_unify_node(BDY((LIST)BDY(farg)), |
|
BDY((LIST)BDY(parg)),rp); |
case I_PVAR: |
case I_PVAR: |
/* [[pat,f]] */ |
/* [[pat,f]] */ |
r = mknode(2,pat,f); MKLIST(l,r); |
r = mknode(2,pat,f); MKLIST(l,r); |
return mknode(1,l); |
*rp = mknode(1,l); |
|
return 1; |
case I_IFUNC: |
case I_IFUNC: |
/* F(X,Y,...) = ... */ |
/* F(X,Y,...) = ... */ |
if ( id == I_FUNC ) { |
if ( id == I_FUNC ) { |
head = quote_unify(BDY(farg),BDY(parg)); |
r = mknode(2,BDY(parg),BDY(farg)); MKLIST(l,r); |
if ( !head ) return 0; |
head = mknode(1,l); |
body = quote_unify(BDY(NEXT(farg)),BDY(NEXT(parg))); |
ret = quote_unify(BDY(NEXT(farg)), |
if ( !body ) return 0; |
BDY(NEXT(parg)),&body); |
return merge_matching_node(head,body); |
if ( !ret ) return 0; |
|
else return merge_matching_node(head,body,rp); |
} else |
} else |
return 0; |
return 0; |
case I_BOP: |
case I_BOP: |
|
case I_FUNC: |
/* X+Y = ... */ |
/* X+Y = ... */ |
|
/* f(...) = ... */ |
if ( compqa(CO,BDY(farg),BDY(parg)) ) return 0; |
if ( compqa(CO,BDY(farg),BDY(parg)) ) return 0; |
return quote_unify_node(NEXT(farg),NEXT(parg)); |
return quote_unify_node(NEXT(farg),NEXT(parg),rp); |
|
break; |
default: |
default: |
if ( pid == id ) |
if ( pid == id ) |
return quote_unify_node(farg,parg); |
return quote_unify_node(farg,parg,rp); |
else |
else |
return 0; |
return 0; |
} |
} |