Results 291 to 300 of about 1,902,940 (354)
Some of the next articles are maybe not open access.
Strategic tree rewriting in attribute grammars
Software Language Engineering, 2020This paper presents strategy attributes, a seamless integration of strategic term rewriting into attribute grammars. Strategy attributes are specified using rewrite rules with strategies that control their application.
Lucas Kramer, E. V. Wyk
semanticscholar +1 more source
Dependently Typed Attribute Grammars [PDF]
International Symposium on Implementation and Application of Functional Languages, 2010 Attribute Grammars (AGs) are a domain-specific language for functional and composable descriptions of tree traversals. Given such a description, it is not immediately clear how to state and prove properties of AGs formally. To meet this challenge, we apply dependent types to AGs.
Arie Middelkoop +2 more
semanticscholar +5 more sources
ACM SIGPLAN Notices, 1984
In this paper, attribute grammars are viewed as specifying translations from source language terms into target language terms. The terms are constructed over a hierarchical signature consisting of a semantic and a syntactic part. Attribute grammars are redefined to become morphisms in the category of such signatures, called attribute coupled grammars ...
Robert Giegerich, Harald Ganzinger
openaire +3 more sources
In this paper, attribute grammars are viewed as specifying translations from source language terms into target language terms. The terms are constructed over a hierarchical signature consisting of a semantic and a syntactic part. Attribute grammars are redefined to become morphisms in the category of such signatures, called attribute coupled grammars ...
Robert Giegerich, Harald Ganzinger
openaire +3 more sources
Attribute grammars made easier: EvDebugger a visual debugger for attribute grammars
2014 International Symposium on Computers in Education (SIIE), 2014Compiler construction courses are usually considered by the students as a difficult subject of the Computer Science degree. The main problem found by the students is to fully understand the theoretical concepts taught during the course and its practical application to build a compiler.
Daniel Rodriguez-Cerezo +2 more
semanticscholar +3 more sources
Monadification of attribute grammars
Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering, 2020We describe a monadification process for attribute grammars for more concisely written attribute equations, closer to the style of inference rules used in traditional typing and evaluation specifications. Inference rules specifying, for example, a typing relation typically consider only typable expressions, whereas well-defined attribute grammars ...
Eric Van Wyk, Dawn Michaelson
openaire +2 more sources
On Generalization of Attribute Grammars
Systems and Computers in Japan, 1996AbstractAn attribute grammar is a formal system consisting of a context‐free grammar together with semantic rules, which enables us to describe not only the syntax but also the semantics of language. The limited framework of attribute grammar, however, is not conducive to expansion of the system and the many ambiguous definitions of attribute grammar ...
Takuya Katayama, Yutaka Kikuchi
openaire +2 more sources
Parallel schedule synthesis for attribute grammars
ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, 2013We examine how to synthesize a parallel schedule of structured traversals over trees. In our system, programs are declaratively specified as attribute grammars.
Leo A. Meyerovich +3 more
semanticscholar +1 more source
Apex graph grammars and attribute grammars
Acta Informatica, 1988Apex graph grammars are a particular type of directed node-label controlled (DNLC) graph grammars: the embedding edges are established between terminal nodes only. Apex graph grammars, slightly generalized, can generate the sets of dependency graphs of attribute grammars.
Joost Engelfriet +2 more
openaire +2 more sources
Efficient Model-based Fuzz Testing Using Higher-order Attribute Grammars
Journal of Software, 2013Format specifications of data input are critical to model-based fuzz testing. Present methods cannot describe the format accurately, which leads to high redundancy in testing practices.
Fan Pan +4 more
semanticscholar +1 more source
Proceedings of the 14th ACM SIGPLAN Workshop on Erlang, 2015
Many functions take a value of a particular (recursive) data structure as input and compute an output value by traversing the structure and collect, combine, or update values in that data structure. Some examples are: collecting all hyperlink tags in a HTML tree, calculating the depth of a binary tree, or adding a prefix to every free variable name in ...
Alex Gerdes, Ulf Norell
openaire +2 more sources
Many functions take a value of a particular (recursive) data structure as input and compute an output value by traversing the structure and collect, combine, or update values in that data structure. Some examples are: collecting all hyperlink tags in a HTML tree, calculating the depth of a binary tree, or adding a prefix to every free variable name in ...
Alex Gerdes, Ulf Norell
openaire +2 more sources