Abstract

Algebraic specifications of programming languages can be used to generate language-specific programming support tools. Some of these can be obtained in a straightforward way by executing language specifications as term rewriting systems. More advanced tools can be obtained if the term rewriting machinery is extended with origin tracking . Origin tracking is a technique which automatically establishes a relation between subterms of the result value (normal form) and their origins , which are subterms of the initial term. For specifications having a syntax-directed nature, as formalized by the class of so-called primitive recursive schemes, high-quality origins can be established. The definition, properties, extensions, and implementation of these so-called syntax-directed origins are discussed.

Citations