Mutual recursion: Difference between revisions

Revision as of 15:23, 18 November 2017

Revision as of 15:49, 18 November 2017

Line 1:

<!-- [[WP:NFCC]] violation: [[File:DrawingHands.jpg|thumb|upright|"[[Drawing Hands]]", a drawing by [[M. C. Escher]]]] -->EnIn [[mathematics]] y enand [[cienciascomputer de la computaciónscience]], la '''recursiónmutual mutuarecursion''' esis unaa formaform deof recursión[[recursion]] dondewhere dostwo objetosmathematical matemáticosor ocomputational computacionalesobjects, comosuch funcionesas ofunctions tiposor dedata datostypes, sonare definidosdefined unoin enterms términosof deeach otro.other.<ref>Manuel Rubio-Sánchez, Jaime Urquiza-Fuentes,Cristóbal Pareja-Flores (2002), 'A Gentle Introduction to Mutual Recursion', Proceedings of the 13th annual conference on Innovation and technology in computer science education, June 30–July 2, 2008, Madrid, Spain.</ref> LaMutual recursiónrecursion mutuais esvery muycommon común enin [[functional programming]] yand algunosin problemassome deproblem dominiodomains, como ensuch analizadores sintácticos de recursión descendienteas [[recursive descent parser]]s, dondewhere losthe tiposdata detypes datosare sonnaturally naturalmentemutually mutuamente recursivosrecursive.

==Examples==