21 |
Teddy Hogeborn <teddy@fukt.bth.se> |
Teddy Hogeborn <teddy@fukt.bth.se> |
22 |
*/ |
*/ |
23 |
|
|
24 |
#define CAR(X) (X->content.c->car) |
#define CAR(X) ((X)->content.c->car) |
25 |
#define CDR(X) (X->content.c->cdr) |
#define CDR(X) ((X)->content.c->cdr) |
26 |
|
|
27 |
/* printf, sscanf, fgets, fprintf, fopen, perror */ |
/* printf, sscanf, fgets, fprintf, fopen, perror */ |
28 |
#include <stdio.h> |
#include <stdio.h> |
62 |
env->gc_ref= NULL; |
env->gc_ref= NULL; |
63 |
|
|
64 |
env->head= new_val(env); |
env->head= new_val(env); |
|
env->head->type= empty; |
|
65 |
for(i= 0; i<HASHTBLSIZE; i++) |
for(i= 0; i<HASHTBLSIZE; i++) |
66 |
env->symbols[i]= NULL; |
env->symbols[i]= NULL; |
67 |
env->err= 0; |
env->err= 0; |
123 |
value *nval= malloc(sizeof(value)); |
value *nval= malloc(sizeof(value)); |
124 |
stackitem *nitem= malloc(sizeof(stackitem)); |
stackitem *nitem= malloc(sizeof(stackitem)); |
125 |
|
|
126 |
|
assert(nval != NULL); |
127 |
|
assert(nitem != NULL); |
128 |
|
|
129 |
nval->content.ptr= NULL; |
nval->content.ptr= NULL; |
130 |
nval->type= integer; |
nval->type= empty; |
131 |
|
|
132 |
nitem->item= nval; |
nitem->item= nval; |
133 |
nitem->next= env->gc_ref; |
nitem->next= env->gc_ref; |
338 |
int length= strlen(in_string)+1; |
int length= strlen(in_string)+1; |
339 |
|
|
340 |
new_value->content.ptr= malloc(length); |
new_value->content.ptr= malloc(length); |
341 |
|
assert(new_value != NULL); |
342 |
env->gc_count += length; |
env->gc_count += length; |
343 |
strcpy(new_value->content.ptr, in_string); |
strcpy(new_value->content.ptr, in_string); |
344 |
new_value->type= string; |
new_value->type= string; |
353 |
char *new_string, *current; |
char *new_string, *current; |
354 |
|
|
355 |
new_string= malloc((strlen(old_string)*2)+4); |
new_string= malloc((strlen(old_string)*2)+4); |
356 |
|
assert(new_string != NULL); |
357 |
strcpy(new_string, "sx_"); /* Stack eXternal */ |
strcpy(new_string, "sx_"); /* Stack eXternal */ |
358 |
current= new_string+3; |
current= new_string+3; |
359 |
while(old_string[0] != '\0'){ |
while(old_string[0] != '\0'){ |
423 |
|
|
424 |
/* Create a new symbol */ |
/* Create a new symbol */ |
425 |
(*new_symbol)= malloc(sizeof(symbol)); |
(*new_symbol)= malloc(sizeof(symbol)); |
426 |
|
assert((*new_symbol) != NULL); |
427 |
(*new_symbol)->val= NULL; /* undefined value */ |
(*new_symbol)->val= NULL; /* undefined value */ |
428 |
(*new_symbol)->next= NULL; |
(*new_symbol)->next= NULL; |
429 |
(*new_symbol)->id= malloc(strlen(in_string)+1); |
(*new_symbol)->id= malloc(strlen(in_string)+1); |
430 |
|
assert((*new_symbol)->id != NULL); |
431 |
strcpy((*new_symbol)->id, in_string); |
strcpy((*new_symbol)->id, in_string); |
432 |
|
|
433 |
/* Intern the new symbol in the hash table */ |
/* Intern the new symbol in the hash table */ |
505 |
} |
} |
506 |
|
|
507 |
/* Print a value */ |
/* Print a value */ |
508 |
void print_val(value *val, int noquote) |
void print_val(value *val, int noquote, stackitem *stack) |
509 |
{ |
{ |
510 |
|
stackitem *titem, *tstack; |
511 |
|
int depth; |
512 |
|
|
513 |
switch(val->type) { |
switch(val->type) { |
514 |
case empty: |
case empty: |
515 |
printf("[]"); |
printf("[]"); |
534 |
break; |
break; |
535 |
case tcons: |
case tcons: |
536 |
printf("[ "); |
printf("[ "); |
537 |
|
tstack= stack; |
538 |
do { |
do { |
539 |
print_val(CAR(val), noquote); |
titem=malloc(sizeof(stackitem)); |
540 |
|
assert(titem != NULL); |
541 |
|
titem->item=val; |
542 |
|
titem->next=tstack; |
543 |
|
tstack=titem; /* Put it on the stack */ |
544 |
|
/* Search a stack of values being printed to see if we are already |
545 |
|
printing this value */ |
546 |
|
titem=tstack; |
547 |
|
depth=0; |
548 |
|
while(titem != NULL && titem->item != CAR(val)){ |
549 |
|
titem=titem->next; |
550 |
|
depth++; |
551 |
|
} |
552 |
|
if(titem != NULL){ /* If we found it on the stack, */ |
553 |
|
printf("#%d#", depth); /* print a depth reference */ |
554 |
|
} else { |
555 |
|
print_val(CAR(val), noquote, tstack); |
556 |
|
} |
557 |
val= CDR(val); |
val= CDR(val); |
558 |
switch(val->type){ |
switch(val->type){ |
559 |
case empty: |
case empty: |
560 |
break; |
break; |
561 |
case tcons: |
case tcons: |
562 |
printf(" "); |
/* Search a stack of values being printed to see if we are already |
563 |
|
printing this value */ |
564 |
|
titem=tstack; |
565 |
|
depth=0; |
566 |
|
while(titem != NULL && titem->item != val){ |
567 |
|
titem=titem->next; |
568 |
|
depth++; |
569 |
|
} |
570 |
|
if(titem != NULL){ /* If we found it on the stack, */ |
571 |
|
printf(" . #%d#", depth); /* print a depth reference */ |
572 |
|
} else { |
573 |
|
printf(" "); |
574 |
|
} |
575 |
break; |
break; |
576 |
default: |
default: |
577 |
printf(" . "); /* Improper list */ |
printf(" . "); /* Improper list */ |
578 |
print_val(val, noquote); |
print_val(val, noquote, tstack); |
579 |
} |
} |
580 |
} while(val->type == tcons); |
} while(val->type == tcons && titem == NULL); |
581 |
|
titem=tstack; |
582 |
|
while(titem != stack){ |
583 |
|
tstack=titem->next; |
584 |
|
free(titem); |
585 |
|
titem=tstack; |
586 |
|
} |
587 |
printf(" ]"); |
printf(" ]"); |
588 |
break; |
break; |
589 |
} |
} |
596 |
env->err= 1; |
env->err= 1; |
597 |
return; |
return; |
598 |
} |
} |
599 |
print_val(CAR(env->head), 0); |
print_val(CAR(env->head), 0, NULL); |
600 |
nl(); |
nl(); |
601 |
} |
} |
602 |
|
|
615 |
env->err= 1; |
env->err= 1; |
616 |
return; |
return; |
617 |
} |
} |
618 |
print_val(CAR(env->head), 1); |
print_val(CAR(env->head), 1, NULL); |
619 |
} |
} |
620 |
|
|
621 |
/* Prints the top element of the stack and then discards it. */ |
/* Prints the top element of the stack and then discards it. */ |
632 |
if(CDR(stack_head)->type != empty) |
if(CDR(stack_head)->type != empty) |
633 |
print_st(CDR(stack_head), counter+1); |
print_st(CDR(stack_head), counter+1); |
634 |
printf("%ld: ", counter); |
printf("%ld: ", counter); |
635 |
print_val(CAR(stack_head), 0); |
print_val(CAR(stack_head), 0, NULL); |
636 |
nl(); |
nl(); |
637 |
} |
} |
638 |
|
|
809 |
|
|
810 |
old_head= CAR(env->head); |
old_head= CAR(env->head); |
811 |
new_head= new_val(env); |
new_head= new_val(env); |
|
new_head->type= empty; |
|
812 |
while(old_head->type != empty) { |
while(old_head->type != empty) { |
813 |
item= old_head; |
item= old_head; |
814 |
old_head= CDR(old_head); |
old_head= CDR(old_head); |
824 |
value *iterator, *temp, *ending; |
value *iterator, *temp, *ending; |
825 |
|
|
826 |
ending=new_val(env); |
ending=new_val(env); |
|
ending->type=empty; |
|
827 |
|
|
828 |
iterator= env->head; |
iterator= env->head; |
829 |
if(iterator->type == empty |
if(iterator->type == empty |
1169 |
toss(env); if(env->err) return; |
toss(env); if(env->err) return; |
1170 |
len= strlen(a_val->content.ptr)+strlen(b_val->content.ptr)+1; |
len= strlen(a_val->content.ptr)+strlen(b_val->content.ptr)+1; |
1171 |
new_string= malloc(len); |
new_string= malloc(len); |
1172 |
|
assert(new_string != NULL); |
1173 |
strcpy(new_string, b_val->content.ptr); |
strcpy(new_string, b_val->content.ptr); |
1174 |
strcat(new_string, a_val->content.ptr); |
strcat(new_string, a_val->content.ptr); |
1175 |
push_cstring(env, new_string); |
push_cstring(env, new_string); |
1651 |
|
|
1652 |
iterator= foo; |
iterator= foo; |
1653 |
|
|
1654 |
while(iterator!=NULL) { |
while(iterator->type!=empty) { |
1655 |
push_val(env, CAR(iterator)); |
push_val(env, CAR(iterator)); |
1656 |
push_val(env, loop); |
push_val(env, loop); |
1657 |
eval(env); if(env->err) return; |
eval(env); if(env->err) return; |
1670 |
extern void to(environment *env) |
extern void to(environment *env) |
1671 |
{ |
{ |
1672 |
int ending, start, i; |
int ending, start, i; |
1673 |
value *iterator, *temp; |
value *iterator, *temp, *end; |
1674 |
|
|
1675 |
|
end= new_val(env); |
1676 |
|
|
1677 |
if(env->head->type==empty || CDR(env->head)->type==empty) { |
if(env->head->type==empty || CDR(env->head)->type==empty) { |
1678 |
printerr("Too Few Arguments"); |
printerr("Too Few Arguments"); |
1707 |
if(iterator->type==empty |
if(iterator->type==empty |
1708 |
|| (CAR(iterator)->type==symb |
|| (CAR(iterator)->type==symb |
1709 |
&& CAR(iterator)->content.sym->id[0]=='[')) { |
&& CAR(iterator)->content.sym->id[0]=='[')) { |
1710 |
temp= NULL; |
temp= end; |
1711 |
toss(env); |
toss(env); |
1712 |
} else { |
} else { |
1713 |
/* Search for first delimiter */ |
/* Search for first delimiter */ |
1714 |
while(CDR(iterator)!=NULL |
while(CDR(iterator)->type!=empty |
1715 |
&& (CAR(CDR(iterator))->type!=symb |
&& (CAR(CDR(iterator))->type!=symb |
1716 |
|| CAR(CDR(iterator))->content.sym->id[0]!='[')) |
|| CAR(CDR(iterator))->content.sym->id[0]!='[')) |
1717 |
iterator= CDR(iterator); |
iterator= CDR(iterator); |
1719 |
/* Extract list */ |
/* Extract list */ |
1720 |
temp= env->head; |
temp= env->head; |
1721 |
env->head= CDR(iterator); |
env->head= CDR(iterator); |
1722 |
CDR(iterator)= NULL; |
CDR(iterator)= end; |
1723 |
|
|
1724 |
if(env->head!=NULL) |
if(env->head->type!=empty) |
1725 |
toss(env); |
toss(env); |
1726 |
} |
} |
1727 |
|
|
1771 |
} |
} |
1772 |
|
|
1773 |
env->in_string= malloc(strlen(CAR(env->head)->content.ptr)+1); |
env->in_string= malloc(strlen(CAR(env->head)->content.ptr)+1); |
1774 |
|
assert(env->in_string != NULL); |
1775 |
env->free_string= env->in_string; /* Save the original pointer */ |
env->free_string= env->in_string; /* Save the original pointer */ |
1776 |
strcpy(env->in_string, CAR(env->head)->content.ptr); |
strcpy(env->in_string, CAR(env->head)->content.ptr); |
1777 |
toss(env); if(env->err) return; |
toss(env); if(env->err) return; |
1779 |
|
|
1780 |
inlength= strlen(env->in_string)+1; |
inlength= strlen(env->in_string)+1; |
1781 |
match= malloc(inlength); |
match= malloc(inlength); |
1782 |
|
assert(match != NULL); |
1783 |
|
|
1784 |
if(sscanf(env->in_string, blankform, &readlength) != EOF |
if(sscanf(env->in_string, blankform, &readlength) != EOF |
1785 |
&& readlength != -1) { |
&& readlength != -1) { |
2448 |
swap(env); if(env->err) return; |
swap(env); if(env->err) return; |
2449 |
toss(env); if(env->err) return; |
toss(env); if(env->err) return; |
2450 |
} |
} |
2451 |
|
|
2452 |
|
/* 2: 3 => */ |
2453 |
|
/* 1: [ [ 1 . 2 ] [ 3 . 4 ] ] => 1: [ 3 . 4 ] */ |
2454 |
|
extern void assq(environment *env) |
2455 |
|
{ |
2456 |
|
assocgen(env, eq); |
2457 |
|
} |
2458 |
|
|
2459 |
|
|
2460 |
|
/* General assoc function */ |
2461 |
|
void assocgen(environment *env, funcp eqfunc) |
2462 |
|
{ |
2463 |
|
value *key, *item; |
2464 |
|
|
2465 |
|
/* Needs two values on the stack, the top one must be an association |
2466 |
|
list */ |
2467 |
|
if(env->head->type==empty || CDR(env->head)->type==empty) { |
2468 |
|
printerr("Too Few Arguments"); |
2469 |
|
env->err= 1; |
2470 |
|
return; |
2471 |
|
} |
2472 |
|
|
2473 |
|
if(CAR(env->head)->type!=tcons) { |
2474 |
|
printerr("Bad Argument Type"); |
2475 |
|
env->err= 2; |
2476 |
|
return; |
2477 |
|
} |
2478 |
|
|
2479 |
|
key=CAR(CDR(env->head)); |
2480 |
|
item=CAR(env->head); |
2481 |
|
|
2482 |
|
while(item->type == tcons){ |
2483 |
|
if(CAR(item)->type != tcons){ |
2484 |
|
printerr("Bad Argument Type"); |
2485 |
|
env->err= 2; |
2486 |
|
return; |
2487 |
|
} |
2488 |
|
push_val(env, key); |
2489 |
|
push_val(env, CAR(CAR(item))); |
2490 |
|
eqfunc(env); if(env->err) return; |
2491 |
|
|
2492 |
|
/* Check the result of 'eqfunc' */ |
2493 |
|
if(env->head->type==empty) { |
2494 |
|
printerr("Too Few Arguments"); |
2495 |
|
env->err= 1; |
2496 |
|
return; |
2497 |
|
} |
2498 |
|
if(CAR(env->head)->type!=integer) { |
2499 |
|
printerr("Bad Argument Type"); |
2500 |
|
env->err= 2; |
2501 |
|
return; |
2502 |
|
} |
2503 |
|
|
2504 |
|
if(CAR(env->head)->content.i){ |
2505 |
|
toss(env); if(env->err) return; |
2506 |
|
break; |
2507 |
|
} |
2508 |
|
toss(env); if(env->err) return; |
2509 |
|
|
2510 |
|
if(item->type!=tcons) { |
2511 |
|
printerr("Bad Argument Type"); |
2512 |
|
env->err= 2; |
2513 |
|
return; |
2514 |
|
} |
2515 |
|
|
2516 |
|
item=CDR(item); |
2517 |
|
} |
2518 |
|
|
2519 |
|
if(item->type == tcons){ /* A match was found */ |
2520 |
|
push_val(env, CAR(item)); |
2521 |
|
} else { |
2522 |
|
push_int(env, 0); |
2523 |
|
} |
2524 |
|
swap(env); if(env->err) return; |
2525 |
|
toss(env); if(env->err) return; |
2526 |
|
swap(env); if(env->err) return; |
2527 |
|
toss(env); |
2528 |
|
} |