bottom-up computation
[ˈbɒtəm-ʌp kəmˌpjuːˈteɪʃən]
nounpl: bottom-up computations
computação ascendente
1. A computational approach that starts from the smallest or most basic elements and progressively combines them to build larger, more complex structures or results
The compiler uses bottom-up computation to parse the source code from individual tokens to complete abstract syntax trees.
O compilador usa computação ascendente para analisar o código-fonte a partir de tokens individuais até árvores de sintaxe abstratas completas.
2. In parsing theory, a method that begins with input symbols and applies reduction rules to build up a parse tree until reaching the start symbol
Bottom-up computation is commonly used in shift-reduce parsers for language processing.
A computação ascendente é comumente usada em analisadores shift-reduce para processamento de linguagem.
3. A recursive strategy where subproblems are solved first and their results are combined to solve larger problems
Dynamic programming often employs bottom-up computation to avoid redundant calculations.
Programação dinâmica frequentemente emprega computação ascendente para evitar cálculos redundantes.
This is a specialized technical term used primarily in computer science and compiler design education in both Brazil and the USA. It represents a fundamental computational paradigm taught in universities and used in professional software development. The term is language-independent and maintains the same meaning across English and Portuguese technical communities.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →