1 |
|
/* -*- coding: utf-8; -*- */ |
2 |
/* |
/* |
3 |
stack - an interactive interpreter for a stack-based language |
stack - an interactive interpreter for a stack-based language |
4 |
Copyright (C) 2002 Mats Alritzson and Teddy Hogeborn |
Copyright (C) 2002 Mats Alritzson and Teddy Hogeborn |
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; |
168 |
extern void gc_init(environment *env) |
extern void gc_init(environment *env) |
169 |
{ |
{ |
170 |
stackitem *new_head= NULL, *titem; |
stackitem *new_head= NULL, *titem; |
|
cons *iterator; |
|
171 |
symbol *tsymb; |
symbol *tsymb; |
172 |
int i; |
int i; |
173 |
|
|
197 |
|
|
198 |
if(!(env->gc_ref->item->gc.no_gc)){ /* neither mark nor protect */ |
if(!(env->gc_ref->item->gc.no_gc)){ /* neither mark nor protect */ |
199 |
|
|
200 |
if(env->gc_ref->item->type==string) /* Remove content */ |
/* Remove content */ |
201 |
|
switch(env->gc_ref->item->type){ |
202 |
|
case string: |
203 |
free(env->gc_ref->item->content.ptr); |
free(env->gc_ref->item->content.ptr); |
204 |
|
break; |
205 |
|
case tcons: |
206 |
|
free(env->gc_ref->item->content.c); |
207 |
|
break; |
208 |
|
case empty: |
209 |
|
case integer: |
210 |
|
case tfloat: |
211 |
|
case func: |
212 |
|
case symb: |
213 |
|
/* Symbol strings are freed when walking the hash table */ |
214 |
|
} |
215 |
|
|
216 |
free(env->gc_ref->item); /* Remove from gc_ref */ |
free(env->gc_ref->item); /* Remove from gc_ref */ |
217 |
titem= env->gc_ref->next; |
titem= env->gc_ref->next; |
248 |
/* Keep values */ |
/* Keep values */ |
249 |
env->gc_count += sizeof(value); |
env->gc_count += sizeof(value); |
250 |
if(env->gc_ref->item->type==string) |
if(env->gc_ref->item->type==string) |
251 |
env->gc_count += strlen(env->gc_ref->item->content.ptr); |
env->gc_count += strlen(env->gc_ref->item->content.ptr)+1; |
252 |
|
|
253 |
titem= env->gc_ref->next; |
titem= env->gc_ref->next; |
254 |
env->gc_ref->next= new_head; |
env->gc_ref->next= new_head; |
300 |
{ |
{ |
301 |
value *new_value= new_val(env); |
value *new_value= new_val(env); |
302 |
|
|
303 |
new_value->content.c= malloc(sizeof(cons)); |
new_value->content.c= malloc(sizeof(pair)); |
304 |
assert(new_value->content.c!=NULL); |
assert(new_value->content.c!=NULL); |
305 |
|
env->gc_count += sizeof(pair); |
306 |
new_value->type= tcons; |
new_value->type= tcons; |
307 |
CAR(new_value)= val; |
CAR(new_value)= val; |
308 |
CDR(new_value)= env->head; |
CDR(new_value)= env->head; |
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 */ |
504 |
toss(env); |
toss(env); |
505 |
} |
} |
506 |
|
|
507 |
/* Prints the top element of the stack. */ |
/* 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 |
switch(CDR(val)->type){ |
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); |
558 |
|
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(CDR(val), noquote); |
print_val(val, noquote, tstack); |
579 |
} |
} |
580 |
val= CDR(val); |
} while(val->type == tcons && titem == NULL); |
581 |
} while(val->type == tcons); |
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 |
|
|
779 |
unprotect(temp_val); |
unprotect(temp_val); |
780 |
return; |
return; |
781 |
|
|
782 |
default: |
case empty: |
783 |
|
case integer: |
784 |
|
case tfloat: |
785 |
|
case string: |
786 |
return; |
return; |
787 |
} |
} |
788 |
} |
} |
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); |
1385 |
case integer: |
case integer: |
1386 |
case func: |
case func: |
1387 |
case symb: |
case symb: |
1388 |
|
case empty: |
1389 |
new_value->content= old_value->content; |
new_value->content= old_value->content; |
1390 |
break; |
break; |
1391 |
case string: |
case string: |
1394 |
break; |
break; |
1395 |
case tcons: |
case tcons: |
1396 |
|
|
1397 |
new_value->content.c= malloc(sizeof(cons)); |
new_value->content.c= malloc(sizeof(pair)); |
1398 |
assert(new_value->content.c!=NULL); |
assert(new_value->content.c!=NULL); |
1399 |
|
env->gc_count += sizeof(pair); |
1400 |
|
|
1401 |
CAR(new_value)= copy_val(env, CAR(old_value)); /* recurse */ |
CAR(new_value)= copy_val(env, CAR(old_value)); /* recurse */ |
1402 |
CDR(new_value)= copy_val(env, CDR(old_value)); /* recurse */ |
CDR(new_value)= copy_val(env, CDR(old_value)); /* recurse */ |
1754 |
int count= -1; |
int count= -1; |
1755 |
float ftemp; |
float ftemp; |
1756 |
static int depth= 0; |
static int depth= 0; |
1757 |
char *match, *ctemp; |
char *match; |
1758 |
size_t inlength; |
size_t inlength; |
1759 |
|
|
1760 |
if(env->in_string==NULL) { |
if(env->in_string==NULL) { |
1769 |
} |
} |
1770 |
|
|
1771 |
env->in_string= malloc(strlen(CAR(env->head)->content.ptr)+1); |
env->in_string= malloc(strlen(CAR(env->head)->content.ptr)+1); |
1772 |
|
assert(env->in_string != NULL); |
1773 |
env->free_string= env->in_string; /* Save the original pointer */ |
env->free_string= env->in_string; /* Save the original pointer */ |
1774 |
strcpy(env->in_string, CAR(env->head)->content.ptr); |
strcpy(env->in_string, CAR(env->head)->content.ptr); |
1775 |
toss(env); if(env->err) return; |
toss(env); if(env->err) return; |
1777 |
|
|
1778 |
inlength= strlen(env->in_string)+1; |
inlength= strlen(env->in_string)+1; |
1779 |
match= malloc(inlength); |
match= malloc(inlength); |
1780 |
|
assert(match != NULL); |
1781 |
|
|
1782 |
if(sscanf(env->in_string, blankform, &readlength) != EOF |
if(sscanf(env->in_string, blankform, &readlength) != EOF |
1783 |
&& readlength != -1) { |
&& readlength != -1) { |
1790 |
} else { |
} else { |
1791 |
push_float(env, ftemp); |
push_float(env, ftemp); |
1792 |
} |
} |
1793 |
|
} else if(sscanf(env->in_string, "\"\"%n", &readlength) != EOF |
1794 |
|
&& readlength != -1) { |
1795 |
|
push_cstring(env, ""); |
1796 |
} else if(sscanf(env->in_string, strform, match, &readlength) != EOF |
} else if(sscanf(env->in_string, strform, match, &readlength) != EOF |
1797 |
&& readlength != -1) { |
&& readlength != -1) { |
1798 |
push_cstring(env, match); |
push_cstring(env, match); |
2418 |
|
|
2419 |
CAR(env->head)=CDR(CAR(env->head)); |
CAR(env->head)=CDR(CAR(env->head)); |
2420 |
} |
} |
2421 |
|
|
2422 |
|
extern void cons(environment *env) |
2423 |
|
{ |
2424 |
|
value *val; |
2425 |
|
|
2426 |
|
if(env->head->type==empty || CDR(env->head)->type==empty) { |
2427 |
|
printerr("Too Few Arguments"); |
2428 |
|
env->err= 1; |
2429 |
|
return; |
2430 |
|
} |
2431 |
|
|
2432 |
|
val=new_val(env); |
2433 |
|
val->content.c= malloc(sizeof(pair)); |
2434 |
|
assert(val->content.c!=NULL); |
2435 |
|
|
2436 |
|
env->gc_count += sizeof(pair); |
2437 |
|
val->type=tcons; |
2438 |
|
|
2439 |
|
CAR(val)= CAR(CDR(env->head)); |
2440 |
|
CDR(val)= CAR(env->head); |
2441 |
|
|
2442 |
|
push_val(env, val); |
2443 |
|
|
2444 |
|
swap(env); if(env->err) return; |
2445 |
|
toss(env); if(env->err) return; |
2446 |
|
swap(env); if(env->err) return; |
2447 |
|
toss(env); if(env->err) return; |
2448 |
|
} |
2449 |
|
|
2450 |
|
/* 2: 3 => */ |
2451 |
|
/* 1: [ [ 1 . 2 ] [ 3 . 4 ] ] => 1: [ 3 . 4 ] */ |
2452 |
|
extern void assq(environment *env) |
2453 |
|
{ |
2454 |
|
value *key, *item; |
2455 |
|
|
2456 |
|
/* Needs two values on the stack, the top one must be an association |
2457 |
|
list */ |
2458 |
|
if(env->head->type==empty || CDR(env->head)->type==empty) { |
2459 |
|
printerr("Too Few Arguments"); |
2460 |
|
env->err= 1; |
2461 |
|
return; |
2462 |
|
} |
2463 |
|
|
2464 |
|
if(CAR(env->head)->type!=tcons) { |
2465 |
|
printerr("Bad Argument Type"); |
2466 |
|
env->err= 2; |
2467 |
|
return; |
2468 |
|
} |
2469 |
|
|
2470 |
|
key=CAR(CDR(env->head)); |
2471 |
|
item=CAR(env->head); |
2472 |
|
|
2473 |
|
while(item->type == tcons){ |
2474 |
|
if(CAR(item)->type != tcons){ |
2475 |
|
printerr("Bad Argument Type"); |
2476 |
|
env->err= 2; |
2477 |
|
return; |
2478 |
|
} |
2479 |
|
push_val(env, key); |
2480 |
|
push_val(env, CAR(CAR(item))); |
2481 |
|
eq(env); if(env->err) return; |
2482 |
|
|
2483 |
|
if(CAR(env->head)->content.i){ |
2484 |
|
toss(env); |
2485 |
|
break; |
2486 |
|
} |
2487 |
|
toss(env); |
2488 |
|
item=CDR(item); |
2489 |
|
} |
2490 |
|
|
2491 |
|
if(item->type == tcons){ /* A match was found */ |
2492 |
|
push_val(env, CAR(item)); |
2493 |
|
} else { |
2494 |
|
push_int(env, 0); |
2495 |
|
} |
2496 |
|
swap(env); if(env->err) return; |
2497 |
|
toss(env); if(env->err) return; |
2498 |
|
swap(env); if(env->err) return; |
2499 |
|
toss(env); |
2500 |
|
} |