recursive subroutine


Also found in: Dictionary.

recursive subroutine

[ri′kər·siv ′səb·rü‚tēn]
(computer science)
A reentrant subroutine whose partial results are stacked, with a processor stack pointer advancing and retracting as the subroutine is called and completed.
References in periodicals archive ?
RECURSIVE SUBROUTINE interpolate(comm,f,t_want,y_want,yderiv_want) TYPE(rk_comm), INTENT(INOUT) :: comm INTERFACE FUNCTION f(t,y) type(independent variable), INTENT(IN) :: t type(dependent variable), dimension, INTENT(IN) :: y type(dependent variable), dimension(y) :: f END FUNCTION END INTERFACE type(independent variable), INTENT(IN) :: t_want type(dependent variable), dimension, OPTIONAL, INTENT(OUT) y_want, & yderiv_want
Our rules differ from Sun's reference implementation in the handling of recursive subroutines.
Full browser ?