A proof of Hamblin's algorithm for translation of arithmetic expressions from infix to postfix form

DOI10.1007/BF01933539zbMath0174.48403OpenAlexW2071580469MaRDI QIDQ5563105

Derick Wood

Publication date: 1969

Published in: BIT (Search for Journal in Brave)

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

zbMATH Keywords

numerical analysis

Related Items (1)

Proving programs correct: Some techniques and examples

Uses Software

• ALGOL 60

Cites Work

• Revised report on the algorithmic language ALGOL 60
• Translation to and from Polish Notation
• Unnamed Item

This page was built for publication: A proof of Hamblin's algorithm for translation of arithmetic expressions from infix to postfix form