APL/APL1.2/TP10/chainee_tables.c

#include <stdio.h>
#include <stdlib.h>

struct pile_ {
    char* tab;
    int size;
};

typedef struct pile_ pile;

void push(pile* p, char c) {
    (p->tab)[p->size] = c;
    p->size++;
    p->tab = realloc(p->tab, (p->size)+1);
}

char pop(pile* p) {
    char c = (p->tab)[p->size-1];
    p->size--;
    p->tab = realloc(p->tab, (p->size)+1);
    return c;
}

int empty(pile p) {
    return p.size == 0;
}

char top(pile p) {
    return (p.tab)[(p.size) - 1];
}

void clear(pile* p) {
    free(p->tab);
    p->tab = calloc(1, sizeof(int));
    p->size = 0;
}

pile create() {
    pile* p = (calloc(1, sizeof(pile)));
    p->tab = calloc(1, sizeof(char));
    p->size = 0;
    return *p;
}

pile destroy(pile* p) {
    free(p);
}