ECLR-attributed grammar
 | This article has been nominated for merging into LR-attributed grammar. You are welcome to participate in the merging discussion, which will decide whether to merge it into LR-attributed grammar. This discussion may also result in the article being deleted, redirected, or draftified. |
 | This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)
|
ECLR-attributed grammars are a special type of attribute grammars.
They are a variant of LR-attributed grammars where an equivalence relation on inherited attributes is used to optimize attribute evaluation. EC stands for equivalence class. The compiler generator Rie (first developed 1985) was based on ECLR-attributed grammars.[1]
References
[edit]- ↑ Deransart, Pierre; Jourdan, Martin; Lorho, Bernard (10 August 1988). Attribute Grammars: Definitions, Systems, and Bibliography. Lecture Notes in Computer Science. Vol. 323. Berlin/Heidelberg: Springer-Verlag. p. 149. doi:10.1007/bfb0030509. ISBN 978-3-540-50056-8.
External links
[edit]- http://web.archive.org/web/20170929180726/http://www.is.titech.ac.jp/~sassa/lab/rie-e.html
- M. Sassa, H. Ishizuka and I. Nakata: ECLR-attributed grammars: a practical class of LR-attributed grammars. Inf. Process. Lett. 24 (1987), 31–41.
- M. Sassa, H. Ishizuka and I. Nakata: Rie, a Compiler Generator Based on a One-pass-type Attribute Grammar. Software—practice and experience 25:3 (March 1995), 229–250.