Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2384716.2384748acmconferencesArticle/Chapter ViewAbstractPublication PagessplashConference Proceedingsconference-collections
poster

The spoofax name binding language

Published: 19 October 2012 Publication History

Abstract

In textual software languages, names are used to identify program elements such as variables, methods, and classes. Name analysis algorithms resolve names in order to establish references between definitions and uses of names. In this poster, we present the Spoofax Name Binding Language (NBL), a declarative meta-language for the specification of name binding and scope rules, which departs from the programmatic encodings of name binding provided by regular approaches. NBL aspires to become the universal language for name binding, which can be used next to BNF definitions in reference manuals, as well as serve the generation of implementations.

References

[1]
M. Bravenboer, K. T. Kalleberg, R. Vermaas, and E. Visser. Stratego/XT 0.17. A language and toolset for program transformation. SCP, 72(1-2):52--70, 2008.
[2]
M. Bravenboer, A. van Dam, K. Olmos, and E. Visser. Program transformation with scoped dynamic rewrite rules. FUIN, 69(1-2):123--178, 2006.
[3]
T. Ekman and G. Hedin. Modular name analysis for java using jastadd. In GTTSE, pages 422--436, 2006.
[4]
U. Kastens and W. M. Waite. Modularity and reusability in attribute grammars. ACTA, 31(7):601--627, 1994.
[5]
L. C. L. Kats and E. Visser. The Spoofax language workbench: rules for declarative specification of languages and IDEs. In OOPSLA, pages 444--463, 2010.
[6]
G. Konat, L. C. L. Kats, G. Wachsmuth, and E. Visser. Language-parametric name resolution based on declarative name binding and scope rules. In SLE, 2013.

Cited By

View all
  • (2020)Strategic tree rewriting in attribute grammarsProceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering10.1145/3426425.3426943(210-229)Online publication date: 16-Nov-2020
  • (2015)A Refactoring Library for Scala Compiler ExtensionsCompiler Construction10.1007/978-3-662-46663-6_2(31-48)Online publication date: 2015
  • (2014)Prototyping SDL ExtensionsSystem Analysis and Modeling: Models and Reusability10.1007/978-3-319-11743-0_21(304-311)Online publication date: 2014

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SPLASH '12: Proceedings of the 3rd annual conference on Systems, programming, and applications: software for humanity
October 2012
252 pages
ISBN:9781450315630
DOI:10.1145/2384716

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 October 2012

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. declarative
  2. meta-language
  3. name binding
  4. name resolution
  5. spoofax

Qualifiers

  • Poster

Conference

SPLASH '12
Sponsor:

Upcoming Conference

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)4
  • Downloads (Last 6 weeks)2
Reflects downloads up to 15 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2020)Strategic tree rewriting in attribute grammarsProceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering10.1145/3426425.3426943(210-229)Online publication date: 16-Nov-2020
  • (2015)A Refactoring Library for Scala Compiler ExtensionsCompiler Construction10.1007/978-3-662-46663-6_2(31-48)Online publication date: 2015
  • (2014)Prototyping SDL ExtensionsSystem Analysis and Modeling: Models and Reusability10.1007/978-3-319-11743-0_21(304-311)Online publication date: 2014

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media