Форум программистов [Powered by Invision Power Board]

Код

const
max=1000;
type
 STACK = record
          top:integer;
          elem:array [1..max] of char;
         end;
 {---------------------------------------}
   procedure MakeNull (var S:STACK);
       begin
         S.top:=max + 1;
       end;
{---------------------------------------}
   function Empty (var S:Stack):boolean;
       begin
        if S.top > max then
           Empty:=true
        else
           Empty:=false;
       end;
{----------------------------------------}
   function Top( s : stack) : char;
  begin
    if Empty(s) then
      exit
    else
      Top := s.elem[s.top];
  end;
{---------------------------------------}
   procedure OutStack (var s:stack; var x: char);
      begin
        if Empty (s) then exit
       else
        begin
         x:= s.elem[s.top];
         s.top:=S.top + 1;
        end;
      end;
{---------------------------------------}
   procedure Instack (var S:Stack;x:char);
      begin
        if S.top = 1 then exit
       else
            begin
             s.top:=s.top-1;
             s.elem[s.top]:=x;
            end ;
       end;
{----------------------------------------}
   function Prior(f : char) : Byte;
begin
    case f of
       '+','-' : prior := 2;
       '*','/' : prior := 3;
       '(' , ')' : prior := 1;
        else
     prior := 0;
    end;
end;
{----------------------------------------}
  procedure opz ( input: string; var output:string);
    var
     i: integer; s,s2:stack;
     t: boolean; elem:char;
      begin
       write ('Inp = ');
       readln (input);
        for i:=1 to length (input) do
          case input[i] of
           '1'..'9': begin
                      output:=output+input[i];
                     end;

    '+','-','*','/': begin
                      t:=empty(s);
                       if t then instack (s,input[i]);
                        if t=false then
                       begin
                        if prior(top(s)) < prior(input[i]) then instack (s,input[i])
                       else
                        if prior(top(s))>= prior(input[i]) then
                          while prior(top(s))>= prior(input[i]) do
                            begin
                             outstack (s,elem);
                             instack  (s2,elem);
                            end;
                            instack (s,input[i]);
                        end;
                      end;
                     end;



  for i:=max downto s.top do
   output:=output+s.elem[i];
  for i:=max downto s2.top do
   output:=output+s.elem[i];
   end;

  var
   outp,inp:string;
    begin
     OPZ (inp,outp);
      writeln ('out = ',outp);
      readln;
     end.