112                                     4.     

    (push)     . 
top   .      ch_stack. 
 ,  ch_stack  .     (pop)
   ;   ,  ch_stack  . -
   ,   top   .

 bool empty(const ch_stack* stk)
{

return (stk -> top == EMPTY);

}

bool full(const ch_stack* stk)
{

return (stk -> top == FULL) ;

}

     bool.      top 
 . ,   push ()  
,  ch_stack  ,     push ()  -
.     ch_stack,    . 
   -  const.    
ch_stack   ,        -
  ->.

 ,        ch_stac1.h, 
       ,  
      ,     :

  ch_stacl.cpp

// ch_stack    

#include "ch_stacl.h"
ttinclude <iostream.h>

int main()
{

ch_stack s;

char sfcr[40] = {"   !"};

int  i = 0;

cout  str  endl;        // 
reset(&s) ;

while (str[i] && ifull(&s)) //  

push(&s, str[i++]);

while (!empty(&s))          //  

cout  pop(&s) ;

cout  endl;

}