Dynamic Attribute Dependencies in Relational Attribute Grammars
| Main Authors: | K. Barbar, M. Dehayni, A. Awada, M. Smaili |
|---|---|
| Format: | Article Journal |
| Bahasa: | eng |
| Terbitan: |
, 2010
|
| Subjects: | |
| Online Access: |
https://zenodo.org/record/1054835 |
Daftar Isi:
- 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.