Abstract
Many natural semantics specifications are intended to be deterministic: type systems, interpreters, and compilers usually have just one expected result. In contrast, specifications usually contain relations with several, often partially overlapping, rules. Executing a specification involves searching among rules for those that contribute to a successful completion. Much control information (choice points) is therefore created on a control stack to guide this search.
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.
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Pettersson, M. (1999). 6 Reducing Nondeterminism. In: Compiling Natural Semantics. Lecture Notes in Computer Science, vol 1549. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10693148_6
Download citation
DOI: https://doi.org/10.1007/10693148_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65968-6
Online ISBN: 978-3-540-48823-1
eBook Packages: Springer Book Archive