Results 11 to 20 of about 284,029 (168)
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
Heritage Language Journal, 2023 Based on production data of yes/no-questions (YNQ), our research shows that the intonational grammar of YNQ s of heritage speakers of Russian in the United States and in Germany differs from the one of monolingual speakers in various aspects, namely ...
Yulia Zuban +2 more
semanticscholar +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
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
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
Expressive Power of Hypergraph Lambek Grammars [PDF]
arXiv, 2023 Hypergraph Lambek grammars (HL-grammars) is a novel logical approach to generating graph languages based on the hypergraph Lambek calculus. In this paper, we establish a precise relation between HL-grammars and hypergraph grammars based on the double pushout (DPO) approach: we prove that HL-grammars generate the same class of languages as DPO grammars ...
arxiv
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
Machines for attribute grammars
Information and Control, 1986 Two automata models are introduced that play, with respect to attribute grammars and attribute-evaluation for them, the same role as pushdown automata have with respect to context-free grammars and their parsing. It is shown, in fact, that these automata define the same class of string-to-value translations as attribute grammars. Their class of tree-to-
openaire +2 more sources
Interpretation and reduction of attribute grammars [PDF]
Acta Informatica, 1983 An attribute grammar (AG) is in reduced form if in all its derivation trees every attribute contributes to the translation. We prove that, eventhough AG are generally not in reduced form, they can be reduced, i.e., put into reduced form, without modifying their translations. This is shown first for noncircular AG and then for arbitrary AG.
openaire +3 more sources