Power, James F. and Malloy, Brian A. (2000) An approach for modeling the name lookup problem in the C++ programming language (extended version). In: SAC '00 Proceedings of the 2000 ACM symposium on Applied computing. ACM, pp. 792-796. ISBN 1581132409

Preview

Download (1MB) | Preview

Abstract

Formal grammars are well established for specifying the syntax of programming languages. However, the formal specification of programming language semantics has proven more elusive. A recent standard, the Unified Modeling Language (UML), has quickly become established as a common framework for the specification of large scale software applications. In this paper, we describe an approach for using the UML to specify aspects of the static semantics of programming languages. In particular, we describe a technique for solving the name lookup problem for the recently standardized C++ programming language. We apply our approach to C++ because a solution to the name lookup problem is required for parser construction and our solution can be applied to Java and other programming languages.

Item Type:	Book Section
Additional Information:	This is the extended version of the published paper, which was published iat DOI: 10.1145/338407.338564
Keywords:	modeling; name lookup problem; C++; programming language; Unified Modeling Language; UML; software applications;
Academic Unit:	Faculty of Science and Engineering > Computer Science
Item ID:	6460
Identification Number:	https://doi.org/10.1145/338407.338564
Depositing User:	Dr. James Power
Date Deposited:	12 Oct 2015 15:24
Publisher:	ACM
Refereed:	Yes
URI:	http://dl.acm.org
Use Licence:	This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here

Repository Staff Only(login required)

Item control page

Downloads

Origin of downloads