Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

Reference Attributed Grammars

Hedin, Görel LU orcid (2000) In Informatica 24(3). p.301-317
Abstract
An object-oriented extension to canonical attribute grammars is described, permitting attributes to be references to arbitrary nodes in the syntax tree, and attributes to be accessed via the reference attributes. Important practical problems such as name and type analysis for object-oriented languages can be expressed in a concise and modular manner in these grammars, and an optimal evaluation algorithm is available. An extensive example is given, capturing all the key constructs in object-oriented languages including block structure, classes, inheritance, qualified use, and assignment compatibility in the presence of subtyping. The formalism and algorithm have been implemented in APPLAB, an interactive language development tool.
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to journal
publication status
published
subject
in
Informatica
volume
24
issue
3
pages
301 - 317
publisher
SAGE Publications
external identifiers
  • scopus:0034268727
ISSN
0868-4952
language
English
LU publication?
yes
id
42369945-8949-4506-a212-280893694207 (old id 107069)
date added to LUP
2016-04-01 15:41:48
date last changed
2025-04-04 14:48:11
@article{42369945-8949-4506-a212-280893694207,
  abstract     = {{An object-oriented extension to canonical attribute grammars is described, permitting attributes to be references to arbitrary nodes in the syntax tree, and attributes to be accessed via the reference attributes. Important practical problems such as name and type analysis for object-oriented languages can be expressed in a concise and modular manner in these grammars, and an optimal evaluation algorithm is available. An extensive example is given, capturing all the key constructs in object-oriented languages including block structure, classes, inheritance, qualified use, and assignment compatibility in the presence of subtyping. The formalism and algorithm have been implemented in APPLAB, an interactive language development tool.}},
  author       = {{Hedin, Görel}},
  issn         = {{0868-4952}},
  language     = {{eng}},
  number       = {{3}},
  pages        = {{301--317}},
  publisher    = {{SAGE Publications}},
  series       = {{Informatica}},
  title        = {{Reference Attributed Grammars}},
  volume       = {{24}},
  year         = {{2000}},
}