int main(void)
{
int v[N] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
int sum;
pretty_print_vect(v, N);
sum = vect_sum(v, N);
printf("\nSum is: ");
pretty_print_int(sum);
return 0;
}
void pretty_print(lexeme tree) {
if (tree == NULL) {
//fprintf(stderr, "Got empty tree. Returning...\n");
return;
}
lexeme_type type = lexeme_get_type(tree);
switch(type) {
case PAIR:
pretty_print_pair(tree);
break;
case STRING:
pretty_print_string(tree);
break;
case AMP:
pretty_print_amp(tree);
break;
case DOT:
pretty_print_dot(tree);
break;
case RETURN:
pretty_print_return(tree);
break;
case BLOCK:
pretty_print_block(tree);
break;
case UNITLIST:
pretty_print_unitlist(tree);
break;
case INT:
pretty_print_int(tree);
break;
case DEC:
pretty_print_dec(tree);
break;
case TRUE:
pretty_print_true(tree);
break;
case FALSE:
pretty_print_false(tree);
break;
case NIL:
pretty_print_nil(tree);
break;
case ID:
pretty_print_id(tree);
break;
case BIND:
pretty_print_bind(tree);
break;
case LAMBDA:
pretty_print_lambda(tree);
break;
case PARAMLIST:
pretty_print_paramlist(tree);
break;
case CALL:
pretty_print_call(tree);
break;
case ARGLIST:
pretty_print_arglist(tree);
break;
default:
printf("BAD LEXEME");
lexeme_destroy(tree);
break;
}
}
