Strictness Analysis for Attribute Grammars

    Research output: Chapter in Book/Report/Conference proceedingBook chapterResearch

    Abstract

    Attribute grammars may be seen as a (rather specialised) lazy or demand-driven programming language. The ``programs'' in this language take text or parse trees as input and return values of the synthesised attributes to the root as output. From this observation we establish a framework for abstract interpretation of attribute grammars. The framework is used to construct a strictness analysis for attribute grammars. Results of the analysis enable us to transform an attribute grammar such that attributes are evaluated during parsing, if possible. The analysis is proved correct by relating it to a fixpoint semantics for attribute grammars. An implementation of the analysis is discussed and some extensions to the analysis are mentioned.
    Original languageEnglish
    Title of host publicationProgramming Language Implementation and Logic Programming
    EditorsMaurice Bruynooghe, Martin Wirsing
    Number of pages13
    PublisherKluwer Academic Publishers
    Publication date1992
    Pages145-157
    ISBN (Print)3-540-55844-6
    Publication statusPublished - 1992
    SeriesLecture Notes in Computer Science
    Volume631
    ISSN0302-9743

    Cite this

    Rosendahl, M. (1992). Strictness Analysis for Attribute Grammars. In M. Bruynooghe, & M. Wirsing (Eds.), Programming Language Implementation and Logic Programming (pp. 145-157). Kluwer Academic Publishers. Lecture Notes in Computer Science, Vol.. 631
    Rosendahl, Mads. / Strictness Analysis for Attribute Grammars. Programming Language Implementation and Logic Programming. editor / Maurice Bruynooghe ; Martin Wirsing. Kluwer Academic Publishers, 1992. pp. 145-157 (Lecture Notes in Computer Science, Vol. 631).
    @inbook{1317006052be11dba4bc000ea68e967b,
    title = "Strictness Analysis for Attribute Grammars",
    abstract = "Attribute grammars may be seen as a (rather specialised) lazy or demand-driven programming language. The ``programs'' in this language take text or parse trees as input and return values of the synthesised attributes to the root as output. From this observation we establish a framework for abstract interpretation of attribute grammars. The framework is used to construct a strictness analysis for attribute grammars. Results of the analysis enable us to transform an attribute grammar such that attributes are evaluated during parsing, if possible. The analysis is proved correct by relating it to a fixpoint semantics for attribute grammars. An implementation of the analysis is discussed and some extensions to the analysis are mentioned.",
    author = "Mads Rosendahl",
    year = "1992",
    language = "English",
    isbn = "3-540-55844-6",
    pages = "145--157",
    editor = "Maurice Bruynooghe and Martin Wirsing",
    booktitle = "Programming Language Implementation and Logic Programming",
    publisher = "Kluwer Academic Publishers",

    }

    Rosendahl, M 1992, Strictness Analysis for Attribute Grammars. in M Bruynooghe & M Wirsing (eds), Programming Language Implementation and Logic Programming. Kluwer Academic Publishers, Lecture Notes in Computer Science, vol. 631, pp. 145-157.

    Strictness Analysis for Attribute Grammars. / Rosendahl, Mads.

    Programming Language Implementation and Logic Programming. ed. / Maurice Bruynooghe; Martin Wirsing. Kluwer Academic Publishers, 1992. p. 145-157 (Lecture Notes in Computer Science, Vol. 631).

    Research output: Chapter in Book/Report/Conference proceedingBook chapterResearch

    TY - CHAP

    T1 - Strictness Analysis for Attribute Grammars

    AU - Rosendahl, Mads

    PY - 1992

    Y1 - 1992

    N2 - Attribute grammars may be seen as a (rather specialised) lazy or demand-driven programming language. The ``programs'' in this language take text or parse trees as input and return values of the synthesised attributes to the root as output. From this observation we establish a framework for abstract interpretation of attribute grammars. The framework is used to construct a strictness analysis for attribute grammars. Results of the analysis enable us to transform an attribute grammar such that attributes are evaluated during parsing, if possible. The analysis is proved correct by relating it to a fixpoint semantics for attribute grammars. An implementation of the analysis is discussed and some extensions to the analysis are mentioned.

    AB - Attribute grammars may be seen as a (rather specialised) lazy or demand-driven programming language. The ``programs'' in this language take text or parse trees as input and return values of the synthesised attributes to the root as output. From this observation we establish a framework for abstract interpretation of attribute grammars. The framework is used to construct a strictness analysis for attribute grammars. Results of the analysis enable us to transform an attribute grammar such that attributes are evaluated during parsing, if possible. The analysis is proved correct by relating it to a fixpoint semantics for attribute grammars. An implementation of the analysis is discussed and some extensions to the analysis are mentioned.

    M3 - Book chapter

    SN - 3-540-55844-6

    SP - 145

    EP - 157

    BT - Programming Language Implementation and Logic Programming

    A2 - Bruynooghe, Maurice

    A2 - Wirsing, Martin

    PB - Kluwer Academic Publishers

    ER -

    Rosendahl M. Strictness Analysis for Attribute Grammars. In Bruynooghe M, Wirsing M, editors, Programming Language Implementation and Logic Programming. Kluwer Academic Publishers. 1992. p. 145-157. (Lecture Notes in Computer Science, Vol. 631).