Results 231 to 240 of about 444,657 (298)
Ordered attributed grammars [PDF]
Acta Informatica, 1980 Ordered attributed grammars are defined as a large subclass of semantically well-defined attributed grammars proposed by Knuth. An attributed grammar is ordered if for each symbol a partial order over the associated attributes can be given, such that in any context of the symbol the attributes are evaluable in an order which includes that partial order.
U. Kastens
semanticscholar +4 more sources
The Hierarchy of LR-Attributed Grammars [PDF]
Attribute Grammars and their Applications, 1990 The problem of attribute evaluation during LR parsing is considered. Several definitions of LR-attributed grammars are presented. Relations of corresponding attribute grammar classes are analysed. Also the relations between LR-attributed grammars and LL-attributed grammars and between LR-attributed grammars and a class of one-pass attributed grammars ...
R. O. D. Akker, B. Melichar, J. Tarhio
semanticscholar +5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
ECLR-attributed grammars: A practical class of LR-attributed grammars
Information Processing Letters, 1987A class of attribute grammars called LR-attributed grammars (LR-AGs) has been proposed by Jones and Madsen as a (virtually) maximum class for which attributes can be evaluated in a single pass during LR parsing, without constructing a syntax tree. However, the original definition of LR-AGs has the problem that evaluation of attributes is inefficient in
Sassa, M., Ishizuka, H., Nakata, I.
openaire +2 more sources
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
ACM SIGPLAN Notices, 1982
We describe the development of a formal specification of the static semantics of Ada in form of an attribute grammar. This specification is complete, and was tested extensively with automatically generated equivalent Pascal programs. From this specification we systematically developed the semantic analysis part of our Ada Compiler Front End. We outline
Manfred Dausmann +5 more
openaire +2 more sources
We describe the development of a formal specification of the static semantics of Ada in form of an attribute grammar. This specification is complete, and was tested extensively with automatically generated equivalent Pascal programs. From this specification we systematically developed the semantic analysis part of our Ada Compiler Front End. We outline
Manfred Dausmann +5 more
openaire +2 more sources
A Contrastive Study on the Lexicalization of Korean and Greek Motion Events
Studies in Modern Grammar, 2023The following research investigates the lexicalization patterns of motion events in Korean and Greek. Cross-linguistic differences in the encoding of motion events are typically attributed to differences in encoding strategies offered by languages and ...
Hye-Sun Kim
semanticscholar +1 more source
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