数据结构中 行编辑 程序问题

输入包含若干行;)
{
if (ch == ',(N+M)*sizeof (char));)
pop (s;
}

void push (stack &s.top = s.base = (char *)realloc (s.top++ = e;#'!= 'iostream><
return e = *--s; )
pop (s.top = s;
s;
# define N 100
# define M 10
using namespace std;=s; '.base ) return !s，表示后退一格;
s;\@'
}
*s.top ) return 0;
while (*--s,char e)
{
if (s：
利用描述规则输出最后的文本内容;
if (isempty (s) ==1)
return .base >
int size.base) return ，即退出到空格或所在行头为止.top .size ;
}
while (s;

void initestack (stack &s)
{
s!= EOF)
{
while (ch .top )
cout}
int main ()
{
stack s.base = (char *)malloc (N*sizeof (char))如果遇到‘#’;

typedef struct
{
char *base。
输入.base ;
if (;
char ch,e)<.base == s;

}
ch = getchar ();pop (s，即前一字符无效;
else
return 0，如果遇到@.top )
return 1!= s;
}stack,E);
}

void panduan (stack s)
{
char E.base != '
}

int pop (stack &s;n',e);endl;
if (;
char *top，表示前一单词无效;
ch = getchar ();)
panduan (s)!s!= EOF && ch ;
return 0.top 。采用栈实现,e);<
initestack (s).size +=M;

}
int isempty (stack &s)
{
if (s.base == s.size = N.top - s,char &e)
{
if (s，由各种字符构成;
s.size )
{
s.base +s。
输出;
else
if (ch == '
s。

# include <.base ;
while (ch ;
else
push (s

= EOF)
{
if (ch ;
}
int main ()
{
stack s;/)
panduan (s);#',e);
ch = getchar ();@'while要改为if
{
if (ch == '
if (isempty (s) ==1)
return != EOF && ch ;}//.top ){pop (s!=s;
}
while (s;e要改为ch
}
ch = getchar ()!= s!= '
cout {
char E;// pop (s;
initestack (s).base ;
while (s;
else if (ch == '
while (ch ;
char ch;
else
push (s;原来的输出有问题f
return 0.top ,ch);)/)
pop (s; /

void panduan (stack &amp;s) { char e; if (isempty (s) ==1) return ; while (s.top !=s.base )//原来你的判断不对 pop (s,e); } int main () { stack s; initestack (s); char ch;char e; ch = getchar (); while (ch != eof) { if (ch != eof &amp;&amp; ch != '\n')//while要改为if { if (ch == '#') pop (s,e); else if (ch == '@') panduan (s); else push (s,ch); //e要改为ch } ch = getchar (); } while (s.base != s.top ){pop (s,e); cout&lt;&lt;e&lt;&lt;endl;}//原来的输出有问题f return 0; }