Dynamic Attribute Dependencies in Relational Attribute Grammars

Considering the theory of attribute grammars, we use logical formulas instead of traditional functional semantic rules. Following the decoration of a derivation tree, a suitable algorithm should maintain the consistency of the formulas together with the evaluation of the attributes. This may be a Prolog-like resolution, but this paper examines a somewhat different strategy, based on production specialization, local consistency and propagation: given a derivation tree, it is interactively decorated, i.e. incrementally checked and evaluated. The non-directed dependencies are dynamically directed during attribute evaluation. Keywords—Input/Output attribute grammars, local consistency, logical programming, propagation, relational attribute grammars.

[1]  Thomas W. Reps,et al.  Incremental Context-Dependent Analysis for Language-Based Editors , 1983, TOPL.

[2]  Bruno Courcelle,et al.  Proofs of Partial Correctness for Attribute Grammars with Applications to Recursive Procedures and Logic Programming , 1988, Inf. Comput..

[3]  Pierre Deransart,et al.  Attribute Grammars , 1988, Lecture Notes in Computer Science.

[4]  Jens M. Dill.  A counter-example for “a simpler construction for showing the intrinsically exponential complexity of the circularity problem for attribute grammars” , 1987, JACM.

[5]  Frank Neven,et al.  Attribute grammars for unranked trees as a query language for structured documents , 2005, J. Comput. Syst. Sci..

[6]  Roger Hoover.  Incremental Graph Evaluation , 1987 .

[7]  Didier Parigot,et al.  Dynamic Attribute Grammars , 1996, PLILP.

[8]  Jan Maluszynski,et al.  A grammatical view of logic programming , 1988, PLILP.

[9]  Tomás Isakowitz.  Can We Transform Logic Programs into Attribute Grammars? , 1991, RAIRO Theor. Informatics Appl..

[10]  Jan Maluszynski,et al.  Attribute Grammars and Logic Programs: A Comparison of Concepts , 1991, Attribute Grammars, Applications and Systems.

[11]  Pierre Deransart,et al.  Attribute Grammars and their Applications , 1990, Lecture Notes in Computer Science.

[12]  Scott E. Hudson,et al.  Incremental attribute evaluation: a flexible algorithm for lazy update , 1991, TOPL.

[13]  Donald E. Knuth,et al.  Semantics of context-free languages , 1968, Mathematical systems theory.

[14]  Bradley T. Vander Zanden.  Incremental Constraint Satisfaction and its Application to Graphical Interfaces , 1988 .

[15]  Jukka Paakki,et al.  Attribute grammar paradigms—a high-level methodology in language implementation , 1995, CSUR.

[16]  Mehdi Jazayeri,et al.  A Simpler Construction for Showing the Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars , 1981, JACM.