Abstract
In computer science one frequently encounters the task of specifying the semantics of a Context-free language. In detail, this means that there is a language L generated by a Context-free grammar and every string w ∈ L has a meaning, called the semantics of w; the semantics is an element of the carrier set of some semantic domain. Let us call the whole machinery which computes the semantics of w the semantics evaluator (Fig. 1.1). A typical occurrence is where L is a programming language, i.e, the strings are programs, and the semantics of a program w is the assembly code which is obtained by translating w into some assembly language.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Fülöp, Z., Vogler, H. (1998). Introduction. In: Syntax-Directed Semantics. Monographs in Theoretical Computer Science An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-72248-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-72248-6_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-72250-9
Online ISBN: 978-3-642-72248-6
eBook Packages: Springer Book Archive