stack-based parsing
[/stæk beɪst ˈpɑːrsɪŋ/]
noun
análise sintática baseada em pilha
1. A parsing technique in computer science that uses a stack data structure to process and analyze the syntactic structure of input strings, commonly employed in compiler design and syntax analysis
Stack-based parsing is widely used in bottom-up parsers like LR and LALR parsers to build abstract syntax trees.
A análise sintática baseada em pilha é amplamente utilizada em analisadores bottom-up como analisadores LR e LALR para construir árvores de sintaxe abstrata.
2. A method of syntax analysis where intermediate results are stored on a stack as the parser processes tokens from left to right
The compiler uses stack-based parsing to recognize valid expressions and detect grammatical errors during compilation.
O compilador usa análise sintática baseada em pilha para reconhecer expressões válidas e detectar erros gramaticais durante a compilação.
This is a specialized technical term used primarily in computer science and compiler design fields. It is consistent across English and Portuguese technical documentation and academic literature. The term is rarely encountered in general conversation outside of programming and computer science contexts. Both Brazilian Portuguese and European Portuguese use identical terminology in technical settings.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →