Modelling and Specifying Name Visibility and Binding Semantics
Technical Report, CMU//CS-93-158. Carnegie Mellon University, School of Computer Science, (July 1993)Abstract
This paper describes visibility networks, a graphical model of static
name visibility and binding. A visibility network is a visual representation
of the search algorithm performed when binding a name reference to
a declaration. In conjunction with an extended attribute grammar
mechanism, visibility networks allow clear and precise specification
of the naming semantics of programming languages. The power of the
model is demonstrated through its description of several examples
of complex visibility constraints in Ada. As a specification technique,
the model has several advantages for the language designer, including
support for prototyping, analysis, formal description, and documentation
of naming semantics. Similar advantages make the visibility network
model pedagogically attractive. Finally, it has been demonstrated
that the specifications can be used to automatically generate naming
semantics modules for compilers and language-based editors, reducing
the burden of the language implementor.
Description
Attribute Grammar