ACM Home Page
Please provide us with feedback. Feedback
Compiler structure engineering with attribute grammars
Full text PdfPdf (690 KB)
Source ACM SIGPLAN Notices archive
Volume 26 ,  Issue 10  (October 1991) table of contents
Pages: 73 - 82  
Year of Publication: 1991
ISSN:0362-1340
Authors
Ilka Miloucheva  Technische Universität Berlin, Prozeβrechnerverbund-Zentrale, Straβe des 17. Juni 136, W-1O00 Berlin 12, Germany
Hans Loeper  Technische Universität Dresden, Informatikzentrum, Mommsenstr. 13, O-8027 Dresden, Germany
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 22,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/122616.122625
What is a DOI?

ABSTRACT

In this paper are discussed the concepts of a compiler structure design system and its prototype implementation.In order to obtain the pass structure based on the properties of the deterministic left to right evaluable attribute grammars we use short path algorithms for directed graphs. An algorithm for assignment of attributes to separate passes is shown. We propose a method for extension of the deterministic left to right evaluable attribute grammars with global data. Futher we describe the approach of a syntax oriented modularization for specifying the compiler structure.Using this research as a base we developed the CSD system (Compiler Structure Design). The CSD system is a compiler engineering tool providing facilities for specification of compilers and for design of their pass, intermediate program and module structure. The main components of the system are also shown and its use for development of a COBOL compiler are discussed.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
/ALB 81/ Alblas H.: A Characterization of Attribute Evaluation in Passes. Acta Informatica, p. 427-464, 16(1981)4.
 
2
/BKS 79/ Biryukov A.N., Kurotchkin V.M., Serebrjakov V.A.: Globalnije atributij i ich izpolsovanie pri opisanii yazikov programmirovania. Obrabotka simvolnoi informazii, vip. 5, Moskwa, VZ AN SSSR, 1979.
3
 
4
 
5
/MIL 88/ Miloucheva I.: Rechnergestuetzter Entwurf der Compilerstruktur mit Attributgrammatiken. Dissertation, Sektion Informatik, Technische Universitaet Dresden, 1988.
 
6
/DJL 86/ Deransart P., Jourdan M., Lorho B.: A Survey on Attribute Grammars. Part I - Review of Existing Systems. INRIA Rapports de Recherche, 1985, no. 417. Part II - Main Results on Attribute Grammars. INRIA Rapports de Recherche, 1986, no. 485. Part III - Classified Bibliography. INRIA Rapports de Recherche, 1986.
 
7
 
8
/KN 68/ Knuth D.E.: Semantics of Context Free Languages. Mathematical Systems Theory, p. 127-145, 2(1968)2.
 
9
/KOS 84/ Koskimies K.: A Specification Language for One-pass Translation using Attribute Grammars. Software Practice and Experience, p. 119-129, 13(1983)2.
10
11
 
12
/LJO 87/ Loeper H., Jaeckel H.-J., Otter W.: Compiler and Interpreter fuer hoehere Programmiersprachen. Akademic-Verlag Berlin, 1987.
 
13
/RIE 85/ Riedewald G: Compiler-Compiler auf der Grundlage attributierter Grammatiken. Problemseminar "Compiler-Generatoren", 1984, Binz, AdW, IIR, 1(1985)7.
 
14
/RU 80/ Raeiha K.-J., Ukkonen E.: Minimizing the Number of Evaluation Passes for Attribute Grammars. SIAM Jour. on Computing, p. 772-786, 10(1981)4.
 
15

Collaborative Colleagues:
Ilka Miloucheva: colleagues
Hans Loeper: colleagues