9 |
/* strcmp, strcpy, strlen, strcat, strdup */ |
/* strcmp, strcpy, strlen, strcat, strdup */ |
10 |
#include <string.h> |
#include <string.h> |
11 |
|
|
12 |
#define HASHTBLSIZE 65536 |
#define HASHTBLSIZE 2048 |
13 |
|
|
14 |
/* First, define some types. */ |
/* First, define some types. */ |
15 |
|
|
60 |
int err; /* Error flag */ |
int err; /* Error flag */ |
61 |
int non_eval_flag; |
int non_eval_flag; |
62 |
char *in_string; /* Input pending to be read */ |
char *in_string; /* Input pending to be read */ |
63 |
|
char *free_string; /* Free this string when all input is |
64 |
|
read from in_string */ |
65 |
} environment; |
} environment; |
66 |
|
|
67 |
/* A type for pointers to external functions */ |
/* A type for pointers to external functions */ |
157 |
} |
} |
158 |
} |
} |
159 |
|
|
|
/* Generic push function. */ |
|
|
void push(stackitem** stack_head, stackitem* in_item) |
|
|
{ |
|
|
in_item->next= *stack_head; |
|
|
*stack_head= in_item; |
|
|
} |
|
|
|
|
160 |
/* Push a value onto the stack */ |
/* Push a value onto the stack */ |
161 |
void push_val(stackitem **stack_head, value *val) |
void push_val(environment *env, value *val) |
162 |
{ |
{ |
163 |
stackitem *new_item= malloc(sizeof(stackitem)); |
stackitem *new_item= malloc(sizeof(stackitem)); |
164 |
new_item->item= val; |
new_item->item= val; |
165 |
val->refcount++; |
val->refcount++; |
166 |
push(stack_head, new_item); |
new_item->next= env->head; |
167 |
|
env->head= new_item; |
168 |
} |
} |
169 |
|
|
170 |
/* Push an integer onto the stack. */ |
/* Push an integer onto the stack. */ |
171 |
void push_int(stackitem **stack_head, int in_val) |
void push_int(environment *env, int in_val) |
172 |
{ |
{ |
173 |
value *new_value= malloc(sizeof(value)); |
value *new_value= malloc(sizeof(value)); |
|
stackitem *new_item= malloc(sizeof(stackitem)); |
|
|
new_item->item= new_value; |
|
174 |
|
|
175 |
new_value->content.val= in_val; |
new_value->content.val= in_val; |
176 |
new_value->type= integer; |
new_value->type= integer; |
177 |
new_value->refcount=1; |
new_value->refcount=1; |
178 |
|
|
179 |
push(stack_head, new_item); |
push_val(env, new_value); |
180 |
} |
} |
181 |
|
|
182 |
/* Copy a string onto the stack. */ |
/* Copy a string onto the stack. */ |
183 |
void push_cstring(stackitem **stack_head, const char *in_string) |
void push_cstring(environment *env, const char *in_string) |
184 |
{ |
{ |
185 |
value *new_value= malloc(sizeof(value)); |
value *new_value= malloc(sizeof(value)); |
|
stackitem *new_item= malloc(sizeof(stackitem)); |
|
|
new_item->item=new_value; |
|
186 |
|
|
187 |
new_value->content.ptr= malloc(strlen(in_string)+1); |
new_value->content.ptr= malloc(strlen(in_string)+1); |
188 |
strcpy(new_value->content.ptr, in_string); |
strcpy(new_value->content.ptr, in_string); |
189 |
new_value->type= string; |
new_value->type= string; |
190 |
new_value->refcount=1; |
new_value->refcount=1; |
191 |
|
|
192 |
push(stack_head, new_item); |
push_val(env, new_value); |
193 |
} |
} |
194 |
|
|
195 |
/* Mangle a symbol name to a valid C identifier name */ |
/* Mangle a symbol name to a valid C identifier name */ |
238 |
new_value->type= string; |
new_value->type= string; |
239 |
new_value->refcount=1; |
new_value->refcount=1; |
240 |
|
|
241 |
push_val(&(env->head), new_value); |
push_val(env, new_value); |
242 |
} |
} |
243 |
|
|
244 |
/* Push a symbol onto the stack. */ |
/* Push a symbol onto the stack. */ |
245 |
void push_sym(environment *env, const char *in_string) |
void push_sym(environment *env, const char *in_string) |
246 |
{ |
{ |
|
stackitem *new_item; /* The new stack item */ |
|
|
/* ...which will contain... */ |
|
247 |
value *new_value; /* A new symbol value */ |
value *new_value; /* A new symbol value */ |
248 |
/* ...which might point to... */ |
/* ...which might point to... */ |
249 |
symbol **new_symbol; /* (if needed) A new actual symbol */ |
symbol **new_symbol; /* (if needed) A new actual symbol */ |
256 |
const char *dlerr; /* Dynamic linker error */ |
const char *dlerr; /* Dynamic linker error */ |
257 |
char *mangled; /* Mangled function name */ |
char *mangled; /* Mangled function name */ |
258 |
|
|
|
/* Create a new stack item containing a new value */ |
|
|
new_item= malloc(sizeof(stackitem)); |
|
259 |
new_value= malloc(sizeof(value)); |
new_value= malloc(sizeof(value)); |
|
new_item->item=new_value; |
|
260 |
|
|
261 |
/* The new value is a symbol */ |
/* The new value is a symbol */ |
262 |
new_value->type= symb; |
new_value->type= symb; |
300 |
new_fvalue->refcount= 1; |
new_fvalue->refcount= 1; |
301 |
} |
} |
302 |
} |
} |
303 |
push(&(env->head), new_item); |
push_val(env, new_value); |
304 |
} |
} |
305 |
|
|
306 |
/* Print newline. */ |
/* Print newline. */ |
340 |
} |
} |
341 |
|
|
342 |
/* Prints the top element of the stack. */ |
/* Prints the top element of the stack. */ |
343 |
void print_h(stackitem *stack_head) |
void print_h(stackitem *stack_head, int noquote) |
344 |
{ |
{ |
345 |
switch(stack_head->item->type) { |
switch(stack_head->item->type) { |
346 |
case integer: |
case integer: |
347 |
printf("%d", stack_head->item->content.val); |
printf("%d", stack_head->item->content.val); |
348 |
break; |
break; |
349 |
case string: |
case string: |
350 |
printf("%s", (char*)stack_head->item->content.ptr); |
if(noquote) |
351 |
|
printf("%s", (char*)stack_head->item->content.ptr); |
352 |
|
else |
353 |
|
printf("\"%s\"", (char*)stack_head->item->content.ptr); |
354 |
break; |
break; |
355 |
case symb: |
case symb: |
356 |
printf("%s", ((symbol *)(stack_head->item->content.ptr))->id); |
printf("%s", ((symbol *)(stack_head->item->content.ptr))->id); |
363 |
stack_head=(stackitem *)(stack_head->item->content.ptr); |
stack_head=(stackitem *)(stack_head->item->content.ptr); |
364 |
printf("[ "); |
printf("[ "); |
365 |
while(stack_head != NULL) { |
while(stack_head != NULL) { |
366 |
print_h(stack_head); |
print_h(stack_head, noquote); |
367 |
printf(" "); |
printf(" "); |
368 |
stack_head=stack_head->next; |
stack_head=stack_head->next; |
369 |
} |
} |
378 |
env->err=1; |
env->err=1; |
379 |
return; |
return; |
380 |
} |
} |
381 |
print_h(env->head); |
print_h(env->head, 0); |
382 |
|
nl(); |
383 |
} |
} |
384 |
|
|
385 |
/* Prints the top element of the stack and then discards it. */ |
/* Prints the top element of the stack and then discards it. */ |
390 |
toss(env); |
toss(env); |
391 |
} |
} |
392 |
|
|
393 |
|
extern void princ_(environment *env) { |
394 |
|
if(env->head==NULL) { |
395 |
|
printerr("Too Few Arguments"); |
396 |
|
env->err=1; |
397 |
|
return; |
398 |
|
} |
399 |
|
print_h(env->head, 1); |
400 |
|
} |
401 |
|
|
402 |
|
/* Prints the top element of the stack and then discards it. */ |
403 |
|
extern void princ(environment *env) |
404 |
|
{ |
405 |
|
princ_(env); |
406 |
|
if(env->err) return; |
407 |
|
toss(env); |
408 |
|
} |
409 |
|
|
410 |
/* Only to be called by function printstack. */ |
/* Only to be called by function printstack. */ |
411 |
void print_st(stackitem *stack_head, long counter) |
void print_st(stackitem *stack_head, long counter) |
412 |
{ |
{ |
413 |
if(stack_head->next != NULL) |
if(stack_head->next != NULL) |
414 |
print_st(stack_head->next, counter+1); |
print_st(stack_head->next, counter+1); |
415 |
printf("%ld: ", counter); |
printf("%ld: ", counter); |
416 |
print_h(stack_head); |
print_h(stack_head, 0); |
417 |
nl(); |
nl(); |
418 |
} |
} |
419 |
|
|
421 |
extern void printstack(environment *env) |
extern void printstack(environment *env) |
422 |
{ |
{ |
423 |
if(env->head == NULL) { |
if(env->head == NULL) { |
424 |
|
printf("Stack Empty\n"); |
425 |
return; |
return; |
426 |
} |
} |
427 |
print_st(env->head, 1); |
print_st(env->head, 1); |
|
nl(); |
|
428 |
} |
} |
429 |
|
|
430 |
/* Swap the two top elements on the stack. */ |
/* Swap the two top elements on the stack. */ |
485 |
} |
} |
486 |
toss(env); /* toss the symbol */ |
toss(env); /* toss the symbol */ |
487 |
if(env->err) return; |
if(env->err) return; |
488 |
push_val(&(env->head), val); /* Return its bound value */ |
push_val(env, val); /* Return its bound value */ |
489 |
} |
} |
490 |
|
|
491 |
/* If the top element is a symbol, determine if it's bound to a |
/* If the top element is a symbol, determine if it's bound to a |
497 |
value* temp_val; |
value* temp_val; |
498 |
stackitem* iterator; |
stackitem* iterator; |
499 |
|
|
500 |
|
eval_start: |
501 |
|
|
502 |
if(env->head==NULL) { |
if(env->head==NULL) { |
503 |
printerr("Too Few Arguments"); |
printerr("Too Few Arguments"); |
504 |
env->err=1; |
env->err=1; |
505 |
return; |
return; |
506 |
} |
} |
507 |
|
|
|
eval_start: |
|
|
|
|
508 |
switch(env->head->item->type) { |
switch(env->head->item->type) { |
509 |
/* if it's a symbol */ |
/* if it's a symbol */ |
510 |
case symb: |
case symb: |
530 |
if(env->err) return; |
if(env->err) return; |
531 |
iterator= (stackitem*)temp_val->content.ptr; |
iterator= (stackitem*)temp_val->content.ptr; |
532 |
while(iterator!=NULL) { |
while(iterator!=NULL) { |
533 |
push_val(&(env->head), iterator->item); |
push_val(env, iterator->item); |
534 |
if(env->head->item->type==symb |
if(env->head->item->type==symb |
535 |
&& strcmp(";", ((symbol*)(env->head->item->content.ptr))->id)==0) { |
&& strcmp(";", ((symbol*)(env->head->item->content.ptr))->id)==0) { |
536 |
toss(env); |
toss(env); |
582 |
/* Make a list. */ |
/* Make a list. */ |
583 |
extern void pack(environment *env) |
extern void pack(environment *env) |
584 |
{ |
{ |
|
void* delimiter; |
|
585 |
stackitem *iterator, *temp; |
stackitem *iterator, *temp; |
586 |
value *pack; |
value *pack; |
587 |
|
|
|
delimiter= env->head->item->content.ptr; /* Get delimiter */ |
|
|
toss(env); |
|
|
|
|
588 |
iterator= env->head; |
iterator= env->head; |
589 |
|
|
590 |
if(iterator==NULL || iterator->item->content.ptr==delimiter) { |
if(iterator==NULL |
591 |
|
|| (iterator->item->type==symb |
592 |
|
&& ((symbol*)(iterator->item->content.ptr))->id[0]=='[')) { |
593 |
temp= NULL; |
temp= NULL; |
594 |
toss(env); |
toss(env); |
595 |
} else { |
} else { |
596 |
/* Search for first delimiter */ |
/* Search for first delimiter */ |
597 |
while(iterator->next!=NULL |
while(iterator->next!=NULL |
598 |
&& iterator->next->item->content.ptr!=delimiter) |
&& (iterator->next->item->type!=symb |
599 |
|
|| ((symbol*)(iterator->next->item->content.ptr))->id[0]!='[')) |
600 |
iterator= iterator->next; |
iterator= iterator->next; |
601 |
|
|
602 |
/* Extract list */ |
/* Extract list */ |
614 |
pack->content.ptr= temp; |
pack->content.ptr= temp; |
615 |
pack->refcount= 1; |
pack->refcount= 1; |
616 |
|
|
617 |
temp= malloc(sizeof(stackitem)); |
push_val(env, pack); |
|
temp->item= pack; |
|
|
|
|
|
push(&(env->head), temp); |
|
618 |
rev(env); |
rev(env); |
619 |
} |
} |
620 |
|
|
674 |
result= (left==right); |
result= (left==right); |
675 |
|
|
676 |
toss(env); toss(env); |
toss(env); toss(env); |
677 |
push_int(&(env->head), result); |
push_int(env, result); |
678 |
} |
} |
679 |
|
|
680 |
/* Negates the top element on the stack. */ |
/* Negates the top element on the stack. */ |
696 |
|
|
697 |
val= env->head->item->content.val; |
val= env->head->item->content.val; |
698 |
toss(env); |
toss(env); |
699 |
push_int(&(env->head), !val); |
push_int(env, !val); |
700 |
} |
} |
701 |
|
|
702 |
/* Compares the two top elements on the stack and return 0 if they're the |
/* Compares the two top elements on the stack and return 0 if they're the |
739 |
toss(env); toss(env); |
toss(env); toss(env); |
740 |
} |
} |
741 |
|
|
742 |
|
extern void clear(environment *); |
743 |
|
void forget_sym(symbol **); |
744 |
|
|
745 |
/* Quit stack. */ |
/* Quit stack. */ |
746 |
extern void quit(environment *env) |
extern void quit(environment *env) |
747 |
{ |
{ |
748 |
|
long i; |
749 |
|
|
750 |
|
clear(env); |
751 |
|
if (env->err) return; |
752 |
|
for(i= 0; i<HASHTBLSIZE; i++) { |
753 |
|
while(env->symbols[i]!= NULL) { |
754 |
|
forget_sym(&(env->symbols[i])); |
755 |
|
} |
756 |
|
env->symbols[i]= NULL; |
757 |
|
} |
758 |
exit(EXIT_SUCCESS); |
exit(EXIT_SUCCESS); |
759 |
} |
} |
760 |
|
|
780 |
} |
} |
781 |
} |
} |
782 |
|
|
783 |
|
/* Internal forget function */ |
784 |
|
void forget_sym(symbol **hash_entry) { |
785 |
|
symbol *temp; |
786 |
|
|
787 |
|
temp= *hash_entry; |
788 |
|
*hash_entry= (*hash_entry)->next; |
789 |
|
|
790 |
|
if(temp->val!=NULL) { |
791 |
|
free_val(temp->val); |
792 |
|
} |
793 |
|
free(temp->id); |
794 |
|
free(temp); |
795 |
|
} |
796 |
|
|
797 |
/* Forgets a symbol (remove it from the hash table) */ |
/* Forgets a symbol (remove it from the hash table) */ |
798 |
extern void forget(environment *env) |
extern void forget(environment *env) |
799 |
{ |
{ |
800 |
char* sym_id; |
char* sym_id; |
801 |
stackitem *stack_head= env->head; |
stackitem *stack_head= env->head; |
|
symbol **hash_entry, *temp; |
|
802 |
|
|
803 |
if(stack_head==NULL) { |
if(stack_head==NULL) { |
804 |
printerr("Too Few Arguments"); |
printerr("Too Few Arguments"); |
815 |
sym_id= ((symbol*)(stack_head->item->content.ptr))->id; |
sym_id= ((symbol*)(stack_head->item->content.ptr))->id; |
816 |
toss(env); |
toss(env); |
817 |
|
|
818 |
hash_entry= hash(env->symbols, sym_id); |
return forget_sym(hash(env->symbols, sym_id)); |
|
temp= *hash_entry; |
|
|
*hash_entry= (*hash_entry)->next; |
|
|
|
|
|
if(temp->val!=NULL) { |
|
|
free_val(temp->val); |
|
|
} |
|
|
free(temp->id); |
|
|
free(temp); |
|
819 |
} |
} |
820 |
|
|
821 |
/* Returns the current error number to the stack */ |
/* Returns the current error number to the stack */ |
822 |
extern void errn(environment *env){ |
extern void errn(environment *env){ |
823 |
push_int(&(env->head), env->err); |
push_int(env, env->err); |
824 |
} |
} |
825 |
|
|
826 |
extern void read(environment*); |
extern void read(environment*); |
832 |
init_env(&myenv); |
init_env(&myenv); |
833 |
|
|
834 |
while(1) { |
while(1) { |
835 |
if(myenv.in_string==NULL) |
if(myenv.in_string==NULL) { |
836 |
|
nl(); |
837 |
printstack(&myenv); |
printstack(&myenv); |
838 |
|
printf("> "); |
839 |
|
} |
840 |
read(&myenv); |
read(&myenv); |
841 |
if(myenv.err) { |
if(myenv.err) { |
842 |
printf("(error %d) ", myenv.err); |
printf("(error %d) ", myenv.err); |
878 |
strcpy(new_string, b_val->content.ptr); |
strcpy(new_string, b_val->content.ptr); |
879 |
strcat(new_string, a_val->content.ptr); |
strcat(new_string, a_val->content.ptr); |
880 |
free_val(a_val); free_val(b_val); |
free_val(a_val); free_val(b_val); |
881 |
push_cstring(&(env->head), new_string); |
push_cstring(env, new_string); |
882 |
free(new_string); |
free(new_string); |
883 |
return; |
return; |
884 |
} |
} |
898 |
b=env->head->item->content.val; |
b=env->head->item->content.val; |
899 |
toss(env); |
toss(env); |
900 |
if(env->err) return; |
if(env->err) return; |
901 |
push_int(&(env->head), a+b); |
push_int(env, a+b); |
902 |
} |
} |
903 |
} |
} |
904 |
|
|
927 |
b=env->head->item->content.val; |
b=env->head->item->content.val; |
928 |
toss(env); |
toss(env); |
929 |
if(env->err) return; |
if(env->err) return; |
930 |
push_int(&(env->head), b-a); |
push_int(env, b-a); |
931 |
} |
} |
932 |
} |
} |
933 |
|
|
956 |
b=env->head->item->content.val; |
b=env->head->item->content.val; |
957 |
toss(env); |
toss(env); |
958 |
if(env->err) return; |
if(env->err) return; |
959 |
push_int(&(env->head), b>a); |
push_int(env, b>a); |
960 |
} |
} |
961 |
} |
} |
962 |
|
|
1012 |
env->err=1; |
env->err=1; |
1013 |
return; |
return; |
1014 |
} |
} |
1015 |
push_val(&(env->head), copy_val(env->head->item)); |
push_val(env, copy_val(env->head->item)); |
1016 |
} |
} |
1017 |
|
|
1018 |
/* "if", If-Then */ |
/* "if", If-Then */ |
1103 |
toss(env); if(env->err) return; |
toss(env); if(env->err) return; |
1104 |
|
|
1105 |
do { |
do { |
1106 |
push_val(&(env->head), test); |
push_val(env, test); |
1107 |
eval(env); |
eval(env); |
1108 |
|
|
1109 |
if(env->head->item->type != integer) { |
if(env->head->item->type != integer) { |
1116 |
toss(env); if(env->err) return; |
toss(env); if(env->err) return; |
1117 |
|
|
1118 |
if(truth) { |
if(truth) { |
1119 |
push_val(&(env->head), loop); |
push_val(env, loop); |
1120 |
eval(env); |
eval(env); |
1121 |
} else { |
} else { |
1122 |
toss(env); |
toss(env); |
1157 |
iterator= foo->content.ptr; |
iterator= foo->content.ptr; |
1158 |
|
|
1159 |
while(iterator!=NULL) { |
while(iterator!=NULL) { |
1160 |
push_val(&(env->head), iterator->item); |
push_val(env, iterator->item); |
1161 |
push_val(&(env->head), loop); |
push_val(env, loop); |
1162 |
eval(env); if(env->err) return; |
eval(env); if(env->err) return; |
1163 |
iterator= iterator->next; |
iterator= iterator->next; |
1164 |
} |
} |
1170 |
/* 'to' */ |
/* 'to' */ |
1171 |
extern void to(environment *env) { |
extern void to(environment *env) { |
1172 |
int i, start, ending; |
int i, start, ending; |
1173 |
|
stackitem *temp_head; |
1174 |
|
value *temp_val; |
1175 |
|
|
1176 |
if((env->head)==NULL || env->head->next==NULL) { |
if((env->head)==NULL || env->head->next==NULL) { |
1177 |
printerr("Too Few Arguments"); |
printerr("Too Few Arguments"); |
1191 |
start= env->head->item->content.val; |
start= env->head->item->content.val; |
1192 |
toss(env); if(env->err) return; |
toss(env); if(env->err) return; |
1193 |
|
|
1194 |
push_sym(env, "["); |
temp_head= env->head; |
1195 |
|
env->head= NULL; |
1196 |
|
|
1197 |
if(ending>=start) { |
if(ending>=start) { |
1198 |
for(i= start; i<=ending; i++) |
for(i= ending; i>=start; i--) |
1199 |
push_int(&(env->head), i); |
push_int(env, i); |
1200 |
} else { |
} else { |
1201 |
for(i= start; i>=ending; i--) |
for(i= ending; i<=start; i++) |
1202 |
push_int(&(env->head), i); |
push_int(env, i); |
1203 |
} |
} |
1204 |
|
|
1205 |
push_sym(env, "["); |
temp_val= malloc(sizeof(value)); |
1206 |
pack(env); if(env->err) return; |
temp_val->content.ptr= env->head; |
1207 |
|
temp_val->refcount= 1; |
1208 |
|
temp_val->type= list; |
1209 |
|
env->head= temp_head; |
1210 |
|
push_val(env, temp_val); |
1211 |
} |
} |
1212 |
|
|
1213 |
/* Read a string */ |
/* Read a string */ |
1215 |
char in_string[101]; |
char in_string[101]; |
1216 |
|
|
1217 |
fgets(in_string, 100, stdin); |
fgets(in_string, 100, stdin); |
1218 |
push_cstring(&(env->head), in_string); |
push_cstring(env, in_string); |
1219 |
} |
} |
1220 |
|
|
1221 |
/* Read a value and place on stack */ |
/* Read a value and place on stack */ |
1222 |
extern void read(environment *env) { |
extern void read(environment *env) { |
1223 |
const char symbform[]= "%[a-zA-Z0-9!$%*+./:<=>?@^_~-]%[\001-\377]"; |
const char symbform[]= "%[a-zA-Z0-9!$%*+./:<=>?@^_~-]%n"; |
1224 |
const char strform[]= "\"%[^\"]\"%[\001-\377]"; |
const char strform[]= "\"%[^\"]\"%n"; |
1225 |
const char intform[]= "%i%[\001-\377]"; |
const char intform[]= "%i%n"; |
1226 |
const char blankform[]= "%*[ \t]%[\001-\377]"; |
const char blankform[]= "%*[ \t]%n"; |
1227 |
const char ebrackform[]= "%*1[]]%[\001-\377]"; |
const char ebrackform[]= "%*1[]]%n"; |
1228 |
const char semicform[]= "%*1[;]%[\001-\377]"; |
const char semicform[]= "%*1[;]%n"; |
1229 |
const char bbrackform[]= "%*1[[]%[\001-\377]"; |
const char bbrackform[]= "%*1[[]%n"; |
1230 |
|
|
1231 |
int itemp; |
int itemp, readlength= -1; |
1232 |
static int depth= 0; |
static int depth= 0; |
1233 |
char *rest, *match; |
char *rest, *match; |
1234 |
size_t inlength; |
size_t inlength; |
1235 |
|
|
1236 |
if(env->in_string==NULL) { |
if(env->in_string==NULL) { |
1237 |
|
if(depth > 0) { |
1238 |
|
printf("]> "); |
1239 |
|
} |
1240 |
readline(env); if(env->err) return; |
readline(env); if(env->err) return; |
1241 |
|
|
1242 |
env->in_string= malloc(strlen(env->head->item->content.ptr)+1); |
env->in_string= malloc(strlen(env->head->item->content.ptr)+1); |
1243 |
|
env->free_string= env->in_string; /* Save the original pointer */ |
1244 |
strcpy(env->in_string, env->head->item->content.ptr); |
strcpy(env->in_string, env->head->item->content.ptr); |
1245 |
toss(env); if(env->err) return; |
toss(env); if(env->err) return; |
1246 |
} |
} |
1249 |
match= malloc(inlength); |
match= malloc(inlength); |
1250 |
rest= malloc(inlength); |
rest= malloc(inlength); |
1251 |
|
|
1252 |
if(sscanf(env->in_string, blankform, rest)) { |
if(sscanf(env->in_string, blankform, &readlength)!=EOF |
1253 |
|
&& readlength != -1) { |
1254 |
; |
; |
1255 |
} else if(sscanf(env->in_string, intform, &itemp, rest) > 0) { |
} else if(sscanf(env->in_string, intform, &itemp, &readlength) != EOF |
1256 |
push_int(&(env->head), itemp); |
&& readlength != -1) { |
1257 |
} else if(sscanf(env->in_string, strform, match, rest) > 0) { |
push_int(env, itemp); |
1258 |
push_cstring(&(env->head), match); |
} else if(sscanf(env->in_string, strform, match, &readlength) != EOF |
1259 |
} else if(sscanf(env->in_string, symbform, match, rest) > 0) { |
&& readlength != -1) { |
1260 |
|
push_cstring(env, match); |
1261 |
|
} else if(sscanf(env->in_string, symbform, match, &readlength) != EOF |
1262 |
|
&& readlength != -1) { |
1263 |
push_sym(env, match); |
push_sym(env, match); |
1264 |
} else if(sscanf(env->in_string, ebrackform, rest) > 0) { |
} else if(sscanf(env->in_string, ebrackform, &readlength) != EOF |
1265 |
push_sym(env, "["); |
&& readlength != -1) { |
1266 |
pack(env); if(env->err) return; |
pack(env); if(env->err) return; |
1267 |
if(depth!=0) depth--; |
if(depth != 0) depth--; |
1268 |
} else if(sscanf(env->in_string, semicform, rest) > 0) { |
} else if(sscanf(env->in_string, semicform, &readlength) != EOF |
1269 |
|
&& readlength != -1) { |
1270 |
push_sym(env, ";"); |
push_sym(env, ";"); |
1271 |
} else if(sscanf(env->in_string, bbrackform, rest) > 0) { |
} else if(sscanf(env->in_string, bbrackform, &readlength) != EOF |
1272 |
|
&& readlength != -1) { |
1273 |
push_sym(env, "["); |
push_sym(env, "["); |
1274 |
depth++; |
depth++; |
1275 |
} else { |
} else { |
1276 |
free(rest); |
free(env->free_string); |
1277 |
rest= NULL; |
env->in_string = env->free_string = NULL; |
1278 |
|
free(match); |
1279 |
|
} |
1280 |
|
if ( env->in_string != NULL) { |
1281 |
|
env->in_string += readlength; |
1282 |
} |
} |
|
|
|
|
free(env->in_string); |
|
|
free(match); |
|
|
|
|
|
env->in_string= rest; |
|
1283 |
|
|
1284 |
if(depth) |
if(depth) |
1285 |
return read(env); |
return read(env); |