The synthesis of loop predicates
Communications of the ACM
The intrinsically exponential complexity of the circularity problem for attribute grammars
Communications of the ACM
Formal languages and their relation to automata
Formal languages and their relation to automata
BIGMAC II: A FORTRAN language augmentation tool
ICSE '81 Proceedings of the 5th international conference on Software engineering
Hi-index | 0.00 |
The correctness of semantic-syntax-directed translators (SSDTs) is examined. SSDTs are a generalization of syntax-directed translators in which semantic information is employed to partially direct the translator. Sufficient conditions for an SSDT to be “semantic-preserving,” or “correct,” are presented. A further result shows that unless certain conditions are met, it is undecidable, in general, whether an SSDT is semantic-preserving.