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.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
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. Sun's specification disallows recursive subroutines, as do our rules, but Sun's reference implementation allows recursion in certain cases.
Full browser ?