Titlebook: Syntax-Directed Semantics; Formal Models Based Zoltán Fül?p,Heiko Vogler Book 1998 Springer-Verlag Berlin Heidelberg 1998 Baumtransformato

overbearing

Two Examples,atures. This yields the formal model of so called many-sorted macro attributed tree transducer, and the two functions will be formalized by means of such transducers. The first function is the contextual analysis of a small, block-structured programming language. The second function is the insertion function in 2–3 trees.

climax

Introduction,anguage . generated by a Context-free grammar and every string . ∈ . has a meaning, called the semantics of .; the semantics is an element of the carrier set of some semantic domain. Let us call the whole machinery which computes the semantics of . the . (Fig. 1.1). A typical occurrence is where . i

evaculate

與野獸博斗者

Attributed Tree Transducers,tribute grammars. It can also handle context information like a macro tree transducer, and in this sense it too is more powerful than a top-down tree transducer. However, attributed tree transducers treat context information in an explicit way rather than implicitly as macro tree transducers do.

褻瀆

Comparison of Induced Tree Transformation Classes,wn tree transducers in the sense that they can handle context information. In this chapter we aim to compare the power of macro tree transducers and attributed tree transducers. We collect all the inclusions which relate the classes ., and their subclasses into an inclusion diagram. Moreover, we pre

Hallowed

Macro Attributed Tree Transducers,ttributed tree transducer, respectively. Whereas the first one handles context in an implicit way by allowing the meaning names (i.e., states) to have parameters, the second one deals with context information in an explicit way by introducing context names (i.e., inherited attributes).

挫敗

Two Examples,tree transducers. Clearly, our formal models are rather archaic, e.g., they abstract from many-sortedness and from concrete computations in particular semantic domains. Thus, in order to provide a more realistic specification language, we will enrich macro attributed tree transducers by these two fe

antidote

保留

Introduction,ier set of some semantic domain. Let us call the whole machinery which computes the semantics of . the . (Fig. 1.1). A typical occurrence is where . is a programming language, i.e, the strings are programs, and the semantics of a program . is the assembly code which is obtained by translating . into some assembly language.

DAUNT