On the number of registers needed to evaluate arithmetic expressions

DOI10.1007/BF01935328zbMath0219.68003OpenAlexW4235460666MaRDI QIDQ5624633

No author found.

Publication date: 1971

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01935328

Mathematics Subject Classification ID

General theory of computer systems (68M01)

Related Items (1)

Translation grammars for compilation and decompilation

Cites Work

• EULER: A generalization of ALGOL and its formal definition: Part 1
• On compiling algorithms for arithmetic expressions
• On arithmetic expressions and trees

This page was built for publication: On the number of registers needed to evaluate arithmetic expressions