Bibliography on Attribute Grammars

Project OSCAR or FNC-2 system

This html bibliography page has created form bibtex file with bib2html tool

Please let me know if you would like to be added to this bibliography, or if you would like an existing entry modified or deleted.

this page maintained by Didier.Parigot http://www-rocq.inria.fr/oscar/www/fnc2/AG.html

The same bibliography with abstract


Research on Attribute Grammars


Search the Bibliography


Keywords: 
Authors:  
            


Updated on Fri Jun 25 14:08:53 MET 1999

[1]
M. F. Abouzaïd. Procédures d'utilisation des grammaires d'attributs. thèse de 3ème cycle, University de Bordeaux I, June 1981.

[2]
H. Abramson. Definite clause translation grammars. In IEEE Symp. on Logic Programming, pages 233-248. Atlantic City, 1984.

[3]
Stephen R. Adams. Modular Grammar for Programming Language Prototyping. Ph.D. thesis, Southampton University, 1991.

[4]
A. Poggi G. Adorni and G. Ferrari. Attribute grammars as a robust technical basis for a human-computer interaction general purpose architecture. Int. Journal of Human-Computer Studies, 47:531-563, 1997.

[5]
G. Adorni, A. Boccalatte, and M. Di Manzo. Top-down semantic analysis. The Computer Journal, 27(3):233-237, August 1984.

[6]
V. N. Agafonov. On attribute grammars. In A. Mazurkiewicz, editor, Mathematical Foundations of Computer Science, volume 45 of Lecture Notes in Computer Science, pages 169-172. Springer-Verlag, New York-Heidelberg-Berlin, September 1976. Gdansk.

[7]
Alfred V. Aho and Jeffrey D. Ullman. The Theory of Parsing, Translation and Compiling. Prentice-Hall, Englewood Cliffs, NJ, 1973. I and II.

[8]
Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers: Principles, Techniques and Tools. Addison Wesley, Reading, MA, 1986.

[9]
Henk Alblas and Borivoj Melichar, editors. Attribute Grammars, Applications and Systems, volume 545 of Lect. Notes in Comp. Sci. Springer-Verlag, New York-Heidelberg-Berlin, June 1991. Prague.

[10]
Henk Alblas. The limitations of attribute-evaluation in passes. memorandum, Onderafdeling der Informatica, Tech. Hogeschool Twente, 1979.

[11]
Henk Alblas. A characterization of attribute evaluation in passes. Acta Informatica, 16(4):427-464, 1981. See also: memorandum 315, Onderafdeling der Informatica, Tech. Hogeschool Twente (September 1980).

[12]
Henk Alblas. An algorithm to find minimal sequences of pass directions for attribute grammars. memorandum INF-83-6, Onderafdeling der Informatica, Tech. Hogeschool Twente, August 1983.

[13]
Henk Alblas. Transformations of attributed program trees. report TL-TR-EXT-84-30, Tartan Labs., Pittsburgh, PA, July 1984.

[14]
Henk Alblas. Finding minimal pass sequences for attribute grammars. SIAM Journal on Computing, 14(4):889-914, November 1985.

[15]
Henk Alblas. Incremental simple multi-pass attribute evaluation. In Procs. NGI/SION Symp. 1986, pages 319-342, 1986. See also: memorandum INF-86-27, Onderafdeling der Informatica, Tech. Hogeschool Twente (August 1986).

[16]
Henk Alblas. Iteration of transformation passes over attributed program trees. memorandum INF-87-28, Onderafdeling der Informatica, Tech. Hogeschool Twente, September 1987.

[17]
Henk Alblas. One-pass transformations of attributed program trees. Acta Informatica, 24(3):299-352, June 1987. See also: memorandum INF-86-30, Onderafdeling der Informatica, Tech. Hogeschool Twente (October 1986).

[18]
Henk Alblas. Pass-oriented Attribute Evaluation and Attributed Tree Transformations. Ph.D. thesis, Onderafdeling der Informatica, Tech. Hogeschool Twente, October 1987.

[19]
Henk Alblas. Attributed tree transformations with delayed and smart reevaluation. memorandum INF-88-45, Onderafdeling der Informatica, Tech. Hogeschool Twente, 1988.

[20]
Henk Alblas. Attribute evaluation methods. memorandum INF-89-20, Onderafdeling der Informatica, Tech. Hogeschool Twente, 1989.

[21]
Henk Alblas. Optimal incremental simple multi-pass attribute evaluation. Information Processing Letters, 32(6):289-295, October 1989.

[22]
Henk Alblas. Concurrent incremental attribute evaluation. In Pierre Deransart and Martin Jourdan, editors, Attribute Grammars and their Applications (WAGA), volume 461 of Lecture Notes in Computer Science, pages 343-358. Springer-Verlag, New York-Heidelberg-Berlin, September 1990. Paris.

[23]
Henk Alblas. Attribute evaluation methods. In Alblas and Melichar [9], pages 48-113. Prague.

[24]
Henk Alblas. Incremental attribute evaluation. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lecture Notes in Computer Science, pages 215-233. Springer-Verlag, New York-Heidelberg-Berlin, June 1991. Prague.

[25]
Henk Alblas. Introduction to attribute grammars. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lecture Notes in Computer Science, pages 1-15. Springer-Verlag, New York-Heidelberg-Berlin, June 1991. Prague.

[26]
Zoltan Alexin, J. Dombi, Karoly Fábricz, Tibor Gyimóthy, and T. Horváth. CONSTRUCTOR: A natural language interface based on attribute grammars. Acta Cybernetica, 9(3):247-255, 1990.

[27]
Zoltan Alexin, Tibor Gyimóthy, Tamas Horváth, and Karoly Fábricz. Attribute grammar specification for a natural language understanding interface. In Pierre Deransart and Martin Jourdan, editors, Attribute Grammars and their Applications (WAGA), volume 461 of Lecture Notes in Computer Science, pages 313-326. Springer-Verlag, New York-Heidelberg-Berlin, September 1990. Paris.

[28]
Zoltán Alexin, Tibor Gyimóthy, and Henrik Boström. IMPUT: An interactive learning tool based on program specialization. Intelligent Data Analysis IDA, 1(4), October 1997. published by Elsevier Science Inc.

[29]
Bowen Alpern, Alan Carle, Barry Rosen, Peter Sweeney, and F. Kenneth Zadeck. Incremental evaluation of attributed graphs. research report RC 13205, IBM T.J. Watson Research Center, Yorktown Heights, NY, October 1987. Also published as Technical Report CS-87-29, Department of Comp. Sc., Brown University, Providence, RI.

[30]
Bowen Alpern, Alan Carle, Barry Rosen, Peter Sweeney, and F. Kenneth Zadeck. Graph attribution as a specification paradigm. In Peter Henderson, editor, ACM SIGSOFT/SIGPLAN Symp. on Practical Software Development Environments, pages 121-129. ACM press, Boston, MA, November 1988. Joint issue with ACM SIGPLAN Notices 24, 2 (February 1989)Published as SIGSOFT Software Eng. Notes, volume 13, number 5.

[31]
Bowen Alpern, Roger Hoover, Barry Rosen, Peter Sweeney, and F. Kenneth Zadeck. Maintaining solutions to changing interdependent equations. Technical Report CS-88-13, Department of Comp. Sc., Brown University, Providence, RI, November 1988.

[32]
Bowen Alpern, Roger Hoover, Barry K. Rosen, Peter F. Sweeney, and F. Kenneth Zadeck. Keeping priorities straight: an investigation of incremental algorithms. Technical Report CS-88-13, Department of Comp. Sc., Brown University, Providence, RI, November 1988.

[33]
Michaneh Amirchahy and Monique Mazaud. Projet DELTA: optimisation de code généré par attributs. rapport de recherche 59, IRIA-Laboria, Rocquencourt, February 1974.

[34]
Michaneh Amirchahy and Danièle Néel. L'optimisation de code pourra-t-elle s'affirmer gr^ace aux attributs? rapport de recherche 162, IRIA-Laboria, Rocquencourt, March 1976.

[35]
Zolt an Alexin, Szilvia Zvada, , and Tibor Gyim othy. Application of AGLEARN on Hungarian Part-of-speech Tagging. In D. Parigot and M. Mernik, editors, Second Workshop on Attribute Grammars and their Applications, WAGA'99, pages 133-152, Amsterdam, The Netherlands, March 1999. INRIA rocquencourt. (PostScript, 20 pages, 277488 bytes)

[36]
An Feng An and Toshiro Wakayama. SIMON: A grammar-based transformation system for structured documents. In Fifth International Conference on Electronic Publishing, pages 361-372, Darmstadt, Germany, 1994. Origination, Dissemination, and Design (EPODD) EP '94.

[37]
D. P. Anderson and L. H. Landweber. Protocol specification by real-time attribute grammars. In Y. Yemini, R. Strom, and S. Yemini, editors, 4th Internat. Workshop on Protocol Specification, Testing, and Verification, pages 457-465, Amsterdam, 1984. North-Holland. Skytop Lodge, PA.

[38]
D. P. Anderson. Automated protocol implementation with RTAG. IEEE Transactions on Software Engineering, 14(3):291-300, March 1988.

[39]
Laurent Andrey and André Schaff. Description and prototyping of OSI protocol entities using attribute grammars. Technical Report 95-R-271, Centre de recherche en Informatique de Mancy, 1995.

[40]
Laurent Andrey and André Schaff. Description et prototypage d'entité de protocole OSI par grammaire attribuées. Technical report, Centre de recherche en Informatique de Mancy, 1996.

[41]
Laurent Andrey. Protocoles de communication et grammaires attribuées. PhD thesis, Université de Mancy, 1995.

[42]
Joao Saraiva and P. Henriques. Concurrent attribute evaluation. In VEC/PAR'93, First International Meeting on Vector and Parallel Processing. Pergamon Press, Set 1993.

[43]
Bijan Arbab. Compiling circular attribute grammars into prolog. International Business Machines Corporation. Journal of Research and Development, 30(3):294-309, May 1986. Also published as a report, IBM Los Angeles Scientific Center (July 1985).

[44]
Brigitte Asbrock, Uwe Kastens, and Erich Zimmermann. Generating an efficient compiler front-end. Bericht 17/81, Institut für Informatik II, University Karlsruhe, 1981.

[45]
Brigitte Asbrock. Attribut-Implementierung und -Optimierung für Attributierte Grammatiken. Diploma thesis, University Karslruhe, July 1979.

[46]
J. Asp. Description of the syntax and static semantics of pascal-HB using the compiler writing system HLP. M.Sc. thesis, report C-1980-77, Department of Comp. Sc., University of Helsinki, 1980. (in Finnish).

[47]
Isabelle Attali and Jacques Chazarain. Functional evaluation of strongly non-circular typol specifications. In Pierre Deransart and Martin Jourdan, editors, Attribute Grammars and their Applications (WAGA), volume 461 of Lecture Notes in Computer Science, pages 157-176. Springer-Verlag, New York-Heidelberg-Berlin, September 1990. Paris.

[48]
Isabelle Attali and Paul Franchi-Zannettacci. Unification-free execution of typol programs by semantic attribute evaluation. In Actes du Séminaire Franco-Soviétique Informatika 88, pages 9-26. INRIA, Nice, February 1988. See also: rapport RR-864, INRIA, Rocquencourt (July 1988).

[49]
Isabelle Attali and Didier Parigot. Integrating Natural Semantics and Attribute Grammars: the Minotaur System. Rapport de recherche 2339, INRIA, 1994. (Gzipped PostScript, 19 pages, 128408 bytes)

[50]
Isabelle Attali. Compiling typol with attribute grammars. In Pierre Deransart, Bernard Lorho, and Jan Maluszynski, editors, Programming Languages Implementation and Logic Programming, volume 348 of Lecture Notes in Computer Science, pages 252-272. Springer-Verlag, New York-Heidelberg-Berlin, May 1988. Orléans.

[51]
Isabelle Attali. Compilation de programmes TYPOL par attributs sémantiques. PhD thesis, Université de Nice, April 1989.

[52]
Isabelle Attali. Sémantique Naturelle: Evaluation et Expressivité. Mémoire d'habilitation, Université de Nice Sophia Antipolis, 1996. (PostScript)

[53]
Lex Augusteijn. The elegant compiler generation system. In Pierre Deransart and Martin Jourdan, editors, Attribute Grammars and their Applications (WAGA), volume 461 of Lecture Notes in Computer Science, pages 238-254. Springer-Verlag, New York-Heidelberg-Berlin, September 1990. Paris.

[54]
Lex Augusteijn. Functional Programming, Program Transformations and Compiler Construction. PhD thesis, Eindhoven Technical University, October 1993.

[55]
Christine Ayrault. Implantation en C des structures de données du langage OLGA. rapport de DEA, University d'Orléans, September 1987.

[56]
W. A. Babich and Mehdi Jazayeri. The method of attributes for data flow analysis. Acta Informatica, 10(3):245-272, October 1978. part 1: Exhaustive Analysis, part 2: Demand Analysis.

[57]
W. A. Babich. High level data flow analysis using a parse tree representation of the program. report TR 77-006, Department of Comp. Sc., University of North Carolina, Chapel Hill, NC, May 1977.

[58]
K. Barbar and K. Musumbu. Implementation of Abstract Interpretation Algorithm by means of Attribute Grammars. In Proceedings of the 26th Southeastern Symposium on System Theory, pages 87-93. IEEE Computer Society, March 1994.

[59]
Kablan Barbar. Étude comparative de différentes classes de grammaires d'attributs ordonnées. thèse de 3ème cycle, University de Bordeaux I, June 1982.

[60]
Kablan Barbar. Classification des grammaires d'attributs ordonnées. rapport 8412, University de Bordeaux I, April 1984.

[61]
Kablan Barbar. Attributed context-free tree grammars. rapport I-8716, Dépt. d'Informatique, University de Bordeaux I, April 1987.

[62]
Milton E. Barber. PARSLEY: a new compiler-compiler. In Software Development Tools, Techniques and Alternatives, pages 232-241. Arlington, VA, July 1983.

[63]
R. Barbuti, M. Bellia, P. Degano, G. Levi, E. Dameri, C. Simonelli, and A. Martelli. Programming environment generation based on denotational semantics. In D. Ferrari, M. Bolognani, and J. Goguen, editors, Theory and Practice of Software Technology, pages 51-83. North-Holland, Amsterdam, 1983.

[64]
Lee A. Barford and Bradley T. Vander Zanden. Attribute grammars in constraint-based graphics systems. Software--Practice and Experience, 19(4):309-328, April 1989.

[65]
Lee Alton Barford and Bradley T. Vander Zanden. Attribute grammars in constraint-based graphics systems. Technical Report CORNELLCS//TR87-838, Cornell University, Computer Science Department, June 1987.

[66]
W. A. Barrett, R. Bates, D. Gustafson, and J. Couch. Compiler Construction: Theory and Practice. SRA Inc., 2nd edition, 1985.

[67]
M. Bartha. An algebraic definition of attributed translations. report, University of Szeged, Hungary, 1981.

[68]
G. Bartmuß and Robert Giegerich. Compiler development with MUG2---an introductory example. Bericht TUM-INFO-8102, Institut für Informatik, Tech. University München, April 1981.

[69]
G. Bartmuß and Sabine Thürmel. MUG-einführung. interner bericht, Institut für Informatik, Tech. University München, April 1984.

[70]
Don Batory and Bart J. Geraci. Validating component compositions in software system generators. In International Conference on Software Reuse, Florida, 1996. (PostScript)

[71]
Bernhar Bauer. Attributed term induction - A proof principle for attribute grammars. Technical Report Bericht 9403, München University, 1994.

[72]
Beate Baum and Peter Forbig. The system FLR (fast laboratory for recomposition). In Programming Language Implementation and Logic Programming (PLILP '91), volume 528 of Lect. Notes in Comp. Sci., pages 427-428, 1991. system demonstration.

[73]
M. Bayer, B. Böhringer, J. P. Dehottay, H. Feuerhahn, J. Jasper, Cornelius H. A. Koster, and U. Schmiedecke. Software development in the CDL2 laboratory. In H. Hünke, editor, Software Engineering Environments, pages 97-118. North-Holland, Amsterdam, 1981.

[74]
Philippe Bazet. Pattern-matching en priorité spécifique sur des types avec constructeurs commutatifs. Rapport de DEA, Universitéde Paris 11, Orsay, September 1992.

[75]
Franco Bazzichi and Ippolito Spadafora. An automatic generator for compiler testing. Institute of Electrical and Electronics Engineers. Transactions on Software Engineering, SE-8(4):343-353, July 1982.

[76]
V. S. Begwani. New approach for attribute evaluation and error correction in compilers. Technical Report #483, Comp. Sc. Department, University of Wisconsin-Madison, 1982.

[77]
Matthew Belmonte. A practical attribute grammar circularity test. Technical Report TR 88-920, Department of Comp. Sc., Cornell University, Ithaca, NY, June 1988.

[78]
J. Benary. Attributed grammars and two-dimensional formula languages. In O. M. Tammepuu, editor, Specialized Languages as Tools for Programming Technology, pages 7-15. Tallinn, January 1988.

[79]
Jean Beney and Jean-Fran c cois Boulicaut. Des spécifications grammaticales à la programmation logique: le compromis STARLET. rapport de recherche, Laboratoire d'Informatique, INSA, Villeurbanne, June 1985.

[80]
Hervé Benvel. Réalisation d'un front-end pascal avec le système FNC-2. Rapport de DEA, Université de Paris 6, September 1993.

[81]
A. Berg, D. A. Bocking, D. R. Peachey, P. G. Sorenson, J. P. Tremblay, and J. A. Wald. VATS---the visible attributed translation system. In 1985 ACM SIGSMALL Symp. on Small Systems, pages 70-81. ACM press, Danvers, May 1985. See also: report 84-19, Dept. of Computational Science, University of Saskatchewan, Saskatoon, Canada (1984).

[82]
D. M. Berry. On the design and specification of the programming language OREGANO. report UCLA-ENG-7388, Comp. Sc. Department, University of California, Los Angeles, CA, 1973.

[83]
Luqi V. Berzins and Y. Lee. Generating displays for specifications using attribute grammars. In Proceedings COMPSAC89, pages 596-602, September 1989.

[84]
George M. Beshers and Roy H. Campbell. Maintained and constructor attributes. In ACM SIGPLAN '85 Symp. on Language Issues in Programming Environments, pages 34-42. ACM press, Seattle, WA, June 1985. Published as ACM SIGPLAN Notices, volume 20, number 7.

[85]
J. A. Bircsak. Incorporating conditional semantic rules in the CIS compiler generator. Senior thesis, Department of Comp. Inf. Sc., Moore School of Elec. Eng. D2, University of Pennsylvania, Philadelphia, PA, May 1984.

[86]
A. N. Biryukov, V. M. Kurochkin, and Vladimir A. Serebryakov. A compiler-construction system based on the homogeneous and universal approach. In Abstracts for the First All-Union Conf. on Programming Technology. Kiev, 1979. (in Russian).

[87]
A. N. Biryukov, V. M. Kurochkin, and Vladimir A. Serebryakov. Global attributes and their use for the definition of a programming language. Akademiya Nauk SSSR. Zhurnal Vychislitel'no u i Matematiki i Matematichesko u i Fiziki, 20(5):1284-1293, 1980. (in Russian). Also published in: Symbolic Data Processing 5, Computing Center, Academy of Sciences of the USSR, Moscow (1979).

[88]
A. N. Biryukov, V. M. Kurochkin, and Vladimir A. Serebryakov. Structural attributes and their implementation in the translator writing system SUPER. Akademiya Nauk SSSR. Programmirovanie, 2:52--?, 1981. (in Russian).

[89]
Kurt M. Bischoff. Design, implementation, use, and evaluation of ox: An attribute-grammar compiling system based on yacc, lex, and C. Technical Report IASTATECS//TR92-31, December 1 1992. (PostScript)

[90]
Kurt M. Bischoff. User manual for ox: An attribute-grammar compiling system based on yacc, lex, and C. Technical Report IASTATECS//TR92-30, December 1 1992. (PostScript)

[91]
E. Bjarnason and Görel Hedin. Tool support for framework-specific language extensions. In Bosch and Mitchell, editors, Object-Oriented Technology. ECOOP'97 Workshop Reader, volume 1357 of LNCS, pages 137-140. Springer Verlag, 1997.

[92]
Dines Björner. Programming languages: Formal development of programming languages and compilers. In E. Morlet and D. Ribbons, editors, Int. Computing Symp., pages 1-21. North-Holland, Amsterdam, April 1977. See also: report ID673, Department of Comp. Sc., Tech. University of Denmark, Lyngby (1977).

[93]
F. Blaizot and Pierre Boullier. Projet DELTA: description d'un langage algorithmique à structure de blocs. rapport de recherche 35, IRIA-Laboria, Rocquencourt, October 1973.

[94]
L. Blaizot. DELTA: système de description de langages et de traducteurs par attributs. rapport de recherche 20, IRIA-Laboria, Rocquencourt, June 1973.

[95]
L. Blaizot. Introduction à la notion d'attributs sémantiques. In M. Kronental and Bernard Lorho, editors, Séminaires Structure et Programmation des Calculateurs 1973, pages 253-273. INRIA, Rocquencourt, 1973.

[96]
M. Blattner and J. Ramanathan. Attributed metaforms for top-down design and analysis of programs. In 1979 Conf. on Information Sciences and Systems, pages 200-206. John Hopkins University, Baltimore, MD, March 1979.

[97]
R. Bloem and J. Engelfriet. A comparison of tree transductions defined by monadic second order logic and by attribute grammars. Technical Report 98-02, Leiden University Technical Report, 1998. (PostScript)

[98]
Roderick Bloem. Attribute Grammars and Monadic Second Order Logic. PhD thesis, Leiden University, Leiden, The Netherlands, August 1996.

[99]
A. Boccalatte and M. Di Manzo. An approach to the detection of semantic errors. The Computer Journal, 23(4):317-323, 1980.

[100]
A. Boccalatte, M. Di Manzo, and D. Sciarra. Error recovery with attribute grammars. The Computer Journal, 25(3):331-336, August 1982.

[101]
Gregor V. Bochmann and Olivier Lecarme. Un système d'écriture de compilateurs. manuel d'utilisation. document de travail 44, Dépt. d'Informatique, University de Montréal, 1973.

[102]
Gregor V. Bochmann and P. Ward. Compiler writing system for attribute grammars. The Computer Journal, 21(2):144-148, May 1978. See also: publication 199, Dépt. d'Informatique, University de Montréal (July 1975).

[103]
Gregor V. Bochmann. Semantic equivalence of syntactically related attribute grammars. publication 148, Dépt. d'Informatique, University de Montréal, November 1973.

[104]
Gregor V. Bochmann. Attribute grammars and compilation: Program evaluation in several phases. document de travail 54, Dépt. d'Informatique, University de Montréal, August 1974.

[105]
Gregor V. Bochmann. Semantic attributes for grammars with regular expressions. publication 195, Dépt. d'Informatique, University de Montréal, 1975.

[106]
Gregor V. Bochmann. Semantic equivalence of covering attribute grammars. publication 218, Dépt. d'Informatique, University de Montréal, December 1975.

[107]
Gregor V. Bochmann. Semantic evaluation from left to right. Communications of the Association for Computing Machinery, 19(2):55-62, February 1976.

[108]
J. Bodwin, L. Bradley, K. Kanda, D. Litle, and Uwe Pleban. Experience with an experimental compiler generator based on denotational semantics. In ACM SIGPLAN '82 Symp. on Compiler Construction, pages 216-229. ACM press, Boston, MA, June 1982. Published as ACM SIGPLAN Notices, volume 17, number 6.

[109]
Hans-Jürgen Böhm and Willy Zwanepoel. Parallel attribute grammar evaluation. In Radin Popescu-Zeletin, Gérard Le Lann, and Kane H. Kim, editors, 7th Int. Conf. on Distributed Computing Systems, pages 347-354. Berlin, September 1987.

[110]
Joël Bonnet. Étude des principaux langages de description de grammaires attribuées et spécification d'un nouveau langage basé sur des grammaires abstraites. rapport de DEA, University d'Orléans, September 1986.

[111]
J. Bormann and J. Lötzsch. Definition und realisierung von fachsprachen mit DEPOT. Dissertation, Sektion Mathematik, Tech. University Dresden, 1974.

[112]
Jan Borowiec. Pragmatics in a compiler production system. In A. Ershov and Cornelius H. A. Koster, editors, Methods of Algorithmic Language Implementation, volume 47 of Lecture Notes in Computer Science, pages 314-340. Springer-Verlag, New York-Heidelberg-Berlin, 1977. Also published in Russian in: Procs. of the All-Union Symp. on Methods of Implementing New Algorithmic Languages, Part 2, Novossibirsk, pp. 210-? (1975).

[113]
Jan Borowiec. Metalanguages of the compiler production system COPS. In W. Henhapl, editor, GI Fachgespräch ``Compiler-Compiler'', pages 122-159. Fachbereich Informatik, Tech. Hochschule Darmstadt, Berlin, 1978.

[114]
Jean-Louis Bouchenez. Système de description de langages et de traducteurs par attributs. présentation du système. In M. Kronental and Bernard Lorho, editors, Séminaires Structure et Programmation des Calculateurs 1973, pages 317-328. INRIA, Rocquencourt, 1973.

[115]
M. Bouckaert, A. Pirotte, and M. Snelling. SOFT: a tool for writing sofware. report R212, MBLE Research Lab., Brussels, January 1973.

[116]
M. Bouckaert, A. Pirotte, and M. Snelling. Utilisation des attributs dans un système d'écriture de software. In M. Kronental and Bernard Lorho, editors, Séminaires Structure et Programmation des Calculateurs 1973, pages 291-315. INRIA, Rocquencourt, 1973.

[117]
Jean-Fran c cois Boulicaut and Jean Beney. Métacompilation et programmation : des règles méthodologiques pour la spécification et la programmation. Génie Logiciel & Systèmes Experts, (11):36-48, March 1988.

[118]
Jean-Fran c cois Boulicaut, editor. BULLET. Dépt. M.S.I., Ecole Centrale de Lyon, Écully, January 1986. This is a local journal. Complete address is: BP 163, F-69131 Écully Cedex (France).

[119]
Pierre Boullier and Knut Ripken. Building an ADA compiler following meta-compilation methods. In Séminaires Langages et Traducteurs 1978-1981, pages 99-140. INRIA, Rocquencourt, 1981.

[120]
Pierre Boullier, Philippe Deschamp, and Martin Jourdan. Spécification et réalisation d'un traducteur pascal-ada. In Jacques André and A. Strohmeier, editors, Journées ADA de l'AFCET, pages 9-29. Lausanne, December 1983.

[121]
Pierre Boullier, Philippe Deschamp, and Martin Jourdan. Application d'outils de haut niveau à la réalisation d'un traducteur automatique pascal-ada. In 2ème Coll. AFCET de Génie Logiciel, pages 375-385. Nice, June 1984.

[122]
Jean-Louis Bouquart. Etude des rapports entre grammaires attribuées et programmation logique: application au test d'occurrence et à l'analyses statique. PhD thesis, Orléans-LIFO, 1992.

[123]
John Boyland and Susan L. Graham. Composing tree attributions. In 21st ACM Symp. on Principles of Programming Languages, pages 375-388, Portland, Oregon, January 1994. ACM Press.

[124]
John Boyland. Conditional attribute grammars. ACM Transactions on Programming Languages and Systems, 18(1):73-108, January 1996.

[125]
John Tang Boyland. Descriptional Composition of Compiler Components. PhD thesis, University of California, Berkeley, September 1996. Available as technical report UCB//CSD-96-916.

[126]
John Tang Boyland. Analyzing direct non-local dependencies in attribute grammars. In Kai Koskimies, editor, Compiler Construction CC'98, volume 1383 of Lect. Notes in Comp. Sci., pages 31-49, portugal, April 1998. Springer-Verlag.

[127]
Peter T. Breuer and Jonathan P. Bowen. Decompilation: the enumeration of types and grammars. ACM Trans. Progr. Languages and Systems, 16(5):1613-1647, September 1994.

[128]
B. M. Brosgol. Deterministic Translation Grammars. Ph.D. thesis, Harvard University, Cambridge, MA, 1974.

[129]
Cynthia A. Brown and Paul W. Purdom. Specifying one-pass bottom-up compilers. report, Comp. Sc. Department, University of Indiana, Bloomington, July 1981.

[130]
Cynthia A. Brown and Paul W. Purdom. A methodology and notation for compiler front-end design. Software--Practice and Experience, 14(4):335-346, April 1984.

[131]
J. Bruno and W. A. Burkhard. A circularity test for interpreted grammmars. Technical Report 88, Comp. Sc. Lab., Department of Elec. Eng., Princeton University, 1970.

[132]
Bill P. Buckles, Frederick E. Petry, and Yuet-Ying Cheung. Attribute grammars for the heuristic translation of query languages. Information Systems, 14(6):507-514, 1989.

[133]
Roy H. Campbell and P. G. Richards. SAGA: a system to automate the management of software production. Technical Report UIUCDCS-R-81-1048, Department of Comp. Sc., University of Illinois at Urbana-Champaign, January 1981. Extended Abstract: 1981 National Computer Conf., Chicago, IL, pp. 231-234 (May 1981).

[134]
Alan Carle and Lori Pollock. A context-based incremental evaluator for hierachical attribute grammars. Journal of Programming Languages, 3, March 1995.

[135]
Alan Carle and Lori Pollock. Matching-based incremental evaluators for hierarchical attribute grammar dialects. ACM Transactions on Programming Languages and Systems, 17(2):394-429, March 1995.

[136]
Alan Carle and Lori Pollock. On the optimality of change propagation for incremental evaluation of hierarchical attribute grammars. ACM Transactions on Programming Languages and Systems, 18(1), 1996.

[137]
Alan Carle. Hierarchical Attribute Grammars: Language, Evaluation and Applications. Ph.d. dissertation, Computer Science, Rice University, 1992.

[138]
M. D. Carroll and Barbara G. Ryder. Incremental data flow analysis via dominator and attribute updates. In 15th ACM Symp. on Principles of Progr. Languages, pages 274-284. ACM press, San Diego, CA, January 1988.

[139]
Bruno Chabrier, Vincent Lextrait, and Paul Franchi-Zannettacci. GIGAS: a graphical interface generator from attribute specifications. In Actes des Journées Int. ``Le Génie Logiciel et ses Applications'', pages 1265-1283. EC2, Paris, December 1988. Toulouse.

[140]
Pascal Chambre. Contribution à la validation de programmes concurrents avec contraintes. PhD thesis, Orléans-LIFO, 1997.

[141]
Nigel P. Chapman. Attribute grammars and finite automata. report RN/88/9, Comp. Sc. Department, University College, London, March 1988.

[142]
Nigel P. Chapman. Regular attribute grammars and finite state machine. ACM SIGPLAN Notices, 24(6):97-105, June 1989. See also: report RN/88/9, Department of Comp. Sc., University College London (March 1988).

[143]
Nigel P. Chapman. Defining, analysing and implementing communication protocols using attribute grammars. Formal Aspects of Computing, 2(4):359-392, 1990.

[144]
Nigel P. Chapman. On extended attribute grammars. report RN/90/27, Comp. Sc. Department, University College, London, 1990.

[145]
Chapman. On extended attribute grammars. BEATCS: Bulletin of the European Association for Theoretical Computer Science, 46, 1992.

[146]
K. S. Chebotar. Order of calculation of semantic attributes. Progr. and Computer Software, 5(2):113-117, March 1979.

[147]
K. S. Chebotar. Some modifications of knuth's algorithm for verifying cyclicity of attribute grammars. Progr. and Computer Software, 7(1):58-61, January 1981.

[148]
H. D. Cheng and X. Cheng. Attribute grammar for shape recognition and its VLSI implementation. In International Conference on Pattern Recognition ICPR'92, pages I:104-107, 1992.

[149]
Laurian M. Chirica and David F. Martin. An algebraic formulation of knuthian semantics. In 17th IEEE Conf. on Foundations of Comput. Sc., pages 127-136. Houston, TX, October 1976.

[150]
Laurian M. Chirica and David F. Martin. An order-algebraic definition of Knuthian semantics. Mathematical Systems Theory, 13(1):1-27, 1979. See also: report TRCS78-2, Dept. of Elec. Eng. and Computer Science, University of California, Santa Barbara, CA (October 1978).

[151]
Laurian M. Chirica and David F. Martin. Toward compiler implementation correctness proofs. ACM Trans. Progr. Languages and Systems, 8(2):185-214, April 1986.

[152]
Laurian M. Chirica. Contributions to Compiler Correctness. Ph.D. thesis, Comp. Sc. Department, University of California, Los Angeles, CA, October 1976.

[153]
M.-L. Christ-Neumann and H.-W. Schmidt. ASDL---an object-oriented specification language for syntax-directed environments. In European Software Eng. Conf. (ESEC '87), pages 77-85. Strasbourg, September 1987.

[154]
Henning Christiansen and Neil D. Jones. Control flow treatment in a simple semantics-directed compiler generator. In Dines Björner, editor, Formal Description of Programming Concepts II, pages 73-97. North-Holland, Amsterdam, 1983.

[155]
Henning Christiansen. Structure sharing in attribute grammars. In Pierre Deransart, Bernard Lorho, and Jan Maluszynski, editors, Programming Languages Implementation and Logic Programming, volume 348 of Lecture Notes in Computer Science, pages 180-200. Springer-Verlag, New York-Heidelberg-Berlin, May 1988. Orléans.

[156]
Henning Christiansen. Structure sharing in incremental systems. Struct. Programm., 10(4):169-186, 1989.

[157]
R. Cohen and E. Harry. Automatic generation of near-optimal linear-time translators for non-circular attribute grammars. In 6th ACM Symp. on Principles of Progr. Languages, pages 121-134. ACM press, San Antonio, TX, January 1979.

[158]
Robert F. Cohen. Combine and conquer. Technical Report CS-92-45, Department of Computer Science, Brown University, October 1992. Sun, 13 Jul 1997 18:30:16 GMT.

[159]
Derek Coleman, Jane W. Hugues, and Malcolm S. Powell. A method for the syntax-directed design of multiprograms. Institute of Electrical and Electronics Engineers. Transactions on Software Engineering, SE-7(2):189-196, 1981.

[160]
R. P. Corbett. Static semantics and compiler error recovery. report UCB-CSD-85-251, Comp. Sc. Department, University of California, Berkeley, 1985.

[161]
Loïc Correnson, Etienne Duris, Didier Parigot, and Gilles Roussel. Attribute grammars and functional programming deforestation. In Fourth International Static Analysis Symposium -- Poster Session, Paris, France, September 1997. (Gzipped PostScript, 16 pages, 88632 bytes)

[162]
Loïc Correnson, Etienne Duris, Didier Parigot, and Gilles Roussel. Composition symbolique. In journées du GDR de programmation, Rennes, November 1997. (Gzipped PostScript, 14 pages, 94080 bytes)

[163]
Loïc Correnson, Etienne Duris, Didier Parigot, and Gilles Roussel. Composition symbolique. In Journées Francophones des Langages Applicatifs, Come, Italie, February 1998. (Gzipped PostScript, 22 pages, 103579 bytes)

[164]
Loïc Correnson, Etienne Duris, Didier Parigot, and Gilles Roussel. A generic framework for genericity. English version of, 1998. (Gzipped PostScript, 7 pages, 65289 bytes)

[165]
Loïc Correnson, Etienne Duris, Didier Parigot, and Gilles Roussel. Generic programming by program composition (position paper). In Workshop on Generic Programming, Marstrand, Sweden, June 1998. conjunction with MPC'98. (Gzipped PostScript, 13 pages, 70933 bytes)

[166]
Loïc Correnson, Etienne Duris, Didier Parigot, and Gilles Roussel. Schéma générique de développement par composition. In Approches Formelles dans l'Assistance au Développement de Logiciel AFADL'98, Poitiers - futuroscope, 1998. (Gzipped PostScript, 14 pages, 72890 bytes)

[167]
Loïc Correnson, Etienne Duris, Didier Parigot, and Gilles Roussel. Symbolic composition. Technical Report 3348, INRIA, January 1998. (Gzipped PostScript, 27 pages, 148776 bytes)

[168]
Loic Correnson, Etienne Duris, Didier Parigot, and Gilles Roussel. Equational semantics. submit, INRIA, October 1998. (Gzipped PostScript, 13 pages, 81455 bytes)

[169]
Loïc Correnson, Etienne Duris, Didier Parigot, and Gilles Roussel. Declarative program transformation: a deforestation case-study. accepted at PPDP'99 and early version, 1999. (Gzipped PostScript, 17 pages, 102270 bytes)

[170]
Loïc Correnson, Etienne Duris, Didier Parigot, and Gilles Roussel. Equational semantics. accepted at SAS'99 and early version, 1999. (Gzipped PostScript, 15 pages, 112513 bytes)

[171]
Loic Correnson, Etienne Duris, Didier Parigot, and Gilles Roussel. How to deforest in accumulative parameters?. Technical Report 3608, INRIA, January 1999. (Gzipped PostScript, 23 pages, 143925 bytes)

[172]
Loïc Correnson. Généricité dans les grammaires attribuées. Rapport de stage d'option, École Polytechnique, 1996. (Gzipped PostScript, 46 pages, 153743 bytes)

[173]
Loïc Correnson. Programmation polytypique avec les grammaires attribuées. Rapport de DEA, Université de Paris VII, September 1997. (Gzipped PostScript, 38 pages, 126320 bytes)

[174]
Loic Correnson. Equational Semantics. In D. Parigot and M. Mernik, editors, Second Workshop on Attribute Grammars and their Applications, WAGA'99, pages 205-222, Amsterdam, The Netherlands, March 1999. INRIA rocquencourt. (PostScript, 18 pages, 206610 bytes)

[175]
Loic Correnson. Equational Semantics. Informatica (Solvenia), 1999. (Gzipped PostScript, 11 pages, 84407 bytes)

[176]
Bruno Courcelle and Pierre Deransart. Proofs of partial correctness for attribute grammars with application to recursive procedures and logic programming. Information and Computation, 78(1):1-55, July 1988.

[177]
Bruno Courcelle and Paul Franchi-Zannettacci. On the equivalence problem for attribute systems. rapport 8026, University de Bordeaux I, 1980.

[178]
Bruno Courcelle and Paul Franchi-Zannettacci. On the expressive power of attribute grammars. In 21st IEEE Conf. on Foudations of Comput. Sc., pages 161-172. Syracuse, NY, October 1980.

[179]
Bruno Courcelle and Paul Franchi-Zannettacci. Attribute grammars and recursive program schemes. Theoretical Computer Science, 17(2 and 3):163-191 and 235-257, 1982. part I and II See also: rapport 8008, University de Bordeaux I (April 1980).

[180]
Bruno Courcelle. Attribute grammars: Theory and applications. In J. Diaz and I. Ramos, editors, Int. Coll. on Formalization of Programming Concepts, volume 107 of Lecture Notes in Computer Science, pages 75-95. Springer-Verlag, New York-Heidelberg-Berlin, April 1981. See also: rapport 8103, University de Bordeaux I (February 1981).

[181]
Bruno Courcelle. Attribute grammars: Definitions, analysis of dependencies, proof methods. In Bernard Lorho, editor, Methods and Tools for Compiler Construction, pages 81-102. Cambridge University Press, New York, New York, 1984.

[182]
Karel Culik, II. Attributed grammars and languages. publication 3, Dépt. d'Informatique, University de Montréal, May 1969.

[183]
J. De Man, M. Peerlinck, D. Genin, and V. Goovaerts. Implementation of a compiler for CHILL. In D. R. Wilson and C. J. van Spronsen, editors, MICROCOMPUTERS: Developments in Industry, Business and Education (EUROMICRO '1983), pages 23-29. Elsevier, Amsterdam-New York, 1983. Madrid.

[184]
J. P. Dehottay, H. Feuerhahn, Cornelius H. A. Koster, and H. M. Stahl. Syntaktische beschreibung von CDL2. Bericht, Forschungsgruppe PC 2, FB 20, Tech. University Berlin, September 1976.

[185]
Marie-Pierre Delest and Jean-Marc Fedou. Attribute grammars are useful for combinatorics. rapport 89-122, LaBRI, University de Bordeaux I, November 1989.

[186]
Marie-Pierre Delest and Jean-Marc Fedou. Attribute grammars are useful for combinatorics. rapport 89-122, LaBRI, University de Bordeaux I, Talence, November 1989.

[187]
Marie-Pierre Delest and Jean-Marc Fedou. Counting polyominoes using attribute grammars. In Pierre Deransart and Martin Jourdan, editors, Attribute Grammars and their Applications (WAGA), volume 461 of Lecture Notes in Computer Science, pages 46-60. Springer-Verlag, New York-Heidelberg-Berlin, September 1990. Paris.

[188]
M. P. Delest and J. M. Fedou. Attribute grammars are useful for combinatorics. Theoretical Computer Science, 98(1):65-76, May 1992.

[189]
P. Della Vigna and C. Ghezzi. Data structures and graph grammars. In K. Samelson, editor, ECI Conf. 1976, volume 44 of Lecture Notes in Computer Science, pages 130-145. Springer-Verlag, New York-Heidelberg-Berlin, August 1976. Amsterdam.

[190]
P. Dembinski and Jan Maluszynski. Attribute grammars and two-level grammars: a unifying approach. In J. Winkowski, editor, Mathematical Foundations of Computer Science, volume 64 of Lecture Notes in Computer Science, pages 143-154. Springer-Verlag, New York-Heidelberg-Berlin, September 1978. Zakopane.

[191]
Alan Demers, Thomas Reps, and Tim Teitelbaum. Incremental evaluation for attribute grammars with application to syntax-directed editors. In 8th ACM Symp. on Principles of Progr. Languages, pages 105-116. ACM press, Williamsburg, VA, January 1981.

[192]
Alan Demers, Anne Rogers, and F. Kenneth Zadeck. Attribute propagation by message passing. In ACM SIGPLAN '85 Symp. on Language Issues in Programming Environments, pages 43-59. ACM press, Seattle, Wa, June 1985. See also: report RC11109, IBM T.J. Watson Research Center, Yorktown Heights, NY (1985).Published as ACM SIGPLAN Notices, volume 20, number 6.

[193]
Peter Dencker. Generative attributierte grammatiken. thesis, Bericht 158, GMD, Sankt Augustin, 1986.

[194]
Pierre Deransart and Martin Jourdan, editors. Attribute Grammars and their Applications (WAGA), volume 461 of Lecture Notes in Computer Science. Springer-Verlag, New York-Heidelberg-Berlin, September 1990. Paris.

[195]
Pierre Deransart and Jan Maluszynski. Modelling data dependencies in logic programs by attribute schemata. rapport RR 323, INRIA, Rocquencourt, July 1984. Also published as a report, Linköping Institute of Technology (October 1984).

[196]
Pierre Deransart and Jan Maluszynski. Relating logic programs and attribute grammars. Journal of Logic Programming, 2(2):119-155, 1985. Also published as a report, Linköping Institute of Technology (October 1984), and as rapport RR 393, INRIA, Rocquencourt (1985).

[197]
Pierre Deransart and Jan Maluszynski. Relating logic programs and attribute grammars. Rapport de recherche 393, Institut National de Recherche en Informatique et en Automatique (INRIA), 1985.

[198]
Pierre Deransart and Jan Maluszynski. A grammatical view of logic programming. In Pierre Deransart, Bernard Lorho, and Jan Maluszynski, editors, Programming Languages Implementation and Logic Programming, volume 348 of Lecture Notes in Computer Science, pages 219-251. Springer-Verlag, New York-Heidelberg-Berlin, May 1988. Orléans.

[199]
P. Deransart and J. Maluszynski. A Grammatical View of Logic Programming. The MIT Press, 1993.

[200]
Pierre Deransart, Martin Jourdan, and Bernard Lorho. Speeding up circularity tests for attribute grammars. Acta Informatica, 21:375-391, December 1984. See also: rapport RR 211, INRIA, Rocquencourt (May 1983).

[201]
Pierre Deransart, Martin Jourdan, and Bernard Lorho. Attribute Grammars: Definitions, Systems and Bibliography, volume 323 of Lect. Notes in Comp. Sci. Springer-Verlag, New York-Heidelberg-Berlin, August 1988.

[202]
Pierre Deransart. Definition and implementation of a lisp system using semantic attributes. In Jacques André and Jean-Pierre Banâtre, editors, 5th Annual III Conf., pages 25-39. Guidel, May 1977.

[203]
Pierre Deransart. Définition de lisp à l'aide d'un compilateur. rapport de recherche 224, IRIA-Laboria, Rocquencourt, March 1977.

[204]
Pierre Deransart. Description par attributs sémantiques de lisp pur et preuve de l'équivalence de la définition traductive et de l'évaluateur. rapport de recherche 220, IRIA-Laboria, Rocquencourt, March 1977.

[205]
Pierre Deransart. Preuve et génération d'attributs sémantiques. In Coll. AFCET ``Théorie et Techniques de l'Informatique'', Vol. 1, pages 412-422. Gif-sur-Yvette, November 1978. See also: rapport de recherche 302, IRIA-Laboria, Rocquencourt (May 1978).

[206]
Pierre Deransart. Proof and synthesis of semantic attributes in compiler definition. rapport de recherche 333, IRIA-Laboria, Rocquencourt, December 1978.

[207]
Pierre Deransart. Technique de preuve par attributs appliquée à un compilateur lisp. rapport de recherche 271, IRIA-Laboria, Rocquencourt, January 1978.

[208]
Pierre Deransart. Proof by semantic attributes of a lisp compiler. The Computer Journal, 22(3):240-245, August 1979.

[209]
Pierre Deransart. Synthèse automatique de traductions définies par attributs sémantiques. In 2ème Congrès AFCET-INRIA ``Reconnaissance des Formes et Intelligence Artificielle'', Vol. 1, pages 111-120. Toulouse, September 1979.

[210]
Pierre Deransart. Logical attribute grammars. In R. E. A. Mason, editor, Information Processing '83, pages 463-469. North-Holland, Amsterdam, September 1983. Paris.

[211]
Pierre Deransart. Validation des grammaires d'attributs. thèse d'état, University de Bordeaux I, October 1984.

[212]
M. Desainte-Catherine and K. Barbar. Using attribute grammars to find solutions for musical equational programs. ACM SIGPLAN Notices, 29(9):56-63, September 1994.

[213]
Philippe Deschamp. Perluette: a compilers producing system using abstract data types. In M. Dezani-Ciancaglini and U. Montanari, editors, 5th Int. Symp. on Programming, volume 137 of Lecture Notes in Computer Science, pages 63-77. Springer-Verlag, New York-Heidelberg-Berlin, April 1982. Torino.

[214]
Michel C. Desmarais, Luc Giroux, and Serge Larochelle. An advice-giving interface based on plan-recognition and user-knowledge assessment. International Journal of Man-Machine Studies, 39(6):901-924, 1993.

[215]
Deutsche Industrie Norma. Programmiersprache PEARL. Reuth-Verlag, 1980. Normentwurf DIN 66253, Teil 2.

[216]
David Devillard. Amélioration de l'implantation en C des évaluateurs d'attributs produits par FNC-2. Rapport de DEA, Universitéd'Orléans, September 1990.

[217]
Werner Dilger. Automatic translation with attribute grammars. COLING-80, pages 397-404, 1980.

[218]
Jens M. Dill. A counter-example for ``A simpler construction for showing the intrinsically exponential complexity of the circularity problem for attribute grammars''. J. ACM, 36(1):92-96, January 1989.

[219]
Yannis A. Dimitriadis and Juan Lopez Coronado end Cristina de la Maza. A new interactive mathematical editor, using on-line handwritten symbol recognition, and error detection-correction with an attribute grammar. In Proceedings of First International Conference on Document Analysis and Recognition, pages 885-893, Saint Malo, France, octobre 1991.

[220]
K. Döbeling. Festlegung Zweier Sprachklassen mit Hilfe Attributierter Grammatiken. Diploma thesis, Tech. University Hannover, 1978.

[221]
H. Dobler and K. Pirklbauer. Coco-2 -- A new compiler-compiler. Technical Report TR 90/1, Inst. für Informatik, University Linz, 1990.

[222]
T. A. Dreisbach. A declarative semantic definition of PL360. Master's thesis, Comp. Sc. Department, University of California, Los Angeles, CA, October 1972.

[223]
S. Drossopoulos, J. Uhl, G. Persch, G. Goos, M. Dausmann, and G. Winterstein. An attribute grammar for ADA. In ACM SIGPLAN '82 Conf. on Compiler Construction, pages 334-349. ACM press, Boston, MA, June 1982. Published as ACM SIGPLAN Notices, volume 17, number 6.

[224]
Gerald D. P. Dueck and Gordon V. Cormack. Modular attribute grammars. research report CS-88-19, University of Waterloo, May 1988.

[225]
Gerald D. P. Dueck and Gordon V. Cormack. Modular attribute grammars. The Computer Journal, 33:164-172, 1990. See also: research report CS-88-19, University of Waterloo (May 1988).

[226]
Winfried Dulz and Stefan Hofmann. Grammar-based workload modeling of communication systems. In Modeling Techniques and Tools for Computer Performance Evaluation, Turin, 1991.

[227]
Bruno Dumant. Analyses statiques en programmation logique avec contraintes. PhD thesis, Paris 7, 1996.

[228]
A. G. Duncan and J. S. Hutchison. Using attribute grammars to test designs and implementations. In 5th Int. Conf. on Software Engineering, pages 170-178. San Diego, CA, March 1981.

[229]
Olivier Durin. Traduction en OLGA d'une grammaire attribuée écrite en lisp. rapport de stage d'option, École Polytechnique, Palaiseau, July 1988.

[230]
Olivier Durin. Génération en le_lisp d'évaluateurs d'attributs spécifiés en olga. rapport de magistère, École Normale Supérieure, Paris, September 1989.

[231]
Etienne Duris, Didier Parigot, and Martin Jourdan. Mises à jour destructives dans les grammaires attribuées. Rapport de recherche 2686, INRIA, October 1995. (Gzipped PostScript, 12 pages, 97353 bytes)

[232]
Etienne Duris, Didier Parigot, Gilles Roussel, and Martin Jourdan. Attribute grammars and folds: Generic control operators. Rapport de recherche 2957, INRIA, August 1996. (Gzipped PostScript, 29 pages, 176512 bytes)

[233]
Etienne Duris, Didier Parigot, Gilles Roussel, and Martin Jourdan. Grammaires attribuées et folds: Opérateurs de contrôle Génériques. In journées du GDR de programmation, Orléans, 1996. (Gzipped PostScript, 8 pages, 63271 bytes)

[234]
Etienne Duris, Didier Parigot, Gilles Roussel, and Martin Jourdan. Grammaires attribuées et folds : opérateurs de contrôle génériques. In Journées Francophones des Langages Applicatifs, Dolomieu, France, January 1997. (Gzipped PostScript, 20 pages, 84868 bytes)

[235]
Etienne Duris, Didier Parigot, Gilles Roussel, and Martin Jourdan. Structure-directed genericity in functional programming and attribute grammars. Rapport de Recherche 3105, INRIA, February 1997. (Gzipped PostScript, 18 pages, 122262 bytes)

[236]
Etienne Duris. Transformation de grammaires attribuées pour des mises à jour destructives. Rapport de DEA, Université d'Orléans, September 1994. (Gzipped PostScript, 90 pages, 190738 bytes)

[237]
Etienne Duris. Functional programming and attribute grammar deforestation. In Proc.of the International Conference on Functional Programming (ICFP'97) -- Poster Session, Amsterdam, The Netherlands, June 1997. ACM Press.

[238]
Etienne Duris. Contribution aux relations entre les grammaires attribuées et la programmation fonctionnelle. PhD thesis, Université d'Orléans, 1998. (Gzipped PostScript, 208 pages, 553547 bytes)

[239]
J. Duske, R. Parchmann, M. Sedello, and J. Specht. IO-macrolanguages and attributed translations. Information and Control, 35(2):87-105, October 1977.

[240]
G. Economakos and G. Papakonstantinou. An attribute grammar driven high-level synthesis paradigm for control applications. In 3rd European Robotics, Intelligent Systems and Control Conference, 1998.

[241]
G. Economakos and G. Papakonstantinou. Exploiting the use of VHDL specifications in the AGENDA high-level synthesis environment. In 24th EUROMICRO Conference, Workshop on Digital System Design, pages 91-98. EUROMICRO, 1998.

[242]
G. Papakonstantinou G. Economakos and P. Tsanakas. Global scheduling in an attribute grammar driven silicon compilation environment. In IEEE/VIUF International Workshop on Behavioral Modeling and Simulation, BMAS, 1997.

[243]
G. Economakos, G. Papakonstantinou, and P. Tsanakas. An attribute grammar approach to high-level automated hardware synthesis. Information and Software Technology, 37(9):493-502, 1995.

[244]
G. Economakos, G. Papakonstantinou, and P. Tsanakas. An attribute grammar approach to the high-level automated hardware synthesis. Information and Software Technology, 37(9), January 1995.

[245]
G. Economakos, P. Economakos, G. Papakonstantinou, and P. Tsanakas. Integrating different VHDL coding styles in an attribute grammar driven high-level synthesis environment. In International Workshop on Logic and Architecture Synthesis, pages 175-184. IFIP, 1997.

[246]
G. Economakos, G. Papakonstantinou, K. Pekmestzi, and P. Tsanakas. Hardware compilation using attribute grammars. In IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods, CHARME, 1997.

[247]
G. Economakos, G. Papakonstantinou, K. Pekmestzi, and P. Tsanakas. Hardware compilation using attribute grammars. In Advanced Research Working Conference on Correct Hardware Design and Verification Methods, pages 273-290. IFIP WG 10.5, 1997.

[248]
G. Economakos, G. Papakonstantinou, and P. Tsanakas. Global scheduling in an attribute grammar driven silicon compilation environment. In International Workshop on Behavioral Modeling and Simulation, pages 167-176. IEEE/VIUF, 1997.

[249]
G. Economakos, G. Papakonstantinou, and P. Tsanakas. AGENDA: An attribute grammar driven environment for the design automation of digital systems. In Design Automation and Test in Europe Conference and Exhibition, pages 933-934. ACM/IEEE, 1998.

[250]
G. Economakos, G. Papakonstantinou, and P. Tsanakas. Behavioral synthesis of digital filters using attribute grammars. In IX European Signal Processing Conference, pages 519-522. EURASIP, 1998.

[251]
G. Economakos, G. Papakonstantinou, and P. Tsanakas. Incorporating multi-pass attribute grammars for the high-level synthesis of ASICs. In Symposium on Applied Computing, pages 45-49. ACM, 1998.

[252]
O. Edelstein and S. Sagiv. Machine independent optimizations via attribute grammars. Technical Report TR88.187, IBM Israel Scientific Center, Haifa, 1986.

[253]
Sophocles Efremidis, Christos H. Papadimitriou, and Martha Sideris. Complexity characterizations of attribute grammar languages. Inform. and Comput., 78(3):178-186, 1988.

[254]
Sofoklis G. Efremidis, Khalid A. Mughal, and John H. Reppy. AML: Attribute grammars in ML. Technical Report TR93-1401, Cornell University, Computer Science Department, December 1993.

[255]
Sofoklis Efremidis, Khalid A. Mughal, Lars Søraas, and John Reppy. AML: Attribute grammars in ML. Nordic Journal of Computing, March 1997.

[256]
J. Eloranta and K. Tarpila. The implementation of an estelle-pascal preprocessor. report C-1987-22, Department of Comp. Sc., University of Helsinki, 1987.

[257]
Joost Engelfriet and Willem de Jong. Attribute storage optimization by stacks. Acta Informatica, 27:567-581, 1990. Preliminary version: rapport 88-30, Vakgroep Informatica, Rijksuniv. te Leiden (December 1988).

[258]
Joost Engelfriet and Gilberto Filé. Formal properties of one-visit and multi-pass attribute grammars. In J. de Bakker and J. van Leeuwen, editors, 7th Int. Coll. on Automata, Languages and Programming, volume 85 of Lecture Notes in Computer Science, pages 182-194. Springer-Verlag, New York-Heidelberg-Berlin, July 1980. Noordwijkerhout.

[259]
Joost Engelfriet and Gilberto Filé. The formal power of one-visit attribute grammars. Acta Informatica, 16(3):275-302, 1981.

[260]
Joost Engelfriet and Gilberto Filé. Passes and paths of attribute grammars. Information and Control, 49(2):125-169, May 1981. See also: memorandum 323, Onderafdeling der Informatica, Tech. Hogeschool Twente (1980).

[261]
Joost Engelfriet and Gilberto Filé. Passes, sweeps and visits. In S. Even and O. Kariv, editors, 8th Int. Coll. on Automata, Languages and Programming, volume 115 of Lecture Notes in Computer Science, pages 193-207. Springer-Verlag, New York-Heidelberg-Berlin, July 1981. Revised version: memorandum INF-82-6, Onderafdeling der Informatica, Tech. Hogeschool Twente (August 1982).

[262]
Joost Engelfriet and Gilberto Filé. Simple multi-visit attribute grammars. Journal of Computer and System Sciences, 24(3):283-314, June 1982. See also: memorandum 314, Onderafdeling der Informatica, Tech. Hogeschool Twente (August 1980).

[263]
Joost Engelfriet and Gilberto Filé. Passes, sweeps and visits in attribute grammars. J. ACM, 36(4):841-869, October 1989.

[264]
Joost Engelfriet and Linda M. Heyker. The term-generating power of context-free hypergraph grammar and attribute grammars. report 89-17, Vakgroep Informatica, Rijksuniversiteit te Leiden, November 1989.

[265]
Joost Engelfriet and Linda Heyker. Context-free hypergraph grammars have the same term-generating power as attribute grammars. Acta Informatica, 29:161-210, 1992.

[266]
Joost Engelfriet, G. Leith, and Grzegorz Rozenberg. Apex graph grammars and attribute grammars. report 87-04, Vakgroep Informatica, Rijksuniversiteit Leiden, March 1987.

[267]
Joost Engelfriet, George Leih, and Grzegorz Rozenberg. Apex graph-grammars and attribute grammars. Acta Informatica, 25:537-571, 1988.

[268]
Joost Engelfriet. Automata for attribute grammars. private communication, November 1982.

[269]
Joost Engelfriet. Tree transducers and syntax-directed semantics. In 7th Coll. on Trees in Algebra and Programming (CAAP '82), pages 82-107. Lille, March 1982. See also: memorandum 363, Onderafdeling der Informatica, Tech. Hogeschool Twente (1981).

[270]
Joost Engelfriet. Attribute grammars: Attribute evaluation methods. In Bernard Lorho, editor, Methods and Tools for Compiler Construction, pages 103-138. Cambridge University Press, New York, 1984.

[271]
Joost Engelfriet. The complexity of languages generated by attribute grammars. SIAM Journal on Computing, 15(1):70-86, February 1986. See also: memorandum INF-82-13, Onderafdeling der Informatica, Tech. Hogeschool Twente (November 1982).

[272]
Joost Engelfriet. Context-free grammars with storage. report 86-11, Vakgroep Informatica, Rijksuniversiteit Leiden, July 1986.

[273]
Michael Eulenstein. POCO---compiler generator user manual. tech. Bericht A2/85, University des Saarlandes, Saarbrücken, 1985.

[274]
Michael Eulenstein. POCO---Ein portables System zur Generierung portabler Compiler, volume 164 of Inf. Fachb. Springer-Verlag, New York-Heidelberg-Berlin, 1988. Reprint of Diplomarbeit, University des Saarlandes, Saarbrücken (December 1983).

[275]
Isu Fang. FOLDS, a Declarative Formal Language Definition System. Ph.D. thesis, Comp. Sc. Department, Stanford University, December 1972. Abstract in: t Séminaires Structure et Programmation des Calculateurs 1973, ed. M. Kronental and Bernard Lorho, INRIA, Rocquencourt, pp. 275-290 (1973).

[276]
Charles Farnum. Pattern-based tree attribution. In Conference Record of the 19th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 211-222, Albuquerque, New Mexico, January 19-22 1992.

[277]
Rodney Farrow and Alec G. Stanculescu. A VHDL compiler based on attribute grammar methodology. In ACM SIGPLAN '89 Conf. on Progr. Languages Design and Implementation, pages 120-130. ACM press, Portland, OR, July 1989. Published as ACM SIGPLAN Notices, volume 24, number 7.

[278]
Rodney Farrow and Daniel M. Yellin. A comparison of storage optimizations in automatically-generated attribute evaluators. Acta Informatica, 23(4):393-427, 1986. See also: Technical Report, Department of Comp. Sc., Columbia University, New York, NY (January 1985).

[279]
Rodney Farrow and Daniel M. Yellin. Generalized inversion of translation specifications. report RC 12925, IBM T.J. Watson Research Center, Yorktown Heights, NY, July 1987.

[280]
Rodney Farrow, Thomas J. Marlowe, and Daniel M. Yellin. Composable attribute grammars: Support for modularity in translator design and implementation. In 19th ACM Symp. on Principles of Programming Languages, pages 223-234, Albuquerque, NM, January 1992. ACM press.

[281]
Rodney Farrow. Attributed Grammar Models for Data Flow Analysis. Ph.D. thesis, Rice University, Houston, TX, May 1977.

[282]
Rodney Farrow. Experience with an attribute grammar based compiler. In 9th ACM Symp. on Principles of Progr. Languages, pages 95-107. ACM press, Albuquerque, NM, January 1982.

[283]
Rodney Farrow. LINGUIST-86 yet another translator writing system based on attribute grammars. In ACM SIGPLAN '82 Symp. on Compiler Construction, pages 160-171. ACM press, Boston, MA, June 1982. Published as ACM SIGPLAN Notices, volume 17, number 6.

[284]
Rodney Farrow. Attribute grammars and data-flow languages. In ACM SIGPLAN '83 Symp. on Programming Languages Issues in Software Systems, pages 28-40. ACM press, San Francisco, CA, June 1983. Published as ACM SIGPLAN Notices, volume 18, number 6.

[285]
Rodney Farrow. Covers of attribute grammars and sub-protocol attribute evaluators. Technical report, Department of Comp. Sc., Columbia University, New York, NY, September 1983.

[286]
Rodney Farrow. Experience with a production compiler automatically generated from an attribute grammar. Technical report, Department of Comp. Sc., Columbia University, New York, NY, March 1984.

[287]
Rodney Farrow. Generating a production compiler from an attribute grammar. IEEE Software, 1(4):77-93, October 1984.

[288]
Rodney Farrow. Sub-protocol-evaluators for attribute grammars. In ACM SIGPLAN '84 Symp. on Compiler Construction, pages 70-80. ACM press, Montréal, June 1984. Published as ACM SIGPLAN Notices, volume 19, number 6.

[289]
Rodney Farrow. Attribute grammars and single-assignment languages. Technical Report CUCS-158-85, Department of Comp. Sc., Columbia University, New York, NY, March 1985.

[290]
Rodney Farrow. Automatic generation of fixed-point-finding evaluators for circular, but well-defined, attribute grammars. In ACM SIGPLAN '86 Symp. on Compiler Construction, pages 85-98. ACM press, Palo Alto, CA, June 1986. Published as ACM SIGPLAN Notices, volume 21, number 7.

[291]
Rodney Farrow. The Linguist Translator-writing System--User's Manual. Declarative Systems Inc., Palo Alto, CA, June 1989. version 6.25.

[292]
Carine Fédéle. Construction automatisée des compilateurs: le système cigale. thèse, I3S, University de Nice-Sophia Antipolis, 1990.

[293]
L. Fegaras, D. Maier, and T. Sheard. Specifying rule-based query optimizers in a reflective framework. In Third International Conference on Deductive and Object-Oriented Databases, pages 146-168, Phoenix, Arizona, December 1993.

[294]
An Feng, Yuji Sugiyama, Mamoru Fujii, and Koji Torii. Generating practical prolog programs from attribute grammars. In IEEE COMPSAC '87, pages 605-612. Tokyo, October 1987.

[295]
An Feng, Yuji Sugiyama, Mamoru Fujii, and Koji Torii. Optimizations in a processor of attribute grammars. Papers of Tech. Group SF20-5, IPS Japan, 1987. (in Japanese).

[296]
An Feng, Tohru Kikuno, and Koji Torii. Incremental attribute evaluation for multiple subtree replacements in structure-oriented environments. In Pierre Deransart and Martin Jourdan, editors, Attribute Grammars and their Applications (WAGA), volume 461 of Lecture Notes in Computer Science, pages 192-206. Springer-Verlag, New York-Heidelberg-Berlin, September 1990. Paris.

[297]
Gilberto Filé. Interpretation and reduction of attribute grammars. Acta Informatica, 19:115-150, 1983. See also: memorandum 359, Onderafdeling der Informatica, Tech. Hogeschool Twente (1981).

[298]
Gilberto Filé. Theory of attribute grammars. dissertation, Onderafdeling der Informatica, Tech. Hogeschool Twente, 1983.

[299]
Gilberto Filé. Classical and incremental attribute evaluation by means of recursive procedures. In Paul Franchi-Zannettacci, editor, 11th Coll. on Trees in Algebra and Programming (CAAP '86), volume 214 of Lecture Notes in Computer Science, pages 112-126. Springer-Verlag, New York-Heidelberg-Berlin, March 1986. Nice.

[300]
Gilberto Filé. Machines for attribute grammars. Information and Control, 69(1-3):41-124, 1986. See also: memorandum INF-83-2, Onderafdeling der Informatica, Tech. Hogeschool Twente (January 1983).

[301]
Gilberto Filé. Classical and incremental attribute evaluation by means of recursive procedures. Theoretical Computer Science, 53(1):25-65, January 1987.

[302]
M. M. Fokkinga, J. Jeuring, L. Meertens, and E. Meijer. A translation from attribute grammars to catamorphisms. The Squiggolist, 2(1):20-26, 1991.

[303]
Rémi Forax. Le langage chocolat. Rapport de stage de ma^itrise d'informatique, Université de Marne la Vallée, July 1997. (Gzipped PostScript, 25 pages, 54681 bytes)

[304]
Peter Forbig. Using the generative aspect of attribute grammars in a knowledge based way. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lecture Notes in Computer Science, pages 438-459. Springer-Verlag, New York-Heidelberg-Berlin, June 1991. Prague.

[305]
István Forgács and Tibor Gyimóthy. An efficient interprocedural slicing method for large programs. Technical Report TR97-7, Informatics Lab., MTA SZTAKI, June 1997.

[306]
Paul Franchi-Zannettacci and Dennis S. Arnon. Context-sensitive semantics as a basis for processing structured documents. BIGRE, 63-64:135-146, May 1989.

[307]
Paul Franchi-Zannettacci and Martin Jourdan. Conception des environnements de programmation, première partie : Attribute grammars. In Actes de l'École Jeunes Chercheurs du GRECO de Programmation, page 71. Sophia-Antipolis, April 1991. english.

[308]
Paul Franchi-Zannettacci. Attributs sémantiques et schémas de programmes. thèse d'état, University de Bordeaux I, March 1982.

[309]
Paul Franchi-Zannettacci. Attribute specifications for graphical interface generation. In G. X. Ritter, editor, Information Processing '89, pages 149-155. North-Holland, Amsterdam, August 1989. San Francisco, CA.

[310]
H. Franzen and Berthold Hoffmann. Automatic determination of data flow in extended affix grammars. In J. H. Böhling and P. P. Spies, editors, Fachbereich ``Compiler-Compiler'', GI 9. Jahrestagung, volume 19 of Inf. Fachb., pages 176-193, New York-Heidelberg-Berlin, 1979. Springer-Verlag. Bonn.

[311]
H. Franzen, Berthold Hoffmann, B. Pohl, and I.-R. Schmiedecke. The EAGLE parser generator: an experimental step towards a practical compiler-compiler using two-level grammars. In Jacques André and Jean-Pierre Ban^atre, editors, 5th Annual III Conf., pages 397-420. Guidel, May 1977.

[312]
H. Franzen, Berthold Hoffmann, and I.-R. Schmiedecke. Using two-level language descriptions for compiler generation. In W. Henhalp, editor, GI Fachgespräch ``Compiler-Compiler'', pages 72-95. Fachbereich Informatik and Tech. Hochschule Darmstadt, Berlin, 1978.

[313]
H. Franzen. Compiler Generation from Compiler Descriptions to Efficient Compilers. Diploma thesis, Fachbereich Informatik, Tech. University Berlin, 1983.

[314]
Louis Frécon. Programmation grammaticale. In Actes du Séminaire Franco-Soviétique Informatika 88, pages 181-198. INRIA, Nice, February 1988.

[315]
R. A. Frost and S. Karamatos. Supporting the Attribute Grammar Programming Paradigm in a Lazy Functional Programming Language, volume 693 of Lecture Notes in Computer Science, pages 278-295. Springer Verlag, 1993.

[316]
R. A. Frost and W. S. Saba. A database interface based on montague's approach to the interpretation of natural language. International Journal of Man-Machine Studies, 33(2):149-176, 1990.

[317]
R. A. Frost and Barbara Szydlowski. Memoizing purely-functional top-down backtracking language processors. Technical report, University of Windsor, 1996.

[318]
Richard A. Frost. Application programming as the construction of language interpreters. ACM SIGPLAN Notices, 24(9):142-151, September 1989.

[319]
Richard A. Frost. The use of attribute grammars in application programming. Technical Report 89-001, School of Comp. Sci., University of Windsor, 1989.

[320]
Richard A. Frost. The use of lazy attribute grammars in application programming. Technical Report 89-007, School of Comp. Sci., University of Windsor, 1989.

[321]
Richard A. Frost. Constructing programs in a calculus of lazy interpreters. University of Windsor, 1990.

[322]
R. A. Frost. Guarded attribute grammars. Software - Practice and Experience, 23(10):1139-1156, 1993.

[323]
Richard A. Frost. W/AGE : The windsor attribute grammar programming environment. Technical report, Winsdor University, May 1994.

[324]
R. A. Frost. W/AGE the windsor attribute grammar programming environment. In Schloss Dagstuhl International Workshop on funtional programming in the Real World, Dagstuhl, Germany, 1995.

[325]
Z. Fülöp, F. Herrmann, S. Vágvölgyi, and H. Vogler. Tree transducers with external functions. Theoret. Comput. Sci., 108:185-236, 1993.

[326]
Z. Fülöp. On attributed tree transducers. Acta Cybernetica, 5:261-279, 1981.

[327]
Tamás Gaál. Parallel compiler generation. In Euromicro '93 Short Notes Program, Barcelona, 1993. Paru dans Microprocessing and Microprogramming, 39 (1993), pp. 147-150.

[328]
Jean H. Gallier, Frank J. Manion, and John McEnerney. CISV3: a compiler generator based on attribute evaluation. Technical report, Department of Comp. Inf. Sc., Moore School of Elec. Eng. D2, University of Pennsylvania, Philadelphia, PA, October 1985.

[329]
Jean H. Gallier. An efficient evaluator for attribute grammars with conditional rules. Technical report, Department of Comp. Inf. Sc., Moore School of Elec. Eng. D2, University of Pennsylvania, Philadelphia, PA, October 1983.

[330]
Mahadevan Ganapathi and Charles N. Fischer. Description-driven code generation using attribute grammars. In 9th ACM Symp. on Principles of Progr. Languages, pages 108-119. ACM press, Albuquerque, NM, January 1982.

[331]
Mahadevan Ganapathi and Charles N. Fischer. Affix grammar driven code generation. ACM Trans. Progr. Languages and Systems, 7(4):560-599, October 1985.

[332]
Mahadevan Ganapathi. Retargetable Code Generation and Optimization using Attribute Grammars. Ph.D. thesis, Comp. Sc. Department, University of Wisconsin-Madison, December 1980.

[333]
E. Gansner, T. R. Horgan, Chandra M. R. Kintala, D. J. Moore, and P. Surko. Semantics and correctness of a query language translation. In 9th ACM Symp. on Principles of Progr. Languages, pages 289-298. ACM press, Albuquerque, NM, January 1982.

[334]
Harald Ganzinger and Robert Giegerich. Attribute coupled grammars. In ACM SIGPLAN '84 Symp. on Compiler Construction, pages 157-170, Montréal, June 1984. ACM press. Published as sl ACM SIGPLAN Notices, 19(6).

[335]
Harald Ganzinger and Michael Hanus. Modular logic programming of compilers. Forschungsbericht 189, Fachbereich Informatik, University Dortmund, 1984.

[336]
Harald Ganzinger and Reinhard Wilhelm. Verschränkung von compiler-moduln. In J. Mülbacher, editor, GI 5. Jahrestagung, volume 34 of Lecture Notes in Computer Science, pages 654-666, New York-Heidelberg-Berlin, October 1975. Springer-Verlag. Dortmund.

[337]
Harald Ganzinger, Knut Ripken, and Reinhard Wilhelm. MUG1---an incremental compiler-compiler. In ACM 1976 Annual Conf., pages 415-418. Houston, TX, October 1976.

[338]
Harald Ganzinger, Knut Ripken, and Reinhard Wilhelm. Automatic generation of optimizing multipass compilers. In B. Gilchrist, editor, Information Processing '77, pages 535-540. North-Holland, Amsterdam, August 1977. Toronto.

[339]
Harald Ganzinger, Robert Giegerich, Ulrich Möncke, and Reinhard Wilhelm. A truly generative semantics-directed compiler generator. In ACM SIGPLAN '82 Symp. on Compiler Construction, pages 172-184. ACM press, Boston, MA, June 1982. Published as sl ACM SIGPLAN Notices, 17(6).

[340]
Harald Ganzinger, Robert Giegerich, and Martin Vach. MARVIN: a tool for applicative and modular compiler specifications. Forschungsbericht 220, Fachbereich Informatik, University Dortmund, July 1986.

[341]
Harald Ganzinger. Drei Methoden zur Beschreibung der Semantik von Programmiersprachen und Formalisierung der Semantik eines Algol 68 Subset. Diploma thesis, Abteilung Mathematik, Tech. University München, November 1973.

[342]
Harald Ganzinger. Modifizierte attributierte grammatiken. Bericht 7420, Abteilung Mathematik, Tech. University München, November 1974.

[343]
Harald Ganzinger. MUG1-manual. Bericht 7608, Institut für Informatik, Tech. University München, July 1976.

[344]
Harald Ganzinger. Deriving proof rules for programming language constructs from static and dynamic attribute structures. ??unknown reference??, August 1977.

[345]
Harald Ganzinger. Optimierende erzeugung von übersetzerteilen aus implementierungsorientierten sprachbeschreibungen. Bericht TUM-INFO-7809, Institut für Informatik, Tech. University München, May 1978.

[346]
Harald Ganzinger. Strukturelle zusammenhänge zwischen funktionalen sprachbeschreibungen und übersetzerbeschreibungen. In W. Henhalp, editor, GI Fachgespräch ``Compiler-Compiler'', pages 96-119. Fachbereich Informatik, Tech. Hochschule Darmstadt, Berlin, 1978.

[347]
Harald Ganzinger. An approach to the derivation of compiler description concepts from the mathematical semantics concept. In J. H. Böhling and P. P. Spies, editors, Fachbereich ``Compiler-Compiler'', GI 9. Jahrestagung, volume 19 of Inf. Fachb., pages 206-217, New York-Heidelberg-Berlin, 1979. Springer-Verlag. Bonn.

[348]
Harald Ganzinger. On storage optimization for automatically generated compilers. In K. Weihrauch, editor, 4th GI Conf. on Theoretical Computer Science, volume 67 of Lecture Notes in Computer Science, pages 132-141. Springer-Verlag, New York-Heidelberg-Berlin, March 1979. Aachen.

[349]
Harald Ganzinger. Some principles for the development of compiler from denotational language definitions. Bericht TUM-INFO-8006, Institut für Informatik, Tech. University München, May 1980.

[350]
Harald Ganzinger. Transforming denotational semantics into practical attribute grammars. In Neil D. Jones, editor, Semantics-Directed Compiler Generation, volume 94 of Lecture Notes in Computer Science, pages 1-69. Springer-Verlag, New York-Heidelberg-Berlin, 1980.

[351]
Harald Ganzinger. Parametrized specifications: Parameter passing and optimizing implementation. Bericht TUM-INFO-8110, Institut für Informatik, Tech. University München, August 1981.

[352]
Harald Ganzinger. An overview of the attribute definition language ADELE. In W. Henhapl, editor, GI 3. Fachgespräch ``Compiler-Compiler'', pages 22-53. München, March 1982.

[353]
Harald Ganzinger. Denotational semantics for languages with modules. In Dines Björner, editor, Formal Description of Programming Concepts II, pages 3-23. North-Holland, Amsterdam, 1983.

[354]
Harald Ganzinger. Increasing modularity and language-independency in automatically generated compilers. Science of Computer Programming, 3(3):223-278, December 1983. See also: Bericht TUM-I8306, Institut für Informatik, Tech. University München (July 1983).

[355]
Harald Ganzinger. Modular compiler descriptions based on abstract semantic data types. In J. Diaz, editor, 10th Int. Coll. on Automata, Languages and Programming, volume 154 of Lecture Notes in Computer Science, pages 237-249. Springer-Verlag, New York-Heidelberg-Berlin, July 1983. Barcelona.

[356]
Harald Ganzinger. On the design of data abstraction mechanisms for compiler description languages. In J. Bormann, editor, Programming Languages and System Design, pages 59-82. Elsevier/North Holland, 1983.

[357]
José Garcia, Martin Jourdan, and Antoine Rizk. An implementation of PARLOG using high-level tools. In Commission of the European Communities--Directorate General XIII, editor, ESPRIT '87: Achievements and Impact, pages 1265-1275. North-Holland, Amsterdam, November 1987. Brussels.

[358]
Marie-Claude Gaudel. Specification of compilers as abstract data type representation. In Neil D. Jones, editor, Semantics-Directed Compiler Generation, volume 94 of Lecture Notes in Computer Science, pages 140-164. Springer-Verlag, New York-Heidelberg-Berlin, 1980.

[359]
Marie-Claude Gaudel. Compiler generation from formal definition of programming languages: a survey. In J. Diaz and I. Ramos, editors, Int. Coll. on Formalization of Programming Concepts, volume 107 of Lecture Notes in Computer Science, pages 96-114. Springer-Verlag, New York-Heidelberg-Berlin, April 1981. Peniscola.

[360]
A. A Ghani and R. B. Hunter. An attribute grammar approach to specifying halstead's metrics. Malaysian Journal of Computer Science, 9, 1996.

[361]
Robert Giegerich and Reinhard Wilhelm. Implementierbarkeit attributierter grammatiken. In H. J. Schneider, editor, GI 7. Jahrestagung, volume 10 of Inf. Fachb., pages 17-36, New York-Heidelberg-Berlin, 1977. Springer-Verlag. Nürnberg.

[362]
Robert Giegerich and Reinhard Wilhelm. Attribute evaluation. In Michaneh Amirchahy and Danièle Néel, editors, Le Point sur la Compilation, pages 337-365. IRIA-CEC Course, Montpellier, January 1978.

[363]
Robert Giegerich and Reinhard Wilhelm. Counter-one-pass features in one-pass compilation: a formalization using attribute grammars. Information Processing Letters, 7(6):279-284, October 1978.

[364]
Robert Giegerich, Ulrich Möncke, and Reinhard Wilhelm. Invariance of approximative semantics with respect to program transformations. In W. Brauer, editor, GI 11. Jahrestagung, volume 50 of Inf. Fachb., pages 1-10, New York-Heidelberg-Berlin, 1981. Springer-Verlag.

[365]
Robert Giegerich. Introduction to the compiler generating system MUG2. Bericht TUM-INFO-7913, Institut für Informatik, Tech. University München, May 1979.

[366]
Robert Giegerich. Automatic generation of machine-specific code optimizers. In 9th ACM Symp. on Principles of Progr. Languages, pages 75-81. ACM press, Albuquerque, NM, January 1982.

[367]
Robert Giegerich. On the relation between descriptional composition and evaluation of attribute coupled grammars. Forschungsbericht 221, Fachbereich Informatik, University Dortmund, July 1986.

[368]
Robert Giegerich. Composition and evaluation of attribute coupled grammars. Acta Informatica, 25:355-423, 1988.

[369]
Gil and Makay. Parallel programming structures and attribute grammars. ACTACYB: Acta Cybernetica, 9, 1989.

[370]
Ingrid Glasner, Ulrich Möncke, and Reinhard Wilhelm. OPTRAN, a language for the specification of program transformations. In H.-J. Hoffmann, editor, GI 6. Fachtagung ``Programmiersprache und Programentwicklung'', volume 34 of Inf. Fachb., pages 125-142, New York-Heidelberg-Berlin, March 1980. Springer-Verlag. Darmstadt.

[371]
E. Gombás and M. Bartha. A multi-visit characterization of absolutely noncircular attribute grammars. Acta Cybernetica, 7:19-31, 1985.

[372]
Gombas and Bartha. Two transformations on attribute grammars improving the complexity of their evaluation. ACTACYB: Acta Cybernetica, 9, 1989.

[373]
Katsuhiko Gondow and Takuya Katayama. Attribute grammars as record calculus. Technical Report 93TR-0047, Tokyo Institute of Technology, 1993.

[374]
Katsuhiko Gondow and Takuya Katayama. On formalization of object oriented attribute grammars OOAG and higher order attribute grammars using record calculus. Technical Report 95TR-0020, Tokyo Institute of Technology, 1995.

[375]
Katsuhiko Gondow, Takashi Imaizumi, Yoichi Shinoda, and Takuya Katayama. Change management and consistency maintenance in software development environments using object oriented attribute grammars. In Object Technologies for Advanced Software, volume 742 of Lecture Notes in Computer Science, pages 77-94. First JSSST International Symposium, November 1993.

[376]
Herbert Göttler and Ewa Grabska. Attributed graph-grammars and composition-nets. In H. Noltmeier, editor, Int. Workshop on Graphtheoretic Concepts in Computer Science (WG '85), pages 119-130, Würzburg, June 1985. Trauner Verlag.

[377]
Herbert Göttler. Attributed graph grammars for graphics. In Hartmut Ehrig, Manfred Nagl, and Grzegorz Rozenberg, editors, Graph Grammars and their Application to Computer Science, volume 153 of Lecture Notes in Computer Science, pages 130-142. Springer-Verlag, New York-Heidelberg-Berlin, October 1982. Haus Ohrbeck.

[378]
Herbert Göttler. Implementation of attributed graph-grammars. In Int. Workshop on Graphtheoretic Concepts in Computer Science (WG '84). Trauner Verlag, 1984.

[379]
Susan L. Graham. Code generation and optimization. In Bernard Lorho, editor, Methods and Tools for Compiler Construction, pages 251-288. Cambridge University Press, New York, New York, 1984.

[380]
R. W. Gray, V. P. Heuring, S. P. Levi, and A. M. Sloane. Eli: A complete, flexible compiler construction system. Communications of the ACM, 35(2):121-131, Februar 1992.

[381]
Robert Gray. Comparing semantic analysis efficiency of a GAG generated compiler vs. hand written compilers. Technical Report ECE 690, Comp. Sc. Department, University of Colorado, Boulder, CO, December 1985.

[382]
Edward A. Green, M. Viswanathan, and M. S. Krishnamoorthy. Document recognition: An attribute grammar approach. In IS & T / SPIE Symposium on Electronic Imaging, Science and Technology, January 1996.

[383]
Michael Greim, Stefan Pistorius, Monika Solsbacher, and Beatrix Weisgerber. POPSY and OPTRAN manual. ESPRIT PROSPECTRA Project Deliverable Item S.1.6 - R.3.0, March 1986. Revised by Ulrich Möncke (August 1986).

[384]
Tapio Grönfors. Peak identification of auditory brainstem responses with multifilters and attributed automaton. Technical Report R-92-4, University of Turku, 1992.

[385]
E. Groller. Fractals and solid modeling. Computer Graphics Forum, 11(3):C415-C424, C484-C485, ???? 1992.

[386]
Eduard Groller. Fractals and solid modeling. volume 11, pages 415-424, September 1992.

[387]
Josef Grosch. Multiple inheritance in object-oriented attribute grammars. Technical Report 28, GMD, Karlsruhe University, 1992.

[388]
Josef Grosch. Using attribute grammars in industry. In D. Parigot and M. Mernik, editors, Second Workshop on Attribute Grammars and their Applications, WAGA'99, pages 1-16, Amsterdam, The Netherlands, March 1999. INRIA rocquencourt. (PostScript, 16 pages, 1688666 bytes)

[389]
R. Grossmann, J. Hutschenreiter, J. Lampe, J. Lötzsch, and K. Mager. Fachsprachensystem DEPOT2a. Schr. r. wbz mkr/iv, 1987.

[390]
U. Grubert. Entwurf und Implementierung einer dynamischen Speicherverwaltung im Rahmen eines Compiler-erzeugenden Systems. Diploma thesis, Lehrstuhl für Angewandte Informatik, Rheinisch-Westfälische Tech. Hoschschule Aachen, 1984.

[391]
Rajiv Gupta, Lori Pollock, and Mary Lou Soffa. Parallelizing data flow analysis. In Proceedings of the Workshop on Parallel Compilation, Kingston, Ontario, Canada, May 1990.

[392]
Tibor Gyimóthy and Janos Toczki. Syntactic pattern recognition in the HLP/PAS system. Acta Cybernetica, 8(1):79-88, 1987.

[393]
Tibor Gyimóthy, Endre Simon, and Árpád Makay. An implementation of the HLP. Acta Cybernetica, 6(3):315-327, 1983.

[394]
Tibor Gyimóthy. Natural languages interface construction using attribute grammars. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lecture Notes in Computer Science, pages 460-468. Springer-Verlag, New York-Heidelberg-Berlin, June 1991. Prague.

[395]
T. Gyimóthy, Z. Alexin, and R. Szücs. Integrated graphic environment to develop applications based on attribute grammars. In U. Kastens, editor, Proceedings of the Fourth International Conference on Compiler Construction CC'92, volume 641 of LNCS, pages 51-58, 1992.

[396]
O. Haas. Formal protocol specification based on attribute grammars. In M. Diaz, editor, 5th Internat. Workshop on Protocol Specification, Testing, and Verification, pages 39-48, Amsterdam, June 1985. Elsevier/North-Holland. Toulouse-Moissac.

[397]
M. L. Hall. The Optimization of Automatically Generated Compilers. Ph.D. thesis, Department of Comp. Sc. University of Colorado, Boulder, 1987.

[398]
H. Hansson. Preppie, a compiler-compiler directed towards generation of preprocessors. Technical Report Uptec 8485R, Uppsala Inst. of Technology, 1984.

[399]
Othar Hansson. Bayesian problem-solving applied to scheduling. Technical Report CSD-98-1028, University of California, Berkeley, January 5, 1999.

[400]
Michael Hanus. Formal specification of a prolog compiler. In Pierre Deransart, Bernard Lorho, and Jan Maluszynski, editors, Programming Languages Implementation and Logic Programming, volume 348 of Lecture Notes in Computer Science, pages 273-282. Springer-Verlag, New York-Heidelberg-Berlin, May 1988. Orléans.

[401]
Martin Hartwig. Attribute evaluation in two passes. preprint P-MATH-29/81, Institut für Informatik, Akademie der Wissenschaften der DDR, Berlin, November 1981.

[402]
Martin Hartwig. Implementation einer attribut-grammatik in SIMULA. In Vorträge der ALGOL-Tagung 1981, Dresden, 1981. Schriftreihe des WBZMKRI.

[403]
G. Hedin. Incremental Semantic Analysis. Ph.D. thesis, Lund University, Lund, Sweden, 1992. LUTEDX/(TECS-1003)/1-276/(1992).

[404]
Gorel Hedin, Lennart Ohlsson, and John McKenna. Product configuration using object oriented grammars. In 8th International Symposium on System Configuration Management (SCM-8), Brussels, July 1998. (co-located with ECOOP'98).

[405]
G. Hedin. An object-oriented notation for attribute grammars. In the 3rd European Conference on Object-Oriented Programming (ECOOP'89), BCS Workshop Series, pages 329-345, Nottingham, U.K., July 1989. Cambridge University Press. Also published in LU-CS-TR:89-42.

[406]
Görel Hedin. Incremental static-semantics analysis for object-oriented languages using door attribute grammars. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lecture Notes in Computer Science, pages 374-379. Springer-Verlag, New York-Heidelberg-Berlin, June 1991. Prague.

[407]
Görel Hedin. An overview of door attribute grammars. In Peter A. Fritzson, editor, 5th Int. Conf. on Compiler Construction (CC' 94), volume 786 of Lect. Notes in Comp. Sci., pages 31-51, Edinburgh, April 1994.

[408]
G. Hedin. Attribute extension - A technique for enforcing programming language conventions. Nordic Journal of Computing, 4:93-122, 1997.

[409]
Görel Hedin. Language support for design patterns using attribute extension. In Language Support for Design Patterns and Frameworks, Jyväskylä, Finland, 1997. Workshop in conjunction with ECOOP'97.

[410]
Gorel Hedin. Reference Attributed Grammars. In D. Parigot and M. Mernik, editors, Second Workshop on Attribute Grammars and their Applications, WAGA'99, pages 153-172, Amsterdam, The Netherlands, March 1999. INRIA rocquencourt. (PostScript, 503064 bytes)

[411]
G. Heeg and E. de Vries. LINGUA---ein Compilergenerator. Diploma thesis, Abteilung Informatik, University Dortmund, 1980.

[412]
E. C. R. Hehner and B. A. Silverberg. Programming with grammars: an exercise in methodology-directed language design. The Computer Journal, 26(3):277-281, 1983.

[413]
Jüri Heleviki and Merik B. Méristé. Problems in incremental construction of language processors. In O. M. Tammepuu, editor, Procs. of the Soviet-French Symposium Informatika '89, pages 70-75, Tallinn, May 1989.

[414]
Pedro Rangel Henriques. A semantic evaluator generating system in prolog. In Pierre Deransart, Bernard Lorho, and Jan Maluszynski, editors, Programming Languages Implementation and Logic Programming, volume 348 of Lecture Notes in Computer Science, pages 201-218. Springer-Verlag, New York-Heidelberg-Berlin, May 1988. Orléans.

[415]
Robert M. Herndon and Valdis A. Berzins. An interpretive technique for evaluating functional attribute grammars. Technical Report TR 86-5 1986, University of Minessota, Department of Computer Science.

[416]
Robert M. Herndon and Valdis A. Berzins. A method for the construction of dynamic, lazy evaluators for functional attribute grammars. Technical Report 86-6 1986, University of Minessota, Department of Computer Science.

[417]
Robert M. Herndon, Jr. and Valdis A. Berzins. AG: a useful attribute grammar translator generator. Technical Report TR 85-25, Comp. Sc. Department, University of Minnesota, Minneapolis, MN, August 1985.

[418]
Robert M. Herndon, Jr. and Valdis A. Berzins. A method for the construction of dynamic, lazy evaluators for functional attribute grammars. Technical Report TR 86-6, Comp. Sc. Department, University of Minnesota, Minneapolis, MN, February 1986.

[419]
Robert M. Herndon, Jr. and Valdis A. Berzins. The realizable benefits of a language prototyping language. Institute of Electrical and Electronics Engineers. Transactions on Software Engineering, 14(6):803-809, June 1988.

[420]
Robert M. Herndon, Jr. The incompleat AG user's guide and reference manual. Technical Report TR 85-37, Comp. Sc. Department, University of Minnesota, Minneapolis, MN, October 1985.

[421]
Diane Hernek and David P. Anderson. Efficient automated protocol implementation using RTAG. Technical Report UCB//CSD-89-526, California Berkeley, August 1989.

[422]
W. Hesse. Vollständige formale beschreibung von programmiersprachen mit zweischichtigen grammatiken. Bericht 7623, Abteilung Mathematik, Tech. University München, July 1976.

[423]
K. Hiitola. An attribute grammar for the static semantics of pascal. M.Sc. thesis, report C-1982-28, Department of Comp. Sc., University of Helsinki, 1982. (in Finnish).

[424]
P. Hirvonen. An implementation of pascal using HLP '84. M.Sc. thesis, report C-1986-5, Department of Comp. Sc., University of Helsinki, 1986. (in Finnish).

[425]
Berthold Hoffmann and I.-R. Schmiedecke. A mathematical approach to multi-pass parsing. In J. Dembinski, editor, 9th Symp. on Mathematical Foundations of Computer Science, volume 88 of Lecture Notes in Computer Science, pages 275-290. Springer-Verlag, New York-Heidelberg-Berlin, 1980. Rydzyna.

[426]
Berthold Hoffmann and I.-R. Schmiedecke. A parsing-oriented derivation model for two-level grammars based on affix-decorated parse trees. Bericht 81-2, Tech. University Berlin, 1981.

[427]
Berthold Hoffmann. Modelling compiler generation by graph grammars. In Hartmut Ehrig, Manfred Nagl, and Grzegorz Rozenberg, editors, Graph Grammars and their Application to Computer Science, volume 153 of Lecture Notes in Computer Science, pages 159-171. Springer-Verlag, New York-Heidelberg-Berlin, October 1982. Haus Ohrbeck.

[428]
Berthold Hoffmann. Using abstract data types in two-level grammars: a case study. In W. Henhapl, editor, GI 3. Fachgespräch ``Compiler-Compiler'', pages 105-119. München, March 1982.

[429]
Berthold Hoffmann. Compiler generation: from language definitions to abstract compilers. Bericht 5/83, Fachbereich Mathematik/Informatik, University Bremen, September 1983. Also Dissertation, Tech. University Berlin.

[430]
Berthold Hoffmann. Unifying van-wijngaarden and attribute grammars by transformation. tech. bericht, University Bremen, 1985.

[431]
U. Hohenstein and G. Engels. SQL/EER - syntax and semantics of an entity-relationship-based query language. Technical report, Technischen Universität Braunschweig, 1991.

[432]
Jason Holdsworth and Anthony M. Sloane. Beyond traditional program slicing. Technical Report JCU-CS-95/8, Department of Computer Science, James Cook University, August 1 1995.

[433]
Clifford R. Hollander. Use of an attribute grammar in network-based representation schemes. In Proceedings of the Third Biennial Conference of the Canadian Society for Computational Studies of Intelligence, pages 95-100, 1980.

[434]
Roger Hoover and Tim Teitelbaum. Efficient incremental evaluation of aggregate values in attribute grammars. In ACM SIGPLAN '86 Symp. on Compiler Construction, pages 39-50. ACM press, Palo Alto, CA, June 1986. Published as ACM SIGPLAN Notices, volume 21, number 7.

[435]
Roger Hoover. Dynamically bypassing copy rule chains in attribute grammars. In 13th ACM Symp. on Principles of Progr. Languages, pages 14-25. ACM press, St Petersburg Beach, Fl, January 1986.

[436]
Roger Hoover. Incremental Graph Evaluation. Ph.D. thesis, Department of Comp. Sc., Cornell University, Ithaca, NY, May 1987.

[437]
Susan Horwitz and Tim Teitelbaum. Relations and attributes: a symbiotic basis for editing environments. In ACM SIGPLAN '85 Symp. on Language Issues in Programming Environments, pages 93-106. ACM press, Seattle, WA, June 1985. Published as ACM SIGPLAN Notices, volume 20, number 7.

[438]
Susan Horwitz and Tim Teitelbaum. Generating editing environments based on relations and attributes. ACM Trans. Progr. Languages and Systems, 8(4):577-608, October 1986.

[439]
Susan Horwitz. Generating Language-Based Editors: a Relationaly-Attributed Approach. Ph.D. thesis, Department of Comp. Sc., Cornell University, Ithaca, NY, August 1985.

[440]
Bernard Houssais. Analyse d'erreurs dans les compilateurs d'algol 68. In 2ème Congrès AFCET de Génie Logiciel, pages 387-402. Nice, June 1984.

[441]
S. E. Hudson and R. King. A generator of direct manipulation office systems. ACM Trans. on Office Inf. Sys., 4(2):132, 1986.

[442]
Scott E. Hudson and Roger King. Implementing a user interface as a system of attributes. In ACM Conf. on Programming Environments, volume 244 of Lecture Notes in Computer Science, pages 143-149. Springer-Verlag, New York-Heidelberg-Berlin, June 1986. Trondheim.

[443]
Scott E. Hudson and Roger King. Semantic feedback in the higgen UIMS. Institute of Electrical and Electronics Engineers. Transactions on Software Engineering, SE-14(8):1188-1206, August 1988.

[444]
Scott E. Hudson. A User Interface Management System which Supports Direct Manipulation. Ph.D. thesis, Department of Comp. Sc., University of Colorado, Boulder, 1986.

[445]
Scott E. Hudson. Incremental attribute evaluation: an algorithm for lazy evaluation in graphs. Technical Report TR 87-20, University of Arizona, Tucson, 1987.

[446]
Talib S. Hussain and Roger A. Browse. Basic properties of attribute grammar encoding. In John R. Koza, editor, Late Breaking Papers at the Genetic Programming 1998 Conference, University of Wisconsin, Madison, Wisconsin, USA, 22-25 July 1998. Stanford University Bookstore.

[447]
M. Ikonen. An attribute grammar for PL360. M.Sc. thesis, report C-1979-24, Department of Comp. Sc., University of Helsinki, 1979. (in Finnish).

[448]
R. Inada. Design of a semantic description language based on attribute grammars and its application to pascal. Bachelor thesis, College of Information Sciences, University of Tsukuba, Ibaraki-ken, 1984. (in Japanese).

[449]
C. Insalaco and W. Tracz. GLUE (graphical layout user environment) user guide. Technical Report ADAGE-LOR-94-04A, Loral Federal Systems, August 1995.

[450]
E. T. Irons. A syntax-directed compiler for ALGOL 60. Communications of the Association for Computing Machinery, 4(1):51-55, January 1961.

[451]
Tomás Isakowitz. Can we transform logic programs into attribute grammars? Journal of Theoretical Informatics and Application, 25(6):499-543, 1991.

[452]
Harushi Ishizuka and Masataka Sassa. A compiler generator based on attribute grammars. In Procs. of 26th Programming Symposium, pages 69-80, Hakone, 1985. IPS Japan. (in Japanese).

[453]
Harushi Ishizuka. A compiler generator based on an attribute grammar suitable for LR parsing. Master's thesis, College of Information Sciences, University of Tsukuba, Ibaraki-ken, 1984. (in Japanese).

[454]
N. Iwamoto. Relational attribute grammars. M. eng. thesis, Department of Comp. Sc., Yamanashi University, 1985. (in Japanese).

[455]
T. Jacob and P. Cahill. Software product metrics as attributes in an attribute grammar. In Proceedings of the Second International Conference on Software Quality, pages 40-49, Research Triangle Park, NC, October 1992.

[456]
Fahimeh Jalili. Design of Incremental Compilers. Ph.D. thesis, Department of Comp. Inf. Sc., Moore School of Elec. Eng. D2, University of Pennsylvania, Philadelphia, PA, 1982.

[457]
Fahimeh Jalili. A general linear-time evaluator for attribute grammars. ACM SIGPLAN Notices, 18(9):35-44, September 1983.

[458]
Fahimeh Jalili. A general incremental evaluator for attribute grammars. Science of Computer Programming, 5(1):83-96, February 1985.

[459]
Mehdi Jazayeri and Diane Pozefsky. Efficient evaluation of multi-pass attribute grammars without a parse tree. In 1977 Conf. on Information Sciences and Systems, pages 184-189. John Hopkins University, Baltimore, MD, April 1977. Extended version: report TR 77-001, Department of Comp. Sc., University of North Carolina, Chapel Hill, NC (February 1977, revised May 1979).

[460]
Mehdi Jazayeri and Diane Pozefsky. A space improvement in the alternating semantic evaluator. In ACM 1980 Annual Conf., pages 498-504. ACM press, Nashville, TE, October 1980. See also: report TR 80-002, Department of Comp. Sc., University of North-Carolina, Chapel Hill, NC (October 1980).

[461]
Mehdi Jazayeri and Diane Pozefsky. Space-efficient storage management in an attribute evaluator. ACM Trans. Progr. Languages and Systems, 3(4):388-404, October 1981. See also: report TR 79-007, Department of Comp. Sc., University of North Carolina, Chapel Hill, NC (May 1979).

[462]
Mehdi Jazayeri and K. G. Walter. Alternating semantic evaluator. In ACM 1975 Annual Conf., pages 230-234. ACM press, Minneapolis, MN, October 1975.

[463]
Mehdi Jazayeri, William F. Ogden, and William C. Rounds. The intrinsically exponential complexity of the circularity problem for attribute grammars. Communications of the Association for Computing Machinery, 18(12):679-706, December 1975.

[464]
Mehdi Jazayeri, William F. Ogden, and William C. Rounds. On the complexity of circularity tests for attribute grammars. In 2nd ACM Symp. on Principles of Progr. Languages, pages 119-129. ACM press, Palo Alto, CA, January 1975.

[465]
Mehdi Jazayeri. On Attribute Grammars and the Semantic Specification of Programming Languages. Ph.D. thesis, Jennings Computing Center, Case Western Reserve University, Cleveland, OH, October 1974.

[466]
Mehdi Jazayeri. Live variable analysis, attribute grammars, and program optimization. manuscript, Department of Comp. Sc., University of North Carolina, Chapel Hill, NC, March 1975.

[467]
Mehdi Jazayeri. Formal specification and automatic programming. In 2nd Int. Conf. on Software Engineering, pages 293-296. San Francisco, CA, October 1976.

[468]
Mehdi Jazayeri. A simpler construction for showing the intrinsically exponential complexity of the circularity problem for attribute grammars. J. ACM, 28(4):715-720, October 1981.

[469]
P. Jespersen, M. Madsen, and Hanne Riis-Nielson. New extended attributed system (NEATS). report daimi, Comp. Sc. Department, Aarhus University, 1978.

[470]
Xiaoping Jia and Jiahua Qian. Incremental evaluation of attributed grammars for incremental programming environments. In IEEE COMPSAC '85, pages 342-349. Chicago, Il, October 1985.

[471]
G. Jochum and W. Willmertinger. A tool for developing text processing systems: Translator writing systems. Bericht TUM-INFO-8103, Institut für Informatik, Tech. University München, May 1981.

[472]
G. Jochum. Generierung Optimierter Semantischer Analyse für Ein- und Mehrpass-Übersetzer. Diploma thesis, Institut für Informatik, Tech. University München, November 1977.

[473]
G. Jochum. Automatische konstruction und einheitliche darstellung von attributauswertungsalgorithmen. Bericht TUM-INFO-8113, Institut für Informatik, Tech. University München, June 1981.

[474]
G. Jochum. Effiziente attributauswertung durch kombination verschiedener strategien. In W. Henhapl, editor, GI 3. Fachgespräch ``Compiler-Compiler'', pages 54-74. München, March 1982.

[475]
K. R. Johmann. A modified attribute grammar and its applications to software maintenance environments. M.sc. thesis, Department of Comp. Inf. Sc., University of Florida, Gainesville, November 1989.

[476]
Gregory F. Johnson and Charles N. Fischer. Non-syntactic attribute flow in language based editors. In 9th ACM Symp. on Principles of Progr. Languages, pages 185-195. ACM press, Albuquerque, NM, January 1982.

[477]
Gregory F. Johnson and Charles N. Fischer. A meta-language and system for nonlocal incremental attribute evaluation in language-based editors. In 12th ACM Symp. on Principles of Progr. Languages, pages 141-151. ACM press, New-Orleans, LA, January 1985.

[478]
Gregory F. Johnson. An Approach to Incremental Semantics. Ph.D. thesis, Department of Comp. Sc., University of Wisconsin-Madison, 1983.

[479]
Thomas Johnsson. Lambda lifting: Transforming programs to recursive equations. In Conf. on Func. Prog. Languages and Computer Architecture., Mancy, 1985. ACM Press.

[480]
T. Johnsson. Target code generation from the G-machine code. Technical Report 39, Programming Methodology Group, University of Goteborg and Chalmers University of Technology, February 1987. Part of the PhD thesis: Compiling Lazy Functional Languages, 1987. Presented at the Graph Reduction Workshop, Santa Fe, Sep 1986.

[481]
Thomas Johnsson. Attribute grammars as a functional programming paradigm. In Gilles Kahn, editor, Func. Prog. Languages and Computer Architecture, volume 274 of Lecture Notes in Computer Science, pages 154-173. Springer-Verlag, New York-Heidelberg-Berlin, September 1987. Portland.

[482]
Neil D. Jones and C. M. Madsen. Attribute-influenced LR parsing. In Neil D. Jones, editor, Semantics-Directed Compiler Generation, volume 94 of Lecture Notes in Computer Science, pages 393-407. Springer-Verlag, New York-Heidelberg-Berlin, 1980.

[483]
Neil D. Jones and D. A. Schmidt. Compiler generation from denotational semantics. In Séminaires Langages et Traducteurs 1978-1981, pages 51-74. INRIA, Rocquencourt, 1981.

[484]
Larry G. Jones and Janos Simon. Hierarchical VLSI design systems based on attribute grammars. In 13th ACM Symp. on Principles of Progr. Languages, pages 58-69. ACM press, St Petersburg Beach, FL, January 1986.

[485]
Neil D. Jones and M. Tofte. Some principles and notations for the construction of compiler generators. internal report, Datalogisk Institut, University of Copenhagen, July 1983.

[486]
Neil D. Jones. Circularity testing of attribute grammars requires exponential time: a simpler proof. report DAIMI PB-107, Comp. Sc. Department, Aarhus University, 1980.

[487]
Neil D. Jones, editor. Semantics-directed Compiler Generation, volume 94 of Lecture Notes in Computer Science. Springer-Verlag, New York-Heidelberg-Berlin, 1980.

[488]
Larry G. Jones. Incremental VLSI Design Systems Based on Circular Attribute Grammars. Ph.D. thesis, Comp. Sc. Department, Pennsylvania State University, 1986.

[489]
Larry G. Jones. Efficient evaluation of circular attribute grammars. ACM Trans. Progr. Languages and Systems, 12(3):429-462, July 1990.

[490]
Martin Jourdan and Didier Parigot. The FNC-2 System User's Guide and Reference Manual. INRIA, Rocquencourt, 1.9 edition. (Gzipped PostScript, 348 pages, 733303 bytes)

[491]
Martin Jourdan and Didier Parigot. More on speeding up circularity tests for attribute grammars. rapport RR-828, INRIA, Rocquencourt, April 1988.

[492]
Martin Jourdan and Didier Parigot. The FNC-2 system: Advances in attribute grammar technology. In O. M. Tammepuu, editor, Procs. of the Soviet-French Symposium Informatika '89, pages 94-118, Tallinn, May 1989. See also: rapport RR-834, INRIA, Rocquencourt (April 1988).

[493]
Martin Jourdan and Didier Parigot. The FNC-2 System User's Guide and Reference Manual. INRIA, Rocquencourt, February 1989. release 0.4 This manual is periodically updated.

[494]
Martin Jourdan and Didier Parigot. Application Development with the FNC-2 Attribute Grammar System. In Dieter Hammer and Michael Albinus, editors, Compiler Compilers '90, volume 477 of Lect. Notes in Comp. Sci., pages 11-25. Springer-Verlag, Schwerin, 1990. (Gzipped PostScript, 15 pages, 71416 bytes)

[495]
Martin Jourdan and Didier Parigot. Techniques for Improving Grammar Flow Analysis. In Neil Jones, editor, European Symp. on Programming (ESOP '90), volume 432 of Lect. Notes in Comp. Sci., pages 240-255, Copenhague, 1990. Springer-Verlag. (Gzipped PostScript, 17 pages, 76745 bytes)

[496]
Martin Jourdan and Didier Parigot. Internals and Externals of the FNC-2 Attribute Grammar System. In Henk Alblas and Borivoj Melichar, editors, Attribute Evaluation Methods, volume 545 of Lect. Notes in Comp. Sci., pages 485-504, New York-Heidelberg-Berlin, June 1991. Springer-Verlag. Prague. (Gzipped PostScript, 20 pages, 88451 bytes)

[497]
Martin Jourdan, Carole LeBellec, and Didier Parigot. The Olga Attribute Grammar Description Language: Design, Implementation and Evaluation. volume 461 of Lecture Notes in Computer Science, pages 222-237, New York-Heidelberg-Berlin, September 1990. Springer-Verlag. (Gzipped PostScript, 16 pages, 71614 bytes)

[498]
Martin Jourdan, Didier Parigot, Catherine Julié, Olivier Durin, and Carole Le Bellec. Design, implementation and evaluation of the FNC-2 attribute grammar system. In Conf. on Programming Languages Design and Implementation, pages 209-222, White Plains, NY, June 1990. Published as sl ACM SIGPLAN Notices, 25(6). (Gzipped PostScript, 14 pages, 80244 bytes)

[499]
Martin Jourdan, Bruno Marmol, and Didier Parigot. Experiments with a Real Parallel Attribute Evaluator. En préparation pour soumission, 1994. (Gzipped PostScript, 10 pages, 83243 bytes)

[500]
Martin Jourdan. Un évaluateur efficace pour les grammaires attribuées fortement non-circulaires. rapport 82-39, Laboratoire d'Informatique Théorique et Programmation, Paris, September 1982.

[501]
Martin Jourdan. An efficient recursive evaluator for strongly non-circular attribute grammars. rapport RR 235, INRIA, Rocquencourt, October 1983.

[502]
Martin Jourdan. Les grammaires attribuées: implantation, applications, optimisations. thèse ddi, University Paris VII, May 1984.

[503]
Martin Jourdan. An optimal-time recursive evaluator for attribute grammars. In M. Paul and Bernard Robinet, editors, 6th Int. Symp. on Programming, volume 167 of Lecture Notes in Computer Science, pages 167-178. Springer-Verlag, New York-Heidelberg-Berlin, April 1984. Toulouse.

[504]
Martin Jourdan. Recursive evaluators for attribute grammars: an implementation. In Bernard Lorho, editor, Methods and Tools for Compiler Construction, pages 139-164. Cambridge University Press, New York, New York, 1984.

[505]
Martin Jourdan. Strongly non-circular attribute grammars and their recursive evaluation. In ACM SIGPLAN '84 Symp. on Compiler Construction, pages 81-93. ACM press, Montréal, June 1984. Published as ACM SIGPLAN Notices, volume 19, number 6.

[506]
Martin Jourdan. Évaluation récursive des grammaires attribuées: deux implantations. rapport RR 409, INRIA, Rocquencourt, May 1985. Extended abstract: Soviet-French Symp. on Computer Science, Institute of Cybernetics of the Academy of Sciences of the SSR of Estonia, Tallinn, USSR, pp. 31-35 (May 1985).

[507]
Martin Jourdan. A Survey of Parallel Attribute Evaluation Methods. In Alblas and Melichar [9], pages 234-255. Prague. (Gzipped PostScript, 15 pages, 71416 bytes)

[508]
Martin Jourdan. Des bienfaits de l'analyse statique sur la mise en oe uvre des grammaires attribuées. Mémoire d'habilitation, Département de Mathématiques et d'Informatique, Université d'Orléans, 1992. (Gzipped PostScript, 64 pages, 253337 bytes)

[509]
Jean-Philippe Jouve. Réalisation du décompilateur d'arbres attribués du système FNC-2 : ppat . Rapport de stage d'option, École Polytechnique, 1991. (Gzipped PostScript, 214 pages, 236395 bytes)

[510]
Catherine Julié and Didier Parigot. Space Optimization in the FNC-2 Attribute Grammar System. Rapport de recherche 1165, INRIA, 1990.

[511]
Catherine Julié and Didier Parigot. Space Optimization in the FNC-2 Attribute Grammar System. In Pierre Deransart and Martin Jourdan, editors, Attribute Grammars and their Applications (WAGA), volume 461 of Lect. Notes in Comp. Sci., pages 29-45, Paris, September 1990. Springer-Verlag. (Gzipped PostScript, 15 pages, 71879 bytes)

[512]
Catherine Julié. Optimisation de l'espace mémoire pour les compilateurs générés selon la méthode d'évaluation OAG: étude des travaux de kastens et propositions d'améliorations. rapport de DEA, Dépt. d'Informatique, University d'Orléans, September 1986.

[513]
Catherine Julié. Optimisation de l'espace mémoire pour l'évaluation de grammaires attribuées. PhD thesis, Université d'Orléans, September 1989.

[514]
R. K. Jullig and Frank De Remer. Regular right-part attribute grammars. In ACM SIGPLAN '84 Symp. on Compiler Construction, pages 171-189. ACM press, Montréal, June 1984. Published as ACM SIGPLAN Notices, volume 19, number 6.

[515]
L. Juutinen. An attribute grammar for a subset of ada. report C-1982-91, Department of Comp. Sc., University of Helsinki, 1982. (in Finnish).

[516]
K. Ohmaki et al. A system for generating language-oriented editors based on attribute grammars. The Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E, J67-D(1):25-32, 1984. (in Japanese).

[517]
G. E. Kaiser and D. Garlan. MELD: A declarative language for writing methods. Technical report, Carnegie-Mellon University, SEI, Pittsburgh, PA, June 1986.

[518]
Gail E. Kaiser and Simon M. Kaplan. Parallel and distributed incremental attribute evaluation. Technical Report CUCS-412-88, Department of Comp. Sc., Columbia University, New York, September 1988.

[519]
Gail E. Kaiser and Simon M. Kaplan. Parallel and distributed incremental attribute evaluation algorithms for multi-user software development environments. In ACM Transactions on Software Engineering and Methodology, volume 2 of 1, pages 47-92. ACM press, January 1993.

[520]
Gail E. Kaiser, Simon M. Kaplan, and Josephine Micallef. Multi-user, distributed language-based environments. IEEE Software, ??:58-67, November 1987.

[521]
Gail E. Kaiser, Peter H. Feiler, Fahimeh Jalili, and Johann H. Schlichter. A retrospective on DOSE: An interpretive approach to structure editor generation. Software--Practice and Experience, 18(8):733-748, August 1988.

[522]
Gail E. Kaiser. Semantics of Structure Editing Environments. Ph.D. thesis, Department of Comp. Sc., Carnegie-Mellon University, 1985.

[523]
Gail E. Kaiser. Specification of interpreters and debuggers using an extension of attribute grammars. Technical Report CUCS-196-85, Department of Comp. Sc., Columbia University, New York, NY, November 1985.

[524]
Gail E. Kaiser. Generation of run-time environments. In ACM SIGPLAN '86 Symp. on Compiler Construction, pages 51-57. ACM press, Palo Alto, CA, June 1986. Published as ACM SIGPLAN Notices, volume 21, number 7.

[525]
Tsutomu Kamimura. Tree automata and attribute grammars. In J. Diaz, editor, 10th Int. Coll. on Automata, Languages and Programming, volume 154 of Lecture Notes in Computer Science, pages 374-384. Springer-Verlag, New York-Heidelberg-Berlin, July 1983. See also: report TR-82-1, Department of Comp. Sc., University of Kansas (1982).

[526]
Simon M. Kaplan and Steven K. Goering. Priority controlled incremental attribute evaluation in attributed graph grammars. In J. Díaz and F. Orejas, editors, TAPSOFT '89, Vol. 1: Coll. on Trees in Algebra and Programming (CAAP '89), volume 351 of Lecture Notes in Computer Science, pages 306-320. Springer-Verlag, New York-Heidelberg-Berlin, 89. Barcelona.

[527]
Simon M. Kaplan and Gail E. Kaiser. Incremental attribute evaluation in distributed language-based environments. In 5th ACM Symp. on Principles of Distributed Computing, pages 121-130. ACM press, Calgary, August 1986. See also: report UIUCDCS-R-86-1294, University of Illinois at Urbana-Champaign (September 1986).

[528]
Simon M. Kaplan, Steven K. Goering, and Roy H. Campbell. Supporting the software development process with attributed NLC graph grammars. In Grzegorz Rozenberg, Hartmut Ehrig, Manfred Nagl, and A. Rosenfeld, editors, Third Int. Workshop on Graph Grammars and their Application to Computer Science, volume 291 of Lecture Notes in Computer Science, pages 309-325, New York-Heidelberg-Berlin, December 1986. Springer-Verlag. Warrenton.

[529]
Simon M. Kaplan. Incremental attribute evaluation on graphs. Technical Report UIUC-DCS-86-1309, University of Illinois at Urbana-Champaign, December 1986. revised version.

[530]
Simon M. Kaplan. Incremental attribute evaluation on node-label controlled graphs. Technical Report UIUCDCS-R-87-1309, Department of Comp. Sc., University of Illinois at Urbana-Champaign, May 1987.

[531]
M. Karttunen. On circularity tests for semantic attributes. M.Sc. thesis, report C-1977-87, Department of Comp. Sc., University of Helsinki, 1977. (in Finnish).

[532]
Einführung in attributierte grammatiken. In W. Henhalp, editor, GI Fachgespräch ``Compiler-Compiler'', pages 9-19. Fachbereich Informatik, Tech. Hochschule Darmstadt, Berlin, 1978.

[533]
Uwe Kastens and M. Schmidt. Lifetime analysis for procedure parameters. In B. Robinet and Reinhard Wilhelm, editors, European Symp. on Programming (ESOP '86), volume 213 of Lecture Notes in Computer Science, pages 53-69. Springer-Verlag, New York-Heidelberg-Berlin, March 1986. Saarbrücken.

[534]
Uwe Kastens and William M. Waite. Modularity and Reusability in Attribute Grammars. Acta Informatica, 31:601-627, 1994.

[535]
Uwe Kastens and Erich Zimmermann. GAG A generator based on attribute grammars. Bericht 14/80, Institut für Informatik, University Karlsruhe, 1980. See also: Séminaires Langages et Traducteurs 1978-1981, INRIA, Rocquencourt, pp. 141-158 (1981).

[536]
Uwe Kastens, R. Kollner, Erich Zimmermann, P. Hruschka, and A. Kappatsch. Eine attributierte grammatik für PEARL. Bericht, Institut für Informatik II, University Karlsruhe, 1980.

[537]
Uwe Kastens, Brigitte Hutt, and Erich Zimmermann. GAG: A Practical Compiler Generator, volume 141 of Lecture Notes in Computer Science. Springer-Verlag, New York-Heidelberg-Berlin, 1982.

[538]
Uwe Kastens, Peter Pfahler, and Matthias Jung. The eli system. In Kai Koskimies, editor, Compiler Construction CC'98, volume 1383 of Lect. Notes in Comp. Sci., portugal, April 1998. Springer-Verlag. tool demonstration.

[539]
Uwe Kastens. Ein übersetzer-erzeugendes system auf der basis attributierter grammatiken. interner Bericht 10, Fakultät für Informatik, University Karlsruhe, September 1976.

[540]
Uwe Kastens. Systematische analyse semantischer abhängigkeiten. In H.-J. Schneider and Manfred Nagl, editors, GI 4. Fachtagung ``Programmiersprachen'', volume 1 of Inf. Fachb., pages 19-32, New York-Heidelberg-Berlin, 1976. Springer-Verlag.

[541]
Uwe Kastens. ALADIN eine definitionssprache für attributierte grammatiken. Bericht 7/79, Institut für Informatik II, University Karlsruhe, July 1979.

[542]
Uwe Kastens. Ordered attribute grammars. Acta Informatica, 13(3):229-256, 1980. See also: Bericht 7/78, Institut für Informatik II, University Karlsruhe (1978).

[543]
Uwe Kastens. The GAG-system---A tool for compiler construction. In Bernard Lorho, editor, Methods and Tools for Compiler Construction, pages 165-182. Cambridge University Press, New York, New York, 1984.

[544]
Uwe Kastens. Lifetime analysis for attributes. Acta Informatica, 24(6):633-652, November 1987.

[545]
Uwe Kastens. Attribute grammars in a compiler construction environment. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lecture Notes in Computer Science, pages 380-400. Springer-Verlag, New York-Heidelberg-Berlin, June 1991. Prague.

[546]
Uwe Kastens. Implementation of visit-oriented attribute evaluators. In Alblas and Melichar [9], pages 114-139. Prague.

[547]
Uwe Kastens. Implementation of visit-oriented attribute evaluators. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lecture Notes in Computer Science, pages 114-139. Springer-Verlag, New York-Heidelberg-Berlin, June 1991. Prague.

[548]
Uwe Kastens. Executable specifications for language implementation. In Maurice Bruynooghe and Jaan Penjam, editors, Programming Language Implementation and Logic Programming (PLILP '93), volume 714 of Lect. Notes in Comp. Sci., pages 1-11, Tallinn, 1993. Springer-Verlag.

[549]
Takuya Katayama and Yutaka Hoshino. Verification of attribute grammars. In 8th ACM Symp. on Principles of Progr. Languages, pages 177-186. ACM press, Williamsburg, VA, January 1981.

[550]
Takuya Katayama and Hisashi Sasaki. Global storage allocation in attribute evaluation. In 13th ACM Symp. on Principles of Progr. Languages, pages 26-37. ACM press, St Petersburg Beach, Fl, January 1986. Extended version in RIMS Symp. on Software Science and Engineering II, Kyoto, LNCS 220, Springer-Verlag, pp. 181-211 (1984).

[551]
Takuya Katayama. HFP: a hierarchical and functional programming methodology based on attribute grammars. In 5th Int. Conf. on Software Engineering, pages 343-352. San Diego, CA, March 1981. Extended version: report CS-K-8102, Tokyo Institute of Technology (January 1981).

[552]
Takuya Katayama. Translation of attribute grammars into procedures. ACM Trans. Progr. Languages and Systems, 6(3):345-369, July 1984.

[553]
Takuya Katayama. Attribute grammar as a language for describing the conceptual model of the software designer's associate. In Proc. of the 21st Hawai Internat. Conf. on Software Systems, page ???, 1988.

[554]
Charok Kaviani. Comparaison de deux Méthodes d'évaluation d'attributs sémantiques: GAG et FNC. thèse de 3ème cycle, University de Paris VI, January 1984.

[555]
J. Kelleher, F. McGriff, and Diane Pozefsky. TAG: Testing attribute grammars, architectural description. report, Department of Comp. Sc., University of North Carolina, Chapel Hill, NC, May 1975.

[556]
Paul Keller and Thomas Maas. An OPTRAN-generated ada rightarrow DIANA front-end. Technical report, FB 10 -- Informatik, University des Saarlandes, Saarbrücken, 1988.

[557]
Paul Keller and Thomas Maas. An OPTRAN-generated front-end for ada. In Pierre Deransart and Martin Jourdan, editors, Attribute Grammars and their Applications (WAGA), volume 461 of Lecture Notes in Computer Science, pages 266-283. Springer-Verlag, New York-Heidelberg-Berlin, September 1990. Paris.

[558]
S. E. Keller, J. A. Perkins, Teri F. Payton, and S. P. Mardinly. Tree transformation techniques and experiences. In ACM SIGPLAN '84 Symp. on Compiler Construction, pages 190-201. ACM press, Montréal, June 1984. Published as ACM SIGPLAN Notices, volume 19, number 6.

[559]
Paul Keller. Spezifikation und Implementierung eines Compilerfrontends für Ada: Deklarations- und Nameklassanalyse. Diploma thesis, FB 10 -- Informatik, University des Saarlandes, Saarbrücken, 1988.

[560]
Wolfgang Keller. Automated generation of code using backtracking parsers for attribute grammars. ACM SIGPLAN Notices, 26(2):109-117, February 1991.

[561]
Ken Kennedy and J. Ramanathan. A deterministic attribute grammar evaluator based on dynamic sequencing. ACM Trans. Progr. Languages and Systems, 1(1):142-160, July 1979.

[562]
Ken Kennedy and S. K. Warren. Automatic generation of efficient evaluators for attribute grammars. In 3rd ACM Symp. on Principles of Progr. Languages, pages 32-49. ACM press, Atlanta, Ge, January 1976.

[563]
Khalid A. Mughal, John H. Reppy and Lars Søraas. ML code generation for AML specifications. In In Proceedings of the Nordic Workshop on Programming Environments Research (NWPER'94), 1994.

[564]
Yutaka Kikuchi. An evaluation method of an attribute grammar based language by extended term rewriting systems. Technical Report 93TR-0033, Tokyo Institute of Technology, 1993.

[565]
Chandra M. R. Kintala. Attributed grammars for query language translation. In 2nd ACM Symp. on Principles of Database Systems, pages 137-148. ACM press, March 1983.

[566]
G. Kókai, Z. Alexin, and T. Gyimóthy. Analyzing and learning ECG waveforms. In The Sixth International Workshop on Inductive Logic Programming (ILP'96), pages 152-171, Stockholm, Sweden, 1996.

[567]
Klaiber and Gokhale. Parallel evaluation of attribute grammars. In ICPP: 18th International Conference on Parallel Processing, 1989.

[568]
Alexander Klaiber and Maya Gokhale. Parallel evaluation of attribute grammars. IEEE Transactions on Parallel and Distributed Systems, 3(2):206-220, March 1992.

[569]
Eduard Klein and Kai Koskimies. The parallelization of one-pass compilers. Arbeitspapier 416, GMD, Karlsruhe, November 1989.

[570]
Eduard Klein and Kai Koskimies. Parallel one-pass compilation. In Pierre Deransart and Martin Jourdan, editors, Attribute Grammars and their Applications (WAGA), volume 461 of Lecture Notes in Computer Science, pages 76-90. Springer-Verlag, New York-Heidelberg-Berlin, September 1990. Paris.

[571]
Jürgen Knopp and Scott E. Hudson. Attributierte transitionsnetze und ihre anwendungen in programmierumgebungen incremental attribute evaluation: a flexible algorithm for lazy update. ACM Trans. Progr. Languages and Systems, 13(3):315-341, July 1987. Bericht TUM-INFO-10-87-I14-350.

[572]
Donald E. Knuth. Semantics of context-free languages. Mathematical Systems Theory, 2(2):127-145, June 1968. Correction: sl Mathematical Systems Theory 5, 1, pp. 95-96 (March 1971).

[573]
Donald E. Knuth. Examples of formal semantics. In E. Engeler, editor, Symp. on Semantics of Algorithmic Languages, volume 188 of Lecture Notes in Mathematics, pages 212-235. Springer-Verlag, New York-Heidelberg-Berlin, 1971.

[574]
Donald E. Knuth. The genesis of attribute grammars. In Pierre Deransart and Martin Jourdan, editors, Attribute Grammars and their Applications (WAGA), volume 461 of Lecture Notes in Computer Science, pages 1-12. Springer-Verlag, New York-Heidelberg-Berlin, September 1990. Paris.

[575]
John Kontos and George K. Papakonstantinou. The interpretation of meta-grammars describing syntax-directed interpreters using an attribute grammar interpreter. Institute of Electrical and Electronics Engineers. Transactions on Software Engineering, SE-8(4):435-436, 1982.

[576]
John Kontos and J. C. Savouras. Knowledge acquisition from technical texts using attribute grammars. The Computer Journal, 31(6):525-530, 1988.

[577]
John Kontos. Syntax-directed plan recognition with a microcomputer. Microprocessing and Microprogramming, 9:277-279, 1982.

[578]
John Kontos. Natural language processing of scientific/technical data, knowledge and text bases. In Artint Workshop, Luxembourg, 1985. Re'fe'rence a` comple'ter.

[579]
L. Kortessalo. Description of the lexical metalanguage of HLP using HLP. report C-1980-68, Department of Comp. Sc., University of Helsinki, July 1980. (in Finnish).

[580]
Kai Koskimies and L. Juutinen. An attribute grammar for the compile-time semantics of the programming language euclid. report C-1979-130, Department of Comp. Sc., University of Helsinki, December 1979.

[581]
Kai Koskimies and Merik B. Méristé. Experiences with class-based implementation of programming languages. report A-1988-12, Department of Comp. Sc., University of Helsinki, November 1988.

[582]
Kai Koskimies and Jukka Paakki. HLP84 semantic metalanguage and its implementation. report C-1983-69, Department of Comp. Sc., University of Helsinki, 1983.

[583]
Kai Koskimies and Jukka Paakki. TOOLS: a unifying approach to object-oriented language interpretation. In ACM SIGPLAN '87 Symp. on Interpreters and Interpretetive Techniques, pages 153-164. ACM press, St. Paul, MN, June 1987. Published as ACM SIGPLAN Notices, volume 22, number 7.

[584]
Kai Koskimies and Jukka Paakki. High-level tools for language implementation. J. of Systems and Software, 15(2):115-132, May 1991.

[585]
Kai Koskimies and Kari-Jouko Räihä. Modelling of space-efficient one-pass translation using attribute grammars. Software--Practice and Experience, 13(2):119-129, February 1983. See also: report C-1982-63, Department of Comp. Sc., University of Helsinki (1982).

[586]
Kai Koskimies, Kari-Jouko Räihä, and Matti Sarjakoski. Compiler construction using attribute grammars. In ACM SIGPLAN '82 Symp. on Compiler Construction, pages 153-159. ACM press, Boston, MA, June 1982. Published as ACM SIGPLAN Notices, volume 17, number 6.

[587]
Kai Koskimies, Tapio Elomaa, Tapio Lehtonen, and Jukka Paakki. TOOLS/HLP84 report and user manual. report A-1988-2, Department of Comp. Sc., University of Helsinki, February 1988.

[588]
Kai Koskimies, Otto Nurmi, Jukka Paakki, and Seppo Sippu. The design of a language processor generator. Software--Practice and Experience, 18(2):107-135, February 1988.

[589]
Kai Koskimies. An attribute grammar for a subset of the programming language euclid. report, Department of Comp. Sc., University of Helsinki, 1981.

[590]
Kai Koskimies. An experience on language implementation using attribute grammars. report A-1982-2, Department of Comp. Sc., University of Helsinki, March 1982.

[591]
Kai Koskimies. Extensions of One-pass Attribute Grammars. Ph.D. thesis, Department of Comp. Sc., University of Helsinki, December 1983.

[592]
Kai Koskimies. A specification language for one-pass semantic analysis. In ACM SIGPLAN '84 Symp. on Compiler Construction, pages 179-189. ACM press, Montréal, June 1984. Published as ACM SIGPLAN Notices, volume 19, number 6.

[593]
Kai Koskimies. A note on one-pass evaluation of attribute grammars. BIT, 25:439-450, 1985.

[594]
Kai Koskimies. Object-oriented language processing with HLP84. report C-1986-3, Department of Comp. Sc., University of Helsinki, 1986.

[595]
Kai Koskimies. Object-orientation in attribute grammars. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lecture Notes in Computer Science, pages 297-329. Springer-Verlag, New York-Heidelberg-Berlin, June 1991. Prague.

[596]
Kai Koskimies. Object-orientation in attribute grammars. Technical Report A-1991-1, Department of Computer Science, University of Tampere, 1991. available as a paper copy only.

[597]
Cornelius H. A. Koster. Affix grammars. In J. E. L. Peck, editor, Algol 68 Implementation, pages 95-109. North-Holland, Amsterdam, 1971.

[598]
Cornelius H. A. Koster. A compiler compiler. Technical Report MR 127, Mathematisch Centrum, Amsterdam, 1971.

[599]
Cornelius H. A. Koster. Using the CDL compiler-compiler. In F. L. Bauer and J. Eickel, editors, Compiler Construction: an Advanced Course, volume 21 of Lecture Notes in Computer Science, pages 366-426. Springer-Verlag, New York-Heidelberg-Berlin, 1974.

[600]
Cornelius H. A. Koster. CDL A compiler implementation language. In A. Ershov and Cornelius H. A. Koster, editors, Methods of Algorithmic Language Implementation, volume 47 of Lecture Notes in Computer Science, pages 341-350. Springer-Verlag, New York-Heidelberg-Berlin, 1977.

[601]
Kees Koster. Affix grammars for natural languages. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lecture Notes in Computer Science, pages 469-484. Springer-Verlag, New York-Heidelberg-Berlin, June 1991. Prague.

[602]
Kees Koster. Affix grammars for programming languages. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lecture Notes in Computer Science, pages 358-373. Springer-Verlag, New York-Heidelberg-Berlin, June 1991. Prague.

[603]
Bernd Krieg-Brückner, Berthold Hoffmann, Harald Ganzinger, Manfred Broy, Reinhard Wilhelm, Ulrich Möncke, Beatrix Weisgerber, A. D. McGettrick, Ian G. Campbell, and Georg Winterstein. PROSPECTRA: Program development by specification and transformation. In CEC--Directorate General XIII, editor, ESPRIT '86: Results and Achievements. Elsevier, Amsterdam-New York, 1987. Bruxelles.

[604]
R. Krishnaswamy and A. B. Pyster. On the correctness of semantic-syntax-directed translations. J. ACM, 27(2):338-355, April 1980.

[605]
B. B. Kristensen, Ole L. Madsen, B. Möller-Pedersen, and K. Nygaard. Syntax-directed program modularization. In P. Degano and E. Sandewall, editors, Integrated Interactive Computing Systems, pages 207-219. North-Holland, Amsterdam, 1983.

[606]
S. Kruszewski and S. Jarzabek. COALA---the object code of the compiler producing system. internal report, Institute of Mathematical Machines--MERA, Warsaw, 1974. (in Polish).

[607]
Marek Kruszewski, Dariusz Kupiecki, and Julian Winiewski. A resident-compiler production method and its implementation. report, Institute of Mathematical Machines--MERA, Warsaw, February 1982.

[608]
R. Krzemien. L'implantation de système lisp sur IRIS 80 en utilisant le système DELTA. rapport interne, INRIA, Rocquencourt, July 1975.

[609]
P. Kühling. Affixgrammatiken zur Beschreibung von Programmiersprachen. Diploma thesis, Tech. University Berlin, 1978.

[610]
A. Kühnemann and H. Vogler. A pumping lemma for output languages of attributed tree transducers. Acta Cybernetica, 11:261-305, 1994.

[611]
A. Kühnemann and H. Vogler. Synthesized and inherited functions - a new computational model for syntax-directed semantics. Acta Informatica, 31:431-477, 1994.

[612]
A. Kühnemann. Berechnungsstärken von Teilklassen primitiv-rekursiver Programmschemata. PhD thesis, Technical University of Dresden, 1997. Shaker Verlag, Aachen.

[613]
Matthijs F. Kuiper and Atze Dijkstra. Attribute evaluation on a network of transputers. In John Wexler, editor, Developing Transputer Applications, pages 142-149. IOS, Amsterdam, 1989.

[614]
Matthijs Kuiper and João Saraiva. Lrc A generator for incremental language-oriented tools. In Kai Koskimies, editor, Compiler Construction CC'98, volume 1383 of Lect. Notes in Comp. Sci., pages 298-301, portugal, April 1998. Springer-Verlag. tool demonstration.

[615]
Matthijs F. Kuiper and S. Doaitse Swierstra. Using Attribute Grammars to Derive Efficient Functional Programs. Report RUU-CS-86-16, Utrecht University, 1986.

[616]
Matthijs F. Kuiper and S. Doaitse Swierstra. Parallel attribute evaluation: Structure of evaluators and detection of parallelism. In Pierre Deransart and Martin Jourdan, editors, Attribute Grammars and their Applications (WAGA), volume 461 of Lecture Notes in Computer Science, pages 61-75. Springer-Verlag, New York-Heidelberg-Berlin, September 1990. Paris.

[617]
Matthijs F. Kuiper. Parallel Attribute Evaluation. Ph.D. thesis, Faculteit Wiskunde en Informatica, Rijksuniv. Utrecht, November 1989.

[618]
Reino Kurki-Suonio. An exercise on formal definition of a simple data retrieval system. report A7, Department of Comp. Sc., University of Tampere, August 1974.

[619]
Reino Kurki-Suonio. Towards better strutured definitions of programming languages. report STAN-CS-75-300, Comp. Sc. Department, Stanford University, September 1975.

[620]
V. M. Kurochkin. A universal economical algorithm of attribute evaluation. In Actes du Séminaire Franco-Soviétique Informatika 88, pages 1-6. INRIA, Nice, February 1988.

[621]
Philipp W. Kutter and Alfonso Pierantonio. Montages: Unified static and dynamic semantics of programming languages. Technical Report 118, Universita de L'Aquila, July 1996. (PostScript)

[622]
R. P. A. Lacroix. Semantics-directed editing in an incremental processing environment. Master's thesis, Worcester Polytechnic Inst., December 1983.

[623]
Uwe Lämmel and K. J. Schuchardt. Das compilerschreibende System RÜGEN---Rostocker Übersetzer GENerator. Diploma thesis, Sektion Mathematik der W.-Pieck-University, Rostock, 1981.

[624]
Uwe Lämmel. Spezifikation und implementation von kommandosprachen für dialogsysteme mit hilfe einer attributierten grammatik. Dissertation a, Sektion Informationsverarbeitung der W.-Pieck-University, Rostock, 1984.

[625]
Ralf Lämmel. The translator writing system RUEGEN-KS. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lecture Notes in Computer Science, pages 508-513. Springer-Verlag, New York-Heidelberg-Berlin, June 1991. Prague.

[626]
Wuu lazybug Yang. A finest partitioning algorithm for attribute grammars. In D. Parigot and M. Mernik, editors, Second Workshop on Attribute Grammars and their Applications, WAGA'99, pages 77-92, Amsterdam, The Netherlands, March 1999. INRIA rocquencourt. (PostScript, 16 pages, 214005 bytes)

[627]
Carole Le Bellec, Martin Jourdan, Didier Parigot, and Gilles Roussel. Specification and Implementation of Grammar Coupling Using Attribute Grammars. In Maurice Bruynooghe and Jaan Penjam, editors, Programming Language Implementation and Logic Programming (PLILP '93), volume 714 of Lect. Notes in Comp. Sci., pages 123-136, Tallinn, August 1993. Springer-Verlag. (Gzipped PostScript, 14 pages, 54522 bytes)

[628]
Carole Le Bellec. Spécification de règles sémantiques manquantes. rapport de DEA, Dépt. d'Informatique, University d'Orléans, September 1989.

[629]
Carole Le Bellec. La généricité et les grammaires attribuées. PhD thesis, Département de Mathématiques et d'Informatique, Université d'Orléans, 1993. (Gzipped PostScript, 211 pages, 343858 bytes)

[630]
Gilles Le Bâtard. Réalisation dans le système FNC-2 d'un traducteur vers ML. rapport de stage de maîtrise, IFI, Université de Marne-la-Vallée, July 1995.

[631]
Olivier Lecarme and Gregor V. Bochmann. A compiler writing system user's manual. document de travail 57, Dépt. d'informatique, University de Montréal, December 1974.

[632]
Olivier Lecarme and Gregor V. Bochmann. A (truly) usable and portable compiler writing system. In J. L. Rosenfeld, editor, Information Processing '74, pages 218-221. North-Holland, Amsterdam, August 1974. Stockholm.

[633]
Olivier Lecarme. Practicability and portability in a compiler-construction system. In Procs. of the All-Union Symp. on Methods of Implementing New Algorithmic Languages, Part 1, pages 47--?, Novosibirsk, 1975. (in Russian).

[634]
Olivier Lecarme. Usability and portability of a compiler writing system. In A. Ershov and Cornelius H. A. Koster, editors, Methods of Algorithmic Language Implementation, volume 47 of Lecture Notes in Computer Science, pages 41-62. Springer-Verlag, New York-Heidelberg-Berlin, 1977.

[635]
B. Lecocq. Optimisation d'évaluateurs d'attributs. rapport de DEA, University de Bordeaux I, 1986.

[636]
C. J. C. Lee. Translation of context-free programming languages using semantic trees. Technical Report 43, Department of Comp. Sc., University of Toronto, July 1972.

[637]
N. J. Lehmann. Problem-oriented languages and DEPOT implementing system. In A. Ershov and Cornelius H. A. Koster., editors, Methods of Algorithmic Language Implementation, volume 47 of Lecture Notes in Computer Science, pages 1-20. Springer-Verlag, New York-Heidelberg-Berlin, 1977.

[638]
Tapio Lehtonen. HLP84: Pascal implementation of the semantic metalanguage. report C-1987-27, Department of Comp. Sc., University of Helsinki, 1987.

[639]
Stéphane Leibovitsch. Relations entre la sémantique dénotationnelle et les grammaires attribuées. Rapport de DEA, Universitéde Paris VII, September 1996. (Gzipped PostScript, 51 pages, 113645 bytes)

[640]
M. V. Lepp, Aare O. Vooglaid, and Leo K. Vyhandu. ELMA---an instrumental tool to build programming systems. In Soviet-French Symp. on Computer Science, pages 130-136. Institute of Cybernetics of the Academy of Sciences of the SSR of Estonia, Tallinn, May 1985.

[641]
M. V. Lepp, Aare O. Vooglaid, and Leo K. Vyhandu. ELMA as an instrumental system for building practical programming systems. In TPI '86 (Data Processing, Compiler Writing, Programming), pages 85-92. Faculty of Economics LIX, Tallinn, 1986.

[642]
J. Leszezylowski, S. Bonnier, and Jan Maluszynski. Logic programs with external procedures: Introducing S-unification. University of Linköping, April 1987.

[643]
Theodore W. Leung. Compiling object-oriented queries. Technical Report CS-94-05, Department of Computer Science, Brown University, February 1994.

[644]
Michael Levison and Gregory Lessard. Application of attribute grammars to natural language sentence generation. In Pierre Deransart and Martin Jourdan, editors, Attribute Grammars and their Applications (WAGA), volume 461 of Lecture Notes in Computer Science, pages 298-312. Springer-Verlag, New York-Heidelberg-Berlin, September 1990. Paris.

[645]
J. Lewi, K. De Vlaminck, J. Huens, and P. Mertens. SLS/1: a translator writing system. In J. Mühlbacher, editor, GI 5. Jahrestagung, volume 34 of Lecture Notes in Computer Science, pages 627-641, New York-Heidelberg-Berlin, October 1975. Springer-Verlag. Dortmund.

[646]
J. Lewi, K. De Vlaminck, and J. Huens. Project LILA, FIGDRAW and PICO-ALGOL, an experience with LILA in a course on compiler construction. report CW4, Applied Mathematics and Programming Division, Katholieke Universiteit Leuven, January 1976.

[647]
J. Lewi, K. De Vlaminck, J. Huens, and M. Huybrechts. Project LILA user's manual. report CW7, Applied Mathematics and Programming Division, Katholieke Universiteit Leuven, 1977.

[648]
J. Lewi, K. De Vlaminck, J. Huens, and M. Huybrechts. A programming Methodology in Compiler Construction. North-Holland, Amsterdam, 1979. I and II.

[649]
J. Lewi, K. De Vlaminck, J. Huens, and E. Steegmans. The language implementation laboratory LILA: an overview. In D. R. Wilson and C. J. van Spronsen, editors, MICROCOMPUTERS: Developments in Industry, Business and Education (EUROMICRO '83), pages 11-21. Elsevier, Amsterdam-New York, 1983. Madrid.

[650]
P. M. Lewis, D. J. Rosenkrantz, and R. E. Stearns. Attributed translations. Journal of Computer and System Sciences, 9(3):279-307, December 1974.

[651]
P. M. Lewis, D. J. Rosenkrantz, and R. E. Stearns. Compiler Design Theory. Addison Wesley, Reading, MA, 1976.

[652]
Vincent Lextrait and Xavier Ceugniet. NEXUS: The meta-generation of versatile graphical multi-user structure editors using generalized attribute grammars. In CHI '90 Workshop on Structure Editors Seattle, April 1990.

[653]
Vincent Lextrait and Alain Zarli. Meta-generation of incremental and graphical structure-oriented editors. BIGRE, (70), September 1990.

[654]
Yu-Min Liang. The equational logic transformation system. Master's thesis, Department of Computer Science Cornell University, Ithaca, New York, December 1992. CS Masters of Engineering Project (CS MEng 445416).

[655]
Tan. Lichao, Y. Shinoda, and T. Katayama. Coping with Changes in an Object Management System based on Attribute Grammars. In Proceedings of the Fourth ACM SIGSOFT '90 Symposium on Software Development Environments, pages 56-65, December 1990. Published as SIGSOFT Software Engineering Notes, volume 15, number 6.

[656]
Peter Lipps, Ulrich Möncke, Matthias Olk, and Reinhard Wilhelm. Attribute (re)evaluation in OPTRAN. Acta Informatica, 26:213-239, 1988. See also: ESPRIT PROSPECTRA Project Report S.1.3 - R.4.0, University des Saarlandes, Saarbrücken (1986).

[657]
Peter Lipps, Ulrich Möncke, and Reinhard Wilhelm. OPTRAN: A language/system for the specification of program transformations--system overview and experiences. In Dieter Hammer, editor, Compiler Compilers and High Speed Compilation, volume 371 of Lecture Notes in Computer Science, pages 52-65. Springer-Verlag, New York-Heidelberg-Berlin, October 1988. Berlin.

[658]
Peter Lipps, Ulrich Möncke, and Reinhard Wilhelm. An overview of the OPTRAN system. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lecture Notes in Computer Science, pages 505-506. Springer-Verlag, New York-Heidelberg-Berlin, June 1991. Prague.

[659]
Peter Lipps. Komplexe Attribute--Mechanismen zur Verwaltung und Berechnung in einem baumtransformierenden System. Diploma thesis, FB 10 -- Informatik, University des Saarlandes, Saarbrücken, 1986.

[660]
Sying-Syang Liu and Kurt R. Johmann. A tool specification language for software maintenance: Part I language design. Technical Report SERC-TR-36-F, Software Engineering Research Centre, November 1989.

[661]
Yanhong A. Liu. CACHET:an interactive, incremental-attribution-based program transformation system for deriving incremental programs. Technical report, Cornell University, 1995.

[662]
Uwe Lämmel and Peter Forbrig. Mixed dialogue control defined by an attribute grammar. In Dieter Hammer and Michael Albinus, editors, Compiler Compilers '90, volume 477 of Lect. Notes in Comp. Sci., pages 219-221. Springer-Verlag, Schwerin, 1990.

[663]
Ralf Lämmel and Günter Riedewald. Motivating operations on attribute grammars. Technical report, Rostocker Informatik-Berichte, November 1995. (PostScript)

[664]
Ralf Lämmel and Günter Riedewald. Operations on attribute grammar specifications towards semantic extensibility. Technical report, Rostok University, May 1997.

[665]
Ralf Lämmel and Günter Riedewald. Reconstruction of paradigm shifts. In D. Parigot and M. Mernik, editors, Second Workshop on Attribute Grammars and their Applications, WAGA'99, pages 37-56, Amsterdam, The Netherlands, March 1999. INRIA rocquencourt. (PostScript, 20 pages, 361450 bytes)

[666]
Ralf Lämmel. DSDL - denotational semantics description language. Technical Report 16, Rostocker Informatik-Berichte, 1994.

[667]
Luigi Logrippo and Douglas R. Skuce. File structures, program structures and attributed grammars. Institute of Electrical and Electronics Engineers. Transactions on Software Engineering, SE-9(3):260-266, May 1983.

[668]
Bernard Lorho and Claude Pair. Algorithms for checking consistency of attribute grammars. In Gérard Huet and Gilles Kahn, editors, Proving and Improving Programs, pages 29-54. INRIA, Rocquencourt, July 1975. Arc et Senans.

[669]
Bernard Lorho. De la définition à la traduction des langages de programmation: méthode des attributs sémantiques. thèse d'état, University Paul Sabatier, Toulouse, November 1974.

[670]
Bernard Lorho. Semantic attributes processing in the system DELTA. In A. Ershov and Cornelius H. A. Koster., editors, Methods of Algorithmic Language Implementation, volume 47 of Lecture Notes in Computer Science, pages 21-40. Springer-Verlag, New York-Heidelberg-Berlin, 1977.

[671]
Bernard Lorho, editor. Methods and Tools for Compiler Construction. Cambridge University Press, New York, New York, 1984. INRIA-CEC Course held in Rocquencourt.

[672]
J. Lötzsch and K. Mager. A system for design, implementation and application of specialized languages. In O. M. Tammepuu, editor, Specialized Languages as Tools for Programming Technology, pages 31-42. Tallinn, January 1988.

[673]
J. Lötzsch. Specialised language centered communication and its automatic implementation. In Problem Solving Environments for Scientific Computing. North-Holland, Amsterdam, 1987.

[674]
Qi Lu and Jiahua Qian. Design, proof and analysis of new efficient algorithms for incremental attribute evaluation. In M. P. Chytil, L. Janiga, and V. Koubek, editors, Mathematical Foundations of Computer Science 1988, volume 324 of Lecture Notes in Computer Science, pages 483-491. Springer-Verlag, New York-Heidelberg-Berlin, August 1988. Carlsbad.

[675]
Qi Lu and Jiahua Qian. An efficient method for incremental attribute evaluation by using multi-dependency. In COMPSAC '88, pages 162-169. Chicago, IL, October 1988.

[676]
P. M. Lu, S. S. Yau, and W. Hong. A formal methodology using attributed grammars for multiprocessing-system software development. Information Sciences. An International Journal, 30(2 and 3):79-105 and 107-123, 1983. I: Design Representation, II: Validation.

[677]
P. H. W. M. Oude Luttighuis. Parallel algorithms for parsing and attribute evaluation. PhD thesis, University of Twente, 1993. ISBN 90-9006247-5.

[678]
Thomas Maas. Spezifikation und Implementierung eines Compilerfrontends für Ada: Auflösung der Überladung und Erzeugung von DIANA. Diploma thesis, FB 10 -- Informatik, University des Saarlandes, Saarbrücken, 1988.

[679]
William Maddox. Incremental static semantic analysis. Technical Report ucb/CSD-97-948, University of California, Berkeley, 1998.

[680]
Ole L. Madsen, B. B. Kristensen, and J. Staunstrup. Use of design criteria for intermediate languages. report DAIMI PB-59, Comp. Sc. Department, Aarhus University, August 1976.

[681]
Ole L. Madsen. On the use of attribute grammars in a practical translator writing system. Master's thesis, Comp. Sc. Department, Aarhus University, July 1975.

[682]
C. M. Madsen. Parsing attribute grammars. thesis, Comp. Sc. Department, Aarhus University, 1980.

[683]
Ole L. Madsen. On defining semantics by means of extended attribute grammars. In Neil D. Jones, editor, Semantics-Directed Compiler Generation, volume 94 of Lecture Notes in Computer Science, pages 259-299. Springer-Verlag, New York-Heidelberg-Berlin, 1980. See also: report DAIMI PB-109, Comp. Sc. Department, Aarhus University (January 1980).

[684]
Ole L. Madsen. Towards a practical and general translator writing system. report daimi, Comp. Sc. Department, Aarhus University, March 1980.

[685]
Ole Lehrmann Madsen. On defining semantics by means of extended attribute grammars. Technical Report DAIMI PB-109, Comp. Sc. Department, Aarhus University, January 1980.

[686]
V. P. Makarov and V. G. Peshkov. The translator generating system SAGET. In Computer-Aided Generation of Application Packages (Automatic Translator Generation), Abstract of Papers. Polytechnic Institute, Tallinn, 1980. (in Russian).

[687]
V. P. Makarov. Syntax-directed translation in the SAGET translator writing system. Preprint IM Akad. Nauk BSSR, 127, 1982.

[688]
V. P. Makarov. Attributed quasitranslation grammars and their implementation in the SAGET translator generation system. Progr. and Computer Software, 9(2):85-90, March 1983.

[689]
Murata Makoto and H. Nakatsuyama. A theoretical foundation of the DSSSL location model. Mathematical and Computer Modelling, 25(4):05-107, February 1997.

[690]
Jan Maluszynski. Attribute grammars and logic programs: a comparison of concepts. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lecture Notes in Computer Science, pages 330-357. Springer-Verlag, New York-Heidelberg-Berlin, June 1991. Prague.

[691]
S. A. Mamrak, M. J. Kaebling, C. K. Nicholas, and M. Share. A software architecture for supporting the exchange of electronic manuscripts. Communications of the Association for Computing Machinery, 30(5):408-414, May 1987.

[692]
Frank Manion. An attribute based compiler generator for unrestricted conditional attribute grammars. Master's thesis, Department of Comp. Inf. Sc., Moore School of Elec. Eng. D2, University of Pennsylvania, Philadelphia, PA, 1985.

[693]
A. J. J. M. Marcelis. On the classification of attribute evaluation algorithms. Science of Computer Programming, 14(1):1-24, June 1990.

[694]
M. Marcotty, H. F. Ledgard, and Gregor V. Bochmann. A sampler of formal definitions. Computing Surveys. ACM. Association for Computing Machinery, 8(2):191-276, June 1976.

[695]
Bruno Marmol. Évaluateurs d'attributs parallèles sur multi-processeurs à mémoire partagée. rapport de DEA, University d'Orléans, September 1990.

[696]
Bruno Marmol. La parallélisation et l'optimisation mémoire dans l'évaluation des grammaires attribuées. PhD thesis, Universitéd'Orléans, 1994. (Gzipped PostScript, 126 pages, 343283 bytes)

[697]
M. Marque-Pucheu. Application de la méthode des attributs à la définition des compilateurs. In Gérard Huet and Gilles Kahn, editors, Proving and Improving Programs, pages 263-283. INRIA, Rocquencourt, July 1975. Arc et Senans.

[698]
R. Marti and T. Murer. Extensible attribute grammars. Tik 92-6, Swiss Federal Institute of Technology Zurick, December 1992.

[699]
Philippe Mathieu and Torbjörn Keisu. Relating attribute grammars and a constraints-prolog programming environment. In Workshop on Programming Environment, Nässlingen (?), August 1989. SICS Research Report 0283-3638 (?).

[700]
Philippe Mathieu and Torbjörn Keisu. Relating attribute grammars and a constraints-prolog programming environment. Technical Report R90004, SICS Swedish Institute of Computer Science, 1990.

[701]
W. D. Maurer. A semantic extension of BNF. International Journal of Computer Mathematics. Section A. Programming Theory and Methods. Section B. Computational Methods, Sect. A, 3(2):157-176, September 1972.

[702]
Brian H. Mayoh. Attribute grammars and mathematical semantics. SIAM Journal on Computing, 10(3):503-518, August 1981. See also: report DAIMI PB-90, Comp. Sc. Department, Aarhus University (August 1978).

[703]
David McAllester. Variational attribute grammars for computer aided design. Technical Report ADAGE-MIT-94-01, MIT, June 1994.

[704]
David McAllester. Variational attribute grammars for computer aided design (release 3.0). Technical Report ADAGE-MIT-94-01, MIT, June 1994.

[705]
John M. McEnerney. A general compiler generator based on attribute grammars. Senior thesis, Department of Comp. Inf. Sc., Moore School of Elec. Eng. D2, University of Pennsylvania, Philadelphia, PA, June 1983.

[706]
Carole M. McNamee and Ronald A. Olsson. An attribute grammar approach to compiler optimization of IntraModule interprocess communication. International Journal of Parallel Programming, 20(3):181-202, June 1991.

[707]
Hans Meijer and Anton Nijholt. Translator writing tools since 1970: a selective bibliography. ACM SIGPLAN Notices, 17(10):62-72, October 1982.

[708]
Hans Meijer. The project on extended affix grammars at nijmegen. In Pierre Deransart and Martin Jourdan, editors, Attribute Grammars and their Applications (WAGA), volume 461 of Lecture Notes in Computer Science, pages 130-142. Springer-Verlag, New York-Heidelberg-Berlin, September 1990. Paris.

[709]
Erik Meijer. More advice on proving compilers correct: Improve correct compilers. September 1994. (PostScript)

[710]
Borivoj Melichar. Evaluation of attributes during LR syntax analysis. In Vorträge des Problemseminars Attributierte Grammatiken und ihre Anwendungen. Pruchten. Wilhelm-Pieck University, Rostock, 1984.

[711]
Borivoj Melichar. Attributed translation directed by LR parser and its implementation. In Proc. of the Bautzen Workshop on Compiler Compilers and Incremental Compilation. Akad. der Wissenschaften der DDR, 1986.

[712]
Merik B. Méristé and Jaan Penjam. Computational models and semantics of programming languages. In O. M. Tammepuu, editor, Specialized Languages as Tools for Programming Technology, pages 79-94. Tallinn, January 1988.

[713]
Merik B. Méristé. Methods of implementing attribute schemes in compiler-construction systems (review). Progr. and Computer Software, 6(5):253-261, September 1980.

[714]
Merik B. Méristé. Combining the evaluation of attributes with parsing. In Abstracts of Papers at the Soviet Conf. on Translation Methods, pages 103-105. Novosibirsk, 1981. (in Russian)Published as Akademiya Nauk SSSR. Sibirskoe Otdelenie. Vychislitel'ny u i Tsentr. Preprint.

[715]
Merik B. Méristé. Mixed strategy implementation of attribute grammars. In Soviet-French Symp. on Computer Science, pages 120-125. Institute of Cybernetics of the Academy of Sciences of the SSR of Estonia, Tallinn, May 1985.

[716]
R. C. Merkle. Evaluators for attribute grammars. M.sc. thesis, Comp. Sc. Department, University of California, Berkeley, CA, March 1977.

[717]
Nikolaj Korbar Marjan Mernik and Vijem Zumer. Object-oriented evaluation paradigm in attribute grammar-based. Computing and Information, 2(1), June 1996.

[718]
Marjan Mernik, Nikolaj Korbar, and Viljem Zumer. LISA: A tool for automatic language implementation. ACM SIGPLAN Notices, 30(4):71-79, April 1995.

[719]
Marjan Mernik, Mitja Leni v c, Enis Avdi v cau v  sevi c, and Viljem v  Zumer. Multiple Attribute Grammar Inheritance. In D. Parigot and M. Mernik, editors, Second Workshop on Attribute Grammars and their Applications, WAGA'99, pages 57-76, Amsterdam, The Netherlands, March 1999. INRIA rocquencourt. (PostScript, 20 pages, 257543 bytes)

[720]
Josephine Micallef and Gail E. Kaiser. Version and configuration control in distributed language-based environments. In Jürgen F. H. Winkler, editor, Intl. Workshop on Software Version and Configuration Control, pages 119-143, Stuttgart, January 1988. B. G. Teubner.

[721]
Josephine Micallef and Gail E. Kaiser. Support algorithms for incremental attribute evaluation of asynchronous subtree replacements. Technical Report CUCS-033-90, University of Columbia, 1990.

[722]
Josephine Micallef and Gail E. Kaiser. Extending attribute grammars to support programming-in-the-large. Technical Report CUCS-003-93, Computer Science, Columbia University, 1993.

[723]
Josephine Micallef and Gail E. Kaiser. Support algorithms for incremental attribute evaluation of asynchronous subtree replacements. In IEEE Transactions on Software Engineering, volume 19 of 3, pages 231-252. March 1993.

[724]
Josephine Micallef and Gail E. Kaiser. Extending attribute grammars to support programming-in-the-large. In ACM Transactions on Programming Languages and Systems, volume 16 of 5, pages 1572-1612. ACM press, September 1994.

[725]
Josephine Micallef, Yael J. Cycowicz, and Gail E. Kaiser. Merging scheduling graphs during incremental attribute evaluation of asynchronous subtree replacements. Technical Report CUCS-450-89, Department of Comp. Sc., Columbia University, New York, July 1989.

[726]
Josephine Micallef. Incremental evaluation of ordered attribute grammars for asynchronous subtree replacements. Technical Report CUCS-380-88, Department of Comp. Sc., Columbia University, New York, July 1988.

[727]
Josephine Micallef. Incremental attribute evaluation with applications to multi-user language-based environments. Technical Report CUCS-444-89, Department of Comp. Sc., Columbia University, New York, April 1989.

[728]
Josephine Micallef. Incremental attribute evaluation for multi-user semantics-based editors. Ph.d. thesis, Computer Science, Columbia University, 1991.

[729]
Don Milos, Uwe F. Pleban, and George Loegel. Direct implementation of compiler specifications or the pascal P-code compiler revisited. In 11th ACM Symp. on Principles of Progr. Languages, pages 196-207. ACM press, Salt Lake City, Ut, January 1984.

[730]
I. Miloucheva and H. Loeper. Compiler structure engineering with attribute grammars. SIGPLAN Notices, 26(10):73-82, October 1991.

[731]
D. R. Milton and Charles N. Fischer. LL(k) parsing for attributed grammars. In H. A. Maurer, editor, 6th Int. Coll. on Automata, Languages and Programming, volume 71 of Lecture Notes in Computer Science, pages 422-430. Springer-Verlag, New York-Heidelberg-Berlin, July 1979. Graz.

[732]
D. R. Milton, L. W. Kirchoff, and Bruce R. Rowland. An ALL(1) compiler generator. In ACM SIGPLAN '79 Symp. on Compiler Construction, pages 152-157. ACM press, Denver, Co, August 1979. Published as ACM SIGPLAN Notices, volume 14, number 8.

[733]
D. R. Milton. Syntactic Specification and Analysis with Attributed Grammars. Ph.D. thesis, Comp. Sc. Department, University of Wisconsin-Madison, August 1977.

[734]
Kazunori Mizushima and Takuya Katayama. Storage allocation strategies for recursive attribute evaluators. In Kai Koskimies, editor, Compiler Construction CC'98, volume 1383 of Lect. Notes in Comp. Sci., pages 50-64, portugal, April 1998. Springer-Verlag.

[735]
Andrea Mößle and Heiko Vogler. Efficient call-by-value evaluation strategy of primitive recursive program schemes. In Proceedings of the Fuji International Workshop in Functional and Logic Programming. World Scientific Publishing Co. Pte Ltd., 1995.

[736]
Ulrich Möncke and Reinhard Wilhelm. Iterative algorithms on grammar graphs. In H. J. Schneider and Herbert Göttler, editors, Conf. on Graphtheoretic Concepts in Computer Science (WG '82), pages 177-194. Hanser Verlag, München, June 1982. Neunkirchen a.Br.

[737]
Ulrich Möncke and Reinhard Wilhelm. Grammar flow analysis. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lecture Notes in Computer Science, pages 151-186. Springer-Verlag, New York-Heidelberg-Berlin, June 1991. Prague.

[738]
Ulrich Möncke, Beatrix Weisgerber, and Reinhard Wilhelm. How to implement a system for manipulation of attributed trees. In U. Ammann, editor, GI 8. Fachtagung ``Programmiersprachen und Programentwicklung'', volume 77 of Inf. Fachb., pages 112-127, New York-Heidelberg-Berlin, March 1984. Springer-Verlag. Zürich.

[739]
Ulrich Möncke, Beatrix Weisgerber, and Reinhard Wilhelm. Generative support for transformational programming. In ESPRIT '85: Status Report of Continuing Work, pages 511-527. Elsevier, Amsterdam-New York, 1986.

[740]
Ulrich Möncke. Generierung von Systemen zur Transformation attributierter Operatorbäume: Komponenten des Systems und Mechanismen der Generierung. Diploma thesis, University des Saarlandes, Saarbrücken, 1985.

[741]
Ulrich Möncke. Grammar flow analysis. ESPRIT PROSPECTRA Project report S.1.3.--R-2.2, University des Saarlandes, Saarbrücken, March 1986, revised January 1987.

[742]
C. Moraitis and Papakonstantinou. Attribute grammars in decision making. In 25th IEEE Conference on Decision and Control, Athens, Greece, 1986.

[743]
C. Moraitis, G. Papakonstantinou, and S. Tzafestas. Attribute grammars as a diagnostic tool. In First European Workshop on Fault Diagnostics, Reliability and Rel ated Knowledge-Based Approaches, Rhodes, Greece, 1986.

[744]
S. P. Morgan. Formal specification of static semantics with an affix grammar translator generator. research report RC 9456, IBM T.J. Watson Research Center, Yorktown Heights, NY, 1982.

[745]
Hans Mössenböck. Coco/R: A generator for fast compiler front-ends. Bericht 127, Dept. Informatik, Inst. für Computersysteme, Eidgenössische Tech. Hochschule, Zürich, February 1990.

[746]
Eva-Maria M. Mueckstein. Q-TRANS: Query translation into english. In 8th Int. Joint Conf. on Artificial Intelligence, pages 660-662. Karlsruhe, August 1983.

[747]
Eva-Maria M. Mueckstein. Controlled natural language interfaces: the best of three worlds. In ACM Computer Science Conf. ACM press, March 1985.

[748]
Khalid A. Mughal and Lars Søraas. Attribute evaluation using neighbour functions. Technical Report 112, Dept. of Informatics, University of Bergen, December 1995.

[749]
Khalid A. Mughal and Lars Søraas. Yet another attribute evaluator based on recursive functions. In Proceedings of the Nordic Workshop on Programming Environments Research (NWPER'96), pages 335-344, Aalborg, Danmark, June 1996.

[750]
Khalid A. Mughal. Control flow aspects of generating runtime facilities for language-based programming environments. In IEEE Conf. on Software Tools, pages 85-91. New York, NY, April 1985.

[751]
Khalid A. Mughal. Generation of Runtime Facilities for Program Editors. Ph.D. thesis, Department of Informatics, University of Bergen, Norway, 1988.

[752]
Arvind M. Murching and Y. N. Srikant. Incremental attribute evaluation through recursive procedures. Comput. Lang., 14(4):225-237, 1989.

[753]
T . Murer, A. Würtz, D. Scherer, and D. Schweizer. GIPSY: Generating integrated process support systems - project overview. Ik-report no. 22, Swiss Federal Institute of Technology Zurick, December 1996.

[754]
Kannan Muthukkaruppan. Spine: A synthesizer for practical incremental evaluators. Technical Report UCB//CSD-94-81, California Berkeley, May 1994.

[755]
Eugene W. Myers. Efficient applicative data types. In 11th ACM Symp. on Principles of Progr. Languages, pages 66-75. ACM press, Salt Lake City, Ut, January 1984.

[756]
F. Vicu na. Semantic Formalization in Mathematical Modeling Languages. PhD thesis, Computer Science Department, UCLA, 1990.

[757]
M. Naini. Design of Attribute Evaluators and Attribute Machines. Ph.D. thesis, Department of Comp. Inf. Sc., Moore School of Elec. Eng. D2, University of Pennsylvania, Philadelphia, PA, 1985.

[758]
Ikuo Nakata and Masataka Sassa. L-attributed LL(1) grammars are LR-attributed. Information Processing Letters, 23(6):325-328, December 1986.

[759]
Shin Natori, Katsuhiko Gondow, Takashi Imaizumi, Takeshi Hagiwara, and Takuya Katayama. On Eliminating Type 3 Circularities of Ordered Attribute Grammars. In D. Parigot and M. Mernik, editors, Second Workshop on Attribute Grammars and their Applications, WAGA'99, pages 93-112, Amsterdam, The Netherlands, March 1999. INRIA rocquencourt. (PostScript, 20 pages, 714840 bytes)

[760]
Danièle Néel and Michaneh Amirchahy. Semantic attributes and improvement of generated code. In ACM 1974 Annual Conf., pages 1-10. ACM press, San Diego, CA, November 1974.

[761]
Danièle Néel and Michaneh Amirchahy. Removal of invariant statements from nested loops in a single effective compiler pass. In Conf. on Programming Languages and Compilers for Parallel and Vector Machines, pages 87-96. ACM press, New York, NY, March 1975. Published as ACM SIGPLAN Notices, volume 10, number 3.

[762]
Danièle Néel, Michaneh Amirchahy, and Monique Mazaud. Optimization of generated code by means of attributes: Local elimination of common redundant sub-expressions. In D. Siefkes, editor, GI 4. Jahrestagung, volume 26 of Lecture Notes in Computer Science, pages 247-256, New York-Heidelberg-Berlin, October 1974. Springer-Verlag. Berlin.

[763]
Danièle Néel. Contribution à la formalisation de l'amélioration de code par attributs sémantiques. thèse d'état, University P. et M. Curie, Paris, 1975.

[764]
Anne Neirynck. Static analysis of aliases and side effects in higher-order languages. Technical Report TR88-896, Cornell University, Computer Science Department, February 1988.

[765]
John R. Nestor, Bhubaneswar Mishra, William L. Scherlis, and William A. Wulf. Extensions to attribute grammars. report TR-TL-83-36, Tartan Labs., Pittsburgh, PA, 1983.

[766]
Frank Neven and Jan Van den Bussche. Expressiveness of structured document query languages based on attribute grammars. In PODS '98. Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, pages 11-17. ACM press, 1998.

[767]
Hanne Riis Nielson and Flemming Nielson. Flow logics for contraint based analysis. In Kai Koskimies, editor, Compiler Construction CC'98, volume 1383 of Lect. Notes in Comp. Sci., pages 109-127, portugal, April 1998. Springer-Verlag.

[768]
Hanne Riis Nielson. Computation sequences: A way to characterize subclasses of attribute grammars. Technical Report DAIMI PB-138, Comp. Sc. Department, Aarhus University, November 1981.

[769]
Timo Niemi. Specification of a query language by the attribute method. BIT, 24:171-186, 1984.

[770]
Timo Niemi. Specification of data restructuring software based on the attribute method. International Journal of Computer and Information Sciences, 13(6):425-460, 1984.

[771]
Timo Niemi. A systematic specification schema based on attribute grammars for multi-level database applications. report A-1987-5, Department of Comp. Sc., University of Tampere, March 1987.

[772]
U. Nilsson. AID: an alternative implementation of DCGs. New Generation Computing, 4, 1986.

[773]
T. Nishino. The intrinsically exponential complexity of the k-visit property problem for attribute grammars. to appear, 1987.

[774]
Tetsuro Nishino. Relating attribute grammars and lexical-functional grammars. Information sciences., 66(1/2):1, 1992.

[775]
Tetsuya Nitta. Construction of compiler generator based on the attribute grammar and object-oriented language. Master's thesis, Watanabe Laboratory, 1995.

[776]
Th. Noll and H. Vogler. Top-down parsing with simultaneous evaluation on noncircular attribute grammars. Technical Report 92-14, Aachen University of Technology, 92.

[777]
Robert E. Noonan. Structured programming and formal specification. Institute of Electrical and Electronics Engineers. Transactions on Software Engineering, SE-1(4):421-425, December 1975.

[778]
Robert L. Nord and Frank Pfenning. The ergo attribute system. In Peter Henderson, editor, ACM SIGSOFT/SIGPLAN Symp. on Practical Software Development Environments, pages 110-120. ACM press, Boston, MA, November 1988. Joint issue with ACM SIGPLAN Notices 24, 2 (February 1989)Published as SIGSOFT Software Eng. Notes, volume 13, number 5.

[779]
M. Nordström. A Method for Defining Formal Semantics of Programming Languages applied to SIMULA. Department of Comp. Sc., University of Uppsala, PhD thesis June 1976.

[780]
Otto Nurmi, Matti Sarjakoski, and Seppo Sippu. The HLP84 project. note, Department of Comp. Sc., University of Helsinki, March 1982.

[781]
A. Obaïd. Évaluateurs optimisés pour les grammaires d'attributs fortement non-circulaires. thèse de 3ème cycle, University de Bordeaux I, June 1982.

[782]
Mary Ann O'Connor and Karen A. Lemone. A method to improve testing and debugging in robotic programs using attribute grammars. In ACM Missouri ???, pages 225-230. February 1987.

[783]
Matthias Olk. Generierung eines effizienten Attributschedulers für ein baumtransformierendes System. Diploma thesis, FB 10 -- Informatik, University des Saarlandes, Saarbrücken, 1986.

[784]
Rieks op den Akker. Parsing Attribute Grammars. Ph.D. thesis, Onderafdeling der Informatica, Tech. Hogeschool Twente 1988.

[785]
Rieks op den Akker and Erik Sluiman. Linear data structures for storage allocation in attribute evaluators. report INF-91-14, Twente University, Enschede, March 1991.

[786]
Rieks op den Akker and Erik Sluiman. Storage allocation for attribute evaluators using stack and queues. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lecture Notes in Computer Science, pages 140-150. Springer-Verlag, New York-Heidelberg-Berlin, June 1991. Prague.

[787]
Rieks op den Akker, Bo u rivoj Melichar, and Jorma Tarhio. The hierarchy of LR-attributed grammars. In Pierre Deransart and Martin Jourdan, editors, Attribute Grammars and their Applications (WAGA), volume 461 of Lecture Notes in Computer Science, pages 13-28. Springer-Verlag, New York-Heidelberg-Berlin, September 1990. Paris.

[788]
Rieks op den Akker, Borivoj Melichar, and Jorma Tarhio. Attribute evaluation and parsing. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lecture Notes in Computer Science, pages 187-214. Springer-Verlag, New York-Heidelberg-Berlin, June 1991. Prague.

[789]
Rieks op den Akker. Deterministic parsing of attribute grammars, part I: Top-down strategies. memorandum INF-86-19, Onderafdeling der Informatica, Tech. Hogeschool Twente, 1986.

[790]
Rieks op den Akker. Deterministic parsing of attribute grammars, part II: Left-corner strategies. memorandum INF-88-67, Onderafdeling der Informatica, Tech. Hogeschool Twente, 1988.

[791]
Jukka Paakki, Ilka Miloucheva, and Hans Loeper. Prolog in practical compiler writing compiler structure engineering with attribute grammars. The Computer Journal ACM SIGPLAN Notices, ? 26(2 10):73-82, October 1991.

[792]
Jukka Paakki. The implementation of the semantic part of HLP84. report C-1986-4, Department of Comp. Sc., University of Helsinki, 1986.

[793]
Jukka Paakki. Experimental comparison of compiler writing methods. Arbeitspapiere der GMD #314, Gesellschaft fuer Mathematik und Datenverarbeitung mbH, 1988.

[794]
Jukka Paakki. Generating one-pass semantic analysis for a compiler. Ph. Lic. thesis, report A-1988-8, Department of Comp. Sc., University of Helsinki, March 1988.

[795]
Jukka Paakki. A note on the speed of prolog. ACM SIGPLAN Notices, 23(8):73-82, August 1988.

[796]
Jukka Paakki. A prolog-based compiler writing tool. In Dieter Hammer, editor, Compiler Compilers and High Speed Compilation, volume 371 of Lecture Notes in Computer Science, pages 107-117. Springer-Verlag, New York-Heidelberg-Berlin, October 1988. Berlin.

[797]
Jukka Paakki. Comparison of compiler writing methods: an experiment. In 13th Information Technologies Conference, volume R122, Sarajevo, 1989. Science and Research Council of Bosnia and Hertzegovina.

[798]
Jukka Paakki. A logic-based modification of attribute grammars for practical compiler writing. In D. H. D. Warren and P. Szeredi, editors, 7th Int. Conference on Logic Programming, pages 203-217, Jerusalem, 1990. MIT Press.

[799]
Jukka Paakki. Paradigms for Attribute-grammar-based Language Implementation. Ph.D. thesis, Department of Comp. Sc., University of Helsinki, February 1991.

[800]
Jukka Paakki. PROFIT: a system integrating logic programming and attribute grammars. In Jan Maluszynski and Martin Wirsing, editors, Programming Language Implementation and Logic Programming (PLILP '93), volume 528 of Lect. Notes in Comp. Sci., pages 243-254, Passau Germany, 1991. Springer-Verlag.

[801]
J. Paakki. Multi-pass evaluation of functional logic programs. Technical Report LiTH-IDA-R-93-02, Linköping University, 1993.

[802]
J. Paakki. Multi-pass execution of functional logic programs. In Conference record of POPL '94, 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages: papers presented at the Symposium: Portland, Oregon, January 17-21, 1994, pages 361-374, New York, NY, USA, 1994. ACM Press.

[803]
Jukka Paakki. Attribute grammar paradigms --- A high-level methodology in language implementation. ACM Computing Surveys, 27(2):196-255, June 1995.

[804]
J. P. Paillard and M. Simonet. Attribute-like W-grammars. implementation and design of algorithmic languages. In Jacques André and Jean-Pierre Ban^atre, editors, 5th Annual III Conf., pages 13-24. Guidel, May 1977.

[805]
Claude Pair, Michaneh Amirchahy, and Danièle Néel. Preuves de descriptions de traitements de textes par attributs. rapport de recherche 163, IRIA-Laboria, Rocquencourt, March 1976.

[806]
Claude Pair, Michaneh Amirchahy, and Danièle Néel. Correctness proofs of syntax-directed processing descriptions by attributes. Journal of Computer and System Sciences, 19(1):1-17, August 1979.

[807]
T. Panayiotopoulos, G. Papakonstantinou, and G. Stamatopoulos. Attribute grammar theorem prover. Information and Software Technology, 30(9):553-560, November 1988.

[808]
T. Panayiotopoulos, G. Papakonstantinou, and G. Stamatopoulos. Attribute grammars and logic programming (AI-debot paper). Angewandte Informatik, (5), 1988.

[809]
T. Panayiotopoulos, G. Papakonstantinou, and N. Sgouros. An attribute grammar interpreter for inexact reasoning. Information and Software Technology, 32(5):347-356, 1990.

[810]
George K. Papakonstantinou and F. Gritzali. Syntactic filtering of ECG waveforms. Comput. and Biomed. Res., 14:158-167, 1981.

[811]
George K. Papakonstantinou and John Kontos. Knowledge representation with attribute grammars. The Computer Journal, 29(3):241-245, 1986.

[812]
George K. Papakonstantinou and E. Skordalakis. Normal ECG pattern generation using an attribute grammar. In 6th Int. Conf. on Pattern Recognition, pages 696-698. München, October 1982.

[813]
G. Papakonstantinou and P. Tsanakas. Attribute grammars and dataflow computing. Information and Software Technology, 30(5):306-313, June 1988.

[814]
G. Papakonstantinou and S. Tzafestas. Attribute grammar approach to knowledge-based system building: Application to fault diagnosis. In S. Tzafestas, editor, Knowledge-based system diagnosis,supervision and control, chapter 7. Plenum Press, 1989.

[815]
G. Papakonstantinou, C. Moraitis, and T. Panayiotopoulos. An attribute grammar interpreter as a knowledge engineering tool. Angewandte Informatik, (9):382-388, 1986.

[816]
G. Papakonstantinou, E. Skordalakis, and F. Gritzali. An attribute grammar for QRS detection. Pattern Recognition, 19(4):297-303, 1986.

[817]
G. Papakonstantinou, P. Tsanakas, A. Stafylopatis, and S. Kollias. The transputer implementation of a parallel attribute grammar evaluator. In ESPRIT/Parallel Computing Action, Workshop III, Bonn Germany, 1991.

[818]
G. Papakonstantinou, T. Panayiotopoulos, and G. Dimitriou. AGP: a parallel processor for knowledge and software engineering. The Computer Journal, 1992.

[819]
G. Papakonstantinou, C. Voliotis, and N. Sgouros. Dependency-directed binding of variables for constraint logic programming. In DEXA 94 International Confrence, Athens, Greece, 1994.

[820]
George K. Papakonstantinou. A poor man's realization of attribute grammars. Software--Practice and Experience, 9(9):719-728, September 1979.

[821]
George K. Papakonstantinou. An interpreter of attribute grammars and its application to waveform analysis. Institute of Electrical and Electronics Engineers. Transactions on Software Engineering, SE-7(3):279-283, May 1981.

[822]
George K. Papakonstantinou. A sentence generator based on attribute grammars. Angew. Informatik, 8, 1983.

[823]
G Papakonstoninou and P Tsanakas. Attribute grammars and dataflow computing. Inf. Softw. Technol., 30(5):306-313, June 1988.

[824]
R. Parchmann. Syntaxgesteuerte codierung zur berechnung arithmetischer ausdrucke auf einer parallelmaschine unter verwendung knuth'scher attribute. Bericht 20, Schriften zur Informatik und Angewandten Mathematik, Rheinisch-Westfälische Tech. Hochschule Aachen, 1975.

[825]
R. Parchmann. Grammatiken mit attributeschema und zweistufige auswertung attributierter grammatiken. Bericht 46, Schriften zur Informatik und Angewandten Mathematik, Rheinisch-Westfälische Tech. Hochschule Aachen, February 1978.

[826]
J. Paredaens. A relation between parsers and the semantic aspects of a language. report R275, MBLE Research Lab., Brussels, November 1974.

[827]
Didier Parigot and Martin Jourdan. A complete bibliography on attribute grammars. http://www-rocq.inria.fr/oscar/www/fnc2/AGabstract.html Updated regularly. Contains around 1000 references to papers on Attribute Grammars. INRIA, France.

[828]
Didier Parigot and Marjan Mernik, editors. Second Workshop on Attribute Grammars and their Applications WAGA'99, Amsterdam, The Netherlands, March 1999. ETAPS'99, INRIA rocquencourt. Satellite event of ETAPS'99.

[829]
Didier Parigot, Etienne Duris, Gilles Roussel, and Martin Jourdan. Attribute grammars: a declarative functional language. Rapport de Recherche 2662, INRIA, October 1995. (Gzipped PostScript, 16 pages, 99960 bytes)

[830]
Didier Parigot, Etienne Duris, Gilles Roussel, and Martin Jourdan. Les grammaires attribuées : un langage fonctionnel déclaratif. In journées du GDR de programmation, Grenoble, November 1995. (Gzipped PostScript, 12 pages, 46895 bytes)

[831]
Didier Parigot, Etienne Duris, Gilles Roussel, and Martin Jourdan. Les grammaires attribuées : un langage fonctionnel déclaratif. In Journées Francophones des Langages Applicatifs, pages 263-279, Val-Morin, Québec, January 1996. (Gzipped PostScript, 18 pages, 73918 bytes)

[832]
Didier Parigot, Gilles Roussel, Martin Jourdan, and Etienne Duris. Dynamic Attribute Grammars. Rapport de recherche 2881, INRIA, May 1996. (Gzipped PostScript, 32 pages, 196959 bytes)

[833]
Didier Parigot, Gilles Roussel, Martin Jourdan, and Etienne Duris. Dynamic Attribute Grammars. In Herbert Kuchen and S. Doaitse Swierstra, editors, Int. Symp. on Progr. Languages, Implementations, Logics and Programs (PLILP'96), volume 1140 of Lect. Notes in Comp. Sci., pages 122-136, Aachen, September 1996. Springer-Verlag. (Gzipped PostScript, 15 pages, 96012 bytes)

[834]
Didier Parigot. Un système interactif de trace des circularités dans une grammaire attribuée et optimisation du test de circularité. rapport de DEA, University de Paris-Sud, Orsay, September 1985.

[835]
Didier Parigot. Mise en oe uvre des grammaires attribuées: transformation, évaluation incrémentale, optimisations. thèse de 3ème cycle, University de Paris-Sud, Orsay, September 1987.

[836]
Didier Parigot. Transformations, Évaluation Incrémentale et Optimisations des Grammaires Attribués: Le Système FNC-2. PhD thesis, Université de Paris-Sud, Orsay, 1988.

[837]
Larry Paulson. A Compiler Generator for Semantic Grammars. Ph.D. thesis, Department of Comp. Sc., Stanford University, 1981.

[838]
Larry Paulson. A semantics-directed compiler generator. In 9th ACM Symp. on Principles of Progr. Languages, pages 224-233. ACM press, Albuquerque, NM, January 1982.

[839]
Larry Paulson. Compiler generation from denotational semantics. In Bernard Lorho, editor, Methods and Tools for Compiler Construction, pages 219-250. Cambridge University Press, New York, New York, 1984.

[840]
Petr Pavlu. Another way to evaluate attributes in parallel with LR parsing. Report DC-90-03, Dept. of Computers, Czech University of Technology, Prague, December 1990.

[841]
Teri F. Payton, S. E. Keller, J. A. Perkins, S. Rowan, and S. P. Mardinly. Design level debugging of attribute grammars. report, SDC--a Burroughs Company, Paoli, PA, 1982.

[842]
Teri F. Payton, S. E. Keller, J. A. Perkins, S. Rowan, and S. P. Mardinly. SSAGS, a syntax and semantics analysis and generation system. In IEEE COMPSAC '82, pages 424-432. Chicago, Il, November 1982.

[843]
Stephen B. Peckham. Globally partitionable attribute grammars. In Pierre Deransart and Martin Jourdan, editors, Attribute Grammars and their Applications (WAGA), volume 461 of Lecture Notes in Computer Science, pages 327-342. Springer-Verlag, New York-Heidelberg-Berlin, September 1990. Paris.

[844]
Stephen B. Peckham. Incremental attribute evaluation and multiple subtree replacements. Technical Report TR90-1093, Department of Comp. Sc., Cornell University, Ithaca, NY, February 1990.

[845]
Jaan Penjam. Methods of automatic implementation of semantics in translators. In Abstracts for the First All-Union Conf. on Programming Technology. Kiev, 1979. (in Russian).

[846]
Jaan Penjam. A method of automatic implementation of compilers. unknown reference, 1980.

[847]
Jaan Penjam. Realization of attributive semantics. Cybernetics, 16(2):199-206, November 1980.

[848]
Jaan Penjam. Synthesis of a semantic processor from an attribute grammar. Progr. and Computer Software, 9(1):29-39, January 1983.

[849]
V. Penner. Formalisierung der semantik von programmiersprachen und anwendungen. Bericht 33, Schriften zur Informatik und Angewandten Mathematik, Rheinisch-Westfälische Tech. Hochschule Aachen, June 1977.

[850]
V. Penner. Die eingabesprache LDL für ein compiler-erzeugendes system und ein umfassendes beispiel. Bericht 50, Schriften zur Informatik und Angewandten Mathematik, Reinisch-Westfälische Tech. Hochschule Aachen, February 1979.

[851]
V. Penner. Ein LDL-compiler. Bericht, Lehrstuhl für Angewandte Mathematik und Informatik, Rheinisch-Westfälische Tech. Hochschule Aachen, 1979.

[852]
M. Pennings, D. Swierstra, and H. Vogt. Using cached functions and constructors for incremental attribute evaluation. In M. Bruynooghe and M. Wirsing, editors, Proceedings of the 4th International Symposium of Programming Language Implementation and Logic Programming, Leuven, BE: PLILP '92, pages 130-144, Berlin, DE, 1992. Springer-Verlag.

[853]
Maarten C. Pennings. Generating incremental attribute evaluators. Ph.D. thesis, Computer Science, Utrecht University, November 1994.

[854]
J. Perraud, O. Roux, and M. Huou. Operational semantics of a kernel of the language ELECTRE. Theoretical Computer Science, 97(1):83-103, April 1992.

[855]
Patrik Persson and Görel Hedin. Interactive Execution Time Predictions Using Reference Attributed Grammars. In D. Parigot and M. Mernik, editors, Second Workshop on Attribute Grammars and their Applications, WAGA'99, pages 173-184, Amsterdam, The Netherlands, March 1999. INRIA rocquencourt. (PostScript, 12 pages, 657585 bytes)

[856]
S. R. Petrick. On the use of syntax-based translators for symbolic and algebraic manipulation. In S. R. Petrick, editor, 2nd Symp. on Symbolic and Algebraic Manipulation, pages 224-237. Los Angeles, CA, March 1971.

[857]
S. R. Petrick. Semantic interpretation in the REQUEST system. In A. Zampolli and N. Calzolari, editors, Computational and Mathematical Linguistics II, pages 585-610. Leo S. Olschki Editore, Firenze, 1977.

[858]
Peter Pfahler and Uwe Kastens. Language design and implementation by selection. In In Proc. 1st ACM-SIGPLAN Workshop on Domain-Specific-Languages, DSL '97, pages 97-108, Paris France, 1997. (PostScript)

[859]
Mary Pfreundschuh-Wagner and Ray Ford. Using attribute grammars to control incremental, concurrent builds of modular systems. In Jürgen F. H. Winkler, editor, Intl. Workshop on Software Version and Configuration Control, pages 285-304, Stuttgart, January 1988. B. G. Teubner.

[860]
Mary Pfreundschuh. A Model for Building Modular Systems Based on Attribute Grammars. Ph.D. thesis, University of Iowa, 1986.

[861]
A. Pister and H. W. Buttelmann. Semantic-syntax-directed translation. Information and Control, 36(3):320-361, March 1978.

[862]
J. V. Pitt and R. J. Cunningham. Attributed translation and the semantics of natural language. In Pierre Deransart and Martin Jourdan, editors, Attribute Grammars and their Applications (WAGA), volume 461 of Lecture Notes in Computer Science, pages 284-297. Springer-Verlag, New York-Heidelberg-Berlin, September 1990. Paris.

[863]
Jeremy Pitt and Jim Cunningham. Attribute grammars and the semantics of natural language. Technical report, 1990.

[864]
Thomas Pittman and James Peters. The Art of Compiler Design. Prentice-Hall, Englewood Cliffs, NJ, November 1991.

[865]
Étienne Planes. PPAT: un décompilateur d'arbres attribués pour le système FNC-2. rapport de DEA, Dépt. d'Informatique, University d'Orléans, September 1989.

[866]
Warren J. Plath. Transformational grammar and transformational parsing in the REQUEST system. report RC 4396, IBM T.J. Watson Research Center, Yorktown Heights, NY, May 1973.

[867]
Warren J. Plath. REQUEST: a natural language question-answering-system. International Business Machines Corporation. Journal of Research and Development, 20(4):326-335, July 1976. See also: report RC 5604, IBM T.J. Watson Research Center, Yorktown Heights, NY (August 1975).

[868]
Uwe F. Pleban. Compiler protyping using formal semantics. In ACM SIGPLAN '84 Symp. on Compiler Construction, pages 94-105. ACM press, Montréal, June 1984. Published as ACM SIGPLAN Notices, volume 19, number 6.

[869]
W. Pohlmann. LR parsing for affix grammars. Acta Informatica, 20(4):283-300, 1983.

[870]
Kjell Erik Post. ANALYSIS AND TRANSFORMATION OF LOGIC PROGRAMS (ph.D. thesis). Technical Report UCSC-CRL-94-38, University of California, Santa Cruz, Jack Baskin School of Engineering, September 1994.

[871]
D. Pozefski and Mehdi Jazayeri. A family of pass-oriented attribute grammar evaluators. In ACM 1978 Annual Conf., pages 261-270. ACM press, Washington, DC, December 1978. See also: report TR 78-010, Department of Comp. Sc., University of North Carolina, Chapel Hill, NC (September 1978).

[872]
Diane Pozefsky. Building Efficient Pass-oriented Attribute Grammar Evaluators. Ph.D. thesis, Department of Comp. Sc., University of North Carolina, Chapel Hill, NC, April 1979.

[873]
G. Psaila and S. Crespi-Reghizzi. Adding Semantics to XML. In D. Parigot and M. Mernik, editors, Second Workshop on Attribute Grammars and their Applications, WAGA'99, pages 113-132, Amsterdam, The Netherlands, March 1999. INRIA rocquencourt. (PostScript, 20 pages, 255287 bytes)

[874]
William W. Pugh. Incremental computation and the incremental evaluation of functional programs. Technical Report CORNELLCS//TR88-936, Cornell University, Computer Science Department, August 1988.

[875]
Kari-Jouko Räihä and Mikko Saarinen. Developments in compiler writing systems. In E. J. Neuhold, editor, GI 6. Jahrestagung, volume 5 of Inf. Fachb., pages 164-178, New York-Heidelberg-Berlin, 1976. Springer-Verlag.

[876]
Kari-Jouko Räihä and Mikko Saarinen. An optimization of the alternating semantic evaluator. Information Processing Letters, 6(3):97-100, June 1977.

[877]
Kari-Jouko Räihä and Mikko Saarinen. Testing attribute grammars for circularity. Acta Informatica, 17(2):185-192, 1982.

[878]
Kari-Jouko Räihä and Jorma Tarhio. A globalizing transformation for attribute grammars. In ACM SIGPLAN '86 Symp. on Compiler Construction, pages 74-84. ACM press, Palo Alto, CA, June 1986. Published as ACM SIGPLAN Notices, volume 21, number 7.

[879]
Kari-Jouko Räihä and Esko Ukkonen. The shortest common supersequence problem over binary alphabet is NP-complete. report C-1979-95, Department of Comp. Sc., University of Helsinki, November 1979.

[880]
Kari-Jouko Räihä and Esko Ukkonen. Balancing syntactic and semantic power in compiler specification. In S. Lavington, editor, Information Processing '80, pages 65-70. North-Holland, Amsterdam, October 1980. Tokyo.

[881]
Kari-Jouko Räihä and Esko Ukkonen. On the optimal assignment of attribute to passes in multi-pass attribute evaluators. In J. de Bakker and J. van Leeuwen, editors, 7th Int. Coll. on Automata, Languages and Programming, volume 85 of Lecture Notes in Computer Science, pages 500-511. Springer-Verlag, New York-Heidelberg-Berlin, July 1980. Noordwijkerhout.

[882]
Kari-Jouko Räihä and Esko Ukkonen. Minimizing the number of evaluation passes for attribute grammars. SIAM Journal on Computing, 10(4):772-786, November 1981. See also: report C-1979-121, Department of Comp. Sc., University of Helsinki (1979).

[883]
Kari-Jouko Räihä, Mikko Saarinen, Eljas Soisalon-Soininen, and Martti Tienari. The compiler writing system HLP (helsinki language processor). report A-1978-2, Department of Comp. Sc., University of Helsinki, March 1978.

[884]
Kari-Jouko Räihä, Mikko Saarinen, Matti Sarjakoski, Seppo Sippu, Eljas Soisalon-Soininen, and Martti Tienari. Revised report on the compiler writing system HLP78. report A-1983-1, Department of Comp. Sc., University of Helsinki, January 1983.

[885]
Kari-Jouko Räihä. Design of the semantic phase of the compiler writing system HLP. report C-1976-24, Department of Comp. Sc., University of Helsinki, 1976. (in Finnish).

[886]
Kari-Jouko Räihä. On compiler writing systems. In NordDATA 76 Conf., pages 668-679. Finnish Data Processing Association, 1976.

[887]
Kari-Jouko Räihä. On attribute grammars and their use in a compiler writing system. Ph. Lic. thesis, report A-1977-4, Department of Comp. Sc., University of Helsinki, August 1977.

[888]
Kari-Jouko Räihä. Dynamic allocation of space for attribute instances in multi-pass evaluators of attribute grammars. In ACM SIGPLAN '79 Symp. on Compiler Construction, pages 26-38. ACM press, Denver, Co, August 1979. Published as ACM SIGPLAN Notices, volume 14, number 8.

[889]
Kari-Jouko Räihä. Bibliography on attribute grammars. ACM SIGPLAN Notices, 15(3):35-44, March 1980.

[890]
Kari-Jouko Räihä. Experiences with the compiler writing system HLP. In Neil D. Jones, editor, Semantics-Directed Compiler Generation, volume 94 of Lecture Notes in Computer Science, pages 350-362. Springer-Verlag, New York-Heidelberg-Berlin, 1980.

[891]
Kari-Jouko Räihä. A Space Management Technique for Multi-pass Attribute Evaluators. Ph.D. thesis, Department of Comp. Sc., University of Helsinki, September 1981.

[892]
Kari-Jouko Räihä. Attribute grammar design using the compiler writing system HLP. In Bernard Lorho, editor, Methods and Tools for Compiler Construction, pages 183-206. Cambridge University Press, New York, New York, 1984.

[893]
Jean-Claude Raoult and Ravi Sethi. The global storage needs of a subcomputation. In 11th ACM Symp. on Principles of Progr. Languages, pages 148-157. ACM press, Salt Lake City, Ut, January 1984.

[894]
Jean-Claude Raoult and Ravi Sethi. On finding stacked attributes. rapport de recherche 206, Laboratoire de Recherche en Informatique, University de Paris-Sud, Orsay, February 1985.

[895]
P. Rechenberg and H. Mössenböck. Ein Compiler-Generator für Mikrocomputer. Hanser Verlag, München, 1985.

[896]
S. Crespi Reghizzi, editor. Le Grammatiche ad Attributi: Semantica dei Linguaggi artificiali. Città Studi Ed., Milano, 1996. (in Italian) (Attribute Grammars: Semantic of artificial Languages).

[897]
Sophie Renault. Verification de programmes normaux. PhD thesis, Université d'Orléans-LIFO, 1996.

[898]
Thomas Reps and Bowen Alpern. Interactive proof checking. In 11th ACM Symp. on Principles of Progr. Languages, pages 36-45. ACM press, Salt Lake City, Ut, January 1984.

[899]
Thomas Reps and Alan J. Demers. Sublinear-space evaluation algorithms for attribute grammars. Technical Report CORNELLCS//TR84-630, Cornell University, Computer Science Department, August 1984.

[900]
Thomas Reps and Alan Demers. Sublinear-space evaluation algorithms for attribute grammars. ACM Trans. Progr. Languages and Systems, 9(3):408-440, July 1987.

[901]
Thomas Reps and Georg Snelting. Context relations implemented with attribute grammars. manuscript, Department of Comp. Sc., Cornell University, Ithaca, NY, January 1986.

[902]
Thomas Reps and Tim Teitelbaum. The synthesizer generator. In ACM SIGSOFT/SIGPLAN Symp. on Practical Software Development Environments, pages 42-48. ACM press, Pittsburgh, PA, April 1984. Joint issue with Software Eng. Notes 9, 3.Published as ACM SIGPLAN Notices, volume 19, number 5.

[903]
Thomas Reps and Tim Teitelbaum. The Synthesizer Generator. Springer-Verlag, New York-Heidelberg-Berlin, 1989.

[904]
Thomas Reps and Tim Teitelbaum. The Synthesizer Generator Reference Manual. Springer-Verlag, New York-Heidelberg-Berlin, 3rd edition, 1989.

[905]
Thomas Reps, Tim Teitelbaum, and Alan Demers. Incremental context-dependent analysis for language-based editors. ACM Trans. Progr. Languages and Systems, 5(3):449-477, July 1983.

[906]
Thomas Reps, Carla Marceau, and Tim Teitelbaum. Remote attribute updating for language-based editors. In 13th ACM Symp. on Principles of Progr. Languages, pages 1-13. ACM press, St Petersburg Beach, FL, January 1986.

[907]
Thomas Reps. Optimal-time incremental semantic analysis for syntax-directed editors. In 9th ACM Symp. on Principles of Progr. Languages, pages 169-176. ACM press, Albuquerque, NM, January 1982.

[908]
Thomas Reps. Static-semantics analysis in language-based editors. In Digest of Papers of the IEEE Spring CompCon 83, pages 411-414. San Francisco, CA, March 1983.

[909]
Thomas Reps. Generating language-based environments. Reprint of PhD thesis, report TR 82-514, Department of Comp. Sc., Cornell University, Ithaca, NY (August 1982)., MIT Press, Cambridge, MA, 1984.

[910]
Thomas Reps. Incremental evaluation for attribute grammars with unrestricted movement between tree modifications. Acta Informatica, 25(2):155-178, 1988.

[911]
Thomas Reps. Scan grammars: Parallel attribute evaluation via data-parallelism. Technical Report TR 1120a, University of Wisconsin-Madison, November 1992. Revised March 1993.

[912]
Thomas Reps. Scan grammars: Parallel attribute evaluation via data-parallelism. In Proceedings of the Fifth ACM Symposium on Parallel Algorithms and Architectures, Velen, Germany, June 1993. ACM.

[913]
Dzenan Ridjanovic and Michael L. Brodie. Defining database dynamics with attribute grammars. Information Processing Letters, 14(3):132-138, May 1982.

[914]
Olivier Ridoux. Engineering transformations of attributed grammars in lambdaprolog. Technical report, IRISA Rennes, 1996.

[915]
Günter Riedewald and Uwe Lämmel. Using an attribute grammar as a logic program. In Pierre Deransart, Bernard Lorho, and Jan Maluszynski, editors, Programming Languages Implementation and Logic Programming, volume 348 of Lecture Notes in Computer Science, pages 161-179. Springer-Verlag, New York-Heidelberg-Berlin, May 1988. Orléans.

[916]
Günter Riedewald and Uwe Lämmel. Using an attribute grammar as a logic program. In Pierre Deransart, Bernard Lorho, and Jan Maluszynski, editors, Programming Language Implementation and Logic Programming (PLILP '89), volume 348 of Lect. Notes in Comp. Sci., pages 161-179, Orléans, 1989. Springer-Verlag.

[917]
Günter Riedewald. Compilerkonstruktion und grammatiken syntaktischer funktionen. Dissertation b, Rechenzentrum der W.-Pieck-University, Rostock, 1979.

[918]
Günter Riedewald, editor. Vorträge des Problemseminar ``Attributierte Grammatiken und ihre Anwendungen''. Sektion Informatik, W.-Pieck University, Rostock, October 1984.

[919]
Günter Riedewald. Ein modell für programmiersprachen und compiler auf der basis universeller algebren. Journal of Information Processing Cybern., 21(3):101-127, 1985.

[920]
Günter Riedewald. A short survey on some projects of the research group ``programming languages'' at thew wilhelm pieck university in rostock, department of computer science. In O. M. Tammepuu, editor, Specialized Languages as Tools for Programming Technology, pages 120-125. Tallinn, January 1988.

[921]
Günter Riedewald. Prototyping by using an attribute grammar as a logic program. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lecture Notes in Computer Science, pages 401-437. Springer-Verlag, New York-Heidelberg-Berlin, June 1991. Prague.

[922]
Hanne Riis and Sven Skyum. K-visit attribute grammars. Technical Report DAIMI PB-121, Comp. Sc. Department, Aarhus University, June 1980.

[923]
Hanne Riis-Nielson and Sven Skyum. k-visit attribute grammars. Mathematical Systems Theory, 15(1):17-28, December 1981. See also: report DAIMI PB-121, Comp. Sc. Department, Aarhus University (June 1980).

[924]
Hanne Riis-Nielson. Subclasses of attribute grammars. report DAIMI PB-114, Comp. Sc. Department, Aarhus University, 1980.

[925]
Hanne Riis-Nielson. Using computation sequences to define evaluators for attribute grammars. report DAIMI PB-139, Comp. Sc. Department, Aarhus University, 1981.

[926]
Hanne Riis-Nielson. Computation sequences: A way to characterize subclasses of attribute grammars. Acta Informatica, 19:255-268, 1983. See also: report DAIMI PB-138, Comp. Sc. Department, Aarhus University (1981).

[927]
Knut Ripken. Generating an intermediate-code generator in a compiler writing system. In E. Gelenbe and D. Potier, editors, Int. Computing Symp., pages 121-127. North Holland/American Elsevier, Amsterdam-New York, New York, June 1975. Antibes.

[928]
Knut Ripken. Formale beschreibung von maschinen, implementierungen und optimierender maschinencodeerzeugung aus attributierten programmgraphen. Dissertation, Institut für Informatik, Tech. University München, 1977.

[929]
Knut Ripken. Application of meta-compilation methods in the ada test translator development. In Reinhard Wilhelm, editor, GI 10. Jahrestagung, volume 33 of Inf. Fachb., pages 66-77, New York-Heidelberg-Berlin, 1980. Springer-Verlag.

[930]
Johannes Röhrich. Graph attribution with multiple attribute grammars. ACM SIGPLAN Notices, 22(11):55-70, November 1987.

[931]
Johannes Rörich. Graph attribution with multiple attribute grammars. ACM SIGPLAN Notices, 22(11):55-70, November 1987.

[932]
Mads Rosendahl. Abstract interpretation using attribute grammars. In Pierre Deransart and Martin Jourdan, editors, Attribute Grammars and their Applications (WAGA), volume 461 of Lecture Notes in Computer Science, pages 143-156. Springer-Verlag, New York-Heidelberg-Berlin, September 1990. Paris.

[933]
Mads Rosendahl. Abstract Interpretation and Attribute Grammars. PhD thesis, Cambridge University, 1991.

[934]
Mads Rosendahl. Strictness analysis for attribute grammars. In Programming Language Implementation and Logic Programming (PLILP '92), volume 631 of LNCS, pages 145-157. Springer-Verlag, 1992.

[935]
A. Rosselet. Language definition based compiler development. J. Systems and Software, 7:145-161, June 1987.

[936]
Christophe Roudet. Visualisation graphique incrémentale par évaluation d'attributs. Stage de DEA informatique de l'ESSI, UniversitéNICE, 1994. (Gzipped PostScript, 90 pages, 370190 bytes)

[937]
Gilles Roussel, Didier Parigot, and Martin Jourdan. Coupling Evaluators for Attribute Coupled Grammars. In Peter A. Fritzson, editor, 5th Int. Conf. on Compiler Construction (CC' 94), volume 786 of Lect. Notes in Comp. Sci., pages 52-67, Edinburgh, April 1994. Springer-Verlag. (Gzipped PostScript, 16 pages, 58989 bytes)

[938]
Gilles Roussel, Didier Parigot, and Martin Jourdan. Static and Dynamic Coupling Attribute Evaluators. Rapport de recherche 2670, INRIA, October 1995. (Gzipped PostScript, 16 pages, 111986 bytes)

[939]
Gilles Roussel. Algorithmes de base pour la modularité et la réutilisabilité des grammaires attribuées. PhD thesis, Département d'Informatique, Université de Paris 6, March 1994. (Gzipped PostScript, 148 pages, 461010 bytes)

[940]
Philippe Rouzier. Réalisation d'une interface entre les systèmes Centaur, FNC-2 et syntax. Rapport de stage de DESS ``Systèmes et communication homme-machine'', Université de Paris 11, September 1993. (Gzipped PostScript, 46 pages, 75066 bytes)

[941]
Bruce R. Rowland. Combining Parsing and Evaluation for Attribute Grammars. Ph.D. thesis, Comp. Sc. Department, University of Wisconsin-Madison, November 1977.

[942]
David Rushall. An attribute evaluator in haskell. Technical report, Manchester University, September 1992.

[943]
Barbara G. Ryder and M. D. Carroll. Incremental data flow analysis via attributes. report LCSR-TR-93, Department of Comp. Sc., Rutgers University, New Brunswick, NJ, June 1987.

[944]
Mikko Saarinen. On constructing efficient evaluators for attribute grammars. In G. Ausiello and C. Böhm, editors, 5th Int. Coll. on Automata, Languages and Programming, volume 62 of Lecture Notes in Computer Science, pages 382-397. Springer-Verlag, New York-Heidelberg-Berlin, July 1978. Udine.

[945]
S. Sagiv, O. Edelstein, Nissim Francez, and M. Rodeh. Resolving circularity in attribute grammars with applications to data flow analysis. In 16th ACM Symp. on Principles of Progr. Languages, pages 36-48. ACM press, Austin, TX, January 1989.

[946]
Joao Saraiva and Doaitse Swierstra. Generic Attribute Grammars. In D. Parigot and M. Mernik, editors, Second Workshop on Attribute Grammars and their Applications, WAGA'99, pages 185-204, Amsterdam, The Netherlands, March 1999. INRIA rocquencourt. (PostScript, 20 pages, 354396 bytes)

[947]
João Saraiva, Matthis Kuiper, and Doaitse Swierstra. Specialing trees for efficient functional tree decoration. In Proceedings of the International Workshop on Specialization of Declarative Programs and its Applications, Port Jefferson, NY, October 1997.

[948]
Janos J. Sarbo and Matthias Moritz. Translator inversion. Comput. Lang., 14(3):205-224, 1989.

[949]
Matti Sarjakoski. Space management for attributes in the compiler writing system HLP. M.Sc. thesis, report C-1982-10, Department of Comp. Sc., University of Helsinki, 1982. (in Finnish).

[950]
Systematic debugging method for attribute grammar description. Information Processing Letters, 62(6):305-313, 1997.

[951]
Hisashi Sasaki. Global Storage Allocation in Attribute Evaluation. Ph.D. thesis, Department of Comp. Sc., Tokyo Institute of Technology, 1985.

[952]
Masataka Sassa and Harushi Ishizuka. Description of PL/0 compiler by ecLR-attributed grammars. tech. memo PL-2, Institute of Information Sciences. An International Journal, University of Tsukuba, Ibaraki-ken, 1984. (in Japanese).

[953]
Masataka Sassa, Junko Tokuda, Tsuyoshi Shinogi, and Kenzo Inoue. Design and implementation of a multipass-compiler generator. Journal of Information Processing, 3(2):77-86, 1980. See also: research report C-24, Dept. of Information Sciences. An International Journal, Tokyo Institute of Technology (April 1979).

[954]
Masataka Sassa, Harushi Ishizuka, and Ikuo Nakata. A compiler generator based on LR-attributed grammars. tech. memo PL-7, Institute of Information Sciences. An International Journal, University of Tsukuba, Ibaraki-ken, 1985.

[955]
Masataka Sassa, Harushi Ishizuka, and Ikuo Nakata. A contribution to LR-attributed grammars. Journal of Information Processing, 8(3):196-206, January 1985.

[956]
Masataka Sassa, Harushi Ishizuka, and Ikuo Nakata. ECLR-attributed grammars: a practical class of LR-attributed grammars. Information Processing Letters, 24(1):31-41, January 1987.

[957]
Masataka Sassa, Harushi Ishizuka, Motoki Sawatani, and Ikuo Nakata. Rie -- introduction and user's manual. Technical Report ISE-TR-90-82, Institute of Information Sciences. An International Journal and Electronics, University of Tsukuba, Ibaraki-ken, June 1990.

[958]
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):229-250, March 1995.

[959]
Masataka Sassa. Incremental attribute evaluation and parsing based on ECLR-attributed grammars. report A-1988-9, Department of Comp. Sc., University of Helsinki, March 1988. Also published as: Technical Report ISE-TR-88-66, Institute of Information Sciences. An International Journal and Electronics, University of Tsukuba (March 1988).

[960]
Y. Schektman, B. Klein, J. Jockin, R. More, J. Pastor, and D. Vielle. Utilisation des Méta-traducteurs dans la conception des logiciels statistiques. présentation d'exemples dans trois domaines d'application. In E. Diday, L. Lebart, J. P. Pages, and R. Tomassone, editors, Data Analysis and Informatics, pages 393-410. North-Holland, Amsterdam, 1980.

[961]
Richard M. Schell. Methods for Constructing Parallel Compilers for Use in a Multiprocessor Environment. Ph.D. thesis, Department of Comp. Sc., University of Illinois at Urbana-Champaign, February 1979.

[962]
Richard M. Schell. Parallel compilation in a multiprocessor environment. report UIUCDCS-R-79-0991, Department of Comp. Sc., University of Illinois at Urbana-Champaign, December 1979.

[963]
E. M. Schmidt. Space-restricted attribute grammars. report daimi, Comp. Sc. Department, Aarhus University, 1980.

[964]
Jean-Marie Schramm. Un formalisme pour la description des langages et des traducteurs. rapport, Centre de Calcul de l'Esplanade, University Louis Pasteur, Strasbourg, November 1981.

[965]
W. A. Schulz. Semantic Analysis and Target Language Synthesis in a Translator. Ph.D. thesis, Department of Comp. Sc., University of Colorado, Boulder, Co, 1976.

[966]
Andy Schürr. Introduction to PROGRESS, an attribute graph grammar based specification language. In Manfred Nagl, editor, Graph-Theoretic Concepts in Computer Science, volume 411 of Lecture Notes in Computer Science. Springer-Verlag, New York-Heidelberg-Berlin, 1989.

[967]
A. Schütte. Spezifikation une Generierung von Übersetzern für Graph-Sprachen durch attributierte Graph-Grammatiken. Ph.D. thesis, EXpress-Edition, Berlin, 1987.

[968]
C. B. Schwind. Ein formalismus zur beschreibung der syntax und bedeutung von frage-antwort-systemen. Bericht TUM-INFO-7710, Institut für Informatik, Tech. University München, May 1977.

[969]
R. Sennhauser. Übersetzung attributierter Grammatiken. Diploma thesis, Dept. Informatik, Inst. für Computersysteme, Eidgenössische Tech. Hochschule, Zürich, 1989.

[970]
Vladimir A. Serebriakov. Application of compiler writing systems for implementing efficient compilers. In O. M. Tammepuu, editor, Specialized Languages as Tools for Programming Technology, pages 164-175. Tallinn, January 1988. (in Russian).

[971]
Vladimir A. Serebriakov. Construction of efficient multi-stage compilers with the attribute TWS. In Actes du Séminaire Franco-Soviétique Informatika 88, pages 27-38. INRIA, Nice, February 1988.

[972]
Vladimir A. Serebriakov. Attribute visibility control in CWS super and implementation of import-export facilities in modula-2 front-end. In O. M. Tammepuu, editor, Procs. of the Soviet-French Symposium Informatika '89, pages 38-45, Tallinn, May 1989.

[973]
Vladimir A. Serebryakov. Principal features of the input language and implementation of the translator design system SUPER. Progr. and Computer Software, 8(1):52-56, January 1982.

[974]
Vladimir A. Serebryakov. Attribute Translation Techniques. Programming Languages, Moscow, 1986.

[975]
Vladimir A. Serebryakov. Construction of efficient multi-stage compilers with the attribute TWS. Comp. Center of the Academy of Sciences, (?) 1987.

[976]
Ravi Sethi. Pebble games for studying storage sharing. Theoretical Computer Science, 19:69-84, 1982.

[977]
Ravi Sethi. Control flow aspects of semantics-directed compiling. ACM Trans. Progr. Languages and Systems, 5(4):554-595, 1983. See also: report CSTR 98, Bell Labs., Murray Hill, NJ (September 1981) and ACM SIGPLAN '82 Symp. on Compiler Construction, Boston, MA, published as ACM SIGPLAN Notices 17, 6, pp. 245-260 (June 1982).

[978]
Q. Y. Shi and King-Sun Fu. Efficient error-correcting parsing for (attributed and stochastic) tree grammars. Information Sciences. An International Journal, 26(2):159-188, March 1982.

[979]
Q. Y. Shi and King-Sun Fu. Parsing and translation of (attributed) expansive graph languages for scene analysis. IEEE Trans. on Pattern Analysis and Machine Intell., PAMI-5(5):472-485, September 1983.

[980]
Q. Y. Shi. Semantic-syntax-directed translation and its application to image processing. Information Sciences. An International Journal, 32:75-90, 1984.

[981]
Yoichi Shinoda and Takuya Katayama. Attribute grammar based programming and its environment. In Proc. of the 21st Hawai Internat. Conf. on Software Systems ???, pages 612-620, 1988.

[982]
Yoichi Shinoda and Takuya Katayama. Object-oriented extension of attribute grammars and its implementation using distributed attribute evaluation algorithm. In Pierre Deransart and Martin Jourdan, editors, Attribute Grammars and their Applications (WAGA), volume 461 of Lecture Notes in Computer Science, pages 177-191. Springer-Verlag, New York-Heidelberg-Berlin, September 1990. Paris.

[983]
Yoichi Shinoda. Specification of dynamic systems based on attribute grammar. report CS-SSE-86-2, Department of Comp. Sc., Tokyo Inst. of Technology, 1986.

[984]
M. Sideri, G. Papakonstantinou, E. Skordalakis, and S. Efraimidis. Error recovery using attribute grammars. In First European Workshop on Fault Diagnostics, Reliability and Related Knowledge-Based Approaches, Rhodes, Greece, 1986.

[985]
M. Sideri, S. Efremidis, and G. Papakonstantinou. Semantically driven parsing of context free languages. The Computer Journal, 32(1):91-93, 1989.

[986]
Martha Sideris. On attribute grammars without attribute synthesis. Information Processing Letters, 35:103-109, June 1990.

[987]
H. Siitari. An attribute grammar for the programming language simula. M.Sc. thesis, report C-1979-90, Department of Comp. Sc., University of Helsinki, 1979. (in Finnish).

[988]
B. A. Silverberg. Using a grammatical formalism as a programming language. Technical Report CSRG-88, Computer Systems Research Group, University of Toronto, January 1978.

[989]
Endre Simon. Language extension in HLP/SZ. Acta Cybernetica, 7(1):89-97, 1984.

[990]
Endre Simon. A new programming methodology using attribute grammars. Acta Cybernetica, 7(4):425-436, 1986.

[991]
Endre Simon. Program specification using attribute grammar. In F. Gécseg and I. Peák, editors, Conf. on Automata, Languages and Programming Systems, pages 216-229. Dept. of Mathematics and Computer Science, Karl Marx University of Economics, Budapest, May 1986. Salgótarján, Hungary.

[992]
M. Simonet. An attribute description of a subset of algol 68. In Strathclyde Algol 68 Conf., pages 129-137. ACM press, Glasgow, June 1977. Published as ACM SIGPLAN Notices, volume 12, number 6.

[993]
Stephen K. Skedzeleski. Definition and Use of Attribute Reevaluation in Attributed Grammars. Ph.D. thesis, Comp. Sc. Department, University of Wisconsin-Madison, October 1978.

[994]
E. Skordalakis and G Papakonstantinou. Towards an attribute grammar for the description of ECG waveforms. In 7th International Conference on Pattern Recognition. IEEE Computer Society Press, 1984.

[995]
Anthony M. Sloane and Jason Holdsworth. Beyond traditional program slicing. In the International Symposium on Software Testing and Analysis, pages 180-186, San Diego, CA, January 1996. ACM Press. (PostScript)

[996]
Anthony M. Sloane. Generating dynamic program analysis tools. In the Australian Software Engineering Conference (ASWEC'97), pages 166-173, Sydney, 1997. IEEE CS Press.

[997]
Michael Sonnenschein. Implementierung und Theoretische Untersuchungen von Attribut-Auswertungsalgorithmnen und Insbesondere von Treewalk-Evaluatoren im Rahmen eines Compiler-erzugenden Systems. Diploma thesis, Lehrstuhl für Angewandte Informatik, Rheinisch-Westfälische Tech. Hoschschule Aachen, 1979.

[998]
Michael Sonnenschein. Generierung effizienter compilerteile durch attributierten grammatiken verwandte konzepte. Dissertation, Lehrstuhl für Angewandte Informatik, Rheinisch-Westfälische Tech. Hoschschule Aachen, 1983.

[999]
Michael Sonnenschein. Global storage cells for attributes in an attribute grammar. Acta Informatica, 22:397-420, 1985.

[1000]
M. Sonnenschein. Graph translation schemes to generate compiler parts. ACM Transactions on Programming Languages and Systems, 9(4):473-490, October 1987.

[1001]
Aziz Souah. Système de transformation d'arbres attribués: étude des principaux systèmes et spécification d'un nouveau système. rapport de DEA, University d'Orléans, September 1987.

[1002]
Aziz Souah. Contribution à la sémantique déclarative des systèmes de transformation d'arbres attribués. PhD thesis, Universitéd'Orléans, November 1990.

[1003]
C. D. Spyropoulos and John Kontos. Automatic organization diagnosis based on behavioural modelling with grammars. In Int. Conf. on Modelling and Simulation. Karlsruhe, 1987. Re'fe'rence a` comple'ter.

[1004]
Lars Søraas. Generering av Attribueringsystemer for AML spesifikasjoner. Cand. scient. thesis, University of Bergen, September 1994.

[1005]
A. N. Stepanov and Y. A. Popov. Realization of syntax-directed translation scheme. Progr. and Computer Software, 8(4):205-213, 1982.

[1006]
B. Stiefel and P. Thiel. Application of attributed grammar for syntax and attribute-directed bottom-up translation. In Dieter Hammer, editor, Compiler Compilers and High Speed Compilation, volume 371 of Lecture Notes in Computer Science, pages 222-238. Springer-Verlag, New York-Heidelberg-Berlin, October 1988. Berlin.

[1007]
Susan Horwitz, Thomas Reps and David Binkley. Interprocedural slicing using dependence graphs. ACM Transactions on Programming Languages and Systems, (1), 1990. (PostScript)

[1008]
Masato Suzuki, Takuya Katayama, and Richard D. Schlichting. A functional and attribute based computational model for fault-tolerant software. Technical Report TR93-08, Arizona University, Computer Science, 1993.

[1009]
M. Suzuki, T. Katayama, and R. Schlichting. Implementing fault-tolerance with an attribute and functional based model. In 24th Symp. on Fault-Tolerant Computing, pages 244-253, Austin, June 1994.

[1010]
Masato Suzuki, Takuya Katayama, and Richard Schlichting. FTAG: A functional and attribute based model for writing fault-tolerant software. Technical Report TR96-05, Arizona University, Computer Science, 1996.

[1011]
S. Doaitse Swierstra and Harald H. Vogt. Higher order attribute grammars: a merge between functional and object oriented programming. report RUU-CS-90-12, Utrecht University, March 1990.

[1012]
S. Doaitse Swierstra and Harald H. Vogt. Higher Order Attribute Grammars. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lect. Notes in Comp. Sci., pages 256-296, New York-Heidelberg-Berlin, June 1991. Springer-Verlag.

[1013]
K. C. Tai. Constant folding within an expression by semantic attributes. report TR 78-15, Computer Studies, North Carolina State University, Raleigh, NC, December 1978.

[1014]
Souad Taouil. Étude et implantation des grammaires couplées par attributs dans le système FNC-2. rapport de DEA, Dépt. d'Informatique, University d'Orléans, September 1988.

[1015]
Jorma Tarhio and Kari-Jouko Räihä. A simplifying transformation for attribute grammars. report A-1987-4, Department of Comp. Sc., University of Tampere, 1987.

[1016]
Jorma Tarhio. Attribute evaluation during LR parsing. report A-1982-4, Department of Comp. Sc., University of Helsinki, September 1982.

[1017]
Jorma Tarhio. LR parsing of some ambiguous grammars. Information Processing Letters, 14(3):101-103, May 1982.

[1018]
Jorma Tarhio. Bottom-up and top-down attributed grammars. In R. J. R. Back, editor, Proc. Winter School on Theoretical Computer Science, pages 290-302. Finnish Society of Inf. Proc. Sc., 1984.

[1019]
Jorma Tarhio. Attribute Grammars for One-pass Compilation. Ph.D. thesis, Department of Comp. Sc., University of Helsinki, May 1988.

[1020]
Jorma Tarhio. A compiler generator for attribute evaluation during LR parsing. In Dieter Hammer, editor, Compiler Compilers and High Speed Compilation, volume 371 of Lecture Notes in Computer Science, pages 146-159. Springer-Verlag, New York-Heidelberg-Berlin, October 1988. Berlin.

[1021]
Jorma Tarhio. The compiler writing system metauncle. report C-1988-23, Department of Comp. Sc., University of Helsinki, 1988.

[1022]
Jorma Tarhio. Uncle-attributed grammars. BIT, 30:437-449, 1990.

[1023]
Victor E. Tavernini. Translating natural semantic specifications to attribute grammars. report UIUCDCS-R-88-1407, Department of Comp. Sc., University of Illinois at Urbana-Champaign, May 1988.

[1024]
Tim Teitelbaum and Thomas Reps. The cornell program synthesizer: a syntax-directed programming environment. Communications of the Association for Computing Machinery, 24(9):563-573, September 1981. See also: report TR 80-421, Department of Comp. Sc., Cornell University, Ithaca, NY (May 1980).

[1025]
Tim Teitelbaum, Thomas Reps, and Susan Horwitz. The why and wherefore of the cornell program synthesizer. ACM SIGPLAN Notices, 16(6):8-16, June 1981.

[1026]
Tim Teitelbaum. The cornell program synthesizer: a tutorial introduction. report TR 79-381, Department of Comp. Sc., Cornell University, Ithaca, NY, July 1979, revised June 1980.

[1027]
Michel Téguia. Construction de grammaires attribuées associées à un programme logique et application au problème du test d'occurrence. PhD thesis, Orléans-LIFO, 1990.

[1028]
Aggelos Thanos and George Papakonstantinou. Facilitating the Development of Parallel Implementations of Declarative Programming Languages Using Attribute Grammars. In D. Parigot and M. Mernik, editors, Second Workshop on Attribute Grammars and their Applications, WAGA'99, pages 17-36, Amsterdam, The Netherlands, March 1999. INRIA rocquencourt. (PostScript, 20 pages, 350586 bytes)

[1029]
A. Thanos and G. Papakonstantinou. An attribute grammar modelling for generating CCLP languages. In K. Ueda, V. Saraswat, and A. Podelski, editors, Workshop on Modelling and Computing with Concurrent Constraint Programming of the 4th Int. Conf. on Principles and Practice of Constraint Programming (CP98), Pisa, Italy, 30 Oct. 1998.

[1030]
A. Thanos, G. Papakonstantinou, and P. Tsanakas. Towards an automatic generator of multi-paradigm programming languages. In Parallel and Distributed Computing and Networks (PDCN 98), Brisbane, Australia, 14-16 Dec. 1998.

[1031]
A. Thanos, G. Papakonstantinou, and P. Tsanakas. Attribute grammar based system for multi-paradigm distributed computing: The concurrent constraint logic programming paradigm. In 10th IITT Expersys-98 Conference on Artificial Intelligence Applications, Virginia, U.S.A., 16-17 Nov. 1998.

[1032]
A. Thanos, C. Voliotis, and G. Papakonstantinou. Modelling the control on parallel implementations of declarative programming languages. In International Conference on Computational Intelligence for Modelling,Control, and Automation (CIMCA99), Vienna, Austria, 17-19 Feb. 1999.

[1033]
A. Thanos. A grammatical approach to parallel logic programming for expressing software evolution reasoning. In 3rd CAiSE 96 Doctoral Consortium, Heraklion, Greece, May 20-21 1996.

[1034]
The Compare Consortium. Extensions of the FNC-2 Attribute Grammar System for Programming-in-the-large. En préparation, 1994.

[1035]
E. Thieser. Attributauswertung für zyklische Attributierung. Diploma thesis, FB 10 -- Informatik, University des Saarlandes, Saarbrücken, 1989.

[1036]
L Thomas and S. Cruz-lara. A concurrent object-oriented paradigm for attribute grammars. Technical report, Centre de recherche en Informatique de Mancy, 1990.

[1037]
L. Thomas and S. Cruz-Lara. A concurrent object-oriented paradigm for attribute grammars. In Plenum Publishing Corporation 1992 COMPUTER SCIENCE : Research and Applications, 1992. (PostScript)

[1038]
J. W. Thomas. Module Interconnection in Programming Systems supporting Abstraction. Ph.D. thesis, Computer Science Program, Brown University, Providence, RI, April 1976.

[1039]
M. G. Thomason. Syntactic/semantic techniques in pattern recognition: A survey. International Journal of Computer and Information Sciences, 11(2):75-100, April 1982.

[1040]
Winfried Thome and Reinhard Wilhelm. Simulating circular attribute grammars through attribute reevaluation. Information Processing Letters, 33:79-81, November 1989.

[1041]
Winfried Thome. Konzept zur Hintereinanderschaltung von Transformationseinheiten sowie zur Implementierung zyklischer Attributierungen durch nichtzyklische unter Benutzung der Reattributierung. Diploma thesis, FB 10 -- Informatik, University des Saarlandes, Saarbrücken, 1989.

[1042]
Sabine Thürmel. Self-composability of attribute coupled grammars. Bericht TUM-I8518, Institut für Informatik, Tech. University München, August 1985.

[1043]
Michael D. Tiemann. Attribute grammar tutorial: the implementation of mini-pascal. Technical Report PP-410-86, Microelectronic and Computer Technology Corporation, Austin, TX, December 1986.

[1044]
Michael D. Tiemann. ICC: an incremental compiler compiler based on attribute evaluation. Technical Report PP-412-86, Microelectronic and Computer Technology Corporation, Austin, TX, December 1986.

[1045]
Michael D. Tiemann. Removing redundancy in attribute grammars. manuscript, Parallel Processing Program, Microelectronic and Computer Technology Corporation, Austin, TX, July 1987.

[1046]
Martti Tienari. Research on programming languages and compilers. Data, 11-78:75-78, 1978.

[1047]
Martti Tienari. On the definition of an attribute grammar. In Neil D. Jones, editor, Semantics-Directed Compiler Generation, volume 94 of Lecture Notes in Computer Science, pages 408-414. Springer-Verlag, New York-Heidelberg-Berlin, 1980. See also: report C-1979-29, Department of Comp. Sc., University of Helsinki (March 1979).

[1048]
Heiner Tittelbach. Effiziente Attributspeicherverwaltung für ein baumtransformierendes System. Diploma thesis, FB 10 -- Informatik, University des Saarlandes, Saarbrücken, 1986.

[1049]
Janos Toczki, Endre Simon, T. Garai, Ferenc Kocsis, and Tibor Gyimóthy. Automatic compiler generation. In F. Gécseg and I. Peák, editors, Conf. on Automata, Languages and Programming Systems, pages 289-297. Dept. of Math. and Comput. Sc., Karl Marx University of Economics, Budapest, May 1986. Salgótarján, Hungary.

[1050]
Janos Toczki, Tibor Gyimóthy, Ferenc Kocsis, and Tamás Horváth. Automatic software generation in practice: New features in the HLP/PAS system. In O. M. Tammepuu, editor, Specialized Languages as Tools for Programming Technology, pages 103-119. Tallinn, January 1988.

[1051]
Takehiro Tokuda and Yoshimichi Watanabe. An attribute evaluation of context-free languages. Technical Report 93TR-0036, Tokyo Institute of Technology, 1993.

[1052]
Takehiro Tokuda and Yoshimichi Watanabe. An attribute grammar modelling of interactive figures. Technical Report 93TR-0034, Tokyo Institute of Technology, 1993.

[1053]
Takehiro Tokuda and Yoshimichi Watanabe. An efficient semantic evaluator for warped LC(1) attributed grammars. Technical Report 93TR-0035, Tokyo Institute of Technology, 1993.

[1054]
Takehiro Tokuda. Wijngaarden grammars as knuthian grammars. In Proc. 20th Annual IPSJ Conf., pages 207-208, 1979. (in Japanese).

[1055]
Takehiro Tokuda. An exercise in transforming wijngaarden grammars into knuthian grammars. report C-40, Department of Comp. Sc., Tokyo Inst. of Technology, 1981.

[1056]
Takehiro Tokuda. Transformation of attribute grammars into efficient action routines by patch introduction. The Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E, E69(9):980-987, 1986.

[1057]
Takehiro Tokuda. Two methods for eliminating redundant copy operations from the evaluation of attribute grammars. Journal of Information Processing, 9(2):79-85, 1986.

[1058]
Takehiro Tokuda. Code improvement techniques in the transformation of attribute grammars into efficient action routines. Journal of Information Processing, 10(1):27-32, 1987.

[1059]
Takehiro Tokuda. An attribute assignment view of non-procedural computing systems. Journal of Information Processing, 11(3):165-174, 1988.

[1060]
Dimitri Tusera. Example of transformation of a derivation tree for an expression by semantic attributes. In J. L. Rosenfeld, editor, Information Processing '74, pages 381-385. North-Holland, Amsterdam, August 1974. Stockholm.

[1061]
G. O. Uddeborg. A functional parser generator. Technical Report 43, Programming Methodology Group, University of Goteborg and Chalmers University of Technology., February 1988.

[1062]
James S. Uhl and Nigel Horspool. Flow grammars - a flow analysis methodology. In Peter A. Fritzson, editor, 5th Int. Conf. on Compiler Construction (CC' 94), volume 786 of Lect. Notes in Comp. Sci., pages 203-217, Edinburgh, April 1994. Springer-Verlag.

[1063]
J. Uhl, Sophia Drossopoulos, G. Persch, Gerhart Goos, M. Daussmann, G. Winterstein, and Walter Kirchgäßner. An Attributed Grammar for the Semantic Analysis of ADA, volume 139 of Lecture Notes in Computer Science. Springer-Verlag, New York-Heidelberg-Berlin, 1982. See also: Bericht 25/81, Institut für Informatik II, University Karlsruhe (1981).

[1064]
A. van den Berg. Attribute grammar based transformation systems. Inf/scr-90-16, Utrecht University, The Netherlands, June 1990.

[1065]
P. M. van den Broek and F. A. van Gilst. A new programming methodology for lazy functional languages. Technical report, University of Twente, 1993.

[1066]
E. A. van der Meulen. Incremental Rewriting. PhD thesis, University of Amsterdam, 1994.

[1067]
A. van Deursen. Origin tracking in primitive recursive schemes. In H. A. Wijshoff, editor, Conference Proceedings Computing Science in the Netherlands (CSN'93), pages 132-143, 1993.

[1068]
Peter van Eijk. Attribute grammar applications in prototyping LOTOS tools. In Pierre Deransart and Martin Jourdan, editors, Attribute Grammars and their Applications (WAGA), volume 461 of Lecture Notes in Computer Science, pages 91-100. Springer-Verlag, New York-Heidelberg-Berlin, September 1990. Paris.

[1069]
Jan Van Katwijk. A preprocessor for YACC or a poor man's approach to parsing attributed grammars. ACM SIGPLAN Notices, 18(10):12-15, October 1983.

[1070]
N. van Vugt. Generalized Context-Free Grammars. PhD thesis, Leiden University, Leiden, The Netherlands, 1996.

[1071]
J. Vilo. Implementing attribute grammars by computational models. In M. Bruynooghe and M. Wirsing, editors, Programming Language Implementation and Logic Programming (PLILP '92), pages 485-486, Leuven, Belgium, 1992. LNCS 631, Springer-Verlag.

[1072]
Jaak Vilo. Attribute grammars and computational models as combined language development tools. Technical Report CS 43/92, Institute of Cybernetics of Estonian Academy of Sciences, 1992.

[1073]
Bruno Vivien. Etude du système syntax/FNC-2 pour la génération de compilateur. Technical report, Conservatoire national des arts et metiers, Grenoble, 1996.

[1074]
Bruno Vivien. Etude et réalisation d'un compilateur E-LOTOS à l'aide du générateur de compilateurs SYNTAX/FNC-2. Diplome d'ingenieur CNAM en informatique, Conservatoire National des Arts et Métiers, Décembre 1997.

[1075]
H. Vogler. Berechnungsmodelle syntaxgesteuerter Übersetzungen. Diploma thesis, Lehrstuhl für Angewandte Informatik, Rheinisch-Westfälische Tech. Hoschschule Aachen, April 1981.

[1076]
Harald H. Vogt, S. Doaitse Swierstra, and Matthijs F. Kuiper. Higher order attribute grammars. In ACM SIGPLAN '89 Conf. on Progr. Lang. Design and Implementation, pages 131-145, Portland, OR, July 1989. ACM press. Published as sl ACM SIGPLAN Notices, 24(7).

[1077]
Harald H. Vogt, S. Doaitse Swierstra, and Matthijs F. Kuiper. On the efficient incremental evaluation of higher order attribute grammars. report RUU-CS-90-36, Utrecht University, December 1990.

[1078]
Harald H. Vogt, Aswin van den Berg, and Arend Freije. Rapid development of a program transformation system with attribute grammars and dynamic transformations. In Pierre Deransart and Martin Jourdan, editors, Attribute Grammars and their Applications (WAGA), volume 461 of Lecture Notes in Computer Science, pages 101-115. Springer-Verlag, New York-Heidelberg-Berlin, September 1990. Paris.

[1079]
H. H. Vogt. Higher order Attribute Grammars. Ph.D. thesis, Faculteit Wiskunde en Informatica, 1993.

[1080]
C. Voliotis, N. Sgouros, and G. Papakonstantinou. Attribute grammar based modeling of concurrent constraint logic programming. International Journal on Artificial Intelligence Tools, 4(3):383-411, 1996.

[1081]
C. Voliotis, A. Thanos, N. Sgouros, and G. Papakonstantinou. DAFFODIL: A framework for integrating AND/OR parallelism. In 5th Hellenic Conference on Informatics, Athens, Dec 1995.

[1082]
Aare O. Vooglaid and Merik B. Méristé. Abstract attribute grammars. Progr. and Computer Software, 8(5):242-251, September 1982.

[1083]
Scott A. Vorthmann. Syntax-directed editor support for incremental consistency maintenance. Technical Report GIT-CC-90-03, Georgia Institute of Technology. College of Computing.

[1084]
Scott A. Vorthmann. Coordinated incremental attribute evaluation on a DR-threaded tree. In Pierre Deransart and Martin Jourdan, editors, Attribute Grammars and their Applications (WAGA), volume 461 of Lecture Notes in Computer Science, pages 207-221. Springer-Verlag, New York-Heidelberg-Berlin, September 1990. Paris.

[1085]
Scott A. Vorthmann. Modelling and specifying name visibility and binding semantics. Technical Report CMU//CS-93-158, Carnegie Mellon University, School of Computer Science, July 1993.

[1086]
R. Vuurboom. Restricting semantic behaviour of attribute grammars. internal report, Onderafdeling der Informatica, Tech. Hogeschool Twente, 1980.

[1087]
Leo K. Vyhandu and Aare O. Vooglaid. Practical problems of automatic software generation. In O. M. Tammepuu, editor, Specialized Languages as Tools for Programming Technology, pages 126-132 syst.ELMA. Tallinn, January 1988.

[1088]
Mary Pfreundschuh Wagner and Ray Ford. Using attribute grammars to control incremental, concurrent builds of modular systems. In Proceedings of the International Workshop on Software Version and Configuration Control, pages 285-304, Grassau, Germany, January 1988.

[1089]
William M. Waite, Josef Grosch, and Friedrich-Wilhelm Schröer. Three compiler specifications. GMD-Studien Nr. 166, GMD, Karlsruhe, August 1989.

[1090]
William A. Waite. Use of attribute grammars in compiler construction. In Pierre Deransart and Martin Jourdan, editors, Attribute Grammars and their Applications (WAGA), volume 461 of Lecture Notes in Computer Science, pages 255-265. Springer-Verlag, New York-Heidelberg-Berlin, September 1990. Paris.

[1091]
Janet A. Walz and Gregory F. Johnson. Incremental evaluation for a general class of circular attribute grammars. In ACM SIGPLAN '88 Conf. on Progr. Languages Design and Implementation, pages 209-221. ACM press, Atlanta, GA, July 1988. Published as ACM SIGPLAN Notices, volume 23, number 7.

[1092]
Janet A. Walz and Gregory F. Johnson. Inductive attribute grammars: A basis for incremental program execution. Acta Informatica, 32(2):117-144, 1995.

[1093]
Janet A. Walz. Extending Attribute Grammar and Type Inference Algorithms. Ph.D. thesis, Cornell University, February 1989.

[1094]
S. K. Warren. The efficient evaluation of attribute grammars. Master's thesis, Rice University, Houston, TX, April 1975.

[1095]
S. K. Warren. The Coroutine Model of Attribute Grammar Evaluation. Ph.D. thesis, Rice University, Houston, TX, April 1976.

[1096]
David A. Watt and Ole L. Madsen. Extended attribute grammars. The Computer Journal, 26:142-153, 1983. See also: report 10, Comp. Sc. Department, University of Glasgow (July 1977) and report DAIMI PB-105, Comp. Sc. Department, Aarhus University (November 1979).

[1097]
David A. Watt. LR parsing of affix grammars. report 7, Comp. Sc. Department, University of Glasgow, August 1974.

[1098]
David A. Watt. The parsing problem for affix-grammars. Acta Informatica, 8(1):1-20, 1977.

[1099]
David A. Watt. An extended attribute grammar for pascal. ACM SIGPLAN Notices, 14(2):60-74, February 1979.

[1100]
David A. Watt. Rule splitting and attribute-directed parsing. In Neil D. Jones, editor, Semantics-Directed Compiler Generation, volume 94 of Lecture Notes in Computer Science, pages 363-392. Springer-Verlag, New York-Heidelberg-Berlin, 1980.

[1101]
David A. Watt. Modular language definitions. report CSC/82/R3, Comp. Sc. Department, University of Glasgow, 1982.

[1102]
David A. Watt. Contextual constraints. In Bernard Lorho, editor, Methods and Tools for Compiler Construction, pages 45-80. Cambridge University Press, New York, New York, 1984.

[1103]
David A. Watt. Executable semantic descriptions. Software--Practice and Experience, 16(1):13-43, 1986.

[1104]
J. Weber. Programmtransformationen mit attributierten transformationsgrammatiken. Bericht 7604, Institut für Informatik, Tech. University München, 1976.

[1105]
Beatrix Weisgerber. Attributierte Transformationsgrammatiken: die Baumanalyse und Untersuchungen zu Transformationsstrategien. Diploma thesis, University des Saarlandes, Saarbrücken, 1983.

[1106]
Describing code optimization algorithms by attributed transformational grammars. In M. Kronental and Bernard Lorho, editors, Séminaires Structure et Programmation des Calculateurs 1975, pages 153-164. INRIA, Rocquencourt, 1975.

[1107]
Reinhard Wilhelm and R. Maurer. Les compilateurs - theorie, construction, generation. Masson, 1994.

[1108]
Reinhard Wilhelm and R. Maurer. Compiler Design. Addison Wesley, 1995.

[1109]
Reinhard Wilhelm, Knut Ripken, H. Ciesinger, W. Lahner, and R. D. Nollmann. Design evaluation of the compiler generating system MUG1. In 2nd Int. Conf. on Software Engineering, pages 571-576. San Francisco, CA, October 1976.

[1110]
Reinhard Wilhelm. Syntax- und semantikspezification in der eingabesprache für einen compiler-compiler. Bericht 7301, Abteilung Mathematik, Tech. University München, 1973.

[1111]
Reinhard Wilhelm. Code-optimierung mittels attributierter transformationsgrammatiken. In D. Siefkes, editor, GI 4. Jahrestagung, volume 26 of Lecture Notes in Computer Science, pages 257-266, New York-Heidelberg-Berlin, October 1974. Springer-Verlag. See also: Bericht 7408, Abteilung Mathematik, Tech. University München (1974).

[1112]
Reinhard Wilhelm. Baumtransformatoren. ein vergleich mit baumtransduktoren und aspekte der implementierung. Bericht TUM-INFO-7713, Institut für Informatik, Tech. University München, June 1977.

[1113]
Reinhard Wilhelm. Presentation of the compiler generating system MUG2. examples: Global flow analysis and optimization. In Michaneh Amirchahy and Danièle Néel, editors, Le Point sur la Compilation, pages 307-335. IRIA-CEC, Rocquencourt, January 1978. Montpellier.

[1114]
Reinhard Wilhelm. Attibutierte grammatiken. Informatik-Spektrum, 2(3):123-130, July 1979.

[1115]
Reinhard Wilhelm. Computation and use of data flow information in optimizing compilers. Acta Informatica, 12(3):209-225, 1979.

[1116]
Reinhard Wilhelm. Global flow analysis and optimization in the MUG2 compiler generating system. In Steven S. Muchnick and Neil D. Jones, editors, Program Flow Analysis: Theory and Applications, pages 141-159. Prentice-Hall, Englewood Cliffs, NJ, 1981.

[1117]
Reinhard Wilhelm. LL- and LR-attributed grammars. In H. Wössner, editor, GI 7. Fachtagung ``Programmiersprachen und Programmentwicklung'', volume 53 of Inf. Fachb., pages 151-164, New York-Heidelberg-Berlin, March 1982. Springer-Verlag.

[1118]
Reinhard Wilhelm. Inverse currying transformation on attribute grammars. In 11th ACM Symp. on Principles of Progr. Languages, pages 140-147. ACM press, Salt Lake City, Ut, January 1984.

[1119]
Reinhard Wilhelm. Tree transformations, functional languages, and attribute grammars. In Pierre Deransart and Martin Jourdan, editors, Attribute Grammars and their Applications (WAGA), volume 461 of Lecture Notes in Computer Science, pages 116-129. Springer-Verlag, New York-Heidelberg-Berlin, September 1990. Paris.

[1120]
Reinhard Wilhelm. Attribute reevaluation in OPTRAN. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lecture Notes in Computer Science, page 507. Springer-Verlag, New York-Heidelberg-Berlin, June 1991. Prague.

[1121]
Reinhard Wilhelm. Inverse currying transformation on attribute grammars. Technical Report UCB//CSD-83-129, California Berkeley, July 1993.

[1122]
M. H. Williams. Methods for specifying static semantics. Comput. Lang., 6(1):1-17, 1981.

[1123]
N. Willman. Describing code optimization algorithms by means of attribute grammars. M.Sc. thesis, report C-1980-73, Department of Comp. Sc., University of Helsinki, 1980. (in Finnish).

[1124]
Linda M. Wills. Using attributed flow graph parsing to recognize programs. In Int. Workshop on Graph Grammars and Their Application to Computer Science, Williamsburg, Virginia, November 1994. (PostScript)

[1125]
W. T. Wilner. Declarative Semantic Definition as Illustrated by a Definition of Simula 67. Ph.D. thesis, Comp. Sc. Department, Stanford University, June 1971.

[1126]
W. T. Wilner. Formal semantic definition using synthesized and inherited attributes. In R. Rustin, editor, Formal Semantics of Programming Languages, pages 25-39. Prentice-Hall, Englewood Cliffs, NJ, 1972.

[1127]
Pei-Chi Wu and Feng-Jian Wang. A worst case of circularity test algorithms for attribute grammars. ACM Transactions on Programming Languages and Systems, 17(2):228-232, March 1995.

[1128]
Y. Yamashita, Masataka Sassa, and Ikuo Nakata. A friendship club problem and its application to attribute grammars. Computer Software, 4(3):28-40, 1987. (in Japanese).

[1129]
W. Yang and Y. T. Liu. SSCC: A software tool based on extended ordered attribute grammars. Proc. National Science Council Part A: Physical Science and Engineering, 1998.

[1130]
Dashing Yeh and Uwe Kastens. Improvements of an incremental evaluation algorithm for ordered attributed grammars. ACM SIGPLAN Notices, 23(12):45-50, December 1988.

[1131]
Dashing Yeh. On incremental evaluation of ordered attributed grammars. BIT, 23:308-320, 1983.

[1132]
Daniel M. Yellin and Eva-Maria M. Mueckstein. Two-way translators based on attribute grammar inversion. In 8th Int. Conf. on Software Engineering, pages 36-42. London, August 1985.

[1133]
Daniel M. Yellin and Eva-Maria M. Mueckstein. The automatic inversion of attribute grammars. Institute of Electrical and Electronics Engineers. Transactions on Software Engineering, SE-12(5):590-599, May 1986. See also: report RC 10957, IBM T.J. Watson Research Center, Yorktown Heights, NY (January 1985).

[1134]
Daniel M. Yellin. A survey of tree-walk evaluation strategies for attribute grammars. report, Department of Comp. Sc., Columbia University, New York, NY, September 1984.

[1135]
Daniel M. Yellin. Attribute grammar inversion and source-to-source translation. Reprint of PhD thesis, Department of Comp. Sc., Columbia University, New York, NY (1987)., Springer-Verlag, New York-Heidelberg-Berlin, 1988.

[1136]
P. Yli-Olli. On compiler writing systems: Applications and software problems. report C-1975-32, Department of Comp. Sc., University of Helsinki, 1975. (in Finnish).

[1137]
K. C. You and King-Sun Fu. A syntactic approach to shape recognition using attributed grammars. Institute of Electrical and Electronic Engineers. Transactions on Systems, Man, and Cybernetics, SMC-9(6):334-345, 1979.

[1138]
Bradley T. Vander Zanden. Incremental constraint satisfaction and its application to graphical interfaces. Technical Report CORNELLCS//TR88-941, Cornell University, Computer Science Department, October 1988.

[1139]
Alan K. Zaring. Parallel Evaluation in Attribute Grammar-based Systems. Ph.D. thesis, Department of Comp. Sc., Cornell University, August 1990.

[1140]
Catherine Zylberman. Réalisation du constructeur d'arbre abstrait (ATC) du système de grammaire attribuée FNC-2 au dessus de l'analyseur lexico-syntaque lex-yacc. Rapport de stage de troisième année, Telecom Paris, 1990.