@article{(Open Science Index):https://publications.waset.org/pdf/1245,
	  title     = {Dynamic Attribute Dependencies in Relational Attribute Grammars},
	  author    = {K. Barbar and  M. Dehayni and  A. Awada and  M. Smaili},
	  country	= {},
	  institution	= {},
	  abstract     = {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.},
	    journal   = {International Journal of Computer and Information Engineering},
	  volume    = {4},
	  number    = {1},
	  year      = {2010},
	  pages     = {120 - 128},
	  ee        = {https://publications.waset.org/pdf/1245},
	  url   	= {https://publications.waset.org/vol/37},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 37, 2010},