An algorithm for inverting certain translators of context-free languages
Dave Goodwin · The Computer Journal · 1975
This paper considers translators between related pairs of context-free languages. These translators are defined as grammars for input to a syntax-directed translation system on the lines of Metcalfe (1964) and Reeves (1967). By applying a simple algorithm to each of the production rules of such a grammar it is shown how to derive the inverse translator, under given conditions.