last call optimisation
Normally when procedure A call s procedure s B, C, .., Z, the environment of procedure A i s only di scarded when procedure Z return s and procedure A it self terminate s. U sing la st call optimi sation, A' s environment i s di scarded a s Z i s called. Thi s allow s arbitrarily deep ne sting of procedure call s without con suming memory to store u sele ss environment s. A special ca se of thi s i s tail recur sion optimi sation where the la st procedure called i s the calling procedure it self. style="border-width:thin; border-color:#333333; border-style:dashed; padding:5px;" align="left">In addition suitable contents: [ ai ] [ al ] [ an ] [ ar ] [ as ] [ at ] [ B ] [ b ] [ bi ] [ bit ] [ C ] [ ca ] [ card ] [ case ] [ ci ] [ co ] [ con ] [ cons ] [ cu ] [ de ] [ disc ] [ du ] [ ec ] [ ed ] [ edu ] [ ee ] [ environment ] [ er ] [ es ] [ et ] [ h ] [ il ] [ in ] [ io ] [ ir ] [ iron ] [ is ] [ it ] [ la ] [ li ] [ ls ] [ ly ] [ ma ] [ mall ] [ memory ] [ mo ] [ N ] [ na ] [ ne ] [ ng ] [ nl ] [ ns ] [ op ] [ pe ] [ pr ] [ procedure ] [ pt ] [ re ] [ recursion ] [ ro ] [ sa ] [ sc ] [ se ] [ si ] [ spec ] [ st ] [ store ] [ su ] [ sum ] [ T ] [ tail recursion ] [ tail recursion optimisation ] [ th ] [ to ] [ tr ] [ um ] [ us ] [ vi ] [ ws ] [ Z ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (2585 Reads) |