Results 1 to 10 of about 9,269 (105)
The art of composing: between autonomy and heteronomy
Techne, 2021 «Music conveys different meanings to everyone, and sometimes, it can even communicate different things at different times to the same person», Daniel Barenboim once said. This is tantamount to saying that music is influenced by the context in which it is
Cristina Frosini
doaj +1 more source
Extended Attribute Grammars [PDF]
The Computer Journal, 1981 <p>Two new formalisms are introduced: extended attribute grammars, which are capable of defining completely the syntax of programming languages, and extended attributed trans!ation grammars, which are additionally capable of defining their semantics by translation.
Watt, David A., Madsen, Ole Lehrmann
openaire +4 more sources
Tense and Aspect in the Academic Writing of Arab L2 Learners of English: A Corpus-Based Approach
Journal of Language and Education, 2019 This study aimed at explicating the use of tense and aspect in the academic writing of Arab L2 learners of English. The scope was restricted to two absolute tenses (simple present and simple past), perfective and imperfective aspects, and verb-form ...
Mousa A. Btoosh
doaj +1 more source
Attribute Grammar Evolution [PDF]
, 2005 This paper describes Attribute Grammar Evolution (AGE), a new Automatic Evolutionary Programming algorithm that extends standard Grammar Evolution (GE) by replacing context-free grammars by attribute grammars. GE only takes into account syntactic restrictions to generate valid individuals.
Manuel Alfonseca +2 more
openaire +3 more sources
Science of Computer Programming, 2012 Having extensible languages is appealing, but raises the question of how to construct extensible compilers and how to compose compilers out of a collection of pre-compiled components. Being able to deal with attribute grammar fragments as first-class values makes it possible to describe semantics in a compositional way; this leads naturally to a ...
Marcos Viera, S. Doaitse Swierstra
openaire +4 more sources
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.
openaire +3 more sources
Zipping Strategies and Attribute Grammars
, 2022 Strategic term rewriting and attribute grammars are two powerful programming techniques widely used in language engineering. The former, relies on strategies to apply term rewrite rules in defining language transformations, while the latter is suitable to express context-dependent language processing algorithms.
Macedo, José Nuno +2 more
openaire +3 more sources
The hierarchy of LR-attributed grammars [PDF]
, 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 ...
Jorma Tarhio +2 more
openaire +4 more sources
Modular Attribute Grammars [PDF]
The Computer Journal, 1990 Attribute grammars provide a formal declarative notation for describing the semantics and translation of programming languages. Describing any real programming language is a significant software engineering challenge. From a software engineering viewpoint, current notations for attribute grammars have two flaws: tedious repetition of essentially the ...
G. D. P. Dueck, Gordon V. Cormack
openaire +1 more source
Passes and paths of attribute grammars
Information and Control, 1981 Contents. Abstract, Introduction, 1. Terminology, 2. The relationship between passes and paths, 3. Exponential lower bounds, 4. Upper bounds, 5. Path languages, Conclusion, References.An attribute grammar is pure (left-to-right) multi-pass if a bounded number of left-to-right passes over the derivation tree suffice to compute all its attributes.
J. Engelfriet, FILE', GILBERTO
openaire +2 more sources