%0 Journal Article
	%A K. Barbar and  M. Dehayni and  A. Awada and  M. Smaili
	%D 2010
	%J International Journal of Computer and Information Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 37, 2010
	%T Dynamic Attribute Dependencies in Relational Attribute Grammars
	%U https://publications.waset.org/pdf/1245
	%V 37
	%X 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.
	%P 120 - 128