pertaining to or using a rule or procedure that can be applied repeatedly.
Mathematics, Computers. pertaining to or using the mathematical process of recursion:
a recursive function; a recursive procedure.
- Recursive acronym
convention A hackish (and especially MIT) tradition is to choose acronyms and abbreviations that refer humorously to themselves or to other acronyms or abbreviations. The classic examples were two MIT editors called EINE (“EINE Is Not Emacs”) and ZWEI (“ZWEI Was EINE Initially”). More recently, there is a Scheme compiler called LIAR (Liar Imitates Apply […]
noun, Logic. 1. a definition consisting of a set of rules such that by repeated application of the rules the meaning of the definiendum is uniquely determined in terms of ideas that are already familiar.
- Recursive descent parser
grammar A “top-down” parser built from a set of mutually-recursive procedures or a non-recursive equivalent where each such procedure usually implements one of the productions of the grammar. Thus the structure of the resulting program closely mirrors that of the grammar it recognises. [“Recursive Programming Techniques”, W.H. Burge, 1975, ISBN 0-201-14450-6]. (1995-04-28)
- Recursive function
noun 1. (logic, maths) a function defined in terms of the repeated application of a number of simpler functions to their own values, by specifying a base clause and a recursion formula