need help to soft the problem in subtopic:Stack?Please guys...

[shahrossi]

Exercise question:

1. Write a program that copies the contents of one stack into another. A function
named copystack receives 2 stacks the source stack and the destination stack.
The order of the stacks must be identical. (Hint: Use a temporary stack to
preserve the order)
2. Write a program that reads a text file, one in a line at a time and prints the line
as it was read and then prints the line with its text reversed. Print a blank line
after each reversed line. Use stack ADT.

[horace1]

Exercise question:

1. Write a program that copies the contents of one stack into another. A function
named copystack receives 2 stacks the source stack and the destination stack.
The order of the stacks must be identical. (Hint: Use a temporary stack to
preserve the order)
2. Write a program that reads a text file, one in a line at a time and prints the line
as it was read and then prints the line with its text reversed. Print a blank line
after each reversed line. Use stack ADT.

what code have you implemented so far?

[shahrossi]

this is a code.

#include "StackA.h"
#include <stdio.h>
void main(){
Stack S;
StackEntry x, itempop;
int yes;
CreateStack(&S);
printf("Enter a list of characters:");
while((x=getchar())!='\n'){
if(!StackFull(&S))
Push(x, &S);
if(StackFull(&S))
printf("Stack already full. Cannot PUSH anymore\n");
}
TraverseStack(S);
do{
printf("\nDo you want to POP an item from the stack? Yes=1, No=0:");
scanf("%d", &yes);
if(yes==1){
Pop(&itempop,&S);
printf("\nThe item that just popped out is %c\n", itempop);
if(StackEmpty(&S))
printf("Stack empty. Cannot POP anymore\n");
}
}while((yes==1) && (!StackEmpty(&S)));
printf("\n\nThe stack afer POP operations:\n");
TraverseStack(S);
printf("NULL\n");
}
 

[shahrossi]

#include "StackA.h"
#include <stdio.h>
void main(){
   Stack S;
   StackEntry x, itempop;
   int yes;
   CreateStack(&S);
   printf("Enter a list of characters:");
   while((x=getchar())!='\n'){
      if(!StackFull(&S))
         Push(x, &S);
      if(StackFull(&S))
         printf("Stack already full. Cannot PUSH anymore\n");
   }
   TraverseStack(S);
   do{
      printf("\nDo you want to POP an item from the stack? Yes=1, No=0:");
      scanf("%d", &yes);
      if(yes==1){
         Pop(&itempop,&S);
         printf("\nThe item that just popped out is %c\n", itempop);
         if(StackEmpty(&S))
            printf("Stack empty. Cannot POP anymore\n");
      }
   } while((yes==1) && (!StackEmpty(&S)));
   printf("\n\nThe stack afer POP operations:\n");
   TraverseStack(S);
   printf("NULL\n");
}