307 |
printf("#<function %p>", (funcp)(stack_head->item->content.ptr)); |
printf("#<function %p>", (funcp)(stack_head->item->content.ptr)); |
308 |
break; |
break; |
309 |
case list: |
case list: |
310 |
printf("#<list %p>", (funcp)(stack_head->item->content.ptr)); |
/* A list is just a stack, so make stack_head point to it */ |
311 |
|
stack_head=(stackitem *)(stack_head->item->content.ptr); |
312 |
|
printf("[ "); |
313 |
|
while(stack_head != NULL) { |
314 |
|
print_h(stack_head); |
315 |
|
printf(" "); |
316 |
|
stack_head=stack_head->next; |
317 |
|
} |
318 |
|
printf("]"); |
319 |
break; |
break; |
320 |
default: |
default: |
321 |
printf("#<unknown %p>", (funcp)(stack_head->item->content.ptr)); |
printf("#<unknown %p>", (stack_head->item->content.ptr)); |
322 |
break; |
break; |
323 |
} |
} |
324 |
} |
} |
603 |
|
|
604 |
} |
} |
605 |
|
|
606 |
|
/* Reverse a list */ |
607 |
|
extern void rev(environment *env){ |
608 |
|
stackitem *old_head, *new_head, *item; |
609 |
|
|
610 |
|
if((env->head)==NULL) { |
611 |
|
printerr("Too Few Arguments"); |
612 |
|
env->err=1; |
613 |
|
return; |
614 |
|
} |
615 |
|
|
616 |
|
if(env->head->item->type!=list) { |
617 |
|
printerr("Bad Argument Type"); |
618 |
|
env->err=2; |
619 |
|
return; |
620 |
|
} |
621 |
|
|
622 |
|
old_head=(stackitem *)(env->head->item->content.ptr); |
623 |
|
new_head=NULL; |
624 |
|
while(old_head != NULL){ |
625 |
|
item=old_head; |
626 |
|
old_head=old_head->next; |
627 |
|
item->next=new_head; |
628 |
|
new_head=item; |
629 |
|
} |
630 |
|
env->head->item->content.ptr=new_head; |
631 |
|
} |
632 |
|
|
633 |
/* Compares two elements by reference. */ |
/* Compares two elements by reference. */ |
634 |
extern void eq(environment *env) |
extern void eq(environment *env) |
635 |
{ |
{ |