test1.out

this is a lp0 compilator new

::::::::::::::
test1.pas
::::::::::::::
PROGRAM Compx_Test;

VAR
  x, y, i 		: INTEGER;

PROCEDURE Foo2 ( l, r: INTEGER );
VAR
  i, j 			: INTEGER;

PROCEDURE Foo1 ( Lo, Hi: INTEGER );

BEGIN { Foo1 }
   Foo2 ( Lo, Hi );
   Hi := Lo + Hi;
END;

BEGIN
   FOR i := 1 TO l DO
      FOR j := 1 to i DO
         r := r + 1;
   Foo1 ( i, j );
END;

PROCEDURE Foo1 ( Lo, Hi: INTEGER );

BEGIN { Foo1 }
   Foo2 ( Lo, Hi );
   Hi := Lo + Hi;
END;

BEGIN { Compx_Test }

   { Check assignment statements.  Should have constant complexity }
   x := 10;

   { Check FOR loops. }
   FOR i := 1 TO ( x + y + 2 ) DO
      BEGIN
         y := y + 1;
         Foo1 ( i, y );
         Foo2 ( i, y );
      END;

END.

::::::::::::::
compx.sym
::::::::::::::


Symbol Table for Pascal source code...
-----------------------------------
1(undefined)
10(undefined)
2(undefined)
compx_test(program)
foo1(procedure)	[Maple Function Name = c(n)]
foo2(procedure)	[Maple Function Name = a(n)]
hi(undefined)
i(variable)
integer(undefined)
j(variable)
l(undefined)
lo(undefined)
r(undefined)
x(variable)
y(variable)

::::::::::::::
compx.mpl
::::::::::::::
assign ( rsolve ( c(n)=a(n)+1+1+1, c(n) ) );
assign ( rsolve ( a(n)=1+1+sum (1+1+sum (1+1+1, j=1..i), i=1..l)+c(n), a(n) ) );
assign ( rsolve ( f(n)=1+1+1+1+1+1+sum (1+1+1+c(n)+a(n), i=1..( x+y+2 )), f(n) ) );