The Design and Implementation of a Translator for Arithmetic and Boolean Expressions

摘要

This paper describes an algorithm for scanning commands of a specific query language for a data management system. The commands include relational, arithmetic assignment, and Boolean expressions. The algorithm accepts the expressions in conventional infix notation, transforms them into postfix notation, then into an efficient set of computing steps known as ordered triples. Structured programming is used in that extensive, indented comments form the structure and FORTRAN code carries out the instructions of the comments. (Author)