Journal of the ACM · 1962 · 29 citations · 2 references
ComputingComputer ScienceMathematicsComputational LinguisticsNatural Language ProcessingTranslation TheoryBoolean AlgebraMachine TranslationSyntactic AnalysisBoolean Expressions
This paper describes an algorithm for scanning Boolean expressions. Such an algorithm takes a complex, relational expression and transforms it into an optimal set of computing steps. The result is optimal in the sense that no redundant evaluations are made. The particular algorithm described is advantageous in that, as a variant of a well-known *
2
On GAT and the construction of translators
Bruce W. Arden, Rumi Graham · Communications of the ACM · 1959 · 29 citations · Full text