Results 261 to 270 of about 26,519 (281)
Some of the next articles are maybe not open access.
Apex graph grammars and attribute grammars
Acta Informatica, 1988In diesem Artikel werden die ADG Graph-Grammatiken (attribute dependency graph grammars) definiert und mit anderen Klassen von Graph-Grammatiken verglichen. Die Untersuchung ist anhand der DNLC (directed node-label controlled) Graph-Grammatiken durchgeführt, die auf dem Rewriting- Mechanismus von kontextfreien Sprachen basieren.
Joost Engelfriet +2 more
openaire +3 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
Finding circular attributes in attribute grammars
Journal of the ACM, 1999The problem of finding the circular attributes in an grammar is considered. Two algorithms are proposed: the first is polynomial but yields conservative results while the second is exact but is potentially expontial. It is also shown that finding the circular attributes is harder than testing circularity.
Michael Rodeh, Mooly Sagiv
openaire +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
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
Reflection in attribute grammars
Proceedings of the 18th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences, 2019This paper shows how reflection on (undecorated) syntax trees used in attribute grammars can significantly reduce the amount of boiler-plate specifications that must be written. It is implemented in the Silver attribute grammar system in the form of a reflect function mapping syntax trees and other values into a generic representation and a reify ...
Ted Kaminski, Eric Van Wyk, Lucas Kramer
openaire +2 more sources
Modularity and reusability in attribute grammars
Acta Informatica, 1994zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uwe Kastens, William M. Waite
openaire +3 more sources
Introduction to attribute grammars
1991This paper recalls the definition of attribute grammars. To give a first impression of the applicability and the power of attribute grammars two examples are given which describe the type-determination problem for simple arithmetic expressions. Also, Knuth's circularity test for attribute grammars is described.
openaire +3 more sources
Verification of attribute grammar
Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '81, 1981Verification of attribute grammar is discussed. As is widely recognized, attribute grammar of Knuth [8] is a very convenient device to describe semantics of programming languages, especially in automating compiler construction. Many efforts have been made to obtain efficient evaluators for attribute grammar [1,3,4,5,7,10] so that efficient compilers ...
Takuya Katayama, Yutaka Hoshino
openaire +2 more sources