Translation equations

Authors:
Steven Vere
Affiliations:
Univ. of California at Los Angeles, Los Angeles
Venue:
Communications of the ACM
Year:
1970

Citing 3
Cited 2

Derivatives of Regular Expressions

Journal of the ACM (JACM)
Syntax-Directed Transduction

Journal of the ACM (JACM)
Design of a separable transition-diagram compiler

Communications of the ACM

Design of an aerospace computer for direct HOL execution

HLLCA '73 Proceedings of the ACM-IEEE symposium on High-level-language computer architecture
Design of an aerospace computer for direct HOL execution

HLLCA '73 Proceedings of a symposium on High-level-language computer architecture

Quantified Score

Hi-index	48.22

Visualization

Abstract

Input limited transduction expressions, or translation equations, are used to describe the syntax and left-context sensitive semantics for context-free languages. A formal procedure is given for deriving from a set of translation equations the specifications for a pushdown translator. The translator consists of Mealy form finite-state automata interacting by means of a pushdown stack. Within the framework described, string recognition and parsing may be treated as special cases of the translation problem.