Results 241 to 250 of about 444,657 (298)
Some of the next articles are maybe not open access.
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
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
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
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
Software: Practice and Experience, 1993
AbstractContrary to a widely‐held belief, it is possible to construct executable specifications of language processors that use a top‐down parsing strategy and which have structures that directly reflect the structure of grammars containing left‐recursive productions.
openaire +2 more sources
AbstractContrary to a widely‐held belief, it is possible to construct executable specifications of language processors that use a top‐down parsing strategy and which have structures that directly reflect the structure of grammars containing left‐recursive productions.
openaire +2 more sources
Relating attribute grammars and lexical-functional grammars
Information Sciences, 1992zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Testing attribute grammars for circularity
Acta Informatica, 1982The problem of deciding whether a given attribute grammar is noncircular is known to require exponential time for infinitely many grammars. Here the time requirement of a simple circularity test is analyzed. It is shown that the reason for the exponential time requirement is the number of graphs in a collection formed for every nonterminal.
Mikko Saarinen, Kari-Jouko Räihä
openaire +3 more sources
Journal of the ACM, 2005
Describing the static semantics of programming languages with attribute grammars is eased when the formalism allows direct dependencies to be induced between rules for nodes arbitrarily far away in the tree. Such direct non-local dependencies cannot be analyzed using classical methods, which enable efficient ...
openaire +2 more sources
Describing the static semantics of programming languages with attribute grammars is eased when the formalism allows direct dependencies to be induced between rules for nodes arbitrarily far away in the tree. Such direct non-local dependencies cannot be analyzed using classical methods, which enable efficient ...
openaire +2 more sources
An attribute grammar view [PDF]
, 1994 Controlled M-grammars, defined formally in Chapter 17, are essentially different from M-grammars without control. The set of well-formed derivation trees is defined at two levels instead of one. The control expressions define a superset of this set of derivation trees, and M-rule applications filter out the ill-formed ones from this superset.
openaire +1 more source