Attribute grammars in Erlang
Paper in proceedings, 2015

Attribute grammars provide a modular way of defining functions over tree-shaped data, allowing each aspect of the computation to be defined as a separate attribute. We present the design and implementation of an attribute grammar system for Erlang that lets you define attributes elegantly using a special purpose syntax. In addition to the tree traversals supported by traditional attribute grammar systems, our system also provides unfold operations that makes it possible to use attributes when constructing data. Our attributes can be used to write QuickCheck generators.

Erlang

QuickCheck

data generation

Attribute grammar

Author

Ulf Norell

Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

Alex Gerdes

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Proceedings of the Fourteenth ACM SIGPLAN Workshop on Erlang

1-12

Areas of Advance

Information and Communication Technology

Subject Categories

Computer and Information Science

DOI

10.1145/2804295.2804296

ISBN

978-1-4503-3805-9

More information

Created

10/7/2017