--- stack/stack.c	2002/02/05 23:26:46	1.34
+++ stack/stack.c	2002/02/07 04:11:10	1.47
@@ -8,6 +8,8 @@
 #include <dlfcn.h>
 /* assert */
 #include <assert.h>
+/* strcat */
+#include <string.h>
 
 #define HASHTBLSIZE 65536
 
@@ -18,8 +20,6 @@
   enum {
     integer,
     string,
-    ref,			/* Reference (to an element in the
-                                   hash table) */
     func,			/* Function pointer */
     symb, 
     list
@@ -59,6 +59,7 @@
   stackitem *head;		/* Head of the stack */
   hashtbl symbols;		/* Hash table of all variable bindings */
   int err;			/* Error flag */
+  int non_eval_flag;
 } environment;
 
 /* A type for pointers to external functions */
@@ -68,8 +69,10 @@
 /* Initialize a newly created environment */
 void init_env(environment *env)
 {
-  long i;
+  int i;
 
+  env->err= 0;
+  env->non_eval_flag= 0;
   for(i= 0; i<HASHTBLSIZE; i++)
     env->symbols[i]= NULL;
 }
@@ -77,8 +80,8 @@
 /* Returns a pointer to a pointer to an element in the hash table. */
 symbol **hash(hashtbl in_hashtbl, const char *in_string)
 {
-  long i= 0;
-  unsigned long out_hash= 0;
+  int i= 0;
+  unsigned int out_hash= 0;
   char key= '\0';
   symbol **position;
   
@@ -104,11 +107,10 @@
 }
 
 /* Generic push function. */
-int push(stackitem** stack_head, stackitem* in_item)
+void push(stackitem** stack_head, stackitem* in_item)
 {
   in_item->next= *stack_head;
   *stack_head= in_item;
-  return 1;
 }
 
 /* Push a value onto the stack */
@@ -121,7 +123,7 @@
 }
 
 /* Push an integer onto the stack. */
-int push_int(stackitem **stack_head, int in_val) 
+void push_int(stackitem **stack_head, int in_val) 
 {
   value *new_value= malloc(sizeof(value));
   stackitem *new_item= malloc(sizeof(stackitem));
@@ -132,11 +134,10 @@
   new_value->refcount=1;
 
   push(stack_head, new_item);
-  return 1;
 }
 
 /* Copy a string onto the stack. */
-int push_cstring(stackitem **stack_head, const char *in_string)
+void push_cstring(stackitem **stack_head, const char *in_string)
 {
   value *new_value= malloc(sizeof(value));
   stackitem *new_item= malloc(sizeof(stackitem));
@@ -148,11 +149,10 @@
   new_value->refcount=1;
 
   push(stack_head, new_item);
-  return 1;
 }
 
 /* Push a symbol onto the stack. */
-int push_sym(environment *env, const char *in_string)
+void push_sym(environment *env, const char *in_string)
 {
   stackitem *new_item;		/* The new stack item */
   /* ...which will contain... */
@@ -207,7 +207,6 @@
     }
   }
   push(&(env->head), new_item);
-  return 1;
 }
 
 void printerr(const char* in_string) {
@@ -223,6 +222,7 @@
     switch (val->type){		/* and free the contents if necessary */
     case string:
       free(val->content.ptr);
+      break;
     case list:			/* lists needs to be freed recursively */
       item=val->content.ptr;
       while(item != NULL) {	/* for all stack items */
@@ -245,7 +245,8 @@
   stackitem *temp= env->head;
 
   if((env->head)==NULL) {
-    printerr("Stack empty");
+    printerr("Too Few Arguments");
+    env->err=1;
     return;
   }
   
@@ -260,15 +261,42 @@
   printf("\n");
 }
 
-/* Prints the top element of the stack. */
-void print_h(stackitem *stack_head)
-{
+/* Gets the type of a value */
+extern void type(environment *env){
+  int typenum;
 
-  if(stack_head==NULL) {
-    printerr("Stack empty");
+  if((env->head)==NULL) {
+    printerr("Too Few Arguments");
+    env->err=1;
     return;
   }
+  typenum=env->head->item->type;
+  toss(env);
+  switch(typenum){
+  case integer:
+    push_sym(env, "integer");
+    break;
+  case string:
+    push_sym(env, "string");
+    break;
+  case symb:
+    push_sym(env, "symbol");
+    break;
+  case func:
+    push_sym(env, "function");
+    break;
+  case list:
+    push_sym(env, "list");
+    break;
+  default:
+    push_sym(env, "unknown");
+    break;
+  }
+}    
 
+/* Prints the top element of the stack. */
+void print_h(stackitem *stack_head)
+{
   switch(stack_head->item->type) {
   case integer:
     printf("%d", stack_head->item->content.val);
@@ -277,15 +305,34 @@
     printf("\"%s\"", (char*)stack_head->item->content.ptr);
     break;
   case symb:
-    printf("'%s'", ((symbol *)(stack_head->item->content.ptr))->id);
+    printf("%s", ((symbol *)(stack_head->item->content.ptr))->id);
+    break;
+  case func:
+    printf("#<function %p>", (funcp)(stack_head->item->content.ptr));
+    break;
+  case list:
+    /* A list is just a stack, so make stack_head point to it */
+    stack_head=(stackitem *)(stack_head->item->content.ptr);
+    printf("[ ");
+    while(stack_head != NULL) {
+      print_h(stack_head);
+      printf(" ");
+      stack_head=stack_head->next;
+    }
+    printf("]");
     break;
   default:
-    printf("%p", (funcp)(stack_head->item->content.ptr));
+    printf("#<unknown %p>", (stack_head->item->content.ptr));
     break;
   }
 }
 
 extern void print_(environment *env) {
+  if(env->head==NULL) {
+    printerr("Too Few Arguments");
+    env->err=1;
+    return;
+  }
   print_h(env->head);
 }
 
@@ -293,6 +340,7 @@
 extern void print(environment *env)
 {
   print_(env);
+  if(env->err) return;
   toss(env);
 }
 
@@ -306,17 +354,14 @@
   nl();
 }
 
-
-
 /* Prints the stack. */
 extern void printstack(environment *env)
 {
-  if(env->head != NULL) {
-    print_st(env->head, 1);
-    nl();
-  } else {
-    printerr("Stack empty");
+  if(env->head == NULL) {
+    return;
   }
+  print_st(env->head, 1);
+  nl();
 }
 
 /* Swap the two top elements on the stack. */
@@ -324,13 +369,9 @@
 {
   stackitem *temp= env->head;
   
-  if((env->head)==NULL) {
-    printerr("Stack empty");
-    return;
-  }
-
-  if(env->head->next==NULL) {
-    printerr("Not enough arguments");
+  if(env->head==NULL || env->head->next==NULL) {
+    printerr("Too Few Arguments");
+    env->err=1;
     return;
   }
 
@@ -339,82 +380,138 @@
   env->head->next= temp;
 } 
 
-stackitem* copy(stackitem* in_item)
-{
-  stackitem *out_item= malloc(sizeof(stackitem));
-
-  memcpy(out_item, in_item, sizeof(stackitem));
-  out_item->next= NULL;
-
-  return out_item;
-}
-
 /* Recall a value from a symbol, if bound */
 extern void rcl(environment *env)
 {
   value *val;
 
   if(env->head == NULL) {
-    printerr("Stack empty");
+    printerr("Too Few Arguments");
+    env->err=1;
     return;
   }
 
   if(env->head->item->type!=symb) {
-    printerr("Not a symbol");
+    printerr("Bad Argument Type");
+    env->err=2;
     return;
   }
+
   val=((symbol *)(env->head->item->content.ptr))->val;
   if(val == NULL){
-    printerr("Unbound variable");
+    printerr("Unbound Variable");
+    env->err=3;
     return;
   }
   toss(env);		/* toss the symbol */
+  if(env->err) return;
   push_val(&(env->head), val); /* Return its bound value */
 }
 
+void stack_read(environment*, char*);
+
 /* If the top element is a symbol, determine if it's bound to a
    function value, and if it is, toss the symbol and execute the
    function. */
 extern void eval(environment *env)
 {
   funcp in_func;
-  value* val;
+  value* temp_val;
+  stackitem* iterator;
+  char* temp_string;
+
   if(env->head==NULL) {
-    printerr("Stack empty");
+    printerr("Too Few Arguments");
+    env->err=1;
     return;
   }
 
-  /* if it's a symbol */
-  if(env->head->item->type==symb) {
-
-    /* If it's not bound to anything */
-    if (((symbol *)(env->head->item->content.ptr))->val == NULL) {
-      printerr("Unbound variable");
-      return;
-    }
-    
-    /* If it contains a function */
-    if (((symbol *)(env->head->item->content.ptr))->val->type == func) {
-      in_func=
-	(funcp)(((symbol *)(env->head->item->content.ptr))->val->content.ptr);
-      toss(env);
-      (*in_func)(env);		/* Run the function */
+  switch(env->head->item->type) {
+    /* if it's a symbol */
+  case symb:
+    rcl(env);			/* get its contents */
+    if(env->err) return;
+    if(env->head->item->type!=symb){ /* don't recurse symbols */
+      eval(env);			/* evaluate the value */
       return;
-    } else {			/* If it's not a function */
-      val=((symbol *)(env->head->item->content.ptr))->val;
-      toss(env);		/* toss the symbol */
-      push_val(&(env->head), val); /* Return its bound value */
     }
-  }
+    break;
 
-  /* If it's a lone function value, run it */
-  if(env->head->item->type==func) {
+    /* If it's a lone function value, run it */
+  case func:
     in_func= (funcp)(env->head->item->content.ptr);
     toss(env); 
+    if(env->err) return;
     (*in_func)(env);
+    break;
+
+    /* If it's a list */
+  case list:
+    temp_val= env->head->item;
+    env->head->item->refcount++;
+    toss(env);
+    if(env->err) return;
+    iterator= (stackitem*)temp_val->content.ptr;
+    while(iterator!=NULL && iterator->item!=NULL) {
+      push_val(&(env->head), iterator->item);
+      if(env->head->item->type==symb
+	&& strcmp(";", ((symbol*)(env->head->item->content.ptr))->id)==0) {
+	toss(env);
+	if(env->err) return;
+	eval(env);
+	if(env->err) return;
+      }
+      iterator= iterator->next;
+    }
+    free_val(temp_val);
+    break;
+
+    /* If it's a string */
+  case string:
+    temp_val= env->head->item;
+    env->head->item->refcount++;
+    toss(env);
+    if(env->err) return;
+    temp_string= malloc(strlen((char*)temp_val->content.ptr)+5);
+    strcat(temp_string, "[ ");
+    strcat(temp_string, (char*)temp_val->content.ptr);
+    strcat(temp_string, " ]");
+    stack_read(env, temp_string);
+    eval(env);
+    if(env->err) return;
+    free_val(temp_val);
+    free(temp_string);
+    break;
+
+  default:
+  }
+}
+
+/* Reverse (flip) a list */
+extern void rev(environment *env){
+  stackitem *old_head, *new_head, *item;
+
+  if((env->head)==NULL) {
+    printerr("Too Few Arguments");
+    env->err=1;
     return;
   }
 
+  if(env->head->item->type!=list) {
+    printerr("Bad Argument Type");
+    env->err=2;
+    return;
+  }
+
+  old_head=(stackitem *)(env->head->item->content.ptr);
+  new_head=NULL;
+  while(old_head != NULL){
+    item=old_head;
+    old_head=old_head->next;
+    item->next=new_head;
+    new_head=item;
+  }
+  env->head->item->content.ptr=new_head;
 }
 
 /* Make a list. */
@@ -457,21 +554,27 @@
   temp->item= pack;
 
   push(&(env->head), temp);
+  rev(env);
 }
 
 /* Parse input. */
-int stack_read(environment *env, char *in_line) 
+void stack_read(environment *env, char *in_line) 
 {
   char *temp, *rest;
   int itemp;
   size_t inlength= strlen(in_line)+1;
   int convert= 0;
-  static int non_eval_flag= 0;
 
   temp= malloc(inlength);
   rest= malloc(inlength);
 
   do {
+    /* If comment */
+    if((convert= sscanf(in_line, "#%[^\n\r]", rest))) {
+      free(temp); free(rest);
+      return;
+    }
+
     /* If string */
     if((convert= sscanf(in_line, "\"%[^\"\n\r]\" %[^\n\r]", temp, rest))) {
       push_cstring(&(env->head), temp);
@@ -496,7 +599,7 @@
     /* If single char */
     if((convert= sscanf(in_line, "%c%[^\n\r]", temp, rest))) {
       if(*temp==';') {
-	if(!non_eval_flag) {
+	if(!env->non_eval_flag) {
 	  eval(env);		/* Evaluate top element */
 	  break;
 	}
@@ -508,31 +611,29 @@
       if(*temp==']') {
 	push_sym(env, "[");
 	pack(env);
-	if(non_eval_flag!=0)
-	  non_eval_flag--;
+	if(env->non_eval_flag)
+	  env->non_eval_flag--;
 	break;
       }
 
       if(*temp=='[') {
 	push_sym(env, "[");
-	non_eval_flag++;
+	env->non_eval_flag++;
 	break;
       }
     }
   } while(0);
 
-
   free(temp);
 
   if(convert<2) {
     free(rest);
-    return 0;
+    return;
   }
    
   stack_read(env, rest);
   
   free(rest);
-  return 1;
 }
 
 /* Relocate elements of the list on the stack. */
@@ -541,11 +642,22 @@
   stackitem *temp, *new_head;
 
   /* Is top element a list? */
-  if(env->head==NULL || env->head->item->type!=list) {
-    printerr("Stack empty or not a list");
+  if(env->head==NULL) {
+    printerr("Too Few Arguments");
+    env->err=1;
+    return;
+  }
+  if(env->head->item->type!=list) {
+    printerr("Bad Argument Type");
+    env->err=2;
     return;
   }
 
+  rev(env);
+
+  if(env->err)
+    return;
+
   /* The first list element is the new stack head */
   new_head= temp= env->head->item->content.ptr;
 
@@ -569,7 +681,8 @@
   int result;
 
   if((env->head)==NULL || env->head->next==NULL) {
-    printerr("Not enough elements to compare");
+    printerr("Too Few Arguments");
+    env->err=1;
     return;
   }
 
@@ -587,8 +700,15 @@
 {
   int val;
 
-  if((env->head)==NULL || env->head->item->type!=integer) {
-    printerr("Stack empty or element is not a integer");
+  if((env->head)==NULL) {
+    printerr("Too Few Arguments");
+    env->err=1;
+    return;
+  }
+
+  if(env->head->item->type!=integer) {
+    printerr("Bad Argument Type");
+    env->err=2;
     return;
   }
 
@@ -611,9 +731,15 @@
   symbol *sym;
 
   /* Needs two values on the stack, the top one must be a symbol */
-  if(env->head==NULL || env->head->next==NULL 
-     || env->head->item->type!=symb) {
-    printerr("Define what?");
+  if(env->head==NULL || env->head->next==NULL) {
+    printerr("Too Few Arguments");
+    env->err=1;
+    return;
+  }
+
+  if(env->head->item->type!=symb) {
+    printerr("Bad Argument Type");
+    env->err=2;
     return;
   }
 
@@ -666,8 +792,15 @@
   stackitem *stack_head= env->head;
   symbol **hash_entry, *temp;
 
-  if(stack_head==NULL || stack_head->item->type!=symb) {
-    printerr("Stack empty or not a symbol");
+  if(stack_head==NULL) {
+    printerr("Too Few Arguments");
+    env->err=1;
+    return;
+  }
+  
+  if(stack_head->item->type!=symb) {
+    printerr("Bad Argument Type");
+    env->err=2;
     return;
   }
 
@@ -683,7 +816,12 @@
   }
   free(temp->id);
   free(temp);
-} 
+}
+
+/* Returns the current error number to the stack */
+extern void errn(environment *env){
+  push_int(&(env->head), env->err);
+}
 
 int main()
 {
@@ -696,8 +834,12 @@
 
   while(fgets(in_string, 100, stdin) != NULL) {
     stack_read(&myenv, in_string);
+    if(myenv.err) {
+      printf("(error %d) ", myenv.err);
+      myenv.err=0;
+    }
     printf("okidok\n ");
   }
-
-  exit(EXIT_SUCCESS);
+  quit(&myenv);
+  return EXIT_FAILURE;
 }