Results 231 to 240 of about 1,546 (250)
Some of the next articles are maybe not open access.
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.
Engelfriet, Joost +2 more
openaire +2 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 +1 more source
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 +1 more source
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 +1 more source
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 +1 more source
Conditional attribute grammars
ACM Transactions on Programming Languages and Systems, 1996Attribute grammars are a useful formalism for the specification of computations on structured terms. The classical definition of attribute grammars, however, has no way of treating conditionals nonstrictly. Consequently, the natural way of expressing many otherwise well-behaved computations involves a circularity. This article presents
openaire +1 more source
Attribute grammars made easier: EvDebugger a visual debugger for attribute grammars
2014 International Symposium on Computers in Education (SIIE), 2014Compiler construction courses are usually considered by the students as a difficult subject of the Computer Science degree. The main problem found by the students is to fully understand the theoretical concepts taught during the course and its practical application to build a compiler.
Daniel Rodriguez-Cerezo +2 more
openaire +1 more source
BIT, 1990
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Attributed Context-Free Hypergraph Grammars
1998Journal of Automata, Languages and Combinatorics, Volume 3, Number 2, 1998, 105 ...
Maneth, Sebastian, Vogler, Heiko
openaire +2 more sources
On attribute grammars without attribute synthesis
Information Processing Letters, 1990zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Relating attribute grammars and lexical-functional grammars
Information Sciences, 1992zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Proceedings of the 16th ACM SIGPLAN International Conference on Software Language Engineering, 2023
Nathan Ringo, Lucas Kramer, Eric Van Wyk
openaire +1 more source
Nathan Ringo, Lucas Kramer, Eric Van Wyk
openaire +1 more source