栈_结构体数组实现栈_静态库_0303

#Makefile 练习

all:
    gcc -Wall stack.c -c -o stack.o
    ar rcs libstack.a stack.c
    gcc main.c -L. -lstack -o app_static
    gcc -shared -fPIC stack.c -o libstack.so
    gcc main.c libstack.so -o main
clean:
    rm main
.PHONY:clean all

//stack.h

#ifndef STACK_H
#define STACK_H

#define MAX 20
#include <stdbool.h>
typedef struct stack
{
    char arr[MAX];
    int top;
}stack_t;

bool is_character(char);
bool is_num(char);
void stack_init(stack_t *);
void push(stack_t *, char);
char pop(stack_t *);
bool is_empty(stack_t *);
bool is_full(stack_t *);

#endif //STACK_H

//stack.c

#include "stack.h"
#include <string.h>

bool is_character(char ch)
{
    if((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z'))
        return true;
    else
        return false;
}

void stack_init(stack_t *st)
{
    memset(st, 0, sizeof(stack_t));
}

void push(stack_t *st, char ch)
{
    st->arr[st->top ++] = ch;
}

char pop(stack_t *st)
{
    return st->arr[-- st->top];
}

bool is_empty(stack_t *st)
{
    return st->top == 0;
}

bool is_full(stack_t *st)
{
    return st->top == MAX;
}

//main.c

#include <stdio.h>
#include "stack.h"

int main(int argc, const char *argv[])
{
    char ch;
    stack_t st_ch, st_num;

    stack_init(&st_ch);
    stack_init(&st_num);

    while((ch = getchar()) != '\n')
    {
        if(is_character(ch))
        {    if(! is_full(&st_ch))
                push(&st_ch, ch);
        }
        else
        {
            if(! is_full(&st_num))
                push(&st_num, ch);
        }
    }

    while(! is_empty(&st_ch))
        putchar(pop(&st_ch));
    putchar('\n');
    while(! is_empty(&st_num))
        putchar(pop(&st_num));
    putchar('\n');
    return 0;
}