Abstract
Lists and optional elements are such an important aspect of editor specifications that they deserve to be discussed in more detail. Although iterated elements (lists) and optional elements are concepts that are commonly found in many extended BNF notations, the form that they take in the Synthesizer Specification Language is different from the familiar notions. The chief motivation for SSL’s notation for lists and optional elements is to provide a uniform notation for specifying the attribution of terms and their unparsing. The attribute equations and, with one small exception, the unparsing declarations that one writes for list phyla and optional phyla are no different in form from those that are used for ordinary phyla. For example, because all lists are terminated by an instance of the list phylum’s nullary operator, there is no need for special-case rules covering the cases of an empty list, a singleton list, and a list of length two or more, as would otherwise have been necessary.
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
© 1989 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Reps, T.W., Teitelbaum, T. (1989). Lists, Optional Elements, and Placeholders. In: The Synthesizer Generator. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9623-9_5
Download citation
DOI: https://doi.org/10.1007/978-1-4613-9623-9_5
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-9625-3
Online ISBN: 978-1-4613-9623-9
eBook Packages: Springer Book Archive