基于栈和队列实现括号匹配算法

typedef struct _member
{
    char ch;//单元内容
    int line;//行号
    int column;//列号
}node,*pnode;
 
typedef struct _stack_ds //记录栈的信息
{
    int size;//size of stack
    int memb;//number of members
    node ptr[0];//stack location 存放数据的位置
}stack_ds,*pstack_ds;
 
pstack_ds init_stack(int size)
{
    pstack_ds head = (pstack_ds)malloc(sizeof(stack_ds) + sizeof(node)*size);
    head->size = size;
    head->memb = 0;
    memset(head->ptr,'\0',sizeof(node)*size);
 
    return head;
}
 
void destroy_stack(pstack_ds head)
{
    free(head); //一次申请一次释放
}
 
void push_stack(pstack_ds head,char ch,int line,int column)
{
    if (head->memb == head->size)
    {
        //realloc stack memory, to do
    }
    head->ptr[head->memb].ch = ch;
    head->ptr[head->memb].line = line;
    head->ptr[head->memb].column = column;
 
    head->memb++;
}
 
pnode pop_stack(pstack_ds head)
{
    if(head->memb == 0)
        return null;
    else
    {
        head->memb--;
        return head.ptr + head->memb;
    }
}
 
char fetch_top_memb(pstack_ds head)
{
    if(head->memb == 0)
        return -1;
    else
        return head->ptr[head->memb - 1].ch;
}
 
/*判断栈是否空*/
int empty_stack(pstack_ds head)
{
    if (head->member <= 0)
    {
        return 1;
    }
    else
        return 0;
}
 
int main(int argc,char *argv[])
{
    if(argc < 2)
    {
        printf("pls usage %s filename\n",argv[0] );
        exit(EXIT_FAILURE);
    }
    FILE *fp = fopen(argv[1],"r");
    if (fp == NULL)
    {        
        perror("fopen");
        exit(EXIT_FAILURE);
    }
 
    fclose(fp);
}