recursive transformation
[rɪˈkɝːsɪv trænsˌfɔrˈmeɪʃən]
nounpl: recursive transformations
transformação recursiva
1. A process or operation that applies a transformation rule repeatedly to its own output, where each iteration uses the result of the previous iteration as input
The recursive transformation of the data structure continued until it reached the base case.
A transformação recursiva da estrutura de dados continuou até atingir o caso base.
2. In computer science and mathematics, a method of solving a problem by breaking it down into smaller instances of the same problem
Recursive transformation is often used in compiler design to parse nested expressions.
A transformação recursiva é frequentemente usada no design de compiladores para analisar expressões aninhadas.
3. A technique in data processing where a function or rule calls itself with modified parameters
The algorithm uses recursive transformation to flatten nested lists.
O algoritmo usa transformação recursiva para achatar listas aninhadas.
This is a specialized technical term primarily used in computer science, mathematics, and programming contexts. It is universally understood in academic and professional technology settings in both Brazil and Portugal. The term has no colloquial usage and remains consistent across English and Portuguese technical communities.
Related Idioms & Phrases
to recurse infinitely - entrar em recursão infinita
to hit the base case - atingir o caso base
to unwind the recursion - desdobrar a recursão
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →