Dynamic Attribute Grammars

Parigot, Didier; Roussel, Gilles; Jourdan, Muriel; Duris, Étienne

doi:10.1007/3-540-61756-6_81

Cited by 8 publications

(6 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Synthesized attributes are used to pass computed information up the tree, while inherited attributes pass information down and across it. Many techniques and algorithms for data-flow analysis were introduced in AG literature and in our previous works (e.g, [13], [14]). These techniques and algorithms are commonly used in compiler construction for performing optimizations from a program's abstract representation (an attribute-dependency graph induced by the Abstract Syntax Tree of the source code).…”

Section: Data-dependency Formalismmentioning

confidence: 99%

“…These techniques and algorithms are commonly used in compiler construction for performing optimizations from a program's abstract representation (an attribute-dependency graph induced by the Abstract Syntax Tree of the source code). In [14] we have argued that in the term "Attributed Grammar" the notion of grammar does not necessarily imply the existence of an underlying tree, and that the notion of attribute does not necessarily mean decoration of a tree. We have presented Dynamic Attributed Grammars as an extension to the AG formalism.…”

Section: Data-dependency Formalismmentioning

confidence: 99%

See 1 more Smart Citation

Defining and Analyzing P2P Applications with a Data-Dependency Formalism

Lahcen¹,

Parigot²,

Mouline³

2012

2012 13th International Conference on Parallel and Distributed Computing, Applications and Technologies

Self Cite

View full text Add to dashboard Cite

Developing peer-to-peer (P2P) applications became increasingly important in software development. Nowadays, a large number of organizations from many different sectors and sizes depend more and more on collaboration between actors to perform their tasks. These P2P applications usually have a recursive behavior that many modeling approaches cannot describe and analyze (e.g., finite-state approaches). In this paper, we present a formal approach that combines component-based development with well-understood methods and techniques from the field of Attribute Grammars and Data-Flow Analysis in order to specify the behavior of P2P applications, and then construct an abstract representation (i.e., Data-Dependency Graph) to perform analyzes on it.

show abstract

Section: Data-dependency Formalismmentioning

confidence: 99%

Section: Data-dependency Formalismmentioning

confidence: 99%

Defining and Analyzing P2P Applications with a Data-Dependency Formalism

Lahcen¹,

Parigot²,

Mouline³

2012

2012 13th International Conference on Parallel and Distributed Computing, Applications and Technologies

Self Cite

View full text Add to dashboard Cite

show abstract

“…The extended attribute grammars described here borrow ideas from composable attribute grammars [6] (object declarations), conditional attribute gram-mars [3] ( i f clauses) and dynamic attribute grammars [15] (local instances of nonterminals). This combination of features was first proposed by Boyland [4] along with other extensions.…”

Section: E X T E N D E D a T T R I B U T E G R A M M A R Smentioning

confidence: 99%

“…This facility is fully general and permits us even to model functions with multiple return values. By performing this canonicalization, functions may be scheduled using the same machinery as that for (conditional) attribute grammars [15].…”

Section: E X T E N D E D a T T R I B U T E G R A M M A R Smentioning

confidence: 99%

Analyzing direct non-local dependencies in attribute grammars

Boyland

1998

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Describing the static semantics of programming languages with attribute grammars is eased when the formalism allows direct dependencies to be induced between miles for nodes arbitrarily far away in the tree. Such direct non-local dependencies cannot be analyzed using classical methods, which enable efficient evaluation. This paper presents a new technique for analyzing such dependencies. Attribute grammars are extended to permit references to objects with fields to be passed through the attribute system. Fields may be read and written through these references. The extension has a declarative semantics in the spirit of classical attribute grammars. This paper describes a technique for rendering the direct non-local dependencies in classical terms, after which well-known attribute grammar scheduling algorithms may be used. The generated classical dependencies use control attributes, attributes used only for scheduling and which involve no run-time computation. Thus the resulting implementations can be efficient: reading a field can be implemented as a simple indirect load; writing a field as an indirect store.

show abstract

“…Attribute grammar shares a great deal in common with functional paradigm, or more broadly, declarative paradigm-based programming models. Some researchers even argued that an attribute grammar per se is a delarative functional language [38,39,40,41]. Indeed, our…”

Section: Attribute-grammar Model Of Situ Fmentioning

confidence: 99%

situ-f: a domain specific language and a first step towards the realization of situ framework

Chang

Hua

View full text Add to dashboard Cite

Situ proposes a human centered, dynamic reasoning framework for domain experts to evolve their software. It formally models the relationship between externally observed situation sequences and the rapid evolution of that software system, using real-time usage information from users and contextual capturing on the behavior of a software system relative to its runtime environment. Situ f is a continuing effort under Situ framework [1]. In this effort, a domain specific, functional programming language named Situ f is presented from its design, semantics and a feasibility test through theoretical validation. The targeted users of this language mainly include domain experts and engineers who are versed in the major concepts and paradigms regarding human-centric situations. As argued there, human-centric situations are vitally important to infer a user's intention and therefore, to drive software service evolution. Situ f is designed particularly to encourage domain experts and engineers to think and work with situations. An attribute grammar based approach is developed so that through Situ f , relevant real-time contexts can be systematically aggregated around situations. A computational semantics is offered to precisely describe the runtime behavior of a Situ f program. While the Situ f language serves as the critical centerpiece of this work, its functioning necessarily requires environmental support from Situ elements outside the language itself, such that altogether they give rise to a Situ oriented system. This environment, named Situ f-based environment, is also introduced.

show abstract

Dynamic Attribute Grammars

Cited by 8 publications

References 10 publications

Defining and Analyzing P2P Applications with a Data-Dependency Formalism

Defining and Analyzing P2P Applications with a Data-Dependency Formalism

Analyzing direct non-local dependencies in attribute grammars

situ-f: a domain specific language and a first step towards the realization of situ framework

Contact Info

Product

Resources

About