Results 271 to 280 of about 26,644 (283)
Some of the next articles are maybe not open access.
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
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
Attribute Grammars and Analysis
2011In the Chapter 7, we concentrated on the discussion of parsing methods, i.e. the top-down and bottom-up syntactical methods, especially LL(1) and LR(1) syntactical analysis methods. From the discussion, we can see that in order to carry out LL(1) or LR(1) syntactical analysis there is a need for the premise that the grammar to be analyzed is a context ...
Yunlin Su, Song Y. Yan
openaire +2 more sources
Translation of attribute grammars into procedures
ACM Transactions on Programming Languages and Systems, 1984An efficient method for evaluating attribute grammars by translating them into sets of procedures is presented. The basic idea behind the method is to consider nonterminal symbols of the grammar as functions that map their inherited attributes to their synthesized attributes.
openaire +3 more sources
BIT, 1990
Evaluation of inherited attributes is a problem in conjunction with LR parsing, because the derivation tree is incomplete during parsing. An evaluation scheme for inherited attributes is presented based on a restricted grammar class, uncle-attributed grammars. A transformation to the uncle-attributed form is described for L-attributed grammars.
openaire +2 more sources
Evaluation of inherited attributes is a problem in conjunction with LR parsing, because the derivation tree is incomplete during parsing. An evaluation scheme for inherited attributes is presented based on a restricted grammar class, uncle-attributed grammars. A transformation to the uncle-attributed form is described for L-attributed grammars.
openaire +2 more sources