QuickSearch:   Number of matching entries: 0.

Search Settings

Irons, E.T. (1961), "A Syntax-directed Compiler for ALGOL 60", Communications of the Association for Computing Machinery., January, 1961. Vol. 4(1), pp. 51-55.
BibTeX:
@article{Irons61,
  author = {E. T. Irons},
  title = {A Syntax-directed Compiler for ALGOL 60},
  journal = {Communications of the Association for Computing Machinery},
  year = {1961},
  volume = {4},
  number = {1},
  pages = {51--55}
}
Knuth, D.E. (1968), "Semantics of Context-free Languages", Mathematical Systems Theory., June, 1968. Vol. 2(2), pp. 127-145.
BibTeX:
@article{Knuth68,
  author = {Donald E. Knuth},
  title = {Semantics of Context-free Languages},
  journal = {Mathematical Systems Theory},
  year = {1968},
  volume = {2},
  number = {2},
  pages = {127--145},
  note = {Correction: sl Mathematical Systems Theory 5, 1, pp. 95-96 (March 1971).}
}
Culik, II, K. (1969), "Attributed Grammars and Languages". Dépt. d'Informatique, University de Montréal, Technical Report 3, May, 1969.
BibTeX:
@techreport{Culik69,
  author = {Karel Culik, II},
  title = {Attributed Grammars and Languages},
  year = {1969},
  number = {3}
}
Bruno, J. & Burkhard, W.A. (1970), "A Circularity Test for Interpreted Grammmars". Comp. Sc. Lab., Department of Elec. Eng., Princeton University, Technical Report 88, 1970.
BibTeX:
@techreport{Bruno70,
  author = {J. Bruno and W. A. Burkhard},
  title = {A Circularity Test for Interpreted Grammmars},
  year = {1970},
  number = {88}
}
Knuth, D.E. (1971), "Examples of Formal Semantics", In Symp. on Semantics of Algorithmic Languages. New York--Heidelberg--Berlin Vol. 188, pp. 212-235. Springer-Verlag.
BibTeX:
@incollection{Knuth71,
  author = {Donald E. Knuth},
  title = {Examples of Formal Semantics},
  booktitle = {Symp. on Semantics of Algorithmic Languages},
  publisher = {Springer-Verlag},
  year = {1971},
  volume = {188},
  pages = {212--235}
}
Koster, C.H.A. (1971), "A Compiler Compiler". Mathematisch Centrum, Technical Report 127, 1971.
BibTeX:
@techreport{Koster71,
  author = {Cornelius H. A. Koster},
  title = {A Compiler Compiler},
  year = {1971},
  number = {127}
}
Koster, C.H.A. (1971), "Affix Grammars", In Algol 68 Implementation. Amsterdam , pp. 95-109. North-Holland.
BibTeX:
@incollection{Koster71a,
  author = {Cornelius H. A. Koster},
  title = {Affix Grammars},
  booktitle = {Algol 68 Implementation},
  publisher = {North-Holland},
  year = {1971},
  pages = {95--109}
}
Petrick, S.R. (1971), "On the Use of Syntax-based Translators for Symbolic and Algebraic Manipulation", In 2nd Symp. on Symbolic and Algebraic Manipulation. Los Angeles, CA, March, 1971. , pp. 224-237.
BibTeX:
@incollection{Petrick71,
  author = {S. R. Petrick},
  title = {On the Use of Syntax-based Translators for Symbolic and Algebraic Manipulation},
  booktitle = {2nd Symp. on Symbolic and Algebraic Manipulation},
  year = {1971},
  pages = {224--237}
}
Wilner, W.T. (1971), "Declarative Semantic Definition as Illustrated by a Definition of Simula 67". School: Comp. Sc. Department, Stanford University., June, 1971. (report STAN-CS-233-71)
BibTeX:
@phdthesis{Wilner71,
  author = {W. T. Wilner},
  title = {Declarative Semantic Definition as Illustrated by a Definition of Simula 67},
  school = {Comp. Sc. Department, Stanford University},
  year = {1971},
  number = {report STAN-CS-233-71}
}
Dreisbach, T.A. (1972), "A Declarative Semantic Definition of PL360". School: Comp. Sc. Department, University of California. Los Angeles, CA, October, 1972. (report UCLA-ENG-7289)
BibTeX:
@mastersthesis{Dreisbach72,
  author = {T. A. Dreisbach},
  title = {A Declarative Semantic Definition of PL360},
  school = {Comp. Sc. Department, University of California},
  year = {1972},
  number = {report UCLA-ENG-7289}
}
Fang, I. (1972), "FOLDS, a Declarative Formal Language Definition System". School: Comp. Sc. Department, Stanford University., December, 1972. (report STAN-CS-72-329)
BibTeX:
@phdthesis{Fang72,
  author = {Isu Fang},
  title = {FOLDS, a Declarative Formal Language Definition System},
  school = {Comp. Sc. Department, Stanford University},
  year = {1972},
  number = {report STAN-CS-72-329},
  note = {Abstract in: t Séminaires Structure et Programmation des Calculateurs 1973, ed. M. Kronental and Bernard Lorho, INRIA, Rocquencourt, pp. 275-290 (1973).}
}
Lee, C.J.C. (1972), "Translation of Context-free Programming Languages using Semantic Trees". Department of Comp. Sc., University of Toronto, Technical Report 43, July, 1972.
BibTeX:
@techreport{Lee72,
  author = {C. J. C. Lee},
  title = {Translation of Context-free Programming Languages using Semantic Trees},
  year = {1972},
  number = {43}
}
Maurer, W.D. (1972), "A Semantic Extension of BNF", International Journal of Computer Mathematics. Section A. Programming Theory and Methods. Section B. Computational Methods, Sect.~A., September, 1972. Vol. 3(2), pp. 157-176.
BibTeX:
@article{Maurer72,
  author = {W. D. Maurer},
  title = {A Semantic Extension of BNF},
  journal = {International Journal of Computer Mathematics. Section A. Programming Theory and Methods. Section B. Computational Methods, Sect.~A},
  year = {1972},
  volume = {3},
  number = {2},
  pages = {157--176}
}
Wilner, W.T. (1972), "Formal Semantic Definition using Synthesized and Inherited Attributes", In Formal Semantics of Programming Languages. Englewood Cliffs, NJ , pp. 25-39. Prentice-Hall.
BibTeX:
@incollection{Wilner72,
  author = {W. T. Wilner},
  title = {Formal Semantic Definition using Synthesized and Inherited Attributes},
  booktitle = {Formal Semantics of Programming Languages},
  publisher = {Prentice-Hall},
  year = {1972},
  pages = {25--39}
}
Aho, A.V. & Ullman, J.D. (1973), "The Theory of Parsing, Translation and Compiling" Englewood Cliffs, NJ Prentice-Hall.
BibTeX:
@book{Aho73,
  author = {Alfred V. Aho and Jeffrey D. Ullman},
  title = {The Theory of Parsing, Translation and Compiling},
  publisher = {Prentice-Hall},
  year = {1973},
  note = {I and II}
}
Berry, D.M. (1973), "On the Design and Specification of the Programming Language OREGANO". Comp. Sc. Department, University of California, Technical Report UCLA-ENG-7388, 1973.
BibTeX:
@techreport{Berry73,
  author = {D. M. Berry},
  title = {On the Design and Specification of the Programming Language OREGANO},
  year = {1973},
  number = {UCLA-ENG-7388}
}
Blaizot, F. & Boullier, P. (1973), "Projet DELTA: description d'un langage algorithmique à structure de blocs". IRIA-Laboria, Technical Report 35, October, 1973.
BibTeX:
@techreport{Blaizot73,
  author = {F. Blaizot and Pierre Boullier},
  title = {Projet DELTA: description d'un langage algorithmique à structure de blocs},
  year = {1973},
  number = {35}
}
Blaizot, L. (1973), "DELTA: système de description de langages et de traducteurs par attributs". IRIA-Laboria, Technical Report 20, June, 1973.
BibTeX:
@techreport{Blaizot73a,
  author = {L. Blaizot},
  title = {DELTA: système de description de langages et de traducteurs par attributs},
  year = {1973},
  number = {20}
}
Blaizot, L. (1973), "Introduction à la notion d'attributs sémantiques", In Séminaires Structure et Programmation des Calculateurs 1973. Rocquencourt , pp. 253-273. INRIA.
BibTeX:
@incollection{Blaizot73b,
  author = {L. Blaizot},
  title = {Introduction à la notion d'attributs sémantiques},
  booktitle = {Séminaires Structure et Programmation des Calculateurs 1973},
  publisher = {INRIA},
  year = {1973},
  pages = {253--273}
}
Bochmann, G.V. (1973), "Semantic Equivalence of Syntactically Related Attribute Grammars". Dépt. d'Informatique, University de Montréal, Technical Report 148, November, 1973.
BibTeX:
@techreport{Bochmann73,
  author = {Gregor V. Bochmann},
  title = {Semantic Equivalence of Syntactically Related Attribute Grammars},
  year = {1973},
  number = {148}
}
Bochmann, G.V. & Lecarme, O. (1973), "Un système d'écriture de compilateurs. Manuel d'utilisation". Dépt. d'Informatique, University de Montréal, Technical Report 44, 1973.
BibTeX:
@techreport{Bochmann73a,
  author = {Gregor V. Bochmann and Olivier Lecarme},
  title = {Un système d'écriture de compilateurs. Manuel d'utilisation},
  year = {1973},
  number = {44}
}
Bouchenez, J.-L. (1973), "Système de description de langages et de traducteurs par attributs. Présentation du système", In Séminaires Structure et Programmation des Calculateurs 1973. Rocquencourt , pp. 317-328. INRIA.
BibTeX:
@incollection{Bouchenez73,
  author = {Jean-Louis Bouchenez},
  title = {Système de description de langages et de traducteurs par attributs. Présentation du système},
  booktitle = {Séminaires Structure et Programmation des Calculateurs 1973},
  publisher = {INRIA},
  year = {1973},
  pages = {317--328}
}
Bouckaert, M., Pirotte, A. & Snelling, M. (1973), "SOFT: a Tool for Writing Sofware". MBLE Research Lab., Technical Report R212, January, 1973.
BibTeX:
@techreport{Bouckaert73,
  author = {M. Bouckaert and A. Pirotte and M. Snelling},
  title = {SOFT: a Tool for Writing Sofware},
  year = {1973},
  number = {R212}
}
Bouckaert, M., Pirotte, A. & Snelling, M. (1973), "Utilisation des Attributs dans un Système d'Écriture de Software", In Séminaires Structure et Programmation des Calculateurs 1973. Rocquencourt , pp. 291-315. INRIA.
BibTeX:
@incollection{Bouckaert73a,
  author = {M. Bouckaert and A. Pirotte and M. Snelling},
  title = {Utilisation des Attributs dans un Système d'Écriture de Software},
  booktitle = {Séminaires Structure et Programmation des Calculateurs 1973},
  publisher = {INRIA},
  year = {1973},
  pages = {291--315}
}
Ganzinger, H. (1973), "Drei Methoden zur Beschreibung der Semantik von Programmiersprachen und Formalisierung der Semantik eines Algol 68 Subset". School: Abteilung Mathematik, Tech. University München., November, 1973.
BibTeX:
@phdthesis{Ganzinger73,
  author = {Harald Ganzinger},
  title = {Drei Methoden zur Beschreibung der Semantik von Programmiersprachen und Formalisierung der Semantik eines Algol 68 Subset},
  school = {Abteilung Mathematik, Tech. University München},
  year = {1973}
}
Plath, W.J. (1973), "Transformational Grammar and Transformational Parsing in the REQUEST System". IBM T.J. Watson Research Center, Technical Report 4396, May, 1973.
BibTeX:
@techreport{Plath73,
  author = {Warren J. Plath},
  title = {Transformational Grammar and Transformational Parsing in the REQUEST System},
  year = {1973},
  number = {4396}
}
Wilhelm, R. (1973), "Syntax- und Semantikspezification in der Eingabesprache für einen Compiler-Compiler". Abteilung Mathematik, Tech. University München, Technical Report 7301, 1973.
BibTeX:
@techreport{Wilhelm73,
  author = {Reinhard Wilhelm},
  title = {Syntax- und Semantikspezification in der Eingabesprache für einen Compiler-Compiler},
  year = {1973},
  number = {7301}
}
Amirchahy, M. & Mazaud, M. (1974), "Projet DELTA: optimisation de code généré par attributs". IRIA-Laboria, Technical Report 59, February, 1974.
BibTeX:
@techreport{Amirchahy74,
  author = {Michaneh Amirchahy and Monique Mazaud},
  title = {Projet DELTA: optimisation de code généré par attributs},
  year = {1974},
  number = {59}
}
Bochmann, G.V. (1974), "Attribute Grammars and Compilation: Program Evaluation in Several Phases". Dépt. d'Informatique, University de Montréal, Technical Report 54, August, 1974.
BibTeX:
@techreport{Bochmann74,
  author = {Gregor V. Bochmann},
  title = {Attribute Grammars and Compilation: Program Evaluation in Several Phases},
  year = {1974},
  number = {54}
}
Bormann, J. & Lötzsch, J. (1974), "Definition und Realisierung von Fachsprachen mit DEPOT". Sektion Mathematik, Tech. University Dresden, 1974.
BibTeX:
@techreport{Bormann74,
  author = {J. Bormann and J. Lötzsch},
  title = {Definition und Realisierung von Fachsprachen mit DEPOT},
  year = {1974}
}
Brosgol, B.M. (1974), "Deterministic Translation Grammars". School: Harvard University. Cambridge, MA (report TR 3-74)
BibTeX:
@phdthesis{Brosgol74,
  author = {B. M. Brosgol},
  title = {Deterministic Translation Grammars},
  school = {Harvard University},
  year = {1974},
  number = {report TR 3-74}
}
Ganzinger, H. (1974), "Modifizierte Attributierte Grammatiken". Abteilung Mathematik, Tech. University München, Technical Report 7420, November, 1974.
BibTeX:
@techreport{Ganzinger74,
  author = {Harald Ganzinger},
  title = {Modifizierte Attributierte Grammatiken},
  year = {1974},
  number = {7420}
}
Jazayeri, M. (1974), "On Attribute Grammars and the Semantic Specification of Programming Languages". School: Jennings Computing Center, Case Western Reserve University. Cleveland, OH, October, 1974. (report 1159)
BibTeX:
@phdthesis{Jazayeri74,
  author = {Mehdi Jazayeri},
  title = {On Attribute Grammars and the Semantic Specification of Programming Languages},
  school = {Jennings Computing Center, Case Western Reserve University},
  year = {1974},
  number = {report 1159}
}
Koster, C.H.A. (1974), "Using the CDL Compiler-Compiler", In Compiler Construction: an Advanced Course. New York--Heidelberg--Berlin Vol. 21, pp. 366-426. Springer-Verlag.
BibTeX:
@incollection{Koster74,
  author = {Cornelius H. A. Koster},
  title = {Using the CDL Compiler-Compiler},
  booktitle = {Compiler Construction: an Advanced Course},
  publisher = {Springer-Verlag},
  year = {1974},
  volume = {21},
  pages = {366--426}
}
Kruszewski, S. & Jarzabek, S. (1974), "COALA---the Object Code of the Compiler Producing System". Institute of Mathematical Machines---MERA, 1974.
BibTeX:
@techreport{Kruszewski74,
  author = {S. Kruszewski and S. Jarzabek},
  title = {COALA---the Object Code of the Compiler Producing System},
  year = {1974},
  note = {(in Polish)}
}
Kurki-Suonio, R. (1974), "An Exercise on Formal Definition of a Simple Data Retrieval System". Department of Comp. Sc., University of Tampere, Technical Report A7, August, 1974.
BibTeX:
@techreport{Kurki-Suonio74,
  author = {Reino Kurki-Suonio},
  title = {An Exercise on Formal Definition of a Simple Data Retrieval System},
  year = {1974},
  number = {A7}
}
Lecarme, O. & Bochmann, G.V. (1974), "A Compiler Writing System User's Manual". Dépt. d'informatique, University de Montréal, Technical Report 57, December, 1974.
BibTeX:
@techreport{Lecarme74,
  author = {Olivier Lecarme and Gregor V. Bochmann},
  title = {A Compiler Writing System User's Manual},
  year = {1974},
  number = {57}
}
Lecarme, O. & Bochmann, G.V. (1974), "A (truly) Usable and Portable Compiler Writing System", In Information Processing '74. Amsterdam, August, 1974. , pp. 218-221. North-Holland.
BibTeX:
@incollection{Lecarme74a,
  author = {Olivier Lecarme and Gregor V. Bochmann},
  title = {A (truly) Usable and Portable Compiler Writing System},
  booktitle = {Information Processing '74},
  publisher = {North-Holland},
  year = {1974},
  pages = {218--221},
  note = {Stockholm}
}
Lewis, P.M., Rosenkrantz, D.J. & Stearns, R.E. (1974), "Attributed Translations", Journal of Computer and System Sciences., December, 1974. Vol. 9(3), pp. 279-307.
BibTeX:
@article{Lewis74,
  author = {P. M. Lewis and D. J. Rosenkrantz and R. E. Stearns},
  title = {Attributed Translations},
  journal = {Journal of Computer and System Sciences},
  year = {1974},
  volume = {9},
  number = {3},
  pages = {279--307}
}
Lorho, B. (1974), "De la définition à la traduction des langages de programmation: méthode des attributs sémantiques". University Paul Sabatier, November, 1974.
BibTeX:
@techreport{Lorho74,
  author = {Bernard Lorho},
  title = {De la définition à la traduction des langages de programmation: méthode des attributs sémantiques},
  year = {1974}
}
Néel, D. & Amirchahy, M. (1974), "Semantic Attributes and Improvement of Generated Code", In ACM 1974 Annual Conf.. San Diego, CA, November, 1974. , pp. 1-10. ACM press.
BibTeX:
@incollection{Neel74,
  author = {Danièle Néel and Michaneh Amirchahy},
  title = {Semantic Attributes and Improvement of Generated Code},
  booktitle = {ACM 1974 Annual Conf.},
  publisher = {ACM press},
  year = {1974},
  pages = {1--10}
}
Néel, D., Amirchahy, M. & Mazaud, M. (1974), "Optimization of Generated Code by means of Attributes: Local Elimination of Common Redundant Sub-expressions", In GI 4. Jahrestagung. New York--Heidelberg--Berlin. October 1974. Volume 26, pp. 247-256. Springer-Verlag.
BibTeX:
@inproceedings{Neel74a,
  author = {Danièle Néel and Michaneh Amirchahy and Monique Mazaud},
  title = {Optimization of Generated Code by means of Attributes: Local Elimination of Common Redundant Sub-expressions},
  booktitle = {GI 4. Jahrestagung},
  publisher = {Springer-Verlag},
  year = {1974},
  volume = {26},
  pages = {247--256},
  note = {Berlin}
}
Paredaens, J. (1974), "A Relation Between Parsers and the Semantic Aspects of a Language". MBLE Research Lab., Technical Report R275, November, 1974.
BibTeX:
@techreport{Paredaens74,
  author = {J. Paredaens},
  title = {A Relation Between Parsers and the Semantic Aspects of a Language},
  year = {1974},
  number = {R275}
}
Tusera, D. (1974), "Example of Transformation of a Derivation Tree for an Expression by Semantic Attributes", In Information Processing '74. Amsterdam, August, 1974. , pp. 381-385. North-Holland.
BibTeX:
@incollection{Tusera74,
  author = {Dimitri Tusera},
  title = {Example of Transformation of a Derivation Tree for an Expression by Semantic Attributes},
  booktitle = {Information Processing '74},
  publisher = {North-Holland},
  year = {1974},
  pages = {381--385},
  note = {Stockholm}
}
Watt, D.A. (1974), "LR Parsing of Affix Grammars". Comp. Sc. Department, University of Glasgow, Technical Report 7, August, 1974.
BibTeX:
@techreport{Watt74,
  author = {David A. Watt},
  title = {LR Parsing of Affix Grammars},
  year = {1974},
  number = {7}
}
Wilhelm, R. (1974), "Code-Optimierung mittels Attributierter Transformationsgrammatiken", In GI 4. Jahrestagung. New York--Heidelberg--Berlin. October 1974. Volume 26, pp. 257-266. Springer-Verlag.
BibTeX:
@inproceedings{Wilhelm74,
  author = {Reinhard Wilhelm},
  title = {Code-Optimierung mittels Attributierter Transformationsgrammatiken},
  booktitle = {GI 4. Jahrestagung},
  publisher = {Springer-Verlag},
  year = {1974},
  volume = {26},
  pages = {257--266},
  note = {See also: Bericht 7408, Abteilung Mathematik, Tech. University München (1974).}
}
Bochmann, G.V. (1975), "Semantic Attributes for Grammars with Regular Expressions". Dépt. d'Informatique, University de Montréal, Technical Report 195, 1975.
BibTeX:
@techreport{Bochmann75,
  author = {Gregor V. Bochmann},
  title = {Semantic Attributes for Grammars with Regular Expressions},
  year = {1975},
  number = {195}
}
Bochmann, G.V. (1975), "Semantic Equivalence of Covering Attribute Grammars". Dépt. d'Informatique, University de Montréal, Technical Report 218, December, 1975.
BibTeX:
@techreport{Bochmann75a,
  author = {Gregor V. Bochmann},
  title = {Semantic Equivalence of Covering Attribute Grammars},
  year = {1975},
  number = {218}
}
Ganzinger, H. & Wilhelm, R. (1975), "Verschränkung von Compiler-Moduln", In GI 5. Jahrestagung. New York--Heidelberg--Berlin. October 1975. Volume 34, pp. 654-666. Springer-Verlag.
BibTeX:
@inproceedings{Ganzinger75,
  author = {Harald Ganzinger and Reinhard Wilhelm},
  title = {Verschränkung von Compiler-Moduln},
  booktitle = {GI 5. Jahrestagung},
  publisher = {Springer-Verlag},
  year = {1975},
  volume = {34},
  pages = {654--666},
  note = {Dortmund}
}
Jazayeri, M. (1975), "Live Variable Analysis, Attribute Grammars, and Program Optimization". Department of Comp. Sc., University of North Carolina, March, 1975.
BibTeX:
@techreport{Jazayeri75,
  author = {Mehdi Jazayeri},
  title = {Live Variable Analysis, Attribute Grammars, and Program Optimization},
  year = {1975}
}
Jazayeri, M., Ogden, W.F. & Rounds, W.C. (1975), "The Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars", Communications of the Association for Computing Machinery., December, 1975. Vol. 18(12), pp. 679-706.
Abstract: Attribute grammars are an extension of context free grammars devised by Knuth as a mechanism for including the semantics of a context-free language with the syntax of the language. The circularity problem for a grammar is to determine whether the semantics for all possible sentences (programs) in fact will be well defined. It is proved that this problem is, in general, computationally intractable. Specifically, it is shown that any deterministic algorithm which solves the problem must for infinitely many cases use an exponential amount of time. An improved version of Knuth's circularity testing algorithm is also given, which actually solves the problem within exponential time.
BibTeX:
@article{Jazayeri75a,
  author = {Mehdi Jazayeri and William F. Ogden and William C. Rounds},
  title = {The Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars},
  journal = {Communications of the Association for Computing Machinery},
  year = {1975},
  volume = {18},
  number = {12},
  pages = {679--706}
}
Jazayeri, M., Ogden, W.F. & Rounds, W.C. (1975), "On the Complexity of Circularity Tests for Attribute Grammars", In 2nd ACM Symp. on Principles of Progr. Languages. Palo Alto, CA, January, 1975. , pp. 119-129. ACM press.
BibTeX:
@incollection{Jazayeri75b,
  author = {Mehdi Jazayeri and William F. Ogden and William C. Rounds},
  title = {On the Complexity of Circularity Tests for Attribute Grammars},
  booktitle = {2nd ACM Symp. on Principles of Progr. Languages},
  publisher = {ACM press},
  year = {1975},
  pages = {119--129}
}
Jazayeri, M. & Walter, K.G. (1975), "Alternating Semantic Evaluator", In ACM 1975 Annual Conf.. Minneapolis, MN, October, 1975. , pp. 230-234. ACM press.
BibTeX:
@incollection{Jazayeri75c,
  author = {Mehdi Jazayeri and K. G. Walter},
  title = {Alternating Semantic Evaluator},
  booktitle = {ACM 1975 Annual Conf.},
  publisher = {ACM press},
  year = {1975},
  pages = {230--234}
}
Kelleher, J., McGriff, F. & Pozefsky, D. (1975), "TAG: Testing Attribute Grammars, Architectural Description". Department of Comp. Sc., University of North Carolina, May, 1975.
BibTeX:
@techreport{Kelleher75,
  author = {J. Kelleher and F. McGriff and Diane Pozefsky},
  title = {TAG: Testing Attribute Grammars, Architectural Description},
  year = {1975}
}
Krzemien, R. (1975), "L'Implantation de Système Lisp sur IRIS 80 en utilisant le Système DELTA". INRIA, July, 1975.
BibTeX:
@techreport{Krzemien75,
  author = {R. Krzemien},
  title = {L'Implantation de Système Lisp sur IRIS 80 en utilisant le Système DELTA},
  year = {1975}
}
Kurki-Suonio, R. (1975), "Towards Better Strutured Definitions of Programming Languages". Comp. Sc. Department, Stanford University, Technical Report STAN-CS-75-300, September, 1975.
BibTeX:
@techreport{Kurki-Suonio75,
  author = {Reino Kurki-Suonio},
  title = {Towards Better Strutured Definitions of Programming Languages},
  year = {1975},
  number = {STAN-CS-75-300}
}
Lecarme, O. (1975), "Practicability and Portability in a Compiler-Construction System", In Procs. of the All-Union Symp. on Methods of Implementing New Algorithmic Languages, Part 1. Novosibirsk., pp. 47-?.
BibTeX:
@inproceedings{Lecarme75,
  author = {Olivier Lecarme},
  title = {Practicability and Portability in a Compiler-Construction System},
  booktitle = {Procs. of the All-Union Symp. on Methods of Implementing New Algorithmic Languages, Part 1},
  year = {1975},
  pages = {47--?},
  note = {(in Russian)}
}
Lewi, J., De Vlaminck, K., Huens, J. & Mertens, P. (1975), "SLS/1: a Translator Writing System", In GI 5. Jahrestagung. New York--Heidelberg--Berlin. October 1975. Volume 34, pp. 627-641. Springer-Verlag.
BibTeX:
@inproceedings{Lewi75,
  author = {J. Lewi and K. De Vlaminck and J. Huens and P. Mertens},
  title = {SLS/1: a Translator Writing System},
  booktitle = {GI 5. Jahrestagung},
  publisher = {Springer-Verlag},
  year = {1975},
  volume = {34},
  pages = {627--641},
  note = {Dortmund}
}
Lorho, B. & Pair, C. (1975), "Algorithms for Checking Consistency of Attribute Grammars", In Proving and Improving Programs. Rocquencourt, July, 1975. , pp. 29-54. INRIA.
BibTeX:
@incollection{Lorho75,
  author = {Bernard Lorho and Claude Pair},
  title = {Algorithms for Checking Consistency of Attribute Grammars},
  booktitle = {Proving and Improving Programs},
  publisher = {INRIA},
  year = {1975},
  pages = {29--54},
  note = {Arc et Senans}
}
Madsen, O.L. (1975), "On the Use of Attribute Grammars in a Practical Translator Writing System". School: Comp. Sc. Department, Aarhus University., July, 1975. (report DAIMI)
BibTeX:
@mastersthesis{Madsen75,
  author = {Ole L. Madsen},
  title = {On the Use of Attribute Grammars in a Practical Translator Writing System},
  school = {Comp. Sc. Department, Aarhus University},
  year = {1975},
  number = {report DAIMI}
}
Marque-Pucheu, M. (1975), "Application de la méthode des attributs à la définition des compilateurs", In Proving and Improving Programs. Rocquencourt, July, 1975. , pp. 263-283. INRIA.
BibTeX:
@incollection{Marque-Pucheu75,
  author = {M. Marque-Pucheu},
  title = {Application de la méthode des attributs à la définition des compilateurs},
  booktitle = {Proving and Improving Programs},
  publisher = {INRIA},
  year = {1975},
  pages = {263--283},
  note = {Arc et Senans}
}
Néel, D. (1975), "Contribution à la formalisation de l'amélioration de code par attributs sémantiques". University P. et M. Curie, 1975.
BibTeX:
@techreport{Neel75,
  author = {Danièle Néel},
  title = {Contribution à la formalisation de l'amélioration de code par attributs sémantiques},
  year = {1975}
}
Néel, D. & Amirchahy, M. (1975), "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. New York, NY, March, 1975. , pp. 87-96. ACM press.
BibTeX:
@incollection{Neel75a,
  author = {Danièle Néel and Michaneh Amirchahy},
  title = {Removal of Invariant Statements from Nested Loops in a Single Effective Compiler Pass},
  booktitle = {Conf. on Programming Languages and Compilers for Parallel and Vector Machines},
  publisher = {ACM press},
  year = {1975},
  pages = {87--96},
  note = {Published as ACM SIGPLAN Notices, volume 10, number 3}
}
Noonan, R.E. (1975), "Structured Programming and Formal Specification", Institute of Electrical and Electronics Engineers. Transactions on Software Engineering., December, 1975. Vol. SE-1(4), pp. 421-425.
BibTeX:
@article{Noonan75,
  author = {Robert E. Noonan},
  title = {Structured Programming and Formal Specification},
  journal = {Institute of Electrical and Electronics Engineers. Transactions on Software Engineering},
  year = {1975},
  volume = {SE-1},
  number = {4},
  pages = {421--425}
}
Parchmann, R. (1975), "Syntaxgesteuerte Codierung zur Berechnung Arithmetischer Ausdrucke auf einer Parallelmaschine unter Verwendung Knuth'scher Attribute". Schriften zur Informatik und Angewandten Mathematik, Rheinisch-Westfälische Tech. Hochschule Aachen, Technical Report 20, 1975.
BibTeX:
@techreport{Parchmann75,
  author = {R. Parchmann},
  title = {Syntaxgesteuerte Codierung zur Berechnung Arithmetischer Ausdrucke auf einer Parallelmaschine unter Verwendung Knuth'scher Attribute},
  year = {1975},
  number = {20}
}
Ripken, K. (1975), "Generating an Intermediate-Code Generator in a Compiler Writing System", In Int. Computing Symp.. Amsterdam--New York, New York, June, 1975. , pp. 121-127. North Holland/American Elsevier.
BibTeX:
@incollection{Ripken75,
  author = {Knut Ripken},
  title = {Generating an Intermediate-Code Generator in a Compiler Writing System},
  booktitle = {Int. Computing Symp.},
  publisher = {North Holland/American Elsevier},
  year = {1975},
  pages = {121--127},
  note = {Antibes}
}
Warren, S.K. (1975), "The Efficient Evaluation of Attribute Grammars". School: Rice University. Houston, TX, April, 1975.
BibTeX:
@mastersthesis{Warren75,
  author = {S. K. Warren},
  title = {The Efficient Evaluation of Attribute Grammars},
  school = {Rice University},
  year = {1975}
}
Wilhelm, R. (1975), "Describing Code Optimization Algorithms by Attributed Transformational Grammars", In Séminaires Structure et Programmation des Calculateurs 1975. Rocquencourt , pp. 153-164. INRIA.
BibTeX:
@incollection{Wilhelm75,
  author = {Reinhard Wilhelm},
  title = {Describing Code Optimization Algorithms by Attributed Transformational Grammars},
  booktitle = {Séminaires Structure et Programmation des Calculateurs 1975},
  publisher = {INRIA},
  year = {1975},
  pages = {153--164}
}
Yli-Olli, P. (1975), "On Compiler Writing Systems: Applications and Software Problems". Department of Comp. Sc., University of Helsinki, Technical Report C-1975-32, 1975.
BibTeX:
@techreport{Yli-Olli75,
  author = {P. Yli-Olli},
  title = {On Compiler Writing Systems: Applications and Software Problems},
  year = {1975},
  number = {C-1975-32},
  note = {(in Finnish)}
}
Agafonov, V.N. (1976), "On Attribute Grammars", In Mathematical Foundations of Computer Science. New York--Heidelberg--Berlin, September, 1976. Vol. 45, pp. 169-172. Springer-Verlag.
BibTeX:
@incollection{Agafonov76,
  author = {V. N. Agafonov},
  title = {On Attribute Grammars},
  booktitle = {Mathematical Foundations of Computer Science},
  publisher = {Springer-Verlag},
  year = {1976},
  volume = {45},
  pages = {169--172},
  note = {Gdansk}
}
Amirchahy, M. & Néel, D. (1976), "L'optimisation de code pourra-t-elle s'affirmer grâce aux attributs?". IRIA-Laboria, Technical Report 162, March, 1976.
BibTeX:
@techreport{Amirchahy76,
  author = {Michaneh Amirchahy and Danièle Néel},
  title = {L'optimisation de code pourra-t-elle s'affirmer grâce aux attributs?},
  year = {1976},
  number = {162}
}
Bochmann, G.V. (1976), "Semantic Evaluation from Left to Right", Communications of the Association for Computing Machinery., February, 1976. Vol. 19(2), pp. 55-62.
BibTeX:
@article{Bochmann76,
  author = {Gregor V. Bochmann},
  title = {Semantic Evaluation from Left to Right},
  journal = {Communications of the Association for Computing Machinery},
  year = {1976},
  volume = {19},
  number = {2},
  pages = {55--62}
}
Chirica, L.M. (1976), "Contributions to Compiler Correctness". School: Comp. Sc. Department, University of California. Los Angeles, CA, October, 1976. (report UCLA-ENG-7697)
BibTeX:
@phdthesis{Chirica76,
  author = {Laurian M. Chirica},
  title = {Contributions to Compiler Correctness},
  school = {Comp. Sc. Department, University of California},
  year = {1976},
  number = {report UCLA-ENG-7697}
}
Chirica, L.M. & Martin, D.F. (1976), "An Algebraic Formulation of Knuthian Semantics", In 17th IEEE Conf. on Foundations of Comput. Sc.. Houston, TX, October, 1976. , pp. 127-136.
BibTeX:
@incollection{Chirica76a,
  author = {Laurian M. Chirica and David F. Martin},
  title = {An Algebraic Formulation of Knuthian Semantics},
  booktitle = {17th IEEE Conf. on Foundations of Comput. Sc.},
  year = {1976},
  pages = {127--136}
}
Dehottay, J.P., Feuerhahn, H., Koster, C.H.A. & Stahl, H.M. (1976), "Syntaktische Beschreibung von CDL2". Forschungsgruppe PC 2, FB 20, Tech. University Berlin, September, 1976.
BibTeX:
@techreport{Dehottay76,
  author = {J. P. Dehottay and H. Feuerhahn and Cornelius H. A. Koster and H. M. Stahl},
  title = {Syntaktische Beschreibung von CDL2},
  year = {1976}
}
Della Vigna, P. & Ghezzi, C. (1976), "Data Structures and Graph Grammars", In ECI Conf. 1976. New York--Heidelberg--Berlin, August, 1976. Vol. 44, pp. 130-145. Springer-Verlag.
BibTeX:
@incollection{DellaVigna76,
  author = {P. Della Vigna and C. Ghezzi},
  title = {Data Structures and Graph Grammars},
  booktitle = {ECI Conf. 1976},
  publisher = {Springer-Verlag},
  year = {1976},
  volume = {44},
  pages = {130--145},
  note = {Amsterdam}
}
Ganzinger, H. (1976), "MUG1-Manual". Institut für Informatik, Tech. University München, Technical Report 7608, July, 1976.
BibTeX:
@techreport{Ganzinger76,
  author = {Harald Ganzinger},
  title = {MUG1-Manual},
  year = {1976},
  number = {7608}
}
Ganzinger, H., Ripken, K. & Wilhelm, R. (1976), "MUG1---an Incremental Compiler-Compiler", In ACM 1976 Annual Conf.. Houston, TX, October, 1976. , pp. 415-418.
BibTeX:
@incollection{Ganzinger76a,
  author = {Harald Ganzinger and Knut Ripken and Reinhard Wilhelm},
  title = {MUG1---an Incremental Compiler-Compiler},
  booktitle = {ACM 1976 Annual Conf.},
  year = {1976},
  pages = {415--418}
}
Hesse, W. (1976), "Vollständige Formale Beschreibung von Programmiersprachen mit Zweischichtigen Grammatiken". Abteilung Mathematik, Tech. University München, Technical Report 7623, July, 1976.
BibTeX:
@techreport{Hesse76,
  author = {W. Hesse},
  title = {Vollständige Formale Beschreibung von Programmiersprachen mit Zweischichtigen Grammatiken},
  year = {1976},
  number = {7623}
}
Jazayeri, M. (1976), "Formal Specification and Automatic Programming", In 2nd Int. Conf. on Software Engineering. San Francisco, CA, October, 1976. , pp. 293-296.
BibTeX:
@incollection{Jazayeri76,
  author = {Mehdi Jazayeri},
  title = {Formal Specification and Automatic Programming},
  booktitle = {2nd Int. Conf. on Software Engineering},
  year = {1976},
  pages = {293--296}
}
Kastens, U. (1976), "Ein Übersetzer-erzeugendes System auf der Basis Attributierter Grammatiken". Fakultät für Informatik, University Karlsruhe, Technical Report 10, September, 1976.
BibTeX:
@techreport{Kastens76,
  author = {Uwe Kastens},
  title = {Ein Übersetzer-erzeugendes System auf der Basis Attributierter Grammatiken},
  year = {1976},
  number = {10}
}
Kastens, U. (1976), "Systematische Analyse Semantischer Abhängigkeiten", In GI 4. Fachtagung ``Programmiersprachen''. New York--Heidelberg--Berlin. Volume 1, pp. 19-32. Springer-Verlag.
BibTeX:
@inproceedings{Kastens76a,
  author = {Uwe Kastens},
  title = {Systematische Analyse Semantischer Abhängigkeiten},
  booktitle = {GI 4. Fachtagung ``Programmiersprachen''},
  publisher = {Springer-Verlag},
  year = {1976},
  volume = {1},
  pages = {19--32}
}
Kennedy, K. & Warren, S.K. (1976), "Automatic Generation of Efficient Evaluators for Attribute Grammars", In 3rd ACM Symp. on Principles of Progr. Languages. Atlanta, Ge, January, 1976. , pp. 32-49. ACM press.
BibTeX:
@incollection{Kennedy76,
  author = {Ken Kennedy and S. K. Warren},
  title = {Automatic Generation of Efficient Evaluators for Attribute Grammars},
  booktitle = {3rd ACM Symp. on Principles of Progr. Languages},
  publisher = {ACM press},
  year = {1976},
  pages = {32--49}
}
Lewi, J., De Vlaminck, K. & Huens, J. (1976), "Project LILA, FIGDRAW and PICO-ALGOL, an experience with LILA in a Course on Compiler Construction". Applied Mathematics and Programming Division, Katholieke Universiteit Leuven, Technical Report CW4, January, 1976.
BibTeX:
@techreport{Lewi76,
  author = {J. Lewi and K. De Vlaminck and J. Huens},
  title = {Project LILA, FIGDRAW and PICO-ALGOL, an experience with LILA in a Course on Compiler Construction},
  year = {1976},
  number = {CW4}
}
Lewis, P.M., Rosenkrantz, D.J. & Stearns, R.E. (1976), "Compiler Design Theory" Reading, MA Addison Wesley.
BibTeX:
@book{Lewis76,
  author = {P. M. Lewis and D. J. Rosenkrantz and R. E. Stearns},
  title = {Compiler Design Theory},
  publisher = {Addison Wesley},
  year = {1976}
}
Madsen, O.L., Kristensen, B.B. & Staunstrup, J. (1976), "Use of Design Criteria for Intermediate Languages". Comp. Sc. Department, Aarhus University, Technical Report PB-59, August, 1976.
BibTeX:
@techreport{Madsen76,
  author = {Ole L. Madsen and B. B. Kristensen and J. Staunstrup},
  title = {Use of Design Criteria for Intermediate Languages},
  year = {1976},
  number = {PB-59}
}
Marcotty, M., Ledgard, H.F. & Bochmann, G.V. (1976), "A Sampler of Formal Definitions", Computing Surveys. ACM. Association for Computing Machinery., June, 1976. Vol. 8(2), pp. 191-276.
BibTeX:
@article{Marcotty76,
  author = {M. Marcotty and H. F. Ledgard and Gregor V. Bochmann},
  title = {A Sampler of Formal Definitions},
  journal = {Computing Surveys. ACM. Association for Computing Machinery},
  year = {1976},
  volume = {8},
  number = {2},
  pages = {191--276}
}
Nordström, M. (1976), "A Method for Defining Formal Semantics of Programming Languages applied to SIMULA", PhD thesis June, 1976. Department of Comp. Sc., University of Uppsala.
BibTeX:
@book{Nordstrom76,
  author = {M. Nordström},
  title = {A Method for Defining Formal Semantics of Programming Languages applied to SIMULA},
  publisher = {Department of Comp. Sc., University of Uppsala},
  year = {1976}
}
Pair, C., Amirchahy, M. & Néel, D. (1976), "Preuves de descriptions de traitements de textes par attributs". IRIA-Laboria, Technical Report 163, March, 1976.
BibTeX:
@techreport{Pair76,
  author = {Claude Pair and Michaneh Amirchahy and Danièle Néel},
  title = {Preuves de descriptions de traitements de textes par attributs},
  year = {1976},
  number = {163}
}
Plath, W.J. (1976), "REQUEST: a Natural Language Question-Answering-System", International Business Machines Corporation. Journal of Research and Development., July, 1976. Vol. 20(4), pp. 326-335.
BibTeX:
@article{Plath76,
  author = {Warren J. Plath},
  title = {REQUEST: a Natural Language Question-Answering-System},
  journal = {International Business Machines Corporation. Journal of Research and Development},
  year = {1976},
  volume = {20},
  number = {4},
  pages = {326--335},
  note = {See also: report RC 5604, IBM T.J. Watson Research Center, Yorktown Heights, NY (August 1975).}
}
Räihä, K.-J. (1976), "Design of the Semantic Phase of the Compiler Writing System HLP". Department of Comp. Sc., University of Helsinki, Technical Report C-1976-24, 1976.
BibTeX:
@techreport{Raiha76,
  author = {Kari-Jouko Räihä},
  title = {Design of the Semantic Phase of the Compiler Writing System HLP},
  year = {1976},
  number = {C-1976-24},
  note = {(in Finnish)}
}
Räihä, K.-J. (1976), "On Compiler Writing Systems", In NordDATA 76 Conf.. , pp. 668-679. Finnish Data Processing Association.
BibTeX:
@incollection{Raiha76a,
  author = {Kari-Jouko Räihä},
  title = {On Compiler Writing Systems},
  booktitle = {NordDATA 76 Conf.},
  publisher = {Finnish Data Processing Association},
  year = {1976},
  pages = {668--679}
}
Räihä, K.-J. & Saarinen, M. (1976), "Developments in Compiler Writing Systems", In GI 6. Jahrestagung. New York--Heidelberg--Berlin. Volume 5, pp. 164-178. Springer-Verlag.
BibTeX:
@inproceedings{Raiha76b,
  author = {Kari-Jouko Räihä and Mikko Saarinen},
  title = {Developments in Compiler Writing Systems},
  booktitle = {GI 6. Jahrestagung},
  publisher = {Springer-Verlag},
  year = {1976},
  volume = {5},
  pages = {164--178}
}
Schulz, W.A. (1976), "Semantic Analysis and Target Language Synthesis in a Translator". School: Department of Comp. Sc., University of Colorado. Boulder, Co
BibTeX:
@phdthesis{Schulz76,
  author = {W. A. Schulz},
  title = {Semantic Analysis and Target Language Synthesis in a Translator},
  school = {Department of Comp. Sc., University of Colorado},
  year = {1976}
}
Thomas, J.W. (1976), "Module Interconnection in Programming Systems supporting Abstraction". School: Computer Science Program, Brown University. Providence, RI, April, 1976. (Technical Report CS-16)
BibTeX:
@phdthesis{Thomas76,
  author = {J. W. Thomas},
  title = {Module Interconnection in Programming Systems supporting Abstraction},
  school = {Computer Science Program, Brown University},
  year = {1976},
  number = {Technical Report CS-16}
}
Warren, S.K. (1976), "The Coroutine Model of Attribute Grammar Evaluation". School: Rice University. Houston, TX, April, 1976.
BibTeX:
@phdthesis{Warren76,
  author = {S. K. Warren},
  title = {The Coroutine Model of Attribute Grammar Evaluation},
  school = {Rice University},
  year = {1976}
}
Weber, J. (1976), "Programmtransformationen mit Attributierten Transformationsgrammatiken". Institut für Informatik, Tech. University München, Technical Report 7604, 1976.
BibTeX:
@techreport{Weber76,
  author = {J. Weber},
  title = {Programmtransformationen mit Attributierten Transformationsgrammatiken},
  year = {1976},
  number = {7604}
}
Wilhelm, R., Ripken, K., Ciesinger, H., Lahner, W. & Nollmann, R.D. (1976), "Design Evaluation of the Compiler Generating System MUG1", In 2nd Int. Conf. on Software Engineering. San Francisco, CA, October, 1976. , pp. 571-576.
BibTeX:
@incollection{Wilhelm76,
  author = {Reinhard Wilhelm and Knut Ripken and H. Ciesinger and W. Lahner and R. D. Nollmann},
  title = {Design Evaluation of the Compiler Generating System MUG1},
  booktitle = {2nd Int. Conf. on Software Engineering},
  year = {1976},
  pages = {571--576}
}
Babich, W.A. (1977), "High Level Data Flow Analysis using a Parse Tree Representation of the Program". Department of Comp. Sc., University of North Carolina, Technical Report 77-006, May, 1977.
BibTeX:
@techreport{Babich77,
  author = {W. A. Babich},
  title = {High Level Data Flow Analysis using a Parse Tree Representation of the Program},
  year = {1977},
  number = {77-006}
}
Björner, D. (1977), "Programming Languages: Formal Development of Programming Languages and Compilers", In Int. Computing Symp.. Amsterdam, April, 1977. , pp. 1-21. North-Holland.
BibTeX:
@incollection{Bjorner77,
  author = {Dines Björner},
  title = {Programming Languages: Formal Development of Programming Languages and Compilers},
  booktitle = {Int. Computing Symp.},
  publisher = {North-Holland},
  year = {1977},
  pages = {1--21},
  note = {See also: report ID673, Department of Comp. Sc., Tech. University of Denmark, Lyngby (1977).}
}
Borowiec, J. (1977), "Pragmatics in a Compiler Production System", In Methods of Algorithmic Language Implementation. New York--Heidelberg--Berlin Vol. 47, pp. 314-340. Springer-Verlag.
BibTeX:
@incollection{Borowiec77,
  author = {Jan Borowiec},
  title = {Pragmatics in a Compiler Production System},
  booktitle = {Methods of Algorithmic Language Implementation},
  publisher = {Springer-Verlag},
  year = {1977},
  volume = {47},
  pages = {314--340},
  note = {Also published in Russian in: Procs. of the All-Union Symp. on Methods of Implementing New Algorithmic Languages, Part 2, Novossibirsk, pp. 210-? (1975).}
}
Deransart, P. (1977), "Définition de Lisp à l'aide d'un compilateur". IRIA-Laboria, Technical Report 224, March, 1977.
BibTeX:
@techreport{Deransart77,
  author = {Pierre Deransart},
  title = {Définition de Lisp à l'aide d'un compilateur},
  year = {1977},
  number = {224}
}
Deransart, P. (1977), "Description par attributs sémantiques de Lisp pur et preuve de l'équivalence de la définition traductive et de l'évaluateur". IRIA-Laboria, Technical Report 220, March, 1977.
BibTeX:
@techreport{Deransart77a,
  author = {Pierre Deransart},
  title = {Description par attributs sémantiques de Lisp pur et preuve de l'équivalence de la définition traductive et de l'évaluateur},
  year = {1977},
  number = {220}
}
Deransart, P. (1977), "Definition and Implementation of a Lisp System using Semantic Attributes", In 5th Annual III Conf.. Guidel, May, 1977. , pp. 25-39.
BibTeX:
@incollection{Deransart77b,
  author = {Pierre Deransart},
  title = {Definition and Implementation of a Lisp System using Semantic Attributes},
  booktitle = {5th Annual III Conf.},
  year = {1977},
  pages = {25--39}
}
Duske, J., Parchmann, R., Sedello, M. & Specht, J. (1977), "IO-Macrolanguages and Attributed Translations", Information and Control., October, 1977. Vol. 35(2), pp. 87-105.
BibTeX:
@article{Duske77,
  author = {J. Duske and R. Parchmann and M. Sedello and J. Specht},
  title = {IO-Macrolanguages and Attributed Translations},
  journal = {Information and Control},
  year = {1977},
  volume = {35},
  number = {2},
  pages = {87--105}
}
Farrow, R. (1977), "Attributed Grammar Models for Data Flow Analysis". School: Rice University. Houston, TX, May, 1977.
BibTeX:
@phdthesis{Farrow77,
  author = {Rodney Farrow},
  title = {Attributed Grammar Models for Data Flow Analysis},
  school = {Rice University},
  year = {1977}
}
Franzen, H., Hoffmann, B., Pohl, B. & Schmiedecke, I.-R. (1977), "The EAGLE Parser Generator: an Experimental Step towards a Practical Compiler-Compiler using Two-level Grammars", In 5th Annual III Conf.. Guidel, May, 1977. , pp. 397-420.
BibTeX:
@incollection{Franzen77,
  author = {H. Franzen and Berthold Hoffmann and B. Pohl and I.-R. Schmiedecke},
  title = {The EAGLE Parser Generator: an Experimental Step towards a Practical Compiler-Compiler using Two-level Grammars},
  booktitle = {5th Annual III Conf.},
  year = {1977},
  pages = {397--420}
}
Ganzinger, H. (1977), "Deriving Proof Rules for Programming Language Constructs from Static and Dynamic Attribute Structures". , August, 1977.
BibTeX:
@techreport{Ganzinger77,
  author = {Harald Ganzinger},
  title = {Deriving Proof Rules for Programming Language Constructs from Static and Dynamic Attribute Structures},
  year = {1977}
}
Ganzinger, H., Ripken, K. & Wilhelm, R. (1977), "Automatic Generation of Optimizing Multipass Compilers", In Information Processing '77. Amsterdam, August, 1977. , pp. 535-540. North-Holland.
BibTeX:
@incollection{Ganzinger77a,
  author = {Harald Ganzinger and Knut Ripken and Reinhard Wilhelm},
  title = {Automatic Generation of Optimizing Multipass Compilers},
  booktitle = {Information Processing '77},
  publisher = {North-Holland},
  year = {1977},
  pages = {535--540},
  note = {Toronto}
}
Giegerich, R. & Wilhelm, R. (1977), "Implementierbarkeit Attributierter Grammatiken", In GI 7. Jahrestagung. New York--Heidelberg--Berlin. Volume 10, pp. 17-36. Springer-Verlag.
BibTeX:
@inproceedings{Giegerich77,
  author = {Robert Giegerich and Reinhard Wilhelm},
  title = {Implementierbarkeit Attributierter Grammatiken},
  booktitle = {GI 7. Jahrestagung},
  publisher = {Springer-Verlag},
  year = {1977},
  volume = {10},
  pages = {17--36},
  note = {Nürnberg}
}
Jazayeri, M. & Pozefsky, D. (1977), "Efficient Evaluation of Multi-pass Attribute Grammars without a Parse Tree", In 1977 Conf. on Information Sciences and Systems. John Hopkins University, Baltimore, MD, April, 1977. , pp. 184-189.
BibTeX:
@incollection{Jazayeri77,
  author = {Mehdi Jazayeri and Diane Pozefsky},
  title = {Efficient Evaluation of Multi-pass Attribute Grammars without a Parse Tree},
  booktitle = {1977 Conf. on Information Sciences and Systems},
  year = {1977},
  pages = {184--189},
  note = {Extended version: report TR 77-001, Department of Comp. Sc., University of North Carolina, Chapel Hill, NC (February 1977, revised May 1979).}
}
Jochum, G. (1977), "Generierung Optimierter Semantischer Analyse für Ein- und Mehrpass-Übersetzer". School: Institut für Informatik, Tech. University München., November, 1977.
BibTeX:
@phdthesis{Jochum77,
  author = {G. Jochum},
  title = {Generierung Optimierter Semantischer Analyse für Ein- und Mehrpass-Übersetzer},
  school = {Institut für Informatik, Tech. University München},
  year = {1977}
}
Karttunen, M. (1977), "On Circularity Tests for Semantic Attributes". Department of Comp. Sc., University of Helsinki, Technical Report C-1977-87, 1977.
BibTeX:
@techreport{Karttunen77,
  author = {M. Karttunen},
  title = {On Circularity Tests for Semantic Attributes},
  year = {1977},
  number = {C-1977-87},
  note = {(in Finnish)}
}
Koster, C.H.A. (1977), "CDL A Compiler Implementation Language", In Methods of Algorithmic Language Implementation. New York--Heidelberg--Berlin Vol. 47, pp. 341-350. Springer-Verlag.
BibTeX:
@incollection{Koster77,
  author = {Cornelius H. A. Koster},
  title = {CDL A Compiler Implementation Language},
  booktitle = {Methods of Algorithmic Language Implementation},
  publisher = {Springer-Verlag},
  year = {1977},
  volume = {47},
  pages = {341--350}
}
Lecarme, O. (1977), "Usability and Portability of a Compiler Writing System", In Methods of Algorithmic Language Implementation. New York--Heidelberg--Berlin Vol. 47, pp. 41-62. Springer-Verlag.
BibTeX:
@incollection{Lecarme77,
  author = {Olivier Lecarme},
  title = {Usability and Portability of a Compiler Writing System},
  booktitle = {Methods of Algorithmic Language Implementation},
  publisher = {Springer-Verlag},
  year = {1977},
  volume = {47},
  pages = {41--62}
}
Lehmann, N.J. (1977), "Problem-oriented Languages and DEPOT Implementing System", In Methods of Algorithmic Language Implementation. New York--Heidelberg--Berlin Vol. 47, pp. 1-20. Springer-Verlag.
BibTeX:
@incollection{Lehmann77,
  author = {N. J. Lehmann},
  title = {Problem-oriented Languages and DEPOT Implementing System},
  booktitle = {Methods of Algorithmic Language Implementation},
  publisher = {Springer-Verlag},
  year = {1977},
  volume = {47},
  pages = {1--20}
}
Lewi, J., De Vlaminck, K., Huens, J. & Huybrechts, M. (1977), "Project LILA User's Manual". Applied Mathematics and Programming Division, Katholieke Universiteit Leuven, Technical Report CW7, 1977.
BibTeX:
@techreport{Lewi77,
  author = {J. Lewi and K. De Vlaminck and J. Huens and M. Huybrechts},
  title = {Project LILA User's Manual},
  year = {1977},
  number = {CW7}
}
Lorho, B. (1977), "Semantic Attributes Processing in the System DELTA", In Methods of Algorithmic Language Implementation. New York--Heidelberg--Berlin Vol. 47, pp. 21-40. Springer-Verlag.
BibTeX:
@incollection{Lorho77,
  author = {Bernard Lorho},
  title = {Semantic Attributes Processing in the System DELTA},
  booktitle = {Methods of Algorithmic Language Implementation},
  publisher = {Springer-Verlag},
  year = {1977},
  volume = {47},
  pages = {21--40}
}
Merkle, R.C. (1977), "Evaluators for Attribute Grammars". Comp. Sc. Department, University of California, March, 1977.
BibTeX:
@techreport{Merkle77,
  author = {R. C. Merkle},
  title = {Evaluators for Attribute Grammars},
  year = {1977}
}
Milton, D.R. (1977), "Syntactic Specification and Analysis with Attributed Grammars". School: Comp. Sc. Department, University of Wisconsin-Madison., August, 1977. (report TR 304)
BibTeX:
@phdthesis{Milton77,
  author = {D. R. Milton},
  title = {Syntactic Specification and Analysis with Attributed Grammars},
  school = {Comp. Sc. Department, University of Wisconsin-Madison},
  year = {1977},
  number = {report TR 304}
}
Paillard, J.P. & Simonet, M. (1977), "Attribute-like W-Grammars. Implementation and Design of Algorithmic Languages", In 5th Annual III Conf.. Guidel, May, 1977. , pp. 13-24.
BibTeX:
@incollection{Paillard77,
  author = {J. P. Paillard and M. Simonet},
  title = {Attribute-like W-Grammars. Implementation and Design of Algorithmic Languages},
  booktitle = {5th Annual III Conf.},
  year = {1977},
  pages = {13--24}
}
Penner, V. (1977), "Formalisierung der Semantik von Programmiersprachen und Anwendungen". Schriften zur Informatik und Angewandten Mathematik, Rheinisch-Westfälische Tech. Hochschule Aachen, Technical Report 33, June, 1977.
BibTeX:
@techreport{Penner77,
  author = {V. Penner},
  title = {Formalisierung der Semantik von Programmiersprachen und Anwendungen},
  year = {1977},
  number = {33}
}
Petrick, S.R. (1977), "Semantic Interpretation in the REQUEST System", In Computational and Mathematical Linguistics~II. Firenze , pp. 585-610. Leo S. Olschki Editore.
BibTeX:
@incollection{Petrick77,
  author = {S. R. Petrick},
  title = {Semantic Interpretation in the REQUEST System},
  booktitle = {Computational and Mathematical Linguistics~II},
  publisher = {Leo S. Olschki Editore},
  year = {1977},
  pages = {585--610}
}
Räihä, K.-J. (1977), "On Attribute Grammars and their Use in a Compiler Writing System". Department of Comp. Sc., University of Helsinki, Technical Report A-1977-4, August, 1977.
BibTeX:
@techreport{Raiha77,
  author = {Kari-Jouko Räihä},
  title = {On Attribute Grammars and their Use in a Compiler Writing System},
  year = {1977},
  number = {A-1977-4}
}
Räihä, K.-J. & Saarinen, M. (1977), "An Optimization of the Alternating Semantic Evaluator", Information Processing Letters., June, 1977. Vol. 6(3), pp. 97-100.
BibTeX:
@article{Raiha77a,
  author = {Kari-Jouko Räihä and Mikko Saarinen},
  title = {An Optimization of the Alternating Semantic Evaluator},
  journal = {Information Processing Letters},
  year = {1977},
  volume = {6},
  number = {3},
  pages = {97--100}
}
Ripken, K. (1977), "Formale Beschreibung von Maschinen, Implementierungen und Optimierender Maschinencodeerzeugung aus Attributierten Programmgraphen". Institut für Informatik, Tech. University München, 1977.
BibTeX:
@techreport{Ripken77,
  author = {Knut Ripken},
  title = {Formale Beschreibung von Maschinen, Implementierungen und Optimierender Maschinencodeerzeugung aus Attributierten Programmgraphen},
  year = {1977}
}
Rowland, B.R. (1977), "Combining Parsing and Evaluation for Attribute Grammars". School: Comp. Sc. Department, University of Wisconsin-Madison., November, 1977. (report TR 308)
BibTeX:
@phdthesis{Rowland77,
  author = {Bruce R. Rowland},
  title = {Combining Parsing and Evaluation for Attribute Grammars},
  school = {Comp. Sc. Department, University of Wisconsin-Madison},
  year = {1977},
  number = {report TR 308}
}
Schwind, C.B. (1977), "Ein Formalismus zur Beschreibung der Syntax und Bedeutung von Frage-Antwort-Systemen". Institut für Informatik, Tech. University München, Technical Report TUM-INFO-7710, May, 1977.
BibTeX:
@techreport{Schwind77,
  author = {C. B. Schwind},
  title = {Ein Formalismus zur Beschreibung der Syntax und Bedeutung von Frage-Antwort-Systemen},
  year = {1977},
  number = {TUM-INFO-7710}
}
Simonet, M. (1977), "An Attribute Description of a Subset of Algol 68", In Strathclyde Algol 68 Conf.. Glasgow, June, 1977. , pp. 129-137. ACM press.
BibTeX:
@incollection{Simonet77,
  author = {M. Simonet},
  title = {An Attribute Description of a Subset of Algol 68},
  booktitle = {Strathclyde Algol 68 Conf.},
  publisher = {ACM press},
  year = {1977},
  pages = {129--137},
  note = {Published as ACM SIGPLAN Notices, volume 12, number 6}
}
Watt, D.A. (1977), "The Parsing Problem for Affix-Grammars", Acta Informatica. Vol. 8(1), pp. 1-20.
BibTeX:
@article{Watt77,
  author = {David A. Watt},
  title = {The Parsing Problem for Affix-Grammars},
  journal = {Acta Informatica},
  year = {1977},
  volume = {8},
  number = {1},
  pages = {1--20}
}
Wilhelm, R. (1977), "Baumtransformatoren. Ein Vergleich mit Baumtransduktoren und Aspekte der Implementierung". Institut für Informatik, Tech. University München, Technical Report TUM-INFO-7713, June, 1977.
BibTeX:
@techreport{Wilhelm77,
  author = {Reinhard Wilhelm},
  title = {Baumtransformatoren. Ein Vergleich mit Baumtransduktoren und Aspekte der Implementierung},
  year = {1977},
  number = {TUM-INFO-7713}
}
Babich, W.A. & Jazayeri, M. (1978), "The Method of Attributes for Data Flow Analysis", Acta Informatica., October, 1978. Vol. 10(3), pp. 245-272.
BibTeX:
@article{Babich78,
  author = {W. A. Babich and Mehdi Jazayeri},
  title = {The Method of Attributes for Data Flow Analysis},
  journal = {Acta Informatica},
  year = {1978},
  volume = {10},
  number = {3},
  pages = {245--272},
  note = {part 1: Exhaustive Analysis, part 2: Demand Analysis}
}
Bochmann, G.V. & Ward, P. (1978), "Compiler Writing System for Attribute Grammars", The Computer Journal., May, 1978. Vol. 21(2), pp. 144-148.
BibTeX:
@article{Bochmann78,
  author = {Gregor V. Bochmann and P. Ward},
  title = {Compiler Writing System for Attribute Grammars},
  journal = {The Computer Journal},
  year = {1978},
  volume = {21},
  number = {2},
  pages = {144--148},
  note = {See also: publication 199, Dépt. d'Informatique, University de Montréal (July 1975).}
}
Borowiec, J. (1978), "Metalanguages of the Compiler Production System COPS", In GI Fachgespräch ``Compiler-Compiler''. Berlin , pp. 122-159. Fachbereich Informatik, Tech. Hochschule Darmstadt.
BibTeX:
@incollection{Borowiec78,
  author = {Jan Borowiec},
  title = {Metalanguages of the Compiler Production System COPS},
  booktitle = {GI Fachgespräch ``Compiler-Compiler''},
  publisher = {Fachbereich Informatik, Tech. Hochschule Darmstadt},
  year = {1978},
  pages = {122--159}
}
Dembinski, P. & Maluszynski, J. (1978), "Attribute Grammars and Two-level Grammars: a Unifying Approach", In Mathematical Foundations of Computer Science. New York--Heidelberg--Berlin, September, 1978. Vol. 64, pp. 143-154. Springer-Verlag.
BibTeX:
@incollection{Dembinski78,
  author = {P. Dembinski and Jan Maluszynski},
  title = {Attribute Grammars and Two-level Grammars: a Unifying Approach},
  booktitle = {Mathematical Foundations of Computer Science},
  publisher = {Springer-Verlag},
  year = {1978},
  volume = {64},
  pages = {143--154},
  note = {Zakopane}
}
Deransart, P. (1978), "Preuve et génération d'attributs sémantiques", In Coll. AFCET ``Théorie et Techniques de l'Informatique'', Vol. 1. Gif-sur-Yvette, November, 1978. , pp. 412-422.
BibTeX:
@incollection{Deransart78,
  author = {Pierre Deransart},
  title = {Preuve et génération d'attributs sémantiques},
  booktitle = {Coll. AFCET ``Théorie et Techniques de l'Informatique'', Vol. 1},
  year = {1978},
  pages = {412--422},
  note = {See also: rapport de recherche 302, IRIA-Laboria, Rocquencourt (May 1978).}
}
Deransart, P. (1978), "Proof and Synthesis of Semantic Attributes in Compiler Definition". IRIA-Laboria, Technical Report 333, December, 1978.
BibTeX:
@techreport{Deransart78a,
  author = {Pierre Deransart},
  title = {Proof and Synthesis of Semantic Attributes in Compiler Definition},
  year = {1978},
  number = {333}
}
Deransart, P. (1978), "Technique de preuve par attributs appliquée à un compilateur Lisp". IRIA-Laboria, Technical Report 271, January, 1978.
BibTeX:
@techreport{Deransart78b,
  author = {Pierre Deransart},
  title = {Technique de preuve par attributs appliquée à un compilateur Lisp},
  year = {1978},
  number = {271}
}
Döbeling, K. (1978), "Festlegung Zweier Sprachklassen mit Hilfe Attributierter Grammatiken". School: Tech. University Hannover.
BibTeX:
@phdthesis{Dobeling78,
  author = {K. Döbeling},
  title = {Festlegung Zweier Sprachklassen mit Hilfe Attributierter Grammatiken},
  school = {Tech. University Hannover},
  year = {1978}
}
Franzen, H., Hoffmann, B. & Schmiedecke, I.-R. (1978), "Using Two-level Language Descriptions for Compiler Generation", In GI Fachgespräch ``Compiler-Compiler''. Berlin , pp. 72-95. Fachbereich Informatik and Tech. Hochschule Darmstadt.
BibTeX:
@incollection{Franzen78,
  author = {H. Franzen and Berthold Hoffmann and I.-R. Schmiedecke},
  title = {Using Two-level Language Descriptions for Compiler Generation},
  booktitle = {GI Fachgespräch ``Compiler-Compiler''},
  publisher = {Fachbereich Informatik and Tech. Hochschule Darmstadt},
  year = {1978},
  pages = {72--95}
}
Ganzinger, H. (1978), "Optimierende Erzeugung von Übersetzerteilen aus Implementierungsorientierten Sprachbeschreibungen". Institut für Informatik, Tech. University München, Technical Report TUM-INFO-7809, May, 1978.
BibTeX:
@techreport{Ganzinger78,
  author = {Harald Ganzinger},
  title = {Optimierende Erzeugung von Übersetzerteilen aus Implementierungsorientierten Sprachbeschreibungen},
  year = {1978},
  number = {TUM-INFO-7809}
}
Ganzinger, H. (1978), "Strukturelle Zusammenhänge zwischen Funktionalen Sprachbeschreibungen und Übersetzerbeschreibungen", In GI Fachgespräch ``Compiler-Compiler''. Berlin , pp. 96-119. Fachbereich Informatik, Tech. Hochschule Darmstadt.
BibTeX:
@incollection{Ganzinger78a,
  author = {Harald Ganzinger},
  title = {Strukturelle Zusammenhänge zwischen Funktionalen Sprachbeschreibungen und Übersetzerbeschreibungen},
  booktitle = {GI Fachgespräch ``Compiler-Compiler''},
  publisher = {Fachbereich Informatik, Tech. Hochschule Darmstadt},
  year = {1978},
  pages = {96--119}
}
Giegerich, R. & Wilhelm, R. (1978), "Counter-one-pass Features in One-pass Compilation: a Formalization using Attribute Grammars", Information Processing Letters., October, 1978. Vol. 7(6), pp. 279-284.
BibTeX:
@article{Giegerich78,
  author = {Robert Giegerich and Reinhard Wilhelm},
  title = {Counter-one-pass Features in One-pass Compilation: a Formalization using Attribute Grammars},
  journal = {Information Processing Letters},
  year = {1978},
  volume = {7},
  number = {6},
  pages = {279--284}
}
Giegerich, R. & Wilhelm, R. (1978), "Attribute Evaluation", In Le Point sur la Compilation. Montpellier, January, 1978. , pp. 337-365. IRIA-CEC Course.
BibTeX:
@incollection{Giegerich78a,
  author = {Robert Giegerich and Reinhard Wilhelm},
  title = {Attribute Evaluation},
  booktitle = {Le Point sur la Compilation},
  publisher = {IRIA-CEC Course},
  year = {1978},
  pages = {337--365}
}
Jespersen, P., Madsen, M. & Riis-Nielson, H. (1978), "New Extended Attributed System (NEATS)". Comp. Sc. Department, Aarhus University, 1978.
BibTeX:
@techreport{Jespersen78,
  author = {P. Jespersen and M. Madsen and Hanne Riis-Nielson},
  title = {New Extended Attributed System (NEATS)},
  year = {1978}
}
Kastens, U. (1978), "Einführung in Attributierte Grammatiken", In GI Fachgespräch ``Compiler-Compiler''. Berlin , pp. 9-19. Fachbereich Informatik, Tech. Hochschule Darmstadt.
BibTeX:
@incollection{Kastens78,
  author = {Uwe Kastens},
  title = {Einführung in Attributierte Grammatiken},
  booktitle = {GI Fachgespräch ``Compiler-Compiler''},
  publisher = {Fachbereich Informatik, Tech. Hochschule Darmstadt},
  year = {1978},
  pages = {9--19}
}
Kühling, P. (1978), "Affixgrammatiken zur Beschreibung von Programmiersprachen". School: Tech. University Berlin.
BibTeX:
@phdthesis{Kuhling78,
  author = {P. Kühling},
  title = {Affixgrammatiken zur Beschreibung von Programmiersprachen},
  school = {Tech. University Berlin},
  year = {1978}
}
Parchmann, R. (1978), "Grammatiken mit Attributeschema und Zweistufige Auswertung Attributierter Grammatiken". Schriften zur Informatik und Angewandten Mathematik, Rheinisch-Westfälische Tech. Hochschule Aachen, Technical Report 46, February, 1978.
BibTeX:
@techreport{Parchmann78,
  author = {R. Parchmann},
  title = {Grammatiken mit Attributeschema und Zweistufige Auswertung Attributierter Grammatiken},
  year = {1978},
  number = {46}
}
Pister, A. & Buttelmann, H.W. (1978), "Semantic-syntax-directed Translation", Information and Control., March, 1978. Vol. 36(3), pp. 320-361.
BibTeX:
@article{Pister78,
  author = {A. Pister and H. W. Buttelmann},
  title = {Semantic-syntax-directed Translation},
  journal = {Information and Control},
  year = {1978},
  volume = {36},
  number = {3},
  pages = {320--361}
}
Pozefski, D. & Jazayeri, M. (1978), "A Family of Pass-oriented Attribute Grammar Evaluators", In ACM 1978 Annual Conf.. Washington, DC, December, 1978. , pp. 261-270. ACM press.
BibTeX:
@incollection{Pozefski78,
  author = {D. Pozefski and Mehdi Jazayeri},
  title = {A Family of Pass-oriented Attribute Grammar Evaluators},
  booktitle = {ACM 1978 Annual Conf.},
  publisher = {ACM press},
  year = {1978},
  pages = {261--270},
  note = {See also: report TR 78-010, Department of Comp. Sc., University of North Carolina, Chapel Hill, NC (September 1978).}
}
Räihä, K.-J., Saarinen, M., Soisalon-Soininen, E. & Tienari, M. (1978), "The Compiler Writing System HLP (Helsinki Language Processor)". Department of Comp. Sc., University of Helsinki, Technical Report A-1978-2, March, 1978.
BibTeX:
@techreport{Raiha78,
  author = {Kari-Jouko Räihä and Mikko Saarinen and Eljas Soisalon-Soininen and Martti Tienari},
  title = {The Compiler Writing System HLP (Helsinki Language Processor)},
  year = {1978},
  number = {A-1978-2}
}
Saarinen, M. (1978), "On Constructing Efficient Evaluators for Attribute Grammars", In 5th Int. Coll. on Automata, Languages and Programming. New York--Heidelberg--Berlin, July, 1978. Vol. 62, pp. 382-397. Springer-Verlag.
BibTeX:
@incollection{Saarinen78,
  author = {Mikko Saarinen},
  title = {On Constructing Efficient Evaluators for Attribute Grammars},
  booktitle = {5th Int. Coll. on Automata, Languages and Programming},
  publisher = {Springer-Verlag},
  year = {1978},
  volume = {62},
  pages = {382--397},
  note = {Udine}
}
Silverberg, B.A. (1978), "Using a Grammatical Formalism as a Programming Language". Computer Systems Research Group, University of Toronto, Technical Report CSRG-88, January, 1978.
BibTeX:
@techreport{Silverberg78,
  author = {B. A. Silverberg},
  title = {Using a Grammatical Formalism as a Programming Language},
  year = {1978},
  number = {CSRG-88}
}
Skedzeleski, S.K. (1978), "Definition and Use of Attribute Reevaluation in Attributed Grammars". School: Comp. Sc. Department, University of Wisconsin-Madison., October, 1978. (report TR 340)
BibTeX:
@phdthesis{Skedzeleski78,
  author = {Stephen K. Skedzeleski},
  title = {Definition and Use of Attribute Reevaluation in Attributed Grammars},
  school = {Comp. Sc. Department, University of Wisconsin-Madison},
  year = {1978},
  number = {report TR 340}
}
Tai, K.C. (1978), "Constant Folding within an Expression by Semantic Attributes". Computer Studies, North Carolina State University, Technical Report 78-15, December, 1978.
BibTeX:
@techreport{Tai78,
  author = {K. C. Tai},
  title = {Constant Folding within an Expression by Semantic Attributes},
  year = {1978},
  number = {78-15}
}
Tienari, M. (1978), "Research on Programming Languages and Compilers", Data. Vol. 11-78, pp. 75-78.
BibTeX:
@article{Tienari78,
  author = {Martti Tienari},
  title = {Research on Programming Languages and Compilers},
  journal = {Data},
  year = {1978},
  volume = {11-78},
  pages = {75--78}
}
Wilhelm, R. (1978), "Presentation of the Compiler Generating System MUG2. Examples: Global Flow Analysis and Optimization", In Le Point sur la Compilation. Rocquencourt, January, 1978. , pp. 307-335. IRIA-CEC.
BibTeX:
@incollection{Wilhelm78,
  author = {Reinhard Wilhelm},
  title = {Presentation of the Compiler Generating System MUG2. Examples: Global Flow Analysis and Optimization},
  booktitle = {Le Point sur la Compilation},
  publisher = {IRIA-CEC},
  year = {1978},
  pages = {307--335},
  note = {Montpellier}
}
Alblas, H. (1979), "The Limitations of Attribute-Evaluation in Passes". Onderafdeling der Informatica, Tech. Hogeschool Twente, 1979.
BibTeX:
@techreport{Alblas79,
  author = {Henk Alblas},
  title = {The Limitations of Attribute-Evaluation in Passes},
  year = {1979}
}
Asbrock, B. (1979), "Attribut-Implementierung und -Optimierung für Attributierte Grammatiken". School: University Karslruhe., July, 1979.
BibTeX:
@phdthesis{Asbrock79,
  author = {Brigitte Asbrock},
  title = {Attribut-Implementierung und -Optimierung für Attributierte Grammatiken},
  school = {University Karslruhe},
  year = {1979}
}
Biryukov, A.N., Kurochkin, V.M. & Serebryakov, V.A. (1979), "A Compiler-Construction System based on the Homogeneous and Universal Approach", In Abstracts for the First All-Union Conf. on Programming Technology. Kiev
BibTeX:
@incollection{Biryukov79,
  author = {A. N. Biryukov and V. M. Kurochkin and Vladimir A. Serebryakov},
  title = {A Compiler-Construction System based on the Homogeneous and Universal Approach},
  booktitle = {Abstracts for the First All-Union Conf. on Programming Technology},
  year = {1979},
  note = {(in Russian)}
}
Blattner, M. & Ramanathan, J. (1979), "Attributed Metaforms for Top-down Design and Analysis of Programs", In 1979 Conf. on Information Sciences and Systems. John Hopkins University, Baltimore, MD, March, 1979. , pp. 200-206.
BibTeX:
@incollection{Blattner79,
  author = {M. Blattner and J. Ramanathan},
  title = {Attributed Metaforms for Top-down Design and Analysis of Programs},
  booktitle = {1979 Conf. on Information Sciences and Systems},
  year = {1979},
  pages = {200--206}
}
Chebotar, K.S. (1979), "Order of Calculation of Semantic Attributes", Progr. and Computer Software., March, 1979. Vol. 5(2), pp. 113-117.
BibTeX:
@article{Chebotar79,
  author = {K. S. Chebotar},
  title = {Order of Calculation of Semantic Attributes},
  journal = {Progr. and Computer Software},
  year = {1979},
  volume = {5},
  number = {2},
  pages = {113--117}
}
Chirica, L.M. & Martin, D.F. (1979), "An Order-Algebraic Definition of Knuthian Semantics", Mathematical Systems Theory. Vol. 13(1), pp. 1-27.
BibTeX:
@article{Chirica79,
  author = {Laurian M. Chirica and David F. Martin},
  title = {An Order-Algebraic Definition of Knuthian Semantics},
  journal = {Mathematical Systems Theory},
  year = {1979},
  volume = {13},
  number = {1},
  pages = {1--27},
  note = {See also: report TRCS78-2, Dept. of Elec. Eng. and Computer Science, University of California, Santa Barbara, CA (October 1978).}
}
Cohen, R. & Harry, E. (1979), "Automatic Generation of Near-Optimal Linear-Time Translators for Non-Circular Attribute Grammars", In 6th ACM Symp. on Principles of Progr. Languages. San Antonio, TX, January, 1979. , pp. 121-134. ACM press.
BibTeX:
@incollection{Cohen79,
  author = {R. Cohen and E. Harry},
  title = {Automatic Generation of Near-Optimal Linear-Time Translators for Non-Circular Attribute Grammars},
  booktitle = {6th ACM Symp. on Principles of Progr. Languages},
  publisher = {ACM press},
  year = {1979},
  pages = {121--134}
}
Deransart, P. (1979), "Proof by Semantic Attributes of a Lisp Compiler", The Computer Journal., August, 1979. Vol. 22(3), pp. 240-245.
BibTeX:
@article{Deransart79,
  author = {Pierre Deransart},
  title = {Proof by Semantic Attributes of a Lisp Compiler},
  journal = {The Computer Journal},
  year = {1979},
  volume = {22},
  number = {3},
  pages = {240--245}
}
Deransart, P. (1979), "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. Toulouse, September, 1979. , pp. 111-120.
BibTeX:
@incollection{Deransart79a,
  author = {Pierre Deransart},
  title = {Synthèse automatique de traductions définies par attributs sémantiques},
  booktitle = {2ème Congrès AFCET-INRIA ``Reconnaissance des Formes et Intelligence Artificielle'', Vol. 1},
  year = {1979},
  pages = {111--120}
}
Franzen, H. & Hoffmann, B. (1979), "Automatic Determination of Data Flow in Extended Affix Grammars", In Fachbereich ``Compiler-Compiler'', GI 9. Jahrestagung. New York--Heidelberg--Berlin. Volume 19, pp. 176-193. Springer-Verlag.
BibTeX:
@inproceedings{Franzen79,
  author = {H. Franzen and Berthold Hoffmann},
  title = {Automatic Determination of Data Flow in Extended Affix Grammars},
  booktitle = {Fachbereich ``Compiler-Compiler'', GI 9. Jahrestagung},
  publisher = {Springer-Verlag},
  year = {1979},
  volume = {19},
  pages = {176--193},
  note = {Bonn}
}
Ganzinger, H. (1979), "An Approach to the Derivation of Compiler Description Concepts from the Mathematical Semantics Concept", In Fachbereich ``Compiler-Compiler'', GI 9. Jahrestagung. New York--Heidelberg--Berlin. Volume 19, pp. 206-217. Springer-Verlag.
BibTeX:
@inproceedings{Ganzinger79,
  author = {Harald Ganzinger},
  title = {An Approach to the Derivation of Compiler Description Concepts from the Mathematical Semantics Concept},
  booktitle = {Fachbereich ``Compiler-Compiler'', GI 9. Jahrestagung},
  publisher = {Springer-Verlag},
  year = {1979},
  volume = {19},
  pages = {206--217},
  note = {Bonn}
}
Ganzinger, H. (1979), "On Storage Optimization for Automatically Generated Compilers", In 4th GI Conf. on Theoretical Computer Science. New York--Heidelberg--Berlin, March, 1979. Vol. 67, pp. 132-141. Springer-Verlag.
BibTeX:
@incollection{Ganzinger79a,
  author = {Harald Ganzinger},
  title = {On Storage Optimization for Automatically Generated Compilers},
  booktitle = {4th GI Conf. on Theoretical Computer Science},
  publisher = {Springer-Verlag},
  year = {1979},
  volume = {67},
  pages = {132--141},
  note = {Aachen}
}
Giegerich, R. (1979), "Introduction to the Compiler Generating System MUG2". Institut für Informatik, Tech. University München, Technical Report TUM-INFO-7913, May, 1979.
BibTeX:
@techreport{Giegerich79,
  author = {Robert Giegerich},
  title = {Introduction to the Compiler Generating System MUG2},
  year = {1979},
  number = {TUM-INFO-7913}
}
Ikonen, M. (1979), "An Attribute Grammar for PL360". Department of Comp. Sc., University of Helsinki, Technical Report C-1979-24, 1979.
BibTeX:
@techreport{Ikonen79,
  author = {M. Ikonen},
  title = {An Attribute Grammar for PL360},
  year = {1979},
  number = {C-1979-24},
  note = {(in Finnish)}
}
Kastens, U. (1979), "ALADIN Eine Definitionssprache für Attributierte Grammatiken". Institut für Informatik~II, University Karlsruhe, Technical Report 7/79, July, 1979.
BibTeX:
@techreport{Kastens79,
  author = {Uwe Kastens},
  title = {ALADIN Eine Definitionssprache für Attributierte Grammatiken},
  year = {1979},
  number = {7/79}
}
Kennedy, K. & Ramanathan, J. (1979), "A Deterministic Attribute Grammar Evaluator based on Dynamic Sequencing", ACM Trans. Progr. Languages and Systems., July, 1979. Vol. 1(1), pp. 142-160.
BibTeX:
@article{Kennedy79,
  author = {Ken Kennedy and J. Ramanathan},
  title = {A Deterministic Attribute Grammar Evaluator based on Dynamic Sequencing},
  journal = {ACM Trans. Progr. Languages and Systems},
  year = {1979},
  volume = {1},
  number = {1},
  pages = {142--160}
}
Koskimies, K. & Juutinen, L. (1979), "An Attribute Grammar for the Compile-Time Semantics of the Programming Language Euclid". Department of Comp. Sc., University of Helsinki, Technical Report C-1979-130, December, 1979.
BibTeX:
@techreport{Koskimies79,
  author = {Kai Koskimies and L. Juutinen},
  title = {An Attribute Grammar for the Compile-Time Semantics of the Programming Language Euclid},
  year = {1979},
  number = {C-1979-130}
}
Lewi, J., De Vlaminck, K., Huens, J. & Huybrechts, M. (1979), "A programming Methodology in Compiler Construction" Amsterdam North-Holland.
BibTeX:
@book{Lewi79,
  author = {J. Lewi and K. De Vlaminck and J. Huens and M. Huybrechts},
  title = {A programming Methodology in Compiler Construction},
  publisher = {North-Holland},
  year = {1979},
  note = {I and II}
}
Milton, D.R. & Fischer, C.N. (1979), "LL(k) Parsing for Attributed Grammars", In 6th Int. Coll. on Automata, Languages and Programming. New York--Heidelberg--Berlin, July, 1979. Vol. 71, pp. 422-430. Springer-Verlag.
BibTeX:
@incollection{Milton79,
  author = {D. R. Milton and Charles N. Fischer},
  title = {LL(k) Parsing for Attributed Grammars},
  booktitle = {6th Int. Coll. on Automata, Languages and Programming},
  publisher = {Springer-Verlag},
  year = {1979},
  volume = {71},
  pages = {422--430},
  note = {Graz}
}
Milton, D.R., Kirchoff, L.W. & Rowland, B.R. (1979), "An ALL(1) Compiler Generator", In ACM SIGPLAN '79 Symp. on Compiler Construction. Denver, Co, August, 1979. , pp. 152-157. ACM press.
BibTeX:
@incollection{Milton79a,
  author = {D. R. Milton and L. W. Kirchoff and Bruce R. Rowland},
  title = {An ALL(1) Compiler Generator},
  booktitle = {ACM SIGPLAN '79 Symp. on Compiler Construction},
  publisher = {ACM press},
  year = {1979},
  pages = {152--157},
  note = {Published as ACM SIGPLAN Notices, volume 14, number 8}
}
Pair, C., Amirchahy, M. & Néel, D. (1979), "Correctness Proofs of Syntax-directed Processing Descriptions by Attributes", Journal of Computer and System Sciences., August, 1979. Vol. 19(1), pp. 1-17.
BibTeX:
@article{Pair79,
  author = {Claude Pair and Michaneh Amirchahy and Danièle Néel},
  title = {Correctness Proofs of Syntax-directed Processing Descriptions by Attributes},
  journal = {Journal of Computer and System Sciences},
  year = {1979},
  volume = {19},
  number = {1},
  pages = {1--17}
}
Papakonstantinou, G.K. (1979), "A Poor Man's Realization of Attribute Grammars", Software---Practice and Experience., September, 1979. Vol. 9(9), pp. 719-728.
BibTeX:
@article{Papakonstantin79,
  author = {George K. Papakonstantinou},
  title = {A Poor Man's Realization of Attribute Grammars},
  journal = {Software---Practice and Experience},
  year = {1979},
  volume = {9},
  number = {9},
  pages = {719--728}
}
Penjam, J. (1979), "Methods of Automatic Implementation of Semantics in Translators", In Abstracts for the First All-Union Conf. on Programming Technology. Kiev
BibTeX:
@incollection{Penjam79,
  author = {Jaan Penjam},
  title = {Methods of Automatic Implementation of Semantics in Translators},
  booktitle = {Abstracts for the First All-Union Conf. on Programming Technology},
  year = {1979},
  note = {(in Russian)}
}
Penner, V. (1979), "Die Eingabesprache LDL für ein Compiler-erzeugendes System und ein Umfassendes Beispiel". Schriften zur Informatik und Angewandten Mathematik, Reinisch-Westfälische Tech. Hochschule Aachen, Technical Report 50, February, 1979.
BibTeX:
@techreport{Penner79,
  author = {V. Penner},
  title = {Die Eingabesprache LDL für ein Compiler-erzeugendes System und ein Umfassendes Beispiel},
  year = {1979},
  number = {50}
}
Penner, V. (1979), "Ein LDL-compiler". Lehrstuhl für Angewandte Mathematik und Informatik, Rheinisch-Westfälische Tech. Hochschule Aachen, 1979.
BibTeX:
@techreport{Penner79a,
  author = {V. Penner},
  title = {Ein LDL-compiler},
  year = {1979}
}
Pozefsky, D. (1979), "Building Efficient Pass-oriented Attribute Grammar Evaluators". School: Department of Comp. Sc., University of North Carolina. Chapel Hill, NC, April, 1979. (report TR 79-006)
BibTeX:
@phdthesis{Pozefsky79,
  author = {Diane Pozefsky},
  title = {Building Efficient Pass-oriented Attribute Grammar Evaluators},
  school = {Department of Comp. Sc., University of North Carolina},
  year = {1979},
  number = {report TR 79-006}
}
Räihä, K.-J. (1979), "Dynamic Allocation of Space for Attribute Instances in Multi-pass Evaluators of Attribute Grammars", In ACM SIGPLAN '79 Symp. on Compiler Construction. Denver, Co, August, 1979. , pp. 26-38. ACM press.
BibTeX:
@incollection{Raiha79,
  author = {Kari-Jouko Räihä},
  title = {Dynamic Allocation of Space for Attribute Instances in Multi-pass Evaluators of Attribute Grammars},
  booktitle = {ACM SIGPLAN '79 Symp. on Compiler Construction},
  publisher = {ACM press},
  year = {1979},
  pages = {26--38},
  note = {Published as ACM SIGPLAN Notices, volume 14, number 8}
}
Räihä, K.-J. & Ukkonen, E. (1979), "The Shortest Common Supersequence Problem over Binary Alphabet is NP-Complete". Department of Comp. Sc., University of Helsinki, Technical Report C-1979-95, November, 1979.
BibTeX:
@techreport{Raiha79a,
  author = {Kari-Jouko Räihä and Esko Ukkonen},
  title = {The Shortest Common Supersequence Problem over Binary Alphabet is NP-Complete},
  year = {1979},
  number = {C-1979-95}
}
Riedewald, Gü. (1979), "Compilerkonstruktion und Grammatiken syntaktischer Funktionen". Rechenzentrum der W.-Pieck-University, 1979.
Abstract: Algebraic models for programming languages and their compilers, based on heterogeneous algebras, are introduced. The use of GSFs as a base for automatic compiler construction is treated.
BibTeX:
@techreport{Riedewald79,
  author = {Günter Riedewald},
  title = {Compilerkonstruktion und Grammatiken syntaktischer Funktionen},
  year = {1979}
}
Schell, R.M. (1979), "Methods for Constructing Parallel Compilers for Use in a Multiprocessor Environment". School: Department of Comp. Sc., University of Illinois at Urbana-Champaign., February, 1979. (report UIUCDCS-R-79-0958)
BibTeX:
@phdthesis{Schell79,
  author = {Richard M. Schell},
  title = {Methods for Constructing Parallel Compilers for Use in a Multiprocessor Environment},
  school = {Department of Comp. Sc., University of Illinois at Urbana-Champaign},
  year = {1979},
  number = {report UIUCDCS-R-79-0958}
}
Schell, R.M. (1979), "Parallel Compilation in a Multiprocessor Environment". Department of Comp. Sc., University of Illinois at Urbana-Champaign, Technical Report UIUCDCS-R-79-0991, December, 1979.
BibTeX:
@techreport{Schell79a,
  author = {Richard M. Schell},
  title = {Parallel Compilation in a Multiprocessor Environment},
  year = {1979},
  number = {UIUCDCS-R-79-0991}
}
Siitari, H. (1979), "An Attribute Grammar for the Programming Language Simula". Department of Comp. Sc., University of Helsinki, Technical Report C-1979-90, 1979.
BibTeX:
@techreport{Siitari79,
  author = {H. Siitari},
  title = {An Attribute Grammar for the Programming Language Simula},
  year = {1979},
  number = {C-1979-90},
  note = {(in Finnish)}
}
Sonnenschein, M. (1979), "Implementierung und Theoretische Untersuchungen von Attribut-Auswertungsalgorithmnen und Insbesondere von Treewalk-Evaluatoren im Rahmen eines Compiler-erzugenden Systems". School: Lehrstuhl für Angewandte Informatik, Rheinisch-Westfälische Tech. Hoschschule Aachen.
BibTeX:
@phdthesis{Sonnenschein79,
  author = {Michael Sonnenschein},
  title = {Implementierung und Theoretische Untersuchungen von Attribut-Auswertungsalgorithmnen und Insbesondere von Treewalk-Evaluatoren im Rahmen eines Compiler-erzugenden Systems},
  school = {Lehrstuhl für Angewandte Informatik, Rheinisch-Westfälische Tech. Hoschschule Aachen},
  year = {1979}
}
Tokuda, T. (1979), "Wijngaarden Grammars as Knuthian Grammars", In Proc. 20th Annual IPSJ Conf.., pp. 207-208.
BibTeX:
@inproceedings{Tokuda79,
  author = {Takehiro Tokuda},
  title = {Wijngaarden Grammars as Knuthian Grammars},
  booktitle = {Proc. 20th Annual IPSJ Conf.},
  year = {1979},
  pages = {207--208},
  note = {(in Japanese)}
}
Watt, D.A. (1979), "An Extended Attribute Grammar for Pascal", ACM SIGPLAN Notices., February, 1979. Vol. 14(2), pp. 60-74.
BibTeX:
@article{Watt79,
  author = {David A. Watt},
  title = {An Extended Attribute Grammar for Pascal},
  journal = {ACM SIGPLAN Notices},
  year = {1979},
  volume = {14},
  number = {2},
  pages = {60--74}
}
Wilhelm, R. (1979), "Attibutierte Grammatiken", Informatik-Spektrum., July, 1979. Vol. 2(3), pp. 123-130.
BibTeX:
@article{Wilhelm79,
  author = {Reinhard Wilhelm},
  title = {Attibutierte Grammatiken},
  journal = {Informatik-Spektrum},
  year = {1979},
  volume = {2},
  number = {3},
  pages = {123--130}
}
Wilhelm, R. (1979), "Computation and Use of Data Flow Information in Optimizing Compilers", Acta Informatica. Vol. 12(3), pp. 209-225.
BibTeX:
@article{Wilhelm79a,
  author = {Reinhard Wilhelm},
  title = {Computation and Use of Data Flow Information in Optimizing Compilers},
  journal = {Acta Informatica},
  year = {1979},
  volume = {12},
  number = {3},
  pages = {209--225}
}
You, K.C. & Fu, K.-S. (1979), "A Syntactic Approach to Shape Recognition using Attributed Grammars", Institute of Electrical and Electronic Engineers. Transactions on Systems, Man, and Cybernetics. Vol. SMC-9(6), pp. 334-345.
BibTeX:
@article{You79,
  author = {K. C. You and King-Sun Fu},
  title = {A Syntactic Approach to Shape Recognition using Attributed Grammars},
  journal = {Institute of Electrical and Electronic Engineers. Transactions on Systems, Man, and Cybernetics},
  year = {1979},
  volume = {SMC-9},
  number = {6},
  pages = {334--345}
}
Asp, J. (1980), "Description of the Syntax and Static Semantics of Pascal-HB using the Compiler Writing System HLP". Department of Comp. Sc., University of Helsinki, Technical Report C-1980-77, 1980.
BibTeX:
@techreport{Asp80,
  author = {J. Asp},
  title = {Description of the Syntax and Static Semantics of Pascal-HB using the Compiler Writing System HLP},
  year = {1980},
  number = {C-1980-77},
  note = {(in Finnish)}
}
Biryukov, A.N., Kurochkin, V.M. & Serebryakov, V.A. (1980), "Global Attributes and their Use for the Definition of a Programming Language", Akademiya Nauk SSSR. Zhurnal Vychislitel'nou ı Matematiki i Matematicheskou ı Fiziki. Vol. 20(5), pp. 1284-1293.
BibTeX:
@article{Biryukov80,
  author = {A. N. Biryukov and V. M. Kurochkin and Vladimir A. Serebryakov},
  title = {Global Attributes and their Use for the Definition of a Programming Language},
  journal = {Akademiya Nauk SSSR. Zhurnal Vychislitel'nou ı  Matematiki i Matematicheskou ı  Fiziki},
  year = {1980},
  volume = {20},
  number = {5},
  pages = {1284--1293},
  note = {(in Russian). Also published in: Symbolic Data Processing 5, Computing Center, Academy of Sciences of the USSR, Moscow (1979).}
}
Boccalatte, A. & Di Manzo, M. (1980), "An Approach to the Detection of Semantic Errors", The Computer Journal. Vol. 23(4), pp. 317-323.
BibTeX:
@article{Boccalatte80,
  author = {A. Boccalatte and M. Di Manzo},
  title = {An Approach to the Detection of Semantic Errors},
  journal = {The Computer Journal},
  year = {1980},
  volume = {23},
  number = {4},
  pages = {317--323}
}
Courcelle, B. & Franchi-Zannettacci, P. (1980), "On the Equivalence Problem for Attribute Systems". University de Bordeaux~I, Technical Report 8026, 1980.
BibTeX:
@techreport{Courcelle80,
  author = {Bruno Courcelle and Paul Franchi-Zannettacci},
  title = {On the Equivalence Problem for Attribute Systems},
  year = {1980},
  number = {8026}
}
Courcelle, B. & Franchi-Zannettacci, P. (1980), "On the Expressive Power of Attribute Grammars", In 21st IEEE Conf. on Foudations of Comput. Sc.. Syracuse, NY, October, 1980. , pp. 161-172.
BibTeX:
@incollection{Courcelle80a,
  author = {Bruno Courcelle and Paul Franchi-Zannettacci},
  title = {On the Expressive Power of Attribute Grammars},
  booktitle = {21st IEEE Conf. on Foudations of Comput. Sc.},
  year = {1980},
  pages = {161--172}
}
Deutsche Industrie Norma (1980), "Programmiersprache PEARL" Reuth-Verlag.
BibTeX:
@book{DeutscheIndust80,
  author = {Deutsche Industrie Norma},
  title = {Programmiersprache PEARL},
  publisher = {Reuth-Verlag},
  year = {1980},
  note = {Normentwurf DIN 66253, Teil 2}
}
Dilger, W. (1980), "Automatic translation with attribute grammars", COLING-80. , pp. 397-404.
BibTeX:
@article{Dilger80,
  author = {Werner Dilger},
  title = {Automatic translation with attribute grammars},
  journal = {COLING-80},
  year = {1980},
  pages = {397--404}
}
Engelfriet, J. & Filé, G. (1980), "Formal Properties of One-Visit and Multi-Pass Attribute Grammars", In 7th Int. Coll. on Automata, Languages and Programming. New York--Heidelberg--Berlin, July, 1980. Vol. 85, pp. 182-194. Springer-Verlag.
BibTeX:
@incollection{Engelfriet80,
  author = {Joost Engelfriet and Gilberto Filé},
  title = {Formal Properties of One-Visit and Multi-Pass Attribute Grammars},
  booktitle = {7th Int. Coll. on Automata, Languages and Programming},
  publisher = {Springer-Verlag},
  year = {1980},
  volume = {85},
  pages = {182--194},
  note = {Noordwijkerhout}
}
Ganapathi, M. (1980), "Retargetable Code Generation and Optimization using Attribute Grammars". School: Comp. Sc. Department, University of Wisconsin-Madison., December, 1980. (report TR 406)
BibTeX:
@phdthesis{Ganapathi80,
  author = {Mahadevan Ganapathi},
  title = {Retargetable Code Generation and Optimization using Attribute Grammars},
  school = {Comp. Sc. Department, University of Wisconsin-Madison},
  year = {1980},
  number = {report TR 406}
}
Ganzinger, H. (1980), "Some Principles for the Development of Compiler from Denotational Language Definitions". Institut für Informatik, Tech. University München, Technical Report TUM-INFO-8006, May, 1980.
BibTeX:
@techreport{Ganzinger80,
  author = {Harald Ganzinger},
  title = {Some Principles for the Development of Compiler from Denotational Language Definitions},
  year = {1980},
  number = {TUM-INFO-8006}
}
Ganzinger, H. (1980), "Transforming Denotational Semantics into Practical Attribute Grammars", In Semantics-Directed Compiler Generation. New York--Heidelberg--Berlin Vol. 94, pp. 1-69. Springer-Verlag.
BibTeX:
@incollection{Ganzinger80a,
  author = {Harald Ganzinger},
  title = {Transforming Denotational Semantics into Practical Attribute Grammars},
  booktitle = {Semantics-Directed Compiler Generation},
  publisher = {Springer-Verlag},
  year = {1980},
  volume = {94},
  pages = {1--69}
}
Gaudel, M.-C. (1980), "Specification of Compilers as Abstract Data Type Representation", In Semantics-Directed Compiler Generation. New York--Heidelberg--Berlin Vol. 94, pp. 140-164. Springer-Verlag.
BibTeX:
@incollection{Gaudel80,
  author = {Marie-Claude Gaudel},
  title = {Specification of Compilers as Abstract Data Type Representation},
  booktitle = {Semantics-Directed Compiler Generation},
  publisher = {Springer-Verlag},
  year = {1980},
  volume = {94},
  pages = {140--164}
}
Glasner, I., Möncke, U. & Wilhelm, R. (1980), "OPTRAN, a Language for the Specification of Program Transformations", In GI 6. Fachtagung ``Programmiersprache und Programentwicklung''. New York--Heidelberg--Berlin. March 1980. Volume 34, pp. 125-142. Springer-Verlag.
BibTeX:
@inproceedings{Glasner80,
  author = {Ingrid Glasner and Ulrich Möncke and Reinhard Wilhelm},
  title = {OPTRAN, a Language for the Specification of Program Transformations},
  booktitle = {GI 6. Fachtagung ``Programmiersprache und Programentwicklung''},
  publisher = {Springer-Verlag},
  year = {1980},
  volume = {34},
  pages = {125--142},
  note = {Darmstadt}
}
Heeg, G. & de Vries, E. (1980), "LINGUA---ein Compilergenerator". School: Abteilung Informatik, University Dortmund.
BibTeX:
@phdthesis{Heeg80,
  author = {G. Heeg and E. de Vries},
  title = {LINGUA---ein Compilergenerator},
  school = {Abteilung Informatik, University Dortmund},
  year = {1980}
}
Hoffmann, B. & Schmiedecke, I.-R. (1980), "A Mathematical Approach to Multi-pass Parsing", In 9th Symp. on Mathematical Foundations of Computer Science. New York--Heidelberg--Berlin Vol. 88, pp. 275-290. Springer-Verlag.
BibTeX:
@incollection{Hoffmann80,
  author = {Berthold Hoffmann and I.-R. Schmiedecke},
  title = {A Mathematical Approach to Multi-pass Parsing},
  booktitle = {9th Symp. on Mathematical Foundations of Computer Science},
  publisher = {Springer-Verlag},
  year = {1980},
  volume = {88},
  pages = {275--290},
  note = {Rydzyna}
}
Hollander, C.R. (1980), "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., pp. 95-100.
BibTeX:
@inproceedings{Hollander80,
  author = {Clifford R. Hollander},
  title = {Use of an attribute grammar in network-based representation schemes},
  booktitle = {Proceedings of the Third Biennial Conference of the Canadian Society for Computational Studies of Intelligence},
  year = {1980},
  pages = {95--100}
}
Jazayeri, M. & Pozefsky, D. (1980), "A Space Improvement in the Alternating Semantic Evaluator", In ACM 1980 Annual Conf.. Nashville, TE, October, 1980. , pp. 498-504. ACM press.
BibTeX:
@incollection{Jazayeri80,
  author = {Mehdi Jazayeri and Diane Pozefsky},
  title = {A Space Improvement in the Alternating Semantic Evaluator},
  booktitle = {ACM 1980 Annual Conf.},
  publisher = {ACM press},
  year = {1980},
  pages = {498--504},
  note = {See also: report TR 80-002, Department of Comp. Sc., University of North-Carolina, Chapel Hill, NC (October 1980).}
}
(1980), "Semantics-directed Compiler Generation" New York--Heidelberg--Berlin Vol. 94 Springer-Verlag.
BibTeX:
@book{Jones80,,
  title = {Semantics-directed Compiler Generation},
  publisher = {Springer-Verlag},
  year = {1980},
  volume = {94}
}
Jones, N.D. (1980), "Circularity Testing of Attribute Grammars Requires Exponential Time: a Simpler Proof". Comp. Sc. Department, Aarhus University, Technical Report PB-107, 1980.
BibTeX:
@techreport{Jones80a,
  author = {Neil D. Jones},
  title = {Circularity Testing of Attribute Grammars Requires Exponential Time: a Simpler Proof},
  year = {1980},
  number = {PB-107}
}
Jones, N.D. & Madsen, C.M. (1980), "Attribute-influenced LR parsing", In Semantics-Directed Compiler Generation. New York--Heidelberg--Berlin Vol. 94, pp. 393-407. Springer-Verlag.
BibTeX:
@incollection{Jones80b,
  author = {Neil D. Jones and C. M. Madsen},
  title = {Attribute-influenced LR parsing},
  booktitle = {Semantics-Directed Compiler Generation},
  publisher = {Springer-Verlag},
  year = {1980},
  volume = {94},
  pages = {393--407}
}
Kastens, U. (1980), "Ordered Attribute Grammars", Acta Informatica. Vol. 13(3), pp. 229-256.
BibTeX:
@article{Kastens80,
  author = {Uwe Kastens},
  title = {Ordered Attribute Grammars},
  journal = {Acta Informatica},
  year = {1980},
  volume = {13},
  number = {3},
  pages = {229--256},
  note = {See also: Bericht 7/78, Institut für Informatik~II, University Karlsruhe (1978).}
}
Kastens, U., Kollner, R., Zimmermann, E., Hruschka, P. & Kappatsch, A. (1980), "Eine attributierte Grammatik für PEARL". Institut für Informatik~II, University Karlsruhe, 1980.
BibTeX:
@techreport{Kastens80a,
  author = {Uwe Kastens and R. Kollner and Erich Zimmermann and P. Hruschka and A. Kappatsch},
  title = {Eine attributierte Grammatik für PEARL},
  year = {1980}
}
Kastens, U. & Zimmermann, E. (1980), "GAG A Generator based on Attribute Grammars". Institut für Informatik, University Karlsruhe, Technical Report 14/80, 1980.
BibTeX:
@techreport{Kastens80b,
  author = {Uwe Kastens and Erich Zimmermann},
  title = {GAG A Generator based on Attribute Grammars},
  year = {1980},
  number = {14/80},
  note = {See also: Séminaires Langages et Traducteurs 1978-1981, INRIA, Rocquencourt, pp. 141-158 (1981).}
}
Kortessalo, L. (1980), "Description of the Lexical Metalanguage of HLP using HLP". Department of Comp. Sc., University of Helsinki, Technical Report C-1980-68, July, 1980.
BibTeX:
@techreport{Kortessalo80,
  author = {L. Kortessalo},
  title = {Description of the Lexical Metalanguage of HLP using HLP},
  year = {1980},
  number = {C-1980-68},
  note = {(in Finnish)}
}
Krishnaswamy, R. & Pyster, A.B. (1980), "On the Correctness of Semantic-Syntax-Directed Translations", J. ACM., April, 1980. Vol. 27(2), pp. 338-355.
BibTeX:
@article{Krishnaswamy80,
  author = {R. Krishnaswamy and A. B. Pyster},
  title = {On the Correctness of Semantic-Syntax-Directed Translations},
  journal = {J. ACM},
  year = {1980},
  volume = {27},
  number = {2},
  pages = {338--355}
}
Madsen, O.L. (1980), "On Defining Semantics by Means of Extended Attribute Grammars". Comp. Sc. Department, Aarhus University, Technical Report DAIMI PB-109, January, 1980.
Abstract: The possibilities for defining predicate transformers, denotational semantics, and operational semantics by means of extended attribute grammars are treated. The approach to operational semantics consists of a set of attribute grammar rules that specifies the possible transformations upon a given program. A proposal for defining the domains of an attribute grammar within the formalism is given. It is also shown how an attribute grammar may be reformulated as a tree rewriting system. Finally an efficient evaluator that works for all attribute grammars (including some circular ones) is described. This evaluator constructs during a left-to-right scan of a linear representation of the parse tree (a right-parse) a directed (acyclic) graph that represents the values of the attributes at the root of the parse tree. The parse tree itself need not be constructed. During a (recursive) scan of this graph the attribute values may be evaluated.
BibTeX:
@techreport{Lehrmann80,
  author = {Ole Lehrmann Madsen},
  title = {On Defining Semantics by Means of Extended Attribute Grammars},
  year = {1980},
  number = {DAIMI PB-109}
}
Madsen, C.M. (1980), "Parsing Attribute Grammars". Comp. Sc. Department, Aarhus University, 1980.
BibTeX:
@techreport{Madsen80,
  author = {C. M. Madsen},
  title = {Parsing Attribute Grammars},
  year = {1980}
}
Madsen, O.L. (1980), "Towards a Practical and General Translator Writing System". Comp. Sc. Department, Aarhus University, March, 1980.
BibTeX:
@techreport{Madsen80a,
  author = {Ole L. Madsen},
  title = {Towards a Practical and General Translator Writing System},
  year = {1980}
}
Madsen, O.L. (1980), "On Defining Semantics by means of Extended Attribute Grammars", In Semantics-Directed Compiler Generation. New York--Heidelberg--Berlin Vol. 94, pp. 259-299. Springer-Verlag.
BibTeX:
@incollection{Madsen80b,
  author = {Ole L. Madsen},
  title = {On Defining Semantics by means of Extended Attribute Grammars},
  booktitle = {Semantics-Directed Compiler Generation},
  publisher = {Springer-Verlag},
  year = {1980},
  volume = {94},
  pages = {259--299},
  note = {See also: report DAIMI PB-109, Comp. Sc. Department, Aarhus University (January 1980).}
}
Makarov, V.P. & Peshkov, V.G. (1980), "The Translator Generating System SAGET", In Computer-Aided Generation of Application Packages (Automatic Translator Generation), Abstract of Papers. Tallinn Polytechnic Institute.
BibTeX:
@incollection{Makarov80,
  author = {V. P. Makarov and V. G. Peshkov},
  title = {The Translator Generating System SAGET},
  booktitle = {Computer-Aided Generation of Application Packages (Automatic Translator Generation), Abstract of Papers},
  publisher = {Polytechnic Institute},
  year = {1980},
  note = {(in Russian)}
}
Méristé, M.B. (1980), "Methods of Implementing Attribute Schemes in Compiler-Construction Systems (review)", Progr. and Computer Software., September, 1980. Vol. 6(5), pp. 253-261.
BibTeX:
@article{Meriste80,
  author = {Merik B. Méristé},
  title = {Methods of Implementing Attribute Schemes in Compiler-Construction Systems (review)},
  journal = {Progr. and Computer Software},
  year = {1980},
  volume = {6},
  number = {5},
  pages = {253--261}
}
Penjam, J. (1980), "A Method of Automatic Implementation of Compilers". , 1980.
BibTeX:
@techreport{Penjam80,
  author = {Jaan Penjam},
  title = {A Method of Automatic Implementation of Compilers},
  year = {1980}
}
Penjam, J. (1980), "Realization of Attributive Semantics", Cybernetics., November, 1980. Vol. 16(2), pp. 199-206.
BibTeX:
@article{Penjam80a,
  author = {Jaan Penjam},
  title = {Realization of Attributive Semantics},
  journal = {Cybernetics},
  year = {1980},
  volume = {16},
  number = {2},
  pages = {199--206}
}
Räihä, K.-J. (1980), "Bibliography on Attribute Grammars", ACM SIGPLAN Notices., March, 1980. Vol. 15(3), pp. 35-44.
BibTeX:
@article{Raiha80,
  author = {Kari-Jouko Räihä},
  title = {Bibliography on Attribute Grammars},
  journal = {ACM SIGPLAN Notices},
  year = {1980},
  volume = {15},
  number = {3},
  pages = {35--44}
}
Räihä, K.-J. (1980), "Experiences with the Compiler Writing System HLP", In Semantics-Directed Compiler Generation. New York--Heidelberg--Berlin Vol. 94, pp. 350-362. Springer-Verlag.
BibTeX:
@incollection{Raiha80a,
  author = {Kari-Jouko Räihä},
  title = {Experiences with the Compiler Writing System HLP},
  booktitle = {Semantics-Directed Compiler Generation},
  publisher = {Springer-Verlag},
  year = {1980},
  volume = {94},
  pages = {350--362}
}
Räihä, K.-J. & Ukkonen, E. (1980), "On the Optimal Assignment of Attribute to Passes in Multi-pass Attribute Evaluators", In 7th Int. Coll. on Automata, Languages and Programming. New York--Heidelberg--Berlin, July, 1980. Vol. 85, pp. 500-511. Springer-Verlag.
BibTeX:
@incollection{Raiha80b,
  author = {Kari-Jouko Räihä and Esko Ukkonen},
  title = {On the Optimal Assignment of Attribute to Passes in Multi-pass Attribute Evaluators},
  booktitle = {7th Int. Coll. on Automata, Languages and Programming},
  publisher = {Springer-Verlag},
  year = {1980},
  volume = {85},
  pages = {500--511},
  note = {Noordwijkerhout}
}
Räihä, K.-J. & Ukkonen, E. (1980), "Balancing Syntactic and Semantic Power in Compiler Specification", In Information Processing '80. Amsterdam, October, 1980. , pp. 65-70. North-Holland.
BibTeX:
@incollection{Raiha80c,
  author = {Kari-Jouko Räihä and Esko Ukkonen},
  title = {Balancing Syntactic and Semantic Power in Compiler Specification},
  booktitle = {Information Processing '80},
  publisher = {North-Holland},
  year = {1980},
  pages = {65--70},
  note = {Tokyo}
}
Riis-Nielson, H. (1980), "Subclasses of Attribute Grammars". Comp. Sc. Department, Aarhus University, Technical Report PB-114, 1980.
Abstract: This thesis is a contribution to the development of a formal theory for attribute grammars, their languages and their translations. There are given precise definitions of an attribute grammar, the language recognized by the attribute grammar and the translation specified by the attribute grammar. The various definitions are compared with some alternative ones. Based on properties of the translation specified by an attribute grammar two new subclasses of attribute grammars are introduced: the determinate and the unambiguous attribute grammars. Furthermore the concept of an evaluator is considered. Based on properties of an evaluator for an attribute grammar some new subclasses of attribute grammars are introduced: the k-visit attribute grammars and the k left-to-right pass attribute grammars (k is an integer). It turns out that the k-visit as well as the k left-to-right pass attribute grammars define proper hierarchies of translations when some conditions are satisfied. It is also shown that there are translations specified by 1-visit anribute grammars that cannot be specified by any k left-to-right pass attribute grammar (when some conditions are satisfied). On the other hand it turns out that any well-defined attribute grammar is k-visit for some k.
BibTeX:
@techreport{Riis-Nielson80,
  author = {Hanne Riis-Nielson},
  title = {Subclasses of Attribute Grammars},
  year = {1980},
  number = {PB-114}
}
Riis, H. & Skyum, S. (1980), "K-Visit Attribute Grammars". Comp. Sc. Department, Aarhus University, Technical Report DAIMI PB-121, June, 1980.
Abstract: An attribute grammar G is k-visit if for any derivation tree t of G it is possible to evaluate all the attributes associated with t by walking through t in such a way that no node in t is visited more than k times.bibpar We show in this paper that any well-defined attribute grammar G is k-visit for some k. Furthermore it is shown using a pumping argument, that given a well-defined grammar G and an integer k it is decidable whether G is k-visit. Thus we can effectively for any well-defined attribute grammar G find the minimal k such that G is k-visit. Finally we show that the k-visit attribute grammars specify a proper hierarchy with respect to translations.
BibTeX:
@techreport{Riis-Nielson80a,
  author = {Hanne Riis and Sven Skyum},
  title = {K-Visit Attribute Grammars},
  year = {1980},
  number = {DAIMI PB-121}
}
Ripken, K. (1980), "Application of Meta-Compilation Methods in the Ada Test Translator Development", In GI 10. Jahrestagung. New York--Heidelberg--Berlin. Volume 33, pp. 66-77. Springer-Verlag.
BibTeX:
@inproceedings{Ripken80,
  author = {Knut Ripken},
  title = {Application of Meta-Compilation Methods in the Ada Test Translator Development},
  booktitle = {GI 10. Jahrestagung},
  publisher = {Springer-Verlag},
  year = {1980},
  volume = {33},
  pages = {66--77}
}
Sassa, M., Tokuda, J., Shinogi, T. & Inoue, K. (1980), "Design and Implementation of a Multipass-Compiler Generator", Journal of Information Processing. Vol. 3(2), pp. 77-86.
BibTeX:
@article{Sassa80,
  author = {Masataka Sassa and Junko Tokuda and Tsuyoshi Shinogi and Kenzo Inoue},
  title = {Design and Implementation of a Multipass-Compiler Generator},
  journal = {Journal of Information Processing},
  year = {1980},
  volume = {3},
  number = {2},
  pages = {77--86},
  note = {See also: research report C-24, Dept. of Information Sciences. An International Journal, Tokyo Institute of Technology (April 1979).}
}
Schektman, Y., Klein, B., Jockin, J., More, R., Pastor, J. & Vielle, D. (1980), "Utilisation des Méta-traducteurs dans la Conception des Logiciels Statistiques. Présentation d'Exemples dans Trois Domaines d'Application", In Data Analysis and Informatics. Amsterdam , pp. 393-410. North-Holland.
BibTeX:
@incollection{Schektman80,
  author = {Y. Schektman and B. Klein and J. Jockin and R. More and J. Pastor and D. Vielle},
  title = {Utilisation des Méta-traducteurs dans la Conception des Logiciels Statistiques. Présentation d'Exemples dans Trois Domaines d'Application},
  booktitle = {Data Analysis and Informatics},
  publisher = {North-Holland},
  year = {1980},
  pages = {393--410}
}
Schmidt, E.M. (1980), "Space-restricted Attribute Grammars". Comp. Sc. Department, Aarhus University, 1980.
BibTeX:
@techreport{Schmidt80,
  author = {E. M. Schmidt},
  title = {Space-restricted Attribute Grammars},
  year = {1980}
}
Teitelbaum, T. (1980), "The Cornell Program Synthesizer: a Tutorial Introduction". Department of Comp. Sc., Cornell University, Technical Report 79-381, July 1979, revised June, 1980.
BibTeX:
@techreport{Teitelbaum80,
  author = {Tim Teitelbaum},
  title = {The Cornell Program Synthesizer: a Tutorial Introduction},
  year = {1980},
  number = {79-381}
}
Tienari, M. (1980), "On the Definition of an Attribute Grammar", In Semantics-Directed Compiler Generation. New York--Heidelberg--Berlin Vol. 94, pp. 408-414. Springer-Verlag.
BibTeX:
@incollection{Tienari80,
  author = {Martti Tienari},
  title = {On the Definition of an Attribute Grammar},
  booktitle = {Semantics-Directed Compiler Generation},
  publisher = {Springer-Verlag},
  year = {1980},
  volume = {94},
  pages = {408--414},
  note = {See also: report C-1979-29, Department of Comp. Sc., University of Helsinki (March 1979).}
}
Vuurboom, R. (1980), "Restricting Semantic Behaviour of Attribute Grammars". Onderafdeling der Informatica, Tech. Hogeschool Twente, 1980.
BibTeX:
@techreport{Vuurboom80,
  author = {R. Vuurboom},
  title = {Restricting Semantic Behaviour of Attribute Grammars},
  year = {1980}
}
Watt, D.A. (1980), "Rule Splitting and Attribute-directed Parsing", In Semantics-Directed Compiler Generation. New York--Heidelberg--Berlin Vol. 94, pp. 363-392. Springer-Verlag.
BibTeX:
@incollection{Watt80,
  author = {David A. Watt},
  title = {Rule Splitting and Attribute-directed Parsing},
  booktitle = {Semantics-Directed Compiler Generation},
  publisher = {Springer-Verlag},
  year = {1980},
  volume = {94},
  pages = {363--392}
}
Willman, N. (1980), "Describing Code Optimization Algorithms by Means of Attribute Grammars". Department of Comp. Sc., University of Helsinki, Technical Report C-1980-73, 1980.
BibTeX:
@techreport{Willman80,
  author = {N. Willman},
  title = {Describing Code Optimization Algorithms by Means of Attribute Grammars},
  year = {1980},
  number = {C-1980-73},
  note = {(in Finnish)}
}
Abouzaïd, M.F. (1981), "Procédures d'utilisation des grammaires d'attributs". University de Bordeaux~I, June, 1981.
BibTeX:
@techreport{Abouzaid81,
  author = {M. F. Abouzaïd},
  title = {Procédures d'utilisation des grammaires d'attributs},
  year = {1981}
}
Alblas, H. (1981), "A Characterization of Attribute Evaluation in Passes", Acta Informatica. Vol. 16(4), pp. 427-464.
BibTeX:
@article{Alblas81,
  author = {Henk Alblas},
  title = {A Characterization of Attribute Evaluation in Passes},
  journal = {Acta Informatica},
  year = {1981},
  volume = {16},
  number = {4},
  pages = {427--464},
  note = {See also: memorandum 315, Onderafdeling der Informatica, Tech. Hogeschool Twente (September 1980).}
}
Asbrock, B., Kastens, U. & Zimmermann, E. (1981), "Generating an Efficient Compiler Front-End". Institut für Informatik~II, University Karlsruhe, Technical Report 17/81, 1981.
BibTeX:
@techreport{Asbrock81,
  author = {Brigitte Asbrock and Uwe Kastens and Erich Zimmermann},
  title = {Generating an Efficient Compiler Front-End},
  year = {1981},
  number = {17/81}
}
Bartha, M. (1981), "An Algebraic Definition of Attributed Translations". University of Szeged, 1981.
BibTeX:
@techreport{Bartha81,
  author = {M. Bartha},
  title = {An Algebraic Definition of Attributed Translations},
  year = {1981}
}
Bartmuß, G. & Giegerich, R. (1981), "Compiler Development with MUG2---an Introductory Example". Institut für Informatik, Tech. University München, Technical Report TUM-INFO-8102, April, 1981.
BibTeX:
@techreport{Bartmuss81,
  author = {G. Bartmuß and Robert Giegerich},
  title = {Compiler Development with MUG2---an Introductory Example},
  year = {1981},
  number = {TUM-INFO-8102}
}
Bayer, M., Böhringer, B., Dehottay, J.P., Feuerhahn, H., Jasper, J., Koster, C.H.A. & Schmiedecke, U. (1981), "Software Development in the CDL2 Laboratory", In Software Engineering Environments. Amsterdam , pp. 97-118. North-Holland.
BibTeX:
@incollection{Bayer81,
  author = {M. Bayer and B. Böhringer and J. P. Dehottay and H. Feuerhahn and J. Jasper and Cornelius H. A. Koster and U. Schmiedecke},
  title = {Software Development in the CDL2 Laboratory},
  booktitle = {Software Engineering Environments},
  publisher = {North-Holland},
  year = {1981},
  pages = {97--118}
}
Biryukov, A.N., Kurochkin, V.M. & Serebryakov, V.A. (1981), "Structural Attributes and their Implementation in the Translator Writing System SUPER", Akademiya Nauk SSSR. Programmirovanie. Vol. 2, pp. 52-?.
BibTeX:
@article{Biryukov81,
  author = {A. N. Biryukov and V. M. Kurochkin and Vladimir A. Serebryakov},
  title = {Structural Attributes and their Implementation in the Translator Writing System SUPER},
  journal = {Akademiya Nauk SSSR. Programmirovanie},
  year = {1981},
  volume = {2},
  pages = {52--?},
  note = {(in Russian)}
}
Boullier, P. & Ripken, K. (1981), "Building an ADA Compiler following Meta-Compilation Methods", In Séminaires Langages et Traducteurs 1978-1981. Rocquencourt , pp. 99-140. INRIA.
BibTeX:
@incollection{Boullier81,
  author = {Pierre Boullier and Knut Ripken},
  title = {Building an ADA Compiler following Meta-Compilation Methods},
  booktitle = {Séminaires Langages et Traducteurs 1978-1981},
  publisher = {INRIA},
  year = {1981},
  pages = {99--140}
}
Brown, C.A. & Purdom, P.W. (1981), "Specifying One-pass Bottom-up Compilers". Comp. Sc. Department, University of Indiana, July, 1981.
BibTeX:
@techreport{Brown81,
  author = {Cynthia A. Brown and Paul W. Purdom},
  title = {Specifying One-pass Bottom-up Compilers},
  year = {1981}
}
Campbell, R.H. & Richards, P.G. (1981), "SAGA: a System to Automate the Management of Software Production". Department of Comp. Sc., University of Illinois at Urbana-Champaign, Technical Report UIUCDCS-R-81-1048, January, 1981.
BibTeX:
@techreport{Campbell81,
  author = {Roy H. Campbell and P. G. Richards},
  title = {SAGA: a System to Automate the Management of Software Production},
  year = {1981},
  number = {UIUCDCS-R-81-1048},
  note = {Extended Abstract: 1981 National Computer Conf., Chicago, IL, pp. 231-234 (May 1981).}
}
Chebotar, K.S. (1981), "Some Modifications of Knuth's Algorithm for Verifying Cyclicity of Attribute Grammars", Progr. and Computer Software., January, 1981. Vol. 7(1), pp. 58-61.
BibTeX:
@article{Chebotar81,
  author = {K. S. Chebotar},
  title = {Some Modifications of Knuth's Algorithm for Verifying Cyclicity of Attribute Grammars},
  journal = {Progr. and Computer Software},
  year = {1981},
  volume = {7},
  number = {1},
  pages = {58--61}
}
Coleman, D., Hugues, J.W. & Powell, M.S. (1981), "A Method for the Syntax-directed Design of Multiprograms", Institute of Electrical and Electronics Engineers. Transactions on Software Engineering. Vol. SE-7(2), pp. 189-196.
BibTeX:
@article{Coleman81,
  author = {Derek Coleman and Jane W. Hugues and Malcolm S. Powell},
  title = {A Method for the Syntax-directed Design of Multiprograms},
  journal = {Institute of Electrical and Electronics Engineers. Transactions on Software Engineering},
  year = {1981},
  volume = {SE-7},
  number = {2},
  pages = {189--196}
}
Courcelle, B. (1981), "Attribute Grammars: Theory and Applications", In Int. Coll. on Formalization of Programming Concepts. New York--Heidelberg--Berlin, April, 1981. Vol. 107, pp. 75-95. Springer-Verlag.
BibTeX:
@incollection{Courcelle81,
  author = {Bruno Courcelle},
  title = {Attribute Grammars: Theory and Applications},
  booktitle = {Int. Coll. on Formalization of Programming Concepts},
  publisher = {Springer-Verlag},
  year = {1981},
  volume = {107},
  pages = {75--95},
  note = {See also: rapport 8103, University de Bordeaux~I (February 1981).}
}
Demers, A., Reps, T. & Teitelbaum, T. (1981), "Incremental Evaluation for Attribute Grammars with Application to Syntax-directed Editors", In 8th ACM Symp. on Principles of Progr. Languages. Williamsburg, VA, January, 1981. , pp. 105-116. ACM press.
BibTeX:
@incollection{Demers81,
  author = {Alan Demers and Thomas Reps and Tim Teitelbaum},
  title = {Incremental Evaluation for Attribute Grammars with Application to Syntax-directed Editors},
  booktitle = {8th ACM Symp. on Principles of Progr. Languages},
  publisher = {ACM press},
  year = {1981},
  pages = {105--116}
}
Duncan, A.G. & Hutchison, J.S. (1981), "Using Attribute Grammars to test Designs and Implementations", In 5th Int. Conf. on Software Engineering. San Diego, CA, March, 1981. , pp. 170-178.
BibTeX:
@incollection{Duncan81,
  author = {A. G. Duncan and J. S. Hutchison},
  title = {Using Attribute Grammars to test Designs and Implementations},
  booktitle = {5th Int. Conf. on Software Engineering},
  year = {1981},
  pages = {170--178}
}
Engelfriet, J. & Filé, G. (1981), "The Formal Power of One-Visit Attribute Grammars", Acta Informatica. Vol. 16(3), pp. 275-302.
BibTeX:
@article{Engelfriet81,
  author = {Joost Engelfriet and Gilberto Filé},
  title = {The Formal Power of One-Visit Attribute Grammars},
  journal = {Acta Informatica},
  year = {1981},
  volume = {16},
  number = {3},
  pages = {275--302}
}
Engelfriet, J. & Filé, G. (1981), "Passes and Paths of Attribute Grammars", Information and Control., May, 1981. Vol. 49(2), pp. 125-169.
BibTeX:
@article{Engelfriet81a,
  author = {Joost Engelfriet and Gilberto Filé},
  title = {Passes and Paths of Attribute Grammars},
  journal = {Information and Control},
  year = {1981},
  volume = {49},
  number = {2},
  pages = {125--169},
  note = {See also: memorandum 323, Onderafdeling der Informatica, Tech. Hogeschool Twente (1980).}
}
Engelfriet, J. & Filé, G. (1981), "Passes, Sweeps and Visits", In 8th Int. Coll. on Automata, Languages and Programming. New York--Heidelberg--Berlin, July, 1981. Vol. 115, pp. 193-207. Springer-Verlag.
BibTeX:
@incollection{Engelfriet81b,
  author = {Joost Engelfriet and Gilberto Filé},
  title = {Passes, Sweeps and Visits},
  booktitle = {8th Int. Coll. on Automata, Languages and Programming},
  publisher = {Springer-Verlag},
  year = {1981},
  volume = {115},
  pages = {193--207},
  note = {Revised version: memorandum INF-82-6, Onderafdeling der Informatica, Tech. Hogeschool Twente (August 1982).}
}
Fülöp, Z. (1981), "On Attributed Tree Transducers", Acta Cybernetica. Vol. 5, pp. 261-279.
BibTeX:
@article{Fulop81,
  author = {Z. Fülöp},
  title = {On Attributed Tree Transducers},
  journal = {Acta Cybernetica},
  year = {1981},
  volume = {5},
  pages = {261--279}
}
Ganzinger, H. (1981), "Parametrized Specifications: Parameter Passing and Optimizing Implementation". Institut für Informatik, Tech. University München, Technical Report TUM-INFO-8110, August, 1981.
BibTeX:
@techreport{Ganzinger81,
  author = {Harald Ganzinger},
  title = {Parametrized Specifications: Parameter Passing and Optimizing Implementation},
  year = {1981},
  number = {TUM-INFO-8110}
}
Gaudel, M.-C. (1981), "Compiler Generation from Formal Definition of Programming Languages: a Survey", In Int. Coll. on Formalization of Programming Concepts. New York--Heidelberg--Berlin, April, 1981. Vol. 107, pp. 96-114. Springer-Verlag.
BibTeX:
@incollection{Gaudel81,
  author = {Marie-Claude Gaudel},
  title = {Compiler Generation from Formal Definition of Programming Languages: a Survey},
  booktitle = {Int. Coll. on Formalization of Programming Concepts},
  publisher = {Springer-Verlag},
  year = {1981},
  volume = {107},
  pages = {96--114},
  note = {Peniscola}
}
Giegerich, R., Möncke, U. & Wilhelm, R. (1981), "Invariance of Approximative Semantics with Respect to Program Transformations", In GI 11. Jahrestagung. New York--Heidelberg--Berlin. Volume 50, pp. 1-10. Springer-Verlag.
BibTeX:
@inproceedings{Giegerich81,
  author = {Robert Giegerich and Ulrich Möncke and Reinhard Wilhelm},
  title = {Invariance of Approximative Semantics with Respect to Program Transformations},
  booktitle = {GI 11. Jahrestagung},
  publisher = {Springer-Verlag},
  year = {1981},
  volume = {50},
  pages = {1--10}
}
Hartwig, M. (1981), "Attribute Evaluation in two Passes". Institut für Informatik, Akademie der Wissenschaften der DDR, Technical Report P-MATH-29/81, November, 1981.
BibTeX:
@techreport{Hartwig81,
  author = {Martin Hartwig},
  title = {Attribute Evaluation in two Passes},
  year = {1981},
  number = {P-MATH-29/81}
}
Hartwig, M. (1981), "Implementation einer Attribut-Grammatik in SIMULA", In Vorträge der ALGOL-Tagung 1981. Dresden. Schriftreihe des WBZMKRI.
BibTeX:
@inproceedings{Hartwig81a,
  author = {Martin Hartwig},
  title = {Implementation einer Attribut-Grammatik in SIMULA},
  booktitle = {Vorträge der ALGOL-Tagung 1981},
  publisher = {Schriftreihe des WBZMKRI},
  year = {1981}
}
Hoffmann, B. & Schmiedecke, I.-R. (1981), "A Parsing-oriented Derivation Model for Two-level Grammars based on Affix-decorated Parse Trees". Tech. University Berlin, Technical Report 81-2, 1981.
BibTeX:
@techreport{Hoffmann81,
  author = {Berthold Hoffmann and I.-R. Schmiedecke},
  title = {A Parsing-oriented Derivation Model for Two-level Grammars based on Affix-decorated Parse Trees},
  year = {1981},
  number = {81-2}
}
Jazayeri, M. (1981), "A Simpler Construction for Showing the Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars", J. ACM., October, 1981. Vol. 28(4), pp. 715-720.
BibTeX:
@article{Jazayeri81,
  author = {Mehdi Jazayeri},
  title = {A Simpler Construction for Showing the Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars},
  journal = {J. ACM},
  year = {1981},
  volume = {28},
  number = {4},
  pages = {715--720}
}
Jazayeri, M. & Pozefsky, D. (1981), "Space-efficient Storage Management in an Attribute Evaluator", ACM Trans. Progr. Languages and Systems., October, 1981. Vol. 3(4), pp. 388-404.
BibTeX:
@article{Jazayeri81a,
  author = {Mehdi Jazayeri and Diane Pozefsky},
  title = {Space-efficient Storage Management in an Attribute Evaluator},
  journal = {ACM Trans. Progr. Languages and Systems},
  year = {1981},
  volume = {3},
  number = {4},
  pages = {388--404},
  note = {See also: report TR 79-007, Department of Comp. Sc., University of North Carolina, Chapel Hill, NC (May 1979).}
}
Jochum, G. (1981), "Automatische Konstruction und Einheitliche Darstellung von Attributauswertungsalgorithmen". Institut für Informatik, Tech. University München, Technical Report TUM-INFO-8113, June, 1981.
BibTeX:
@techreport{Jochum81,
  author = {G. Jochum},
  title = {Automatische Konstruction und Einheitliche Darstellung von Attributauswertungsalgorithmen},
  year = {1981},
  number = {TUM-INFO-8113}
}
Jochum, G. & Willmertinger, W. (1981), "A Tool for Developing Text Processing Systems: Translator Writing Systems". Institut für Informatik, Tech. University München, Technical Report TUM-INFO-8103, May, 1981.
BibTeX:
@techreport{Jochum81a,
  author = {G. Jochum and W. Willmertinger},
  title = {A Tool for Developing Text Processing Systems: Translator Writing Systems},
  year = {1981},
  number = {TUM-INFO-8103}
}
Jones, N.D. & Schmidt, D.A. (1981), "Compiler Generation from Denotational Semantics", In Séminaires Langages et Traducteurs 1978-1981. Rocquencourt , pp. 51-74. INRIA.
BibTeX:
@incollection{Jones81,
  author = {Neil D. Jones and D. A. Schmidt},
  title = {Compiler Generation from Denotational Semantics},
  booktitle = {Séminaires Langages et Traducteurs 1978-1981},
  publisher = {INRIA},
  year = {1981},
  pages = {51--74}
}
Katayama, T. (1981), "HFP: a Hierarchical and Functional Programming Methodology based on Attribute Grammars", In 5th Int. Conf. on Software Engineering. San Diego, CA, March, 1981. , pp. 343-352.
BibTeX:
@incollection{Katayama81,
  author = {Takuya Katayama},
  title = {HFP: a Hierarchical and Functional Programming Methodology based on Attribute Grammars},
  booktitle = {5th Int. Conf. on Software Engineering},
  year = {1981},
  pages = {343--352},
  note = {Extended version: report CS-K-8102, Tokyo Institute of Technology (January 1981).}
}
Katayama, T. & Hoshino, Y. (1981), "Verification of Attribute Grammars", In 8th ACM Symp. on Principles of Progr. Languages. Williamsburg, VA, January, 1981. , pp. 177-186. ACM press.
BibTeX:
@incollection{Katayama81a,
  author = {Takuya Katayama and Yutaka Hoshino},
  title = {Verification of Attribute Grammars},
  booktitle = {8th ACM Symp. on Principles of Progr. Languages},
  publisher = {ACM press},
  year = {1981},
  pages = {177--186}
}
Koskimies, K. (1981), "An Attribute Grammar for a Subset of the Programming Language Euclid". Department of Comp. Sc., University of Helsinki, 1981.
BibTeX:
@techreport{Koskimies81,
  author = {Kai Koskimies},
  title = {An Attribute Grammar for a Subset of the Programming Language Euclid},
  year = {1981}
}
Lämmel, U. & Schuchardt, K.J. (1981), "Das compilerschreibende System RÜGEN---Rostocker Übersetzer GENerator". School: Sektion Mathematik der W.-Pieck-University. Rostock
Abstract: The compiler-compiler RUGEN based on GSFs is described.
BibTeX:
@phdthesis{Lammel81,
  author = {Uwe Lämmel and K. J. Schuchardt},
  title = {Das compilerschreibende System RÜGEN---Rostocker Übersetzer GENerator},
  school = {Sektion Mathematik der W.-Pieck-University},
  year = {1981}
}
Mayoh, B.H. (1981), "Attribute Grammars and Mathematical Semantics", SIAM Journal on Computing., August, 1981. Vol. 10(3), pp. 503-518.
BibTeX:
@article{Mayoh81,
  author = {Brian H. Mayoh},
  title = {Attribute Grammars and Mathematical Semantics},
  journal = {SIAM Journal on Computing},
  year = {1981},
  volume = {10},
  number = {3},
  pages = {503--518},
  note = {See also: report DAIMI PB-90, Comp. Sc. Department, Aarhus University (August 1978).}
}
Méristé, M.B. (1981), "Combining the Evaluation of Attributes with Parsing", In Abstracts of Papers at the Soviet Conf. on Translation Methods. Novosibirsk , pp. 103-105.
BibTeX:
@incollection{Meriste81,
  author = {Merik B. Méristé},
  title = {Combining the Evaluation of Attributes with Parsing},
  booktitle = {Abstracts of Papers at the Soviet Conf. on Translation Methods},
  year = {1981},
  pages = {103--105},
  note = {(in Russian)Published as Akademiya Nauk SSSR. Sibirskoe Otdelenie. Vychislitel'nyu ı  Tsentr. Preprint}
}
Papakonstantinou, G.K. (1981), "An Interpreter of Attribute Grammars and its Application to Waveform Analysis", Institute of Electrical and Electronics Engineers. Transactions on Software Engineering., May, 1981. Vol. SE-7(3), pp. 279-283.
BibTeX:
@article{Papakonstantin81,
  author = {George K. Papakonstantinou},
  title = {An Interpreter of Attribute Grammars and its Application to Waveform Analysis},
  journal = {Institute of Electrical and Electronics Engineers. Transactions on Software Engineering},
  year = {1981},
  volume = {SE-7},
  number = {3},
  pages = {279--283}
}
Papakonstantinou, G.K. & Gritzali, F. (1981), "Syntactic Filtering of ECG Waveforms", Comput. and Biomed. Res.. Vol. 14, pp. 158-167.
BibTeX:
@article{Papakonstantin81a,
  author = {George K. Papakonstantinou and F. Gritzali},
  title = {Syntactic Filtering of ECG Waveforms},
  journal = {Comput. and Biomed. Res.},
  year = {1981},
  volume = {14},
  pages = {158--167}
}
Paulson, L. (1981), "A Compiler Generator for Semantic Grammars". School: Department of Comp. Sc., Stanford University. (report STAN-CS-82-893)
BibTeX:
@phdthesis{Paulson81,
  author = {Larry Paulson},
  title = {A Compiler Generator for Semantic Grammars},
  school = {Department of Comp. Sc., Stanford University},
  year = {1981},
  number = {report STAN-CS-82-893}
}
Räihä, K.-J. (1981), "A Space Management Technique for Multi-pass Attribute Evaluators". School: Department of Comp. Sc., University of Helsinki., September, 1981. (report A-1981-4)
BibTeX:
@phdthesis{Raiha81,
  author = {Kari-Jouko Räihä},
  title = {A Space Management Technique for Multi-pass Attribute Evaluators},
  school = {Department of Comp. Sc., University of Helsinki},
  year = {1981},
  number = {report A-1981-4}
}
Räihä, K.-J. & Ukkonen, E. (1981), "Minimizing the Number of Evaluation Passes for Attribute Grammars", SIAM Journal on Computing., November, 1981. Vol. 10(4), pp. 772-786.
BibTeX:
@article{Raiha81a,
  author = {Kari-Jouko Räihä and Esko Ukkonen},
  title = {Minimizing the Number of Evaluation Passes for Attribute Grammars},
  journal = {SIAM Journal on Computing},
  year = {1981},
  volume = {10},
  number = {4},
  pages = {772--786},
  note = {See also: report C-1979-121, Department of Comp. Sc., University of Helsinki (1979).}
}
Riis-Nielson, H. (1981), "Using Computation Sequences to Define Evaluators for Attribute Grammars". Comp. Sc. Department, Aarhus University, Technical Report PB-139, 1981.
Abstract: An evaluator for an attribute grammar takes a derivation tree as input and produces a computation sequence for it as output. We give a simple but general construction of an evaluator for any well-defined attribute grammar and we prove its correctness. Evaluators for seueral subclasses of attribute grammars can be constructed by changing a preprocessing stage of the evaluator.
BibTeX:
@techreport{Riis-Nielson81,
  author = {Hanne Riis-Nielson},
  title = {Using Computation Sequences to Define Evaluators for Attribute Grammars},
  year = {1981},
  number = {PB-139}
}
Riis-Nielson, H. & Skyum, S. (1981), "$k$-visit Attribute Grammars", Mathematical Systems Theory., December, 1981. Vol. 15(1), pp. 17-28.
BibTeX:
@article{Riis-Nielson81a,
  author = {Hanne Riis-Nielson and Sven Skyum},
  title = {$k$-visit Attribute Grammars},
  journal = {Mathematical Systems Theory},
  year = {1981},
  volume = {15},
  number = {1},
  pages = {17--28},
  note = {See also: report DAIMI PB-121, Comp. Sc. Department, Aarhus University (June 1980).}
}
Nielson, H.R. (1981), "Computation sequences: A way to characterize subclasses of attribute grammars". Comp. Sc. Department, Aarhus University, Technical Report DAIMI PB-138, November, 1981.
Abstract: A computation sequence for a derivation tree specifies a way of walking through the tree evaluating all the attributes of all nodes. By requiring that each derivation tree has a computation sequence with a certain property, it is possible to give simple characterizations of well-known subclasses of attribute grammars. Especially the absolutely well-defined attribute grammars are considered.
BibTeX:
@techreport{Riis-Nielson81b,
  author = {Hanne Riis Nielson},
  title = {Computation sequences: A way to characterize subclasses of attribute grammars},
  year = {1981},
  number = {DAIMI PB-138}
}
Schramm, J.-M. (1981), "Un formalisme pour la description des langages et des traducteurs". Centre de Calcul de l'Esplanade, University Louis Pasteur, November, 1981.
BibTeX:
@techreport{Schramm81,
  author = {Jean-Marie Schramm},
  title = {Un formalisme pour la description des langages et des traducteurs},
  year = {1981}
}
Teitelbaum, T. & Reps, T. (1981), "The Cornell Program Synthesizer: a Syntax-directed Programming Environment", Communications of the Association for Computing Machinery., September, 1981. Vol. 24(9), pp. 563-573.
BibTeX:
@article{Teitelbaum81,
  author = {Tim Teitelbaum and Thomas Reps},
  title = {The Cornell Program Synthesizer: a Syntax-directed Programming Environment},
  journal = {Communications of the Association for Computing Machinery},
  year = {1981},
  volume = {24},
  number = {9},
  pages = {563--573},
  note = {See also: report TR 80-421, Department of Comp. Sc., Cornell University, Ithaca, NY (May 1980).}
}
Teitelbaum, T., Reps, T. & Horwitz, S. (1981), "The Why and Wherefore of the Cornell Program Synthesizer", ACM SIGPLAN Notices., June, 1981. Vol. 16(6), pp. 8-16.
BibTeX:
@article{Teitelbaum81a,
  author = {Tim Teitelbaum and Thomas Reps and Susan Horwitz},
  title = {The Why and Wherefore of the Cornell Program Synthesizer},
  journal = {ACM SIGPLAN Notices},
  year = {1981},
  volume = {16},
  number = {6},
  pages = {8--16}
}
Tokuda, T. (1981), "An Exercise in Transforming Wijngaarden Grammars into Knuthian Grammars". Department of Comp. Sc., Tokyo Inst. of Technology, Technical Report C-40, 1981.
BibTeX:
@techreport{Tokuda81,
  author = {Takehiro Tokuda},
  title = {An Exercise in Transforming Wijngaarden Grammars into Knuthian Grammars},
  year = {1981},
  number = {C-40}
}
Vogler, H. (1981), "Berechnungsmodelle syntaxgesteuerter Übersetzungen". School: Lehrstuhl für Angewandte Informatik, Rheinisch-Westfälische Tech. Hoschschule Aachen., April, 1981.
BibTeX:
@phdthesis{Vogler81,
  author = {H. Vogler},
  title = {Berechnungsmodelle syntaxgesteuerter Übersetzungen},
  school = {Lehrstuhl für Angewandte Informatik, Rheinisch-Westfälische Tech. Hoschschule Aachen},
  year = {1981}
}
Wilhelm, R. (1981), "Global Flow Analysis and Optimization in the MUG2 Compiler Generating System", In Program Flow Analysis: Theory and Applications. Englewood Cliffs, NJ , pp. 141-159. Prentice-Hall.
BibTeX:
@incollection{Wilhelm81,
  author = {Reinhard Wilhelm},
  title = {Global Flow Analysis and Optimization in the MUG2 Compiler Generating System},
  booktitle = {Program Flow Analysis: Theory and Applications},
  publisher = {Prentice-Hall},
  year = {1981},
  pages = {141--159}
}
Williams, M.H. (1981), "Methods for Specifying Static Semantics", Comput. Lang.. Vol. 6(1), pp. 1-17.
BibTeX:
@article{Williams81,
  author = {M. H. Williams},
  title = {Methods for Specifying Static Semantics},
  journal = {Comput. Lang.},
  year = {1981},
  volume = {6},
  number = {1},
  pages = {1--17}
}
Barbar, K. (1982), "Étude comparative de différentes classes de grammaires d'attributs ordonnées". University de Bordeaux~I, June, 1982.
BibTeX:
@techreport{Barbar82,
  author = {Kablan Barbar},
  title = {Étude comparative de différentes classes de grammaires d'attributs ordonnées},
  year = {1982}
}
Bazzichi, F. & Spadafora, I. (1982), "An Automatic Generator for Compiler Testing", Institute of Electrical and Electronics Engineers. Transactions on Software Engineering., July, 1982. Vol. SE--8(4), pp. 343-353.
BibTeX:
@article{Bazzichi82,
  author = {Franco Bazzichi and Ippolito Spadafora},
  title = {An Automatic Generator for Compiler Testing},
  journal = {Institute of Electrical and Electronics Engineers. Transactions on Software Engineering},
  year = {1982},
  volume = {SE--8},
  number = {4},
  pages = {343--353}
}
Begwani, V.S. (1982), "New Approach for Attribute Evaluation and Error Correction in Compilers". Comp. Sc. Department, University of Wisconsin-Madison, Technical Report \#483, 1982.
BibTeX:
@techreport{Begwani82,
  author = {V. S. Begwani},
  title = {New Approach for Attribute Evaluation and Error Correction in Compilers},
  year = {1982},
  number = {483}
}
Boccalatte, A., Di Manzo, M. & Sciarra, D. (1982), "Error Recovery with Attribute Grammars", The Computer Journal., August, 1982. Vol. 25(3), pp. 331-336.
BibTeX:
@article{Boccalatte82,
  author = {A. Boccalatte and M. Di Manzo and D. Sciarra},
  title = {Error Recovery with Attribute Grammars},
  journal = {The Computer Journal},
  year = {1982},
  volume = {25},
  number = {3},
  pages = {331--336}
}
Bodwin, J., Bradley, L., Kanda, K., Litle, D. & Pleban, U. (1982), "Experience with an Experimental Compiler Generator based on Denotational Semantics", In ACM SIGPLAN '82 Symp. on Compiler Construction. Boston, MA, June, 1982. , pp. 216-229. ACM press.
BibTeX:
@incollection{Bodwin82,
  author = {J. Bodwin and L. Bradley and K. Kanda and D. Litle and Uwe Pleban},
  title = {Experience with an Experimental Compiler Generator based on Denotational Semantics},
  booktitle = {ACM SIGPLAN '82 Symp. on Compiler Construction},
  publisher = {ACM press},
  year = {1982},
  pages = {216--229},
  note = {Published as ACM SIGPLAN Notices, volume 17, number 6}
}
Courcelle, B. & Franchi-Zannettacci, P. (1982), "Attribute Grammars and Recursive Program Schemes", Theoretical Computer Science. Vol. 17(2 and 3), pp. 163-191 and 235-257.
BibTeX:
@article{Courcelle82,
  author = {Bruno Courcelle and Paul Franchi-Zannettacci},
  title = {Attribute Grammars and Recursive Program Schemes},
  journal = {Theoretical Computer Science},
  year = {1982},
  volume = {17},
  number = {2 and 3},
  pages = {163--191 and 235--257},
  note = {part I and II See also: rapport 8008, University de Bordeaux~I (April 1980).}
}
Deschamp, P. (1982), "Perluette: a Compilers Producing System using Abstract Data Types", In 5th Int. Symp. on Programming. New York--Heidelberg--Berlin, April, 1982. Vol. 137, pp. 63-77. Springer-Verlag.
BibTeX:
@incollection{Deschamp82,
  author = {Philippe Deschamp},
  title = {Perluette: a Compilers Producing System using Abstract Data Types},
  booktitle = {5th Int. Symp. on Programming},
  publisher = {Springer-Verlag},
  year = {1982},
  volume = {137},
  pages = {63--77},
  note = {Torino}
}
Drossopoulos, S., Uhl, J., Persch, G., Goos, G., Dausmann, M. & Winterstein, G. (1982), "An Attribute Grammar for ADA", In ACM SIGPLAN '82 Conf. on Compiler Construction. Boston, MA, June, 1982. , pp. 334-349. ACM press.
BibTeX:
@incollection{Drossopoulos82,
  author = {S. Drossopoulos and J. Uhl and G. Persch and G. Goos and M. Dausmann and G. Winterstein},
  title = {An Attribute Grammar for ADA},
  booktitle = {ACM SIGPLAN '82 Conf. on Compiler Construction},
  publisher = {ACM press},
  year = {1982},
  pages = {334--349},
  note = {Published as ACM SIGPLAN Notices, volume 17, number 6}
}
Engelfriet, J. (1982), "Automata for Attribute Grammars". , November, 1982.
BibTeX:
@techreport{Engelfriet82,
  author = {Joost Engelfriet},
  title = {Automata for Attribute Grammars},
  year = {1982}
}
Engelfriet, J. (1982), "Tree Transducers and Syntax-directed Semantics", In 7th Coll. on Trees in Algebra and Programming (CAAP '82). Lille, March, 1982. , pp. 82-107.
BibTeX:
@incollection{Engelfriet82a,
  author = {Joost Engelfriet},
  title = {Tree Transducers and Syntax-directed Semantics},
  booktitle = {7th Coll. on Trees in Algebra and Programming (CAAP '82)},
  year = {1982},
  pages = {82--107},
  note = {See also: memorandum 363, Onderafdeling der Informatica, Tech. Hogeschool Twente (1981).}
}
Engelfriet, J. & Filé, G. (1982), "Simple Multi-Visit Attribute Grammars", Journal of Computer and System Sciences., June, 1982. Vol. 24(3), pp. 283-314.
BibTeX:
@article{Engelfriet82b,
  author = {Joost Engelfriet and Gilberto Filé},
  title = {Simple Multi-Visit Attribute Grammars},
  journal = {Journal of Computer and System Sciences},
  year = {1982},
  volume = {24},
  number = {3},
  pages = {283--314},
  note = {See also: memorandum 314, Onderafdeling der Informatica, Tech. Hogeschool Twente (August 1980).}
}
Farrow, R. (1982), "Experience with an Attribute Grammar based Compiler", In 9th ACM Symp. on Principles of Progr. Languages. Albuquerque, NM, January, 1982. , pp. 95-107. ACM press.
BibTeX:
@incollection{Farrow82,
  author = {Rodney Farrow},
  title = {Experience with an Attribute Grammar based Compiler},
  booktitle = {9th ACM Symp. on Principles of Progr. Languages},
  publisher = {ACM press},
  year = {1982},
  pages = {95--107}
}
Farrow, R. (1982), "LINGUIST-86 Yet Another Translator Writing System based on Attribute Grammars", In ACM SIGPLAN '82 Symp. on Compiler Construction. Boston, MA, June, 1982. , pp. 160-171. ACM press.
Abstract: LINGUIST-86 is a commercially-developed translator-writing-system based on attribute grammars~teKnuth:mst:1968,Knuth:mst:1971. From an input attribute grammar it generates a set of high-level language source modules that form an alternating pass attribute grammar evaluator~teJazayeri:Walter:1975. LINGUIST-86 generates attribute evaluators efficient enough to run on a microcomputer at speeds competitive with other translators on the system. The Attributed Program Tree is kept on secondary storage rather than in randomly-accessed memory, thus allowing non-trivial inputs to be evaluated on a microcomputer system. LINGUIST-86 also applies an optimization called static subsumption that eliminates many copy-rules from the generated evaluators. LINGUIST-86 is itself written as an 1800 line attribute grammar and is self generating.
BibTeX:
@incollection{Farrow82a,
  author = {Rodney Farrow},
  title = {LINGUIST-86 Yet Another Translator Writing System based on Attribute Grammars},
  booktitle = {ACM SIGPLAN '82 Symp. on Compiler Construction},
  publisher = {ACM press},
  year = {1982},
  pages = {160--171},
  note = {Published as ACM SIGPLAN Notices, volume 17, number 6}
}
Franchi-Zannettacci, P. (1982), "Attributs sémantiques et schémas de programmes". University de Bordeaux~I, March, 1982.
BibTeX:
@techreport{Franchi-Zannet82,
  author = {Paul Franchi-Zannettacci},
  title = {Attributs sémantiques et schémas de programmes},
  year = {1982}
}
Ganapathi, M. & Fischer, C.N. (1982), "Description-driven Code Generation using Attribute Grammars", In 9th ACM Symp. on Principles of Progr. Languages. Albuquerque, NM, January, 1982. , pp. 108-119. ACM press.
BibTeX:
@incollection{Ganapathi82,
  author = {Mahadevan Ganapathi and Charles N. Fischer},
  title = {Description-driven Code Generation using Attribute Grammars},
  booktitle = {9th ACM Symp. on Principles of Progr. Languages},
  publisher = {ACM press},
  year = {1982},
  pages = {108--119}
}
Gansner, E., Horgan, T.R., Kintala, C.M.R., Moore, D.J. & Surko, P. (1982), "Semantics and Correctness of a Query Language Translation", In 9th ACM Symp. on Principles of Progr. Languages. Albuquerque, NM, January, 1982. , pp. 289-298. ACM press.
BibTeX:
@incollection{Gansner82,
  author = {E. Gansner and T. R. Horgan and Chandra M. R. Kintala and D. J. Moore and P. Surko},
  title = {Semantics and Correctness of a Query Language Translation},
  booktitle = {9th ACM Symp. on Principles of Progr. Languages},
  publisher = {ACM press},
  year = {1982},
  pages = {289--298}
}
Ganzinger, H. (1982), "An Overview of the Attribute Definition Language ADELE", In GI 3. Fachgespräch ``Compiler-Compiler''. München, March, 1982. , pp. 22-53.
BibTeX:
@incollection{Ganzinger82,
  author = {Harald Ganzinger},
  title = {An Overview of the Attribute Definition Language ADELE},
  booktitle = {GI 3. Fachgespräch ``Compiler-Compiler''},
  year = {1982},
  pages = {22--53}
}
Ganzinger, H., Giegerich, R., Möncke, U. & Wilhelm, R. (1982), "A Truly Generative Semantics-directed Compiler Generator", In ACM SIGPLAN '82 Symp. on Compiler Construction. Boston, MA, June, 1982. , pp. 172-184. ACM press.
BibTeX:
@incollection{Ganzinger82a,
  author = {Harald Ganzinger and Robert Giegerich and Ulrich Möncke and Reinhard Wilhelm},
  title = {A Truly Generative Semantics-directed Compiler Generator},
  booktitle = {ACM SIGPLAN '82 Symp. on Compiler Construction},
  publisher = {ACM press},
  year = {1982},
  pages = {172--184},
  note = {Published as sl ACM SIGPLAN Notices, 17(6)}
}
Giegerich, R. (1982), "Automatic Generation of Machine-specific Code Optimizers", In 9th ACM Symp. on Principles of Progr. Languages. Albuquerque, NM, January, 1982. , pp. 75-81. ACM press.
BibTeX:
@incollection{Giegerich82,
  author = {Robert Giegerich},
  title = {Automatic Generation of Machine-specific Code Optimizers},
  booktitle = {9th ACM Symp. on Principles of Progr. Languages},
  publisher = {ACM press},
  year = {1982},
  pages = {75--81}
}
Göttler, H. (1982), "Attributed Graph Grammars for Graphics", In Graph Grammars and their Application to Computer Science. New York--Heidelberg--Berlin, October, 1982. Vol. 153, pp. 130-142. Springer-Verlag.
BibTeX:
@incollection{Gottler82,
  author = {Herbert Göttler},
  title = {Attributed Graph Grammars for Graphics},
  booktitle = {Graph Grammars and their Application to Computer Science},
  publisher = {Springer-Verlag},
  year = {1982},
  volume = {153},
  pages = {130--142},
  note = {Haus Ohrbeck}
}
Hiitola, K. (1982), "An Attribute Grammar for the Static Semantics of Pascal". Department of Comp. Sc., University of Helsinki, Technical Report C-1982-28, 1982.
BibTeX:
@techreport{Hiitola82,
  author = {K. Hiitola},
  title = {An Attribute Grammar for the Static Semantics of Pascal},
  year = {1982},
  number = {C-1982-28},
  note = {(in Finnish)}
}
Hoffmann, B. (1982), "Modelling Compiler Generation by Graph Grammars", In Graph Grammars and their Application to Computer Science. New York--Heidelberg--Berlin, October, 1982. Vol. 153, pp. 159-171. Springer-Verlag.
BibTeX:
@incollection{Hoffmann82,
  author = {Berthold Hoffmann},
  title = {Modelling Compiler Generation by Graph Grammars},
  booktitle = {Graph Grammars and their Application to Computer Science},
  publisher = {Springer-Verlag},
  year = {1982},
  volume = {153},
  pages = {159--171},
  note = {Haus Ohrbeck}
}
Hoffmann, B. (1982), "Using Abstract Data Types in Two-Level Grammars: a Case Study", In GI 3. Fachgespräch ``Compiler-Compiler''. München, March, 1982. , pp. 105-119.
BibTeX:
@incollection{Hoffmann82a,
  author = {Berthold Hoffmann},
  title = {Using Abstract Data Types in Two-Level Grammars: a Case Study},
  booktitle = {GI 3. Fachgespräch ``Compiler-Compiler''},
  year = {1982},
  pages = {105--119}
}
Jalili, F. (1982), "Design of Incremental Compilers". School: Department of Comp. Inf. Sc., Moore School of Elec. Eng. D2, University of Pennsylvania. Philadelphia, PA
BibTeX:
@phdthesis{Jalili82,
  author = {Fahimeh Jalili},
  title = {Design of Incremental Compilers},
  school = {Department of Comp. Inf. Sc., Moore School of Elec. Eng. D2, University of Pennsylvania},
  year = {1982}
}
Jochum, G. (1982), "Effiziente Attributauswertung durch Kombination Verschiedener Strategien", In GI 3. Fachgespräch ``Compiler-Compiler''. München, March, 1982. , pp. 54-74.
BibTeX:
@incollection{Jochum82,
  author = {G. Jochum},
  title = {Effiziente Attributauswertung durch Kombination Verschiedener Strategien},
  booktitle = {GI 3. Fachgespräch ``Compiler-Compiler''},
  year = {1982},
  pages = {54--74}
}
Johnson, G.F. & Fischer, C.N. (1982), "Non-syntactic Attribute Flow in Language based Editors", In 9th ACM Symp. on Principles of Progr. Languages. Albuquerque, NM, January, 1982. , pp. 185-195. ACM press.
BibTeX:
@incollection{Johnson82,
  author = {Gregory F. Johnson and Charles N. Fischer},
  title = {Non-syntactic Attribute Flow in Language based Editors},
  booktitle = {9th ACM Symp. on Principles of Progr. Languages},
  publisher = {ACM press},
  year = {1982},
  pages = {185--195}
}
Jourdan, M. (1982), "Un évaluateur efficace pour les grammaires attribuées fortement non-circulaires". Laboratoire d'Informatique Théorique et Programmation, Technical Report 82-39, September, 1982.
BibTeX:
@techreport{Jourdan82,
  author = {Martin Jourdan},
  title = {Un évaluateur efficace pour les grammaires attribuées fortement non-circulaires},
  year = {1982},
  number = {82-39}
}
Juutinen, L. (1982), "An Attribute Grammar for a Subset of Ada". Department of Comp. Sc., University of Helsinki, Technical Report C-1982-91, 1982.
BibTeX:
@techreport{Juutinen82,
  author = {L. Juutinen},
  title = {An Attribute Grammar for a Subset of Ada},
  year = {1982},
  number = {C-1982-91},
  note = {(in Finnish)}
}
Kastens, U., Hutt, B. & Zimmermann, E. (1982), "GAG: A Practical Compiler Generator" New York--Heidelberg--Berlin Vol. 141 Springer-Verlag.
BibTeX:
@book{Kastens82,
  author = {Uwe Kastens and Brigitte Hutt and Erich Zimmermann},
  title = {GAG: A Practical Compiler Generator},
  publisher = {Springer-Verlag},
  year = {1982},
  volume = {141}
}
Kontos, J. (1982), "Syntax-Directed Plan Recognition with a Microcomputer", Microprocessing and Microprogramming. Vol. 9, pp. 277-279.
BibTeX:
@article{Kontos82,
  author = {John Kontos},
  title = {Syntax-Directed Plan Recognition with a Microcomputer},
  journal = {Microprocessing and Microprogramming},
  year = {1982},
  volume = {9},
  pages = {277--279}
}
Kontos, J. & Papakonstantinou, G.K. (1982), "The Interpretation of Meta-grammars Describing Syntax-directed Interpreters using an Attribute Grammar Interpreter", Institute of Electrical and Electronics Engineers. Transactions on Software Engineering. Vol. SE-8(4), pp. 435-436.
BibTeX:
@article{Kontos82a,
  author = {John Kontos and George K. Papakonstantinou},
  title = {The Interpretation of Meta-grammars Describing Syntax-directed Interpreters using an Attribute Grammar Interpreter},
  journal = {Institute of Electrical and Electronics Engineers. Transactions on Software Engineering},
  year = {1982},
  volume = {SE-8},
  number = {4},
  pages = {435--436}
}
Koskimies, K. (1982), "An Experience on Language Implementation using Attribute Grammars". Department of Comp. Sc., University of Helsinki, Technical Report A-1982-2, March, 1982.
BibTeX:
@techreport{Koskimies82,
  author = {Kai Koskimies},
  title = {An Experience on Language Implementation using Attribute Grammars},
  year = {1982},
  number = {A-1982-2}
}
Koskimies, K., Räihä, K.-J. & Sarjakoski, M. (1982), "Compiler Construction using Attribute Grammars", In ACM SIGPLAN '82 Symp. on Compiler Construction. Boston, MA, June, 1982. , pp. 153-159. ACM press.
Abstract: The adequacy of attribute grammars as a compiler writing tool is studied on the basis of the experiences on attribute grammars for Pascal and a subset of Euclid. A qualitative assessment of the grammar shows that the compiler oriented view in the design of an attribute grammar tends to make the grammar hard to understand. A design discipline is proposed to improve the comprehensibility of the grammar. Quantitive measurements of the automatically generated compilers suggest that an efficient compiler can be produced from an attribute grammar. To achieve this, a careful optimized implementation of the compiler-compiler is required.
BibTeX:
@incollection{Koskimies82a,
  author = {Kai Koskimies and Kari-Jouko Räihä and Matti Sarjakoski},
  title = {Compiler Construction using Attribute Grammars},
  booktitle = {ACM SIGPLAN '82 Symp. on Compiler Construction},
  publisher = {ACM press},
  year = {1982},
  pages = {153--159},
  note = {Published as ACM SIGPLAN Notices, volume 17, number 6}
}
Kruszewski, M., Kupiecki, D. & Winiewski, J. (1982), "A Resident-Compiler Production Method and its Implementation". Institute of Mathematical Machines---MERA, February, 1982.
BibTeX:
@techreport{Kruszewski82,
  author = {Marek Kruszewski and Dariusz Kupiecki and Julian Winiewski},
  title = {A Resident-Compiler Production Method and its Implementation},
  year = {1982}
}
Makarov, V.P. (1982), "Syntax-directed Translation in the SAGET Translator Writing System", Preprint IM Akad. Nauk BSSR. Vol. 127
BibTeX:
@article{Makarov82,
  author = {V. P. Makarov},
  title = {Syntax-directed Translation in the SAGET Translator Writing System},
  journal = {Preprint IM Akad. Nauk BSSR},
  year = {1982},
  volume = {127}
}
Meijer, H. & Nijholt, A. (1982), "Translator Writing Tools since 1970: a Selective Bibliography", ACM SIGPLAN Notices., October, 1982. Vol. 17(10), pp. 62-72.
BibTeX:
@article{Meijer82,
  author = {Hans Meijer and Anton Nijholt},
  title = {Translator Writing Tools since 1970: a Selective Bibliography},
  journal = {ACM SIGPLAN Notices},
  year = {1982},
  volume = {17},
  number = {10},
  pages = {62--72}
}
Möncke, U. & Wilhelm, R. (1982), "Iterative Algorithms on Grammar Graphs", In Conf. on Graphtheoretic Concepts in Computer Science (WG '82). München, June, 1982. , pp. 177-194. Hanser Verlag.
BibTeX:
@incollection{Moncke82,
  author = {Ulrich Möncke and Reinhard Wilhelm},
  title = {Iterative Algorithms on Grammar Graphs},
  booktitle = {Conf. on Graphtheoretic Concepts in Computer Science (WG '82)},
  publisher = {Hanser Verlag},
  year = {1982},
  pages = {177--194},
  note = {Neunkirchen a.Br.}
}
Morgan, S.P. (1982), "Formal Specification of Static Semantics with an Affix Grammar Translator Generator". IBM T.J. Watson Research Center, Technical Report 9456, 1982.
BibTeX:
@techreport{Morgan82,
  author = {S. P. Morgan},
  title = {Formal Specification of Static Semantics with an Affix Grammar Translator Generator},
  year = {1982},
  number = {9456}
}
Nurmi, O., Sarjakoski, M. & Sippu, S. (1982), "The HLP84 Project". Department of Comp. Sc., University of Helsinki, March, 1982.
BibTeX:
@techreport{Nurmi82,
  author = {Otto Nurmi and Matti Sarjakoski and Seppo Sippu},
  title = {The HLP84 Project},
  year = {1982}
}
Obaïd, A. (1982), "Évaluateurs optimisés pour les grammaires d'attributs fortement non-circulaires". University de Bordeaux~I, June, 1982.
BibTeX:
@techreport{Obaid82,
  author = {A. Obaïd},
  title = {Évaluateurs optimisés pour les grammaires d'attributs fortement non-circulaires},
  year = {1982}
}
Papakonstantinou, G.K. & Skordalakis, E. (1982), "Normal ECG Pattern Generation using an Attribute Grammar", In 6th Int. Conf. on Pattern Recognition. München, October, 1982. , pp. 696-698.
BibTeX:
@incollection{Papakonstantin82,
  author = {George K. Papakonstantinou and E. Skordalakis},
  title = {Normal ECG Pattern Generation using an Attribute Grammar},
  booktitle = {6th Int. Conf. on Pattern Recognition},
  year = {1982},
  pages = {696--698}
}
Paulson, L. (1982), "A Semantics-directed Compiler Generator", In 9th ACM Symp. on Principles of Progr. Languages. Albuquerque, NM, January, 1982. , pp. 224-233. ACM press.
BibTeX:
@incollection{Paulson82,
  author = {Larry Paulson},
  title = {A Semantics-directed Compiler Generator},
  booktitle = {9th ACM Symp. on Principles of Progr. Languages},
  publisher = {ACM press},
  year = {1982},
  pages = {224--233}
}
Payton, T.F., Keller, S.E., Perkins, J.A., Rowan, S. & Mardinly, S.P. (1982), "Design Level Debugging of Attribute Grammars". SDC---a Burroughs Company, 1982.
BibTeX:
@techreport{Payton82,
  author = {Teri F. Payton and S. E. Keller and J. A. Perkins and S. Rowan and S. P. Mardinly},
  title = {Design Level Debugging of Attribute Grammars},
  year = {1982}
}
Payton, T.F., Keller, S.E., Perkins, J.A., Rowan, S. & Mardinly, S.P. (1982), "SSAGS, a Syntax and Semantics Analysis and Generation System", In IEEE COMPSAC '82. Chicago, Il, November, 1982. , pp. 424-432.
BibTeX:
@incollection{Payton82a,
  author = {Teri F. Payton and S. E. Keller and J. A. Perkins and S. Rowan and S. P. Mardinly},
  title = {SSAGS, a Syntax and Semantics Analysis and Generation System},
  booktitle = {IEEE COMPSAC '82},
  year = {1982},
  pages = {424--432}
}
Räihä, K.-J. & Saarinen, M. (1982), "Testing Attribute Grammars for Circularity", Acta Informatica. Vol. 17(2), pp. 185-192.
BibTeX:
@article{Raiha82,
  author = {Kari-Jouko Räihä and Mikko Saarinen},
  title = {Testing Attribute Grammars for Circularity},
  journal = {Acta Informatica},
  year = {1982},
  volume = {17},
  number = {2},
  pages = {185--192}
}
Reps, T. (1982), "Optimal-time Incremental Semantic Analysis for Syntax-directed Editors", In 9th ACM Symp. on Principles of Progr. Languages. Albuquerque, NM, January, 1982. , pp. 169-176. ACM press.
Abstract: Attribute grammars permit the specification of static semantics in an applicative and modular fashion, and thus are a good basis for syntax directed editors. Such editors represent programs as attributed trees, which are modified by operations such as sub-tree pruning and grafting. After each modification, a subset of attributes, AFFECTED, requires new values. Membership in AFFECTED is not known a priori; this paper presents an algorithm that identifies attributes in AFFECTED and computes their new values. The algorithm is time-optimal, its cost is proportional to the size of AFFECTED.
BibTeX:
@incollection{Reps82,
  author = {Thomas Reps},
  title = {Optimal-time Incremental Semantic Analysis for Syntax-directed Editors},
  booktitle = {9th ACM Symp. on Principles of Progr. Languages},
  publisher = {ACM press},
  year = {1982},
  pages = {169--176}
}
Ridjanovic, D. & Brodie, M.L. (1982), "Defining Database Dynamics with Attribute Grammars", Information Processing Letters., May, 1982. Vol. 14(3), pp. 132-138.
BibTeX:
@article{Ridjanovic82,
  author = {Dzenan Ridjanovic and Michael L. Brodie},
  title = {Defining Database Dynamics with Attribute Grammars},
  journal = {Information Processing Letters},
  year = {1982},
  volume = {14},
  number = {3},
  pages = {132--138}
}
Sarjakoski, M. (1982), "Space Management for Attributes in the Compiler Writing System HLP". Department of Comp. Sc., University of Helsinki, Technical Report C-1982-10, 1982.
BibTeX:
@techreport{Sarjakoski82,
  author = {Matti Sarjakoski},
  title = {Space Management for Attributes in the Compiler Writing System HLP},
  year = {1982},
  number = {C-1982-10},
  note = {(in Finnish)}
}
Serebryakov, V.A. (1982), "Principal Features of the Input Language and Implementation of the Translator Design System SUPER", Progr. and Computer Software., January, 1982. Vol. 8(1), pp. 52-56.
BibTeX:
@article{Serebryakov82,
  author = {Vladimir A. Serebryakov},
  title = {Principal Features of the Input Language and Implementation of the Translator Design System SUPER},
  journal = {Progr. and Computer Software},
  year = {1982},
  volume = {8},
  number = {1},
  pages = {52--56}
}
Sethi, R. (1982), "Pebble Games for Studying Storage Sharing", Theoretical Computer Science. Vol. 19, pp. 69-84.
BibTeX:
@article{Sethi82,
  author = {Ravi Sethi},
  title = {Pebble Games for Studying Storage Sharing},
  journal = {Theoretical Computer Science},
  year = {1982},
  volume = {19},
  pages = {69--84}
}
Shi, Q.Y. & Fu, K.-S. (1982), "Efficient Error-correcting Parsing for (Attributed and Stochastic) Tree Grammars", Information Sciences. An International Journal., March, 1982. Vol. 26(2), pp. 159-188.
BibTeX:
@article{Shi82,
  author = {Q. Y. Shi and King-Sun Fu},
  title = {Efficient Error-correcting Parsing for (Attributed and Stochastic) Tree Grammars},
  journal = {Information Sciences. An International Journal},
  year = {1982},
  volume = {26},
  number = {2},
  pages = {159--188}
}
Stepanov, A.N. & Popov, Y.A. (1982), "Realization of Syntax-directed Translation Scheme", Progr. and Computer Software. Vol. 8(4), pp. 205-213.
BibTeX:
@article{Stepanov82,
  author = {A. N. Stepanov and Y. A. Popov},
  title = {Realization of Syntax-directed Translation Scheme},
  journal = {Progr. and Computer Software},
  year = {1982},
  volume = {8},
  number = {4},
  pages = {205--213}
}
Tarhio, J. (1982), "Attribute Evaluation during LR parsing". Department of Comp. Sc., University of Helsinki, Technical Report A-1982-4, September, 1982.
BibTeX:
@techreport{Tarhio82,
  author = {Jorma Tarhio},
  title = {Attribute Evaluation during LR parsing},
  year = {1982},
  number = {A-1982-4}
}
Tarhio, J. (1982), "LR parsing of some Ambiguous Grammars", Information Processing Letters., May, 1982. Vol. 14(3), pp. 101-103.
BibTeX:
@article{Tarhio82a,
  author = {Jorma Tarhio},
  title = {LR parsing of some Ambiguous Grammars},
  journal = {Information Processing Letters},
  year = {1982},
  volume = {14},
  number = {3},
  pages = {101--103}
}
Thomason, M.G. (1982), "Syntactic/Semantic Techniques in Pattern Recognition: A Survey", International Journal of Computer and Information Sciences., April, 1982. Vol. 11(2), pp. 75-100.
BibTeX:
@article{Thomason82,
  author = {M. G. Thomason},
  title = {Syntactic/Semantic Techniques in Pattern Recognition: A Survey},
  journal = {International Journal of Computer and Information Sciences},
  year = {1982},
  volume = {11},
  number = {2},
  pages = {75--100}
}
Uhl, J., Drossopoulos, S., Persch, G., Goos, G., Daussmann, M., Winterstein, G. & Kirchgäßner, W. (1982), "An Attributed Grammar for the Semantic Analysis of ADA" New York--Heidelberg--Berlin Vol. 139 Springer-Verlag.
BibTeX:
@book{Uhl82,
  author = {J. Uhl and Sophia Drossopoulos and G. Persch and Gerhart Goos and M. Daussmann and G. Winterstein and Walter Kirchgäßner},
  title = {An Attributed Grammar for the Semantic Analysis of ADA},
  publisher = {Springer-Verlag},
  year = {1982},
  volume = {139},
  note = {See also: Bericht 25/81, Institut für Informatik~II, University Karlsruhe (1981).}
}
Vooglaid, A.O. & Méristé, M.B. (1982), "Abstract Attribute Grammars", Progr. and Computer Software., September, 1982. Vol. 8(5), pp. 242-251.
BibTeX:
@article{Vooglaid82,
  author = {Aare O. Vooglaid and Merik B. Méristé},
  title = {Abstract Attribute Grammars},
  journal = {Progr. and Computer Software},
  year = {1982},
  volume = {8},
  number = {5},
  pages = {242--251}
}
Watt, D.A. (1982), "Modular Language Definitions". Comp. Sc. Department, University of Glasgow, Technical Report CSC/82/R3, 1982.
BibTeX:
@techreport{Watt82,
  author = {David A. Watt},
  title = {Modular Language Definitions},
  year = {1982},
  number = {CSC/82/R3}
}
Wilhelm, R. (1982), "LL- and LR-attributed Grammars", In GI 7. Fachtagung ``Programmiersprachen und Programmentwicklung''. New York--Heidelberg--Berlin. March 1982. Volume 53, pp. 151-164. Springer-Verlag.
BibTeX:
@inproceedings{Wilhelm82,
  author = {Reinhard Wilhelm},
  title = {LL- and LR-attributed Grammars},
  booktitle = {GI 7. Fachtagung ``Programmiersprachen und Programmentwicklung''},
  publisher = {Springer-Verlag},
  year = {1982},
  volume = {53},
  pages = {151--164}
}
Alblas, H. (1983), "An Algorithm to Find Minimal Sequences of Pass Directions for Attribute Grammars". Onderafdeling der Informatica, Tech. Hogeschool Twente, Technical Report INF-83-6, August, 1983.
BibTeX:
@techreport{Alblas83,
  author = {Henk Alblas},
  title = {An Algorithm to Find Minimal Sequences of Pass Directions for Attribute Grammars},
  year = {1983},
  number = {INF-83-6}
}
Barber, M.E. (1983), "PARSLEY: a new Compiler-Compiler", In Software Development Tools, Techniques and Alternatives. Arlington, VA, July, 1983. , pp. 232-241.
BibTeX:
@incollection{Barber83,
  author = {Milton E. Barber},
  title = {PARSLEY: a new Compiler-Compiler},
  booktitle = {Software Development Tools, Techniques and Alternatives},
  year = {1983},
  pages = {232--241}
}
Barbuti, R., Bellia, M., Degano, P., Levi, G., Dameri, E., Simonelli, C. & Martelli, A. (1983), "Programming Environment Generation based on Denotational Semantics", In Theory and Practice of Software Technology. Amsterdam , pp. 51-83. North-Holland.
BibTeX:
@incollection{Barbuti83,
  author = {R. Barbuti and M. Bellia and P. Degano and G. Levi and E. Dameri and C. Simonelli and A. Martelli},
  title = {Programming Environment Generation based on Denotational Semantics},
  booktitle = {Theory and Practice of Software Technology},
  publisher = {North-Holland},
  year = {1983},
  pages = {51--83}
}
Boullier, P., Deschamp, P. & Jourdan, M. (1983), "Spécification et réalisation d'un traducteur Pascal-Ada", In Journées ADA de l'AFCET. Lausanne, December, 1983. , pp. 9-29.
BibTeX:
@incollection{Boullier83,
  author = {Pierre Boullier and Philippe Deschamp and Martin Jourdan},
  title = {Spécification et réalisation d'un traducteur Pascal-Ada},
  booktitle = {Journées ADA de l'AFCET},
  year = {1983},
  pages = {9--29}
}
Christiansen, H. & Jones, N.D. (1983), "Control Flow Treatment in a Simple Semantics-Directed Compiler Generator", In Formal Description of Programming Concepts~II. Amsterdam , pp. 73-97. North-Holland.
BibTeX:
@incollection{Christiansen83,
  author = {Henning Christiansen and Neil D. Jones},
  title = {Control Flow Treatment in a Simple Semantics-Directed Compiler Generator},
  booktitle = {Formal Description of Programming Concepts~II},
  publisher = {North-Holland},
  year = {1983},
  pages = {73--97}
}
De Man, J., Peerlinck, M., Genin, D. & Goovaerts, V. (1983), "Implementation of a Compiler for CHILL", In MICROCOMPUTERS: Developments in Industry, Business and Education (EUROMICRO '1983). Amsterdam--New York , pp. 23-29. Elsevier.
BibTeX:
@incollection{DeMan83,
  author = {J. De Man and M. Peerlinck and D. Genin and V. Goovaerts},
  title = {Implementation of a Compiler for CHILL},
  booktitle = {MICROCOMPUTERS: Developments in Industry, Business and Education (EUROMICRO '1983)},
  publisher = {Elsevier},
  year = {1983},
  pages = {23--29},
  note = {Madrid}
}
Deransart, P. (1983), "Logical Attribute Grammars", In Information Processing '83. Amsterdam, September, 1983. , pp. 463-469. North-Holland.
BibTeX:
@incollection{Deransart83,
  author = {Pierre Deransart},
  title = {Logical Attribute Grammars},
  booktitle = {Information Processing '83},
  publisher = {North-Holland},
  year = {1983},
  pages = {463--469},
  note = {Paris}
}
Farrow, R. (1983), "Attribute Grammars and Data-Flow Languages", In ACM SIGPLAN '83 Symp. on Programming Languages Issues in Software Systems. San Francisco, CA, June, 1983. , pp. 28-40. ACM press.
BibTeX:
@incollection{Farrow83,
  author = {Rodney Farrow},
  title = {Attribute Grammars and Data-Flow Languages},
  booktitle = {ACM SIGPLAN '83 Symp. on Programming Languages Issues in Software Systems},
  publisher = {ACM press},
  year = {1983},
  pages = {28--40},
  note = {Published as ACM SIGPLAN Notices, volume 18, number 6}
}
Farrow, R. (1983), "Covers of Attribute Grammars and Sub-Protocol Attribute Evaluators". Department of Comp. Sc., Columbia University, September, 1983.
BibTeX:
@techreport{Farrow83a,
  author = {Rodney Farrow},
  title = {Covers of Attribute Grammars and Sub-Protocol Attribute Evaluators},
  year = {1983}
}
Filé, G. (1983), "Interpretation and Reduction of Attribute Grammars", Acta Informatica. Vol. 19, pp. 115-150.
BibTeX:
@article{File83,
  author = {Gilberto Filé},
  title = {Interpretation and Reduction of Attribute Grammars},
  journal = {Acta Informatica},
  year = {1983},
  volume = {19},
  pages = {115--150},
  note = {See also: memorandum 359, Onderafdeling der Informatica, Tech. Hogeschool Twente (1981).}
}
Filé, G. (1983), "Theory of Attribute Grammars". Onderafdeling der Informatica, Tech. Hogeschool Twente, 1983.
BibTeX:
@techreport{File83a,
  author = {Gilberto Filé},
  title = {Theory of Attribute Grammars},
  year = {1983}
}
Franzen, H. (1983), "Compiler Generation from Compiler Descriptions to Efficient Compilers". School: Fachbereich Informatik, Tech. University Berlin. (83-20)
BibTeX:
@phdthesis{Franzen83,
  author = {H. Franzen},
  title = {Compiler Generation from Compiler Descriptions to Efficient Compilers},
  school = {Fachbereich Informatik, Tech. University Berlin},
  year = {1983},
  number = {83-20}
}
Gallier, J.H. (1983), "An Efficient Evaluator for Attribute Grammars with Conditional Rules". Department of Comp. Inf. Sc., Moore School of Elec. Eng. D2, University of Pennsylvania, October, 1983.
BibTeX:
@techreport{Gallier83,
  author = {Jean H. Gallier},
  title = {An Efficient Evaluator for Attribute Grammars with Conditional Rules},
  year = {1983}
}
Ganzinger, H. (1983), "Increasing Modularity and Language-Independency in Automatically Generated Compilers", Science of Computer Programming., December, 1983. Vol. 3(3), pp. 223-278.
BibTeX:
@article{Ganzinger83,
  author = {Harald Ganzinger},
  title = {Increasing Modularity and Language-Independency in Automatically Generated Compilers},
  journal = {Science of Computer Programming},
  year = {1983},
  volume = {3},
  number = {3},
  pages = {223--278},
  note = {See also: Bericht TUM-I8306, Institut für Informatik, Tech. University München (July 1983).}
}
Ganzinger, H. (1983), "Denotational Semantics for Languages with Modules", In Formal Description of Programming Concepts~II. Amsterdam , pp. 3-23. North-Holland.
BibTeX:
@incollection{Ganzinger83a,
  author = {Harald Ganzinger},
  title = {Denotational Semantics for Languages with Modules},
  booktitle = {Formal Description of Programming Concepts~II},
  publisher = {North-Holland},
  year = {1983},
  pages = {3--23}
}
Ganzinger, H. (1983), "On the Design of Data Abstraction Mechanisms for Compiler Description Languages", In Programming Languages and System Design. , pp. 59-82. Elsevier/North Holland.
BibTeX:
@incollection{Ganzinger83b,
  author = {Harald Ganzinger},
  title = {On the Design of Data Abstraction Mechanisms for Compiler Description Languages},
  booktitle = {Programming Languages and System Design},
  publisher = {Elsevier/North Holland},
  year = {1983},
  pages = {59--82}
}
Ganzinger, H. (1983), "Modular Compiler Descriptions based on Abstract Semantic Data Types", In 10th Int. Coll. on Automata, Languages and Programming. New York--Heidelberg--Berlin, July, 1983. Vol. 154, pp. 237-249. Springer-Verlag.
BibTeX:
@incollection{Ganzinger83c,
  author = {Harald Ganzinger},
  title = {Modular Compiler Descriptions based on Abstract Semantic Data Types},
  booktitle = {10th Int. Coll. on Automata, Languages and Programming},
  publisher = {Springer-Verlag},
  year = {1983},
  volume = {154},
  pages = {237--249},
  note = {Barcelona}
}
Gyimóthy, T., Simon, E. & Makay, Á. (1983), "An Implementation of the HLP", Acta Cybernetica. Szeged Vol. 6(3), pp. 315-327.
BibTeX:
@article{Gyimothy83,
  author = {Tibor Gyimóthy and Endre Simon and Árpád Makay},
  title = {An Implementation of the HLP},
  journal = {Acta Cybernetica},
  year = {1983},
  volume = {6},
  number = {3},
  pages = {315--327}
}
Hehner, E.C.R. & Silverberg, B.A. (1983), "Programming with Grammars: an Exercise in Methodology-directed Language Design", The Computer Journal. Vol. 26(3), pp. 277-281.
BibTeX:
@article{Hehner83,
  author = {E. C. R. Hehner and B. A. Silverberg},
  title = {Programming with Grammars: an Exercise in Methodology-directed Language Design},
  journal = {The Computer Journal},
  year = {1983},
  volume = {26},
  number = {3},
  pages = {277--281}
}
Hoffmann, B. (1983), "Compiler Generation: from Language Definitions to Abstract Compilers". Fachbereich Mathematik/Informatik, University Bremen, Technical Report 5/83, September, 1983.
BibTeX:
@techreport{Hoffmann83,
  author = {Berthold Hoffmann},
  title = {Compiler Generation: from Language Definitions to Abstract Compilers},
  year = {1983},
  number = {5/83},
  note = {Also Dissertation, Tech. University Berlin.}
}
Jalili, F. (1983), "A General Linear-Time Evaluator for Attribute Grammars", ACM SIGPLAN Notices., September, 1983. Vol. 18(9), pp. 35-44.
BibTeX:
@article{Jalili83,
  author = {Fahimeh Jalili},
  title = {A General Linear-Time Evaluator for Attribute Grammars},
  journal = {ACM SIGPLAN Notices},
  year = {1983},
  volume = {18},
  number = {9},
  pages = {35--44}
}
Johnson, G.F. (1983), "An Approach to Incremental Semantics". School: Department of Comp. Sc., University of Wisconsin-Madison. (report TR547)
BibTeX:
@phdthesis{Johnson83,
  author = {Gregory F. Johnson},
  title = {An Approach to Incremental Semantics},
  school = {Department of Comp. Sc., University of Wisconsin-Madison},
  year = {1983},
  number = {report TR547}
}
Jones, N.D. & Tofte, M. (1983), "Some Principles and Notations for the Construction of Compiler Generators". Datalogisk Institut, University of Copenhagen, July, 1983.
BibTeX:
@techreport{Jones83,
  author = {Neil D. Jones and M. Tofte},
  title = {Some Principles and Notations for the Construction of Compiler Generators},
  year = {1983}
}
Jourdan, M. (1983), "An Efficient Recursive Evaluator for Strongly Non-Circular Attribute Grammars". INRIA, Technical Report 235, October, 1983.
BibTeX:
@techreport{Jourdan83,
  author = {Martin Jourdan},
  title = {An Efficient Recursive Evaluator for Strongly Non-Circular Attribute Grammars},
  year = {1983},
  number = {235}
}
Kamimura, T. (1983), "Tree Automata and Attribute Grammars", In 10th Int. Coll. on Automata, Languages and Programming. New York--Heidelberg--Berlin, July, 1983. Vol. 154, pp. 374-384. Springer-Verlag.
BibTeX:
@incollection{Kamimura83,
  author = {Tsutomu Kamimura},
  title = {Tree Automata and Attribute Grammars},
  booktitle = {10th Int. Coll. on Automata, Languages and Programming},
  publisher = {Springer-Verlag},
  year = {1983},
  volume = {154},
  pages = {374--384},
  note = {See also: report TR-82-1, Department of Comp. Sc., University of Kansas (1982).}
}
Kintala, C.M.R. (1983), "Attributed Grammars for Query Language Translation", In 2nd ACM Symp. on Principles of Database Systems., March, 1983. , pp. 137-148. ACM press.
BibTeX:
@incollection{Kintala83,
  author = {Chandra M. R. Kintala},
  title = {Attributed Grammars for Query Language Translation},
  booktitle = {2nd ACM Symp. on Principles of Database Systems},
  publisher = {ACM press},
  year = {1983},
  pages = {137--148}
}
Koskimies, K. (1983), "Extensions of One-pass Attribute Grammars". School: Department of Comp. Sc., University of Helsinki., December, 1983. (report A-1983-4)
BibTeX:
@phdthesis{Koskimies83,
  author = {Kai Koskimies},
  title = {Extensions of One-pass Attribute Grammars},
  school = {Department of Comp. Sc., University of Helsinki},
  year = {1983},
  number = {report A-1983-4}
}
Koskimies, K. & Paakki, J. (1983), "HLP84 Semantic Metalanguage and its Implementation". Department of Comp. Sc., University of Helsinki, Technical Report C-1983-69, 1983.
BibTeX:
@techreport{Koskimies83a,
  author = {Kai Koskimies and Jukka Paakki},
  title = {HLP84 Semantic Metalanguage and its Implementation},
  year = {1983},
  number = {C-1983-69}
}
Koskimies, K. & Räihä, K.-J. (1983), "Modelling of Space-efficient One-pass Translation using Attribute Grammars", Software---Practice and Experience., February, 1983. Vol. 13(2), pp. 119-129.
BibTeX:
@article{Koskimies83b,
  author = {Kai Koskimies and Kari-Jouko Räihä},
  title = {Modelling of Space-efficient One-pass Translation using Attribute Grammars},
  journal = {Software---Practice and Experience},
  year = {1983},
  volume = {13},
  number = {2},
  pages = {119--129},
  note = {See also: report C-1982-63, Department of Comp. Sc., University of Helsinki (1982).}
}
Kristensen, B.B., Madsen, O.L., Möller-Pedersen, B. & Nygaard, K. (1983), "Syntax-directed Program Modularization", In Integrated Interactive Computing Systems. Amsterdam , pp. 207-219. North-Holland.
BibTeX:
@incollection{Kristensen83,
  author = {B. B. Kristensen and Ole L. Madsen and B. Möller-Pedersen and K. Nygaard},
  title = {Syntax-directed Program Modularization},
  booktitle = {Integrated Interactive Computing Systems},
  publisher = {North-Holland},
  year = {1983},
  pages = {207--219}
}
Lacroix, R.P.A. (1983), "Semantics-directed Editing in an Incremental Processing Environment". School: Worcester Polytechnic Inst.., December, 1983.
BibTeX:
@mastersthesis{Lacroix83,
  author = {R. P. A. Lacroix},
  title = {Semantics-directed Editing in an Incremental Processing Environment},
  school = {Worcester Polytechnic Inst.},
  year = {1983}
}
Lewi, J., De Vlaminck, K., Huens, J. & Steegmans, E. (1983), "The Language Implementation Laboratory LILA: an Overview", In MICROCOMPUTERS: Developments in Industry, Business and Education (EUROMICRO '83). Amsterdam--New York , pp. 11-21. Elsevier.
BibTeX:
@incollection{Lewi83,
  author = {J. Lewi and K. De Vlaminck and J. Huens and E. Steegmans},
  title = {The Language Implementation Laboratory LILA: an Overview},
  booktitle = {MICROCOMPUTERS: Developments in Industry, Business and Education (EUROMICRO '83)},
  publisher = {Elsevier},
  year = {1983},
  pages = {11--21},
  note = {Madrid}
}
Logrippo, L. & Skuce, D.R. (1983), "File Structures, Program Structures and Attributed Grammars", Institute of Electrical and Electronics Engineers. Transactions on Software Engineering., May, 1983. Vol. SE-9(3), pp. 260-266.
BibTeX:
@article{Logrippo83,
  author = {Luigi Logrippo and Douglas R. Skuce},
  title = {File Structures, Program Structures and Attributed Grammars},
  journal = {Institute of Electrical and Electronics Engineers. Transactions on Software Engineering},
  year = {1983},
  volume = {SE-9},
  number = {3},
  pages = {260--266}
}
Lu, P.M., Yau, S.S. & Hong, W. (1983), "A Formal Methodology using Attributed Grammars for Multiprocessing-System Software Development", Information Sciences. An International Journal. Vol. 30(2 and 3), pp. 79-105 and 107-123.
BibTeX:
@article{Lu83,
  author = {P. M. Lu and S. S. Yau and W. Hong},
  title = {A Formal Methodology using Attributed Grammars for Multiprocessing-System Software Development},
  journal = {Information Sciences. An International Journal},
  year = {1983},
  volume = {30},
  number = {2 and 3},
  pages = {79--105 and 107--123},
  note = {I: Design Representation, II: Validation}
}
Makarov, V.P. (1983), "Attributed Quasitranslation Grammars and their Implementation in the SAGET Translator Generation System", Progr. and Computer Software., March, 1983. Vol. 9(2), pp. 85-90.
BibTeX:
@article{Makarov83,
  author = {V. P. Makarov},
  title = {Attributed Quasitranslation Grammars and their Implementation in the SAGET Translator Generation System},
  journal = {Progr. and Computer Software},
  year = {1983},
  volume = {9},
  number = {2},
  pages = {85--90}
}
McEnerney, J.M. (1983), "A General Compiler Generator based on Attribute Grammars". Department of Comp. Inf. Sc., Moore School of Elec. Eng. D2, University of Pennsylvania, June, 1983.
BibTeX:
@techreport{McEnerney83,
  author = {John M. McEnerney},
  title = {A General Compiler Generator based on Attribute Grammars},
  year = {1983}
}
Mueckstein, E.-M.M. (1983), "Q-TRANS: Query Translation into English", In 8th Int. Joint Conf. on Artificial Intelligence. Karlsruhe, August, 1983. , pp. 660-662.
BibTeX:
@incollection{Mueckstein83,
  author = {Eva-Maria M. Mueckstein},
  title = {Q-TRANS: Query Translation into English},
  booktitle = {8th Int. Joint Conf. on Artificial Intelligence},
  year = {1983},
  pages = {660--662}
}
Nestor, J.R., Mishra, B., Scherlis, W.L. & Wulf, W.A. (1983), "Extensions to Attribute Grammars". Tartan Labs., Technical Report TR-TL-83-36, 1983.
BibTeX:
@techreport{Nestor83,
  author = {John R. Nestor and Bhubaneswar Mishra and William L. Scherlis and William A. Wulf},
  title = {Extensions to Attribute Grammars},
  year = {1983},
  number = {TR-TL-83-36}
}
Papakonstantinou, G.K. (1983), "A Sentence Generator based on Attribute Grammars", Angew. Informatik. Vol. 8
BibTeX:
@article{Papakonstantin83,
  author = {George K. Papakonstantinou},
  title = {A Sentence Generator based on Attribute Grammars},
  journal = {Angew. Informatik},
  year = {1983},
  volume = {8}
}
Penjam, J. (1983), "Synthesis of a Semantic Processor from an Attribute Grammar", Progr. and Computer Software., January, 1983. Vol. 9(1), pp. 29-39.
BibTeX:
@article{Penjam83,
  author = {Jaan Penjam},
  title = {Synthesis of a Semantic Processor from an Attribute Grammar},
  journal = {Progr. and Computer Software},
  year = {1983},
  volume = {9},
  number = {1},
  pages = {29--39}
}
Pohlmann, W. (1983), "LR Parsing for Affix Grammars", Acta Informatica. Vol. 20(4), pp. 283-300.
BibTeX:
@article{Pohlmann83,
  author = {W. Pohlmann},
  title = {LR Parsing for Affix Grammars},
  journal = {Acta Informatica},
  year = {1983},
  volume = {20},
  number = {4},
  pages = {283--300}
}
Räihä, K.-J., Saarinen, M., Sarjakoski, M., Sippu, S., Soisalon-Soininen, E. & Tienari, M. (1983), "Revised Report on the Compiler Writing System HLP78". Department of Comp. Sc., University of Helsinki, Technical Report A-1983-1, January, 1983.
BibTeX:
@techreport{Raiha83,
  author = {Kari-Jouko Räihä and Mikko Saarinen and Matti Sarjakoski and Seppo Sippu and Eljas Soisalon-Soininen and Martti Tienari},
  title = {Revised Report on the Compiler Writing System HLP78},
  year = {1983},
  number = {A-1983-1}
}
Reps, T. (1983), "Static-Semantics Analysis in Language-based Editors", In Digest of Papers of the IEEE Spring CompCon 83. San Francisco, CA, March, 1983. , pp. 411-414.
BibTeX:
@incollection{Reps83,
  author = {Thomas Reps},
  title = {Static-Semantics Analysis in Language-based Editors},
  booktitle = {Digest of Papers of the IEEE Spring CompCon 83},
  year = {1983},
  pages = {411--414}
}
Reps, T., Teitelbaum, T. & Demers, A. (1983), "Incremental Context-dependent Analysis for Language-based Editors", ACM Trans. Progr. Languages and Systems., July, 1983. Vol. 5(3), pp. 449-477.
BibTeX:
@article{Reps83a,
  author = {Thomas Reps and Tim Teitelbaum and Alan Demers},
  title = {Incremental Context-dependent Analysis for Language-based Editors},
  journal = {ACM Trans. Progr. Languages and Systems},
  year = {1983},
  volume = {5},
  number = {3},
  pages = {449--477}
}
Riis-Nielson, H. (1983), "Computation Sequences: A Way to Characterize Subclasses of Attribute Grammars", Acta Informatica. Vol. 19, pp. 255-268.
BibTeX:
@article{Riis-Nielson83,
  author = {Hanne Riis-Nielson},
  title = {Computation Sequences: A Way to Characterize Subclasses of Attribute Grammars},
  journal = {Acta Informatica},
  year = {1983},
  volume = {19},
  pages = {255--268},
  note = {See also: report DAIMI PB-138, Comp. Sc. Department, Aarhus University (1981).}
}
Sethi, R. (1983), "Control Flow Aspects of Semantics-directed Compiling", ACM Trans. Progr. Languages and Systems. Vol. 5(4), pp. 554-595.
BibTeX:
@article{Sethi83,
  author = {Ravi Sethi},
  title = {Control Flow Aspects of Semantics-directed Compiling},
  journal = {ACM Trans. Progr. Languages and Systems},
  year = {1983},
  volume = {5},
  number = {4},
  pages = {554--595},
  note = {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).}
}
Shi, Q.Y. & Fu, K.-S. (1983), "Parsing and Translation of (Attributed) Expansive Graph Languages for Scene Analysis", IEEE Trans. on Pattern Analysis and Machine Intell.., September, 1983. Vol. PAMI-5(5), pp. 472-485.
BibTeX:
@article{Shi83,
  author = {Q. Y. Shi and King-Sun Fu},
  title = {Parsing and Translation of (Attributed) Expansive Graph Languages for Scene Analysis},
  journal = {IEEE Trans. on Pattern Analysis and Machine Intell.},
  year = {1983},
  volume = {PAMI-5},
  number = {5},
  pages = {472--485}
}
Sonnenschein, M. (1983), "Generierung Effizienter Compilerteile durch Attributierten Grammatiken Verwandte Konzepte". Lehrstuhl für Angewandte Informatik, Rheinisch-Westfälische Tech. Hoschschule Aachen, 1983.
BibTeX:
@techreport{Sonnenschein83,
  author = {Michael Sonnenschein},
  title = {Generierung Effizienter Compilerteile durch Attributierten Grammatiken Verwandte Konzepte},
  year = {1983}
}
Van Katwijk, J. (1983), "A Preprocessor for YACC or a Poor Man's Approach to Parsing Attributed Grammars", ACM SIGPLAN Notices., October, 1983. Vol. 18(10), pp. 12-15.
BibTeX:
@article{VanKatwijk83,
  author = {Jan Van Katwijk},
  title = {A Preprocessor for YACC or a Poor Man's Approach to Parsing Attributed Grammars},
  journal = {ACM SIGPLAN Notices},
  year = {1983},
  volume = {18},
  number = {10},
  pages = {12--15}
}
Watt, D.A. & Madsen, O.L. (1983), "Extended Attribute Grammars", The Computer Journal. Vol. 26, pp. 142-153.
BibTeX:
@article{Watt83,
  author = {David A. Watt and Ole L. Madsen},
  title = {Extended Attribute Grammars},
  journal = {The Computer Journal},
  year = {1983},
  volume = {26},
  pages = {142--153},
  note = {See also: report 10, Comp. Sc. Department, University of Glasgow (July 1977) and report DAIMI PB-105, Comp. Sc. Department, Aarhus University (November 1979).}
}
Weisgerber, B. (1983), "Attributierte Transformationsgrammatiken: die Baumanalyse und Untersuchungen zu Transformationsstrategien". School: University des Saarlandes. Saarbrücken
BibTeX:
@phdthesis{Weisgerber83,
  author = {Beatrix Weisgerber},
  title = {Attributierte Transformationsgrammatiken: die Baumanalyse und Untersuchungen zu Transformationsstrategien},
  school = {University des Saarlandes},
  year = {1983}
}
Yeh, D. (1983), "On Incremental Evaluation of Ordered Attributed Grammars", BIT. Vol. 23, pp. 308-320.
BibTeX:
@article{Yeh83,
  author = {Dashing Yeh},
  title = {On Incremental Evaluation of Ordered Attributed Grammars},
  journal = {BIT},
  year = {1983},
  volume = {23},
  pages = {308--320}
}
Abramson, H. (1984), "Definite Clause Translation Grammars", In IEEE Symp. on Logic Programming. Atlantic City , pp. 233-248.
Abstract: The author introduces definite clause translation grammars, a new class of logic grammars which generalizes definite clause grammars and which may be thought of as a logical implementation of attribute grammars. Definite clause translation grammars permit the specification of the syntax and semantic rules in the form of Horn clauses attached to each node of the parse tree (automatically created during syntactic analysis), and which control traversal(s) of the parse tree and computation of attributes of each node. The semantic rules attached to a node constitute, therefore, a local database for the node. the separation of syntactic and sematic rules is intended to promote modularity, simplicity, clarity of definition, and ease of modification.
BibTeX:
@incollection{Abramson84,
  author = {H. Abramson},
  title = {Definite Clause Translation Grammars},
  booktitle = {IEEE Symp. on Logic Programming},
  year = {1984},
  pages = {233--248}
}
Adorni, G., Boccalatte, A. & Di Manzo, M. (1984), "Top-down Semantic Analysis", The Computer Journal., August, 1984. Vol. 27(3), pp. 233-237.
BibTeX:
@article{Adorni84,
  author = {G. Adorni and A. Boccalatte and M. Di Manzo},
  title = {Top-down Semantic Analysis},
  journal = {The Computer Journal},
  year = {1984},
  volume = {27},
  number = {3},
  pages = {233--237}
}
Alblas, H. (1984), "Transformations of Attributed Program Trees". Tartan Labs., Technical Report TL-TR-EXT-84-30, July, 1984.
BibTeX:
@techreport{Alblas84,
  author = {Henk Alblas},
  title = {Transformations of Attributed Program Trees},
  year = {1984},
  number = {TL-TR-EXT-84-30}
}
Anderson, D.P. & Landweber, L.H. (1984), "Protocol Specification by Real-time Attribute Grammars", In 4th Internat. Workshop on Protocol Specification, Testing, and Verification. Amsterdam., pp. 457-465. North-Holland.
BibTeX:
@inproceedings{Anderson84,
  author = {D. P. Anderson and L. H. Landweber},
  title = {Protocol Specification by Real-time Attribute Grammars},
  booktitle = {4th Internat. Workshop on Protocol Specification, Testing, and Verification},
  publisher = {North-Holland},
  year = {1984},
  pages = {457--465},
  note = {Skytop Lodge, PA}
}
Barbar, K. (1984), "Classification des grammaires d'attributs ordonnées". University de Bordeaux~I, Technical Report 8412, April, 1984.
BibTeX:
@techreport{Barbar84,
  author = {Kablan Barbar},
  title = {Classification des grammaires d'attributs ordonnées},
  year = {1984},
  number = {8412}
}
Bartmuß, G. & Thürmel, S. (1984), "MUG-Einführung". Institut für Informatik, Tech. University München, April, 1984.
BibTeX:
@techreport{Bartmuss84,
  author = {G. Bartmuß and Sabine Thürmel},
  title = {MUG-Einführung},
  year = {1984}
}
Bircsak, J.A. (1984), "Incorporating Conditional Semantic Rules in the CIS Compiler Generator". Department of Comp. Inf. Sc., Moore School of Elec. Eng. D2, University of Pennsylvania, May, 1984.
BibTeX:
@techreport{Bircsak84,
  author = {J. A. Bircsak},
  title = {Incorporating Conditional Semantic Rules in the CIS Compiler Generator},
  year = {1984}
}
Boullier, P., Deschamp, P. & Jourdan, M. (1984), "Application d'outils de haut niveau à la réalisation d'un traducteur automatique Pascal-Ada", In 2ème Coll. AFCET de Génie Logiciel. Nice, June, 1984. , pp. 375-385.
BibTeX:
@incollection{Boullier84,
  author = {Pierre Boullier and Philippe Deschamp and Martin Jourdan},
  title = {Application d'outils de haut niveau à la réalisation d'un traducteur automatique Pascal-Ada},
  booktitle = {2ème Coll. AFCET de Génie Logiciel},
  year = {1984},
  pages = {375--385}
}
Brown, C.A. & Purdom, P.W. (1984), "A Methodology and Notation for Compiler Front-end Design", Software---Practice and Experience., April, 1984. Vol. 14(4), pp. 335-346.
BibTeX:
@article{Brown84,
  author = {Cynthia A. Brown and Paul W. Purdom},
  title = {A Methodology and Notation for Compiler Front-end Design},
  journal = {Software---Practice and Experience},
  year = {1984},
  volume = {14},
  number = {4},
  pages = {335--346}
}
Courcelle, B. (1984), "Attribute Grammars: Definitions, Analysis of Dependencies, Proof Methods", In Methods and Tools for Compiler Construction. New York, New York , pp. 81-102. Cambridge University Press.
BibTeX:
@incollection{Courcelle84,
  author = {Bruno Courcelle},
  title = {Attribute Grammars: Definitions, Analysis of Dependencies, Proof Methods},
  booktitle = {Methods and Tools for Compiler Construction},
  publisher = {Cambridge University Press},
  year = {1984},
  pages = {81--102}
}
Deransart, P. (1984), "Validation des grammaires d'attributs". University de Bordeaux~I, October, 1984.
BibTeX:
@techreport{Deransart84,
  author = {Pierre Deransart},
  title = {Validation des grammaires d'attributs},
  year = {1984}
}
Deransart, P., Jourdan, M. & Lorho, B. (1984), "Speeding up Circularity Tests for Attribute Grammars", Acta Informatica., December, 1984. Vol. 21, pp. 375-391.
BibTeX:
@article{Deransart84a,
  author = {Pierre Deransart and Martin Jourdan and Bernard Lorho},
  title = {Speeding up Circularity Tests for Attribute Grammars},
  journal = {Acta Informatica},
  year = {1984},
  volume = {21},
  pages = {375--391},
  note = {See also: rapport RR 211, INRIA, Rocquencourt (May 1983).}
}
Deransart, P. & Maluszynski, J. (1984), "Modelling Data Dependencies in Logic Programs by Attribute Schemata". INRIA, Technical Report 323, July, 1984.
BibTeX:
@techreport{Deransart84b,
  author = {Pierre Deransart and Jan Maluszynski},
  title = {Modelling Data Dependencies in Logic Programs by Attribute Schemata},
  year = {1984},
  number = {323},
  note = {Also published as a report, Linköping Institute of Technology (October 1984).}
}
Engelfriet, J. (1984), "Attribute Grammars: Attribute Evaluation Methods", In Methods and Tools for Compiler Construction. New York , pp. 103-138. Cambridge University Press.
BibTeX:
@incollection{Engelfriet84,
  author = {Joost Engelfriet},
  title = {Attribute Grammars: Attribute Evaluation Methods},
  booktitle = {Methods and Tools for Compiler Construction},
  publisher = {Cambridge University Press},
  year = {1984},
  pages = {103--138}
}
Farrow, R. (1984), "Experience with a Production Compiler Automatically Generated from an Attribute Grammar". Department of Comp. Sc., Columbia University, March, 1984.
BibTeX:
@techreport{Farrow84,
  author = {Rodney Farrow},
  title = {Experience with a Production Compiler Automatically Generated from an Attribute Grammar},
  year = {1984}
}
Farrow, R. (1984), "Generating a Production Compiler from an Attribute Grammar", IEEE Software., October, 1984. Vol. 1(4), pp. 77-93.
BibTeX:
@article{Farrow84a,
  author = {Rodney Farrow},
  title = {Generating a Production Compiler from an Attribute Grammar},
  journal = {IEEE Software},
  year = {1984},
  volume = {1},
  number = {4},
  pages = {77--93}
}
Farrow, R. (1984), "Sub-Protocol-Evaluators for Attribute Grammars", In ACM SIGPLAN '84 Symp. on Compiler Construction. Montréal, June, 1984. , pp. 70-80. ACM press.
Abstract: This paper presents a new strategy for evaluating attribute grammars, sub-protocol attribute evaluation, and gives an algorithm for constructing sub-protocol-evaluators. Sub-protocol-evaluators can be built for any non-circular attribute grammar; this paper describes how to construct them for absolutely non-circular grammars~teKennedy:Warren:acm:popl:1976. Sub-protocol-evaluators are most easily understood as a simple optimisation of another evaluator we call the protocol-evaluator. The protocol-evaluator has elements in common with the tree-walk evaluator of Kennedy-Warren~teKennedy:Warren:acm:popl:1976 and with Nielson's direct evaluator~teNielson:1981; it can be viewed as a refinement of each of these. Furthermore, the uniform AGs, proposed by Warren~teWarren:phd:1976, and the ordered AGs, proposed by Kastens~teKastens:acta:1980, are both subclasses of grammars for which especially efficient protocol-evaluators can be built.
BibTeX:
@incollection{Farrow84b,
  author = {Rodney Farrow},
  title = {Sub-Protocol-Evaluators for Attribute Grammars},
  booktitle = {ACM SIGPLAN '84 Symp. on Compiler Construction},
  publisher = {ACM press},
  year = {1984},
  pages = {70--80},
  note = {Published as ACM SIGPLAN Notices, volume 19, number 6}
}
Ganzinger, H. & Giegerich, R. (1984), "Attribute Coupled Grammars", In ACM SIGPLAN '84 Symp. on Compiler Construction. Montréal. June 1984., pp. 157-170. ACM press.
Abstract: In this paper, attribute grammars are viewed as specifying translations from source language terms into target language terms. The terms are constructed over a hierarchical signature consisting of a semantic and syntactic part. Attribute grammars are redefined to become morphisms in the category of such signatures, called attribute coupled grammars, such that they come with an associative composition operation. The composition allows for a new kind of modularity in compiler specifications. The paper also discusses properties of the concept with respect to attribute evaluation and application as a tree transformation device.
BibTeX:
@inproceedings{Ganzinger84,
  author = {Harald Ganzinger and Robert Giegerich},
  title = {Attribute Coupled Grammars},
  booktitle = {ACM SIGPLAN '84 Symp. on Compiler Construction},
  publisher = {ACM press},
  year = {1984},
  pages = {157--170},
  note = {Published as sl ACM SIGPLAN Notices, 19(6)}
}
Ganzinger, H. & Hanus, M. (1984), "Modular Logic Programming of Compilers". Fachbereich Informatik, University Dortmund, Technical Report 189, 1984.
BibTeX:
@techreport{Ganzinger84a,
  author = {Harald Ganzinger and Michael Hanus},
  title = {Modular Logic Programming of Compilers},
  year = {1984},
  number = {189}
}
Göttler, H. (1984), "Implementation of Attributed Graph-Grammars", In Int. Workshop on Graphtheoretic Concepts in Computer Science (WG '84). Trauner Verlag.
BibTeX:
@inproceedings{Gottler84,
  author = {Herbert Göttler},
  title = {Implementation of Attributed Graph-Grammars},
  booktitle = {Int. Workshop on Graphtheoretic Concepts in Computer Science (WG '84)},
  publisher = {Trauner Verlag},
  year = {1984}
}
Graham, S.L. (1984), "Code Generation and Optimization", In Methods and Tools for Compiler Construction. New York, New York , pp. 251-288. Cambridge University Press.
BibTeX:
@incollection{Graham84,
  author = {Susan L. Graham},
  title = {Code Generation and Optimization},
  booktitle = {Methods and Tools for Compiler Construction},
  publisher = {Cambridge University Press},
  year = {1984},
  pages = {251--288}
}
Grubert, U. (1984), "Entwurf und Implementierung einer dynamischen Speicherverwaltung im Rahmen eines Compiler-erzeugenden Systems". School: Lehrstuhl für Angewandte Informatik, Rheinisch-Westfälische Tech. Hoschschule Aachen.
BibTeX:
@phdthesis{Grubert84,
  author = {U. Grubert},
  title = {Entwurf und Implementierung einer dynamischen Speicherverwaltung im Rahmen eines Compiler-erzeugenden Systems},
  school = {Lehrstuhl für Angewandte Informatik, Rheinisch-Westfälische Tech. Hoschschule Aachen},
  year = {1984}
}
Hansson, H. (1984), "Preppie, a Compiler-compiler Directed towards Generation of Preprocessors". Uppsala Inst. of Technology, Technical Report 8485R, 1984.
BibTeX:
@techreport{Hansson84,
  author = {H. Hansson},
  title = {Preppie, a Compiler-compiler Directed towards Generation of Preprocessors},
  year = {1984},
  number = {8485R}
}
Houssais, B. (1984), "Analyse d'Erreurs dans les Compilateurs d'Algol 68", In 2ème Congrès AFCET de Génie Logiciel. Nice, June, 1984. , pp. 387-402.
BibTeX:
@incollection{Houssais84,
  author = {Bernard Houssais},
  title = {Analyse d'Erreurs dans les Compilateurs d'Algol 68},
  booktitle = {2ème Congrès AFCET de Génie Logiciel},
  year = {1984},
  pages = {387--402}
}
Inada, R. (1984), "Design of a Semantic Description Language based on Attribute Grammars and its Application to Pascal". College of Information Sciences, University of Tsukuba, 1984.
BibTeX:
@techreport{Inada84,
  author = {R. Inada},
  title = {Design of a Semantic Description Language based on Attribute Grammars and its Application to Pascal},
  year = {1984},
  note = {(in Japanese)}
}
Ishizuka, H. (1984), "A Compiler Generator based on an Attribute Grammar Suitable for LR Parsing". School: College of Information Sciences, University of Tsukuba. Ibaraki-ken
BibTeX:
@mastersthesis{Ishizuka84,
  author = {Harushi Ishizuka},
  title = {A Compiler Generator based on an Attribute Grammar Suitable for LR Parsing},
  school = {College of Information Sciences, University of Tsukuba},
  year = {1984},
  note = {(in Japanese)}
}
Jourdan, M. (1984), "Les grammaires attribuées: implantation, applications, optimisations". University Paris~VII, May, 1984.
BibTeX:
@techreport{Jourdan84,
  author = {Martin Jourdan},
  title = {Les grammaires attribuées: implantation, applications, optimisations},
  year = {1984}
}
Jourdan, M. (1984), "Strongly Non-Circular Attribute Grammars and Their Recursive Evaluation", In ACM SIGPLAN '84 Symp. on Compiler Construction. Montréal, June, 1984. , pp. 81-93. ACM press.
Abstract: This paper is devoted to the construction of recursive evaluators for strongly non-circular attribute grammars. This class of attribute grammars is very large and includes every practical example; testing strong non-circularity can be done in polynomial time. To each synthesized attribute, a function is associated, which takes as parameters a derivation tree and the values of some inherited attributes, and returns the value of that attribute at the root of the tree. These functions are mutually recursive according to the structure of the full parse tree. This method implements a dynamic ``evaluation by need'', reducing the number of attributes computed to those necessary to get the ``semantic value'' of the full tree. A Lisp implementation allowing automatic efficient storage management is also presented, together with some applications. Our work is closely related to those of Kennedy and Warren, Saarinen and Katamaya, but our method is more efficient and has better theoretical basis.
BibTeX:
@incollection{Jourdan84a,
  author = {Martin Jourdan},
  title = {Strongly Non-Circular Attribute Grammars and Their Recursive Evaluation},
  booktitle = {ACM SIGPLAN '84 Symp. on Compiler Construction},
  publisher = {ACM press},
  year = {1984},
  pages = {81--93},
  note = {Published as ACM SIGPLAN Notices, volume 19, number 6}
}
Jourdan, M. (1984), "Recursive Evaluators for Attribute Grammars: an Implementation", In Methods and Tools for Compiler Construction. New York, New York , pp. 139-164. Cambridge University Press.
BibTeX:
@incollection{Jourdan84b,
  author = {Martin Jourdan},
  title = {Recursive Evaluators for Attribute Grammars: an Implementation},
  booktitle = {Methods and Tools for Compiler Construction},
  publisher = {Cambridge University Press},
  year = {1984},
  pages = {139--164}
}
Jourdan, M. (1984), "An Optimal-time Recursive Evaluator for Attribute Grammars", In 6th Int. Symp. on Programming. New York--Heidelberg--Berlin, April, 1984. Vol. 167, pp. 167-178. Springer-Verlag.
BibTeX:
@incollection{Jourdan84c,
  author = {Martin Jourdan},
  title = {An Optimal-time Recursive Evaluator for Attribute Grammars},
  booktitle = {6th Int. Symp. on Programming},
  publisher = {Springer-Verlag},
  year = {1984},
  volume = {167},
  pages = {167--178},
  note = {Toulouse}
}
Jullig, R.K. & De Remer, F. (1984), "Regular Right-part Attribute Grammars", In ACM SIGPLAN '84 Symp. on Compiler Construction. Montréal, June, 1984. , pp. 171-189. ACM press.
BibTeX:
@incollection{Jullig84,
  author = {R. K. Jullig and Frank De Remer},
  title = {Regular Right-part Attribute Grammars},
  booktitle = {ACM SIGPLAN '84 Symp. on Compiler Construction},
  publisher = {ACM press},
  year = {1984},
  pages = {171--189},
  note = {Published as ACM SIGPLAN Notices, volume 19, number 6}
}
Kastens, U. (1984), "The GAG-System---A Tool for Compiler Construction", In Methods and Tools for Compiler Construction. New York, New York , pp. 165-182. Cambridge University Press.
BibTeX:
@incollection{Kastens84,
  author = {Uwe Kastens},
  title = {The GAG-System---A Tool for Compiler Construction},
  booktitle = {Methods and Tools for Compiler Construction},
  publisher = {Cambridge University Press},
  year = {1984},
  pages = {165--182}
}
Katayama, T. (1984), "Translation of Attribute Grammars into Procedures", ACM Trans. Progr. Languages and Systems., July, 1984. Vol. 6(3), pp. 345-369.
BibTeX:
@article{Katayama84,
  author = {Takuya Katayama},
  title = {Translation of Attribute Grammars into Procedures},
  journal = {ACM Trans. Progr. Languages and Systems},
  year = {1984},
  volume = {6},
  number = {3},
  pages = {345--369}
}
Kaviani, C. (1984), "Comparaison de deux Méthodes d'Évaluation d'Attributs sémantiques: GAG et FNC". University de Paris~VI, January, 1984.
BibTeX:
@techreport{Kaviani84,
  author = {Charok Kaviani},
  title = {Comparaison de deux Méthodes d'Évaluation d'Attributs sémantiques: GAG et FNC},
  year = {1984}
}
Keller, S.E., Perkins, J.A., Payton, T.F. & Mardinly, S.P. (1984), "Tree Transformation Techniques and Experiences", In ACM SIGPLAN '84 Symp. on Compiler Construction. Montréal, June, 1984. , pp. 190-201. ACM press.
Abstract: A formal description technique for describing transformations from one well-defined language to another is introduced. A TT-grammar contains context-free grammars for describing the syntax of both languages. The transformation between the languages is described by a relationship of productions from the grammar. The TT-grammar is supported by an automated tool. SSAGS -- a translator writing system based on attribute grammars -- has been extended to support certain classes of TT-grammars. SSAGS analyzes TT-grammars and automatically generates Ada source programs implementing the transformation specified by the TT-grammar. Experience with two different restricted forms of Tt-grammars is described with respect to their practical application. The experience demonstrates the readability, ease of development, and additional verification available through the use of TT-grammars.
BibTeX:
@incollection{Keller84,
  author = {S. E. Keller and J. A. Perkins and Teri F. Payton and S. P. Mardinly},
  title = {Tree Transformation Techniques and Experiences},
  booktitle = {ACM SIGPLAN '84 Symp. on Compiler Construction},
  publisher = {ACM press},
  year = {1984},
  pages = {190--201},
  note = {Published as ACM SIGPLAN Notices, volume 19, number 6}
}
Koskimies, K. (1984), "A Specification Language for One-pass Semantic Analysis", In ACM SIGPLAN '84 Symp. on Compiler Construction. Montréal, June, 1984. , pp. 179-189. ACM press.
Abstract: A new language is introduced for the specification of semantic analysis of programming languages. The language is based o the concept of one-pass attribute grammars. Various extensions of this basic formalism are incorporated in the language, including disciplined global variables, facilities for symbol processing, and features supporting semantic error detection and recovery. To encourage the writing of declarative specifications the language is nonterminal-oriented, in contrast to the production-oriented languages traditionally used in compiler writing systems.
BibTeX:
@incollection{Koskimies84,
  author = {Kai Koskimies},
  title = {A Specification Language for One-pass Semantic Analysis},
  booktitle = {ACM SIGPLAN '84 Symp. on Compiler Construction},
  publisher = {ACM press},
  year = {1984},
  pages = {179--189},
  note = {Published as ACM SIGPLAN Notices, volume 19, number 6}
}
Lämmel, U. (1984), "Spezifikation und Implementation von Kommandosprachen für Dialogsysteme mit Hilfe einer attributierten Grammatik". Sektion Informationsverarbeitung der W.-Pieck-University, 1984.
Abstract: A method for describing dialogue systems by GSFs is given. Provided a fixed form of commands of the command language, the GSF defining the language can be derived automatically from a signature. (mj)
BibTeX:
@techreport{Lammel84,
  author = {Uwe Lämmel},
  title = {Spezifikation und Implementation von Kommandosprachen für Dialogsysteme mit Hilfe einer attributierten Grammatik},
  year = {1984}
}
(1984), "Methods and Tools for Compiler Construction" New York, New York Cambridge University Press.
BibTeX:
@book{Lorho84,,
  title = {Methods and Tools for Compiler Construction},
  publisher = {Cambridge University Press},
  year = {1984},
  note = {INRIA-CEC Course held in Rocquencourt.}
}
Melichar, B. (1984), "Evaluation of Attributes during LR Syntax Analysis", In Vorträge des Problemseminars Attributierte Grammatiken und ihre Anwendungen. Rostock Pruchten. Wilhelm-Pieck University.
BibTeX:
@incollection{Melichar84,
  author = {Borivoj Melichar},
  title = {Evaluation of Attributes during LR Syntax Analysis},
  booktitle = {Vorträge des Problemseminars Attributierte Grammatiken und ihre Anwendungen},
  publisher = {Pruchten. Wilhelm-Pieck University},
  year = {1984}
}
Milos, D., Pleban, U.F. & Loegel, G. (1984), "Direct Implementation of Compiler Specifications or the Pascal P-Code Compiler Revisited", In 11th ACM Symp. on Principles of Progr. Languages. Salt Lake City, Ut, January, 1984. , pp. 196-207. ACM press.
BibTeX:
@incollection{Milos84,
  author = {Don Milos and Uwe F. Pleban and George Loegel},
  title = {Direct Implementation of Compiler Specifications or the Pascal P-Code Compiler Revisited},
  booktitle = {11th ACM Symp. on Principles of Progr. Languages},
  publisher = {ACM press},
  year = {1984},
  pages = {196--207}
}
Möncke, U., Weisgerber, B. & Wilhelm, R. (1984), "How to Implement a System for Manipulation of Attributed Trees", In GI 8. Fachtagung ``Programmiersprachen und Programentwicklung''. New York--Heidelberg--Berlin. March 1984. Volume 77, pp. 112-127. Springer-Verlag.
BibTeX:
@inproceedings{Moncke84,
  author = {Ulrich Möncke and Beatrix Weisgerber and Reinhard Wilhelm},
  title = {How to Implement a System for Manipulation of Attributed Trees},
  booktitle = {GI 8. Fachtagung ``Programmiersprachen und Programentwicklung''},
  publisher = {Springer-Verlag},
  year = {1984},
  volume = {77},
  pages = {112--127},
  note = {Zürich}
}
Myers, E.W. (1984), "Efficient Applicative Data Types", In 11th ACM Symp. on Principles of Progr. Languages. Salt Lake City, Ut, January, 1984. , pp. 66-75. ACM press.
BibTeX:
@incollection{Myers84,
  author = {Eugene W. Myers},
  title = {Efficient Applicative Data Types},
  booktitle = {11th ACM Symp. on Principles of Progr. Languages},
  publisher = {ACM press},
  year = {1984},
  pages = {66--75}
}
Niemi, T. (1984), "Specification of a Query Language by the Attribute Method", BIT. Vol. 24, pp. 171-186.
BibTeX:
@article{Niemi84,
  author = {Timo Niemi},
  title = {Specification of a Query Language by the Attribute Method},
  journal = {BIT},
  year = {1984},
  volume = {24},
  pages = {171--186}
}
Niemi, T. (1984), "Specification of Data Restructuring Software based on the Attribute Method", International Journal of Computer and Information Sciences. Vol. 13(6), pp. 425-460.
BibTeX:
@article{Niemi84a,
  author = {Timo Niemi},
  title = {Specification of Data Restructuring Software based on the Attribute Method},
  journal = {International Journal of Computer and Information Sciences},
  year = {1984},
  volume = {13},
  number = {6},
  pages = {425--460}
}
K. Ohmaki it et al. (1984), "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. Vol. J67-D(1), pp. 25-32.
BibTeX:
@article{Ohmaki84,
  author = {K. Ohmaki it et al.},
  title = {A System for Generating Language-oriented Editors based on Attribute Grammars},
  journal = {The Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E},
  year = {1984},
  volume = {J67-D},
  number = {1},
  pages = {25--32},
  note = {(in Japanese)}
}
Paulson, L. (1984), "Compiler Generation from Denotational Semantics", In Methods and Tools for Compiler Construction. New York, New York , pp. 219-250. Cambridge University Press.
BibTeX:
@incollection{Paulson84,
  author = {Larry Paulson},
  title = {Compiler Generation from Denotational Semantics},
  booktitle = {Methods and Tools for Compiler Construction},
  publisher = {Cambridge University Press},
  year = {1984},
  pages = {219--250}
}
Pleban, U.F. (1984), "Compiler Protyping using Formal Semantics", In ACM SIGPLAN '84 Symp. on Compiler Construction. Montréal, June, 1984. , pp. 94-105. ACM press.
BibTeX:
@incollection{Pleban84,
  author = {Uwe F. Pleban},
  title = {Compiler Protyping using Formal Semantics},
  booktitle = {ACM SIGPLAN '84 Symp. on Compiler Construction},
  publisher = {ACM press},
  year = {1984},
  pages = {94--105},
  note = {Published as ACM SIGPLAN Notices, volume 19, number 6}
}
Räihä, K.-J. (1984), "Attribute Grammar Design using the Compiler Writing System HLP", In Methods and Tools for Compiler Construction. New York, New York , pp. 183-206. Cambridge University Press.
BibTeX:
@incollection{Raiha84,
  author = {Kari-Jouko Räihä},
  title = {Attribute Grammar Design using the Compiler Writing System HLP},
  booktitle = {Methods and Tools for Compiler Construction},
  publisher = {Cambridge University Press},
  year = {1984},
  pages = {183--206}
}
Raoult, J.-C. & Sethi, R. (1984), "The Global Storage Needs of a Subcomputation", In 11th ACM Symp. on Principles of Progr. Languages. Salt Lake City, Ut, January, 1984. , pp. 148-157. ACM press.
BibTeX:
@incollection{Raoult84,
  author = {Jean-Claude Raoult and Ravi Sethi},
  title = {The Global Storage Needs of a Subcomputation},
  booktitle = {11th ACM Symp. on Principles of Progr. Languages},
  publisher = {ACM press},
  year = {1984},
  pages = {148--157}
}
Reps, T. (1984), "Generating Language-based Environments". MIT Press, Technical Report 1982)., 1984.
Abstract: This thesis concerns the design of interactive, language-based programming environments that use knowledge of a programming language to provide functions based on the structure and meaning of programs. The goal of the research is a system-constructor to enable editors for different languages to be created easily. The most challenging aspect of such a system is the design of the semantic component, because a language-based editor performs static semantic analysis when a program is altered in order to detect erroneous constructions or to prevent illegal modifications. For efficiency, this should be performed incrementally, re-using as much old information as possible; therefore, a major focus of my research concerns a model of editing for which it is possible to perform incremental semantic analysis efficiently. In this model, a program is represented as an attributed tree in which all attributes have consistent values; programs are modified by tree operations such as pruning, grafting, and deriving. After each modification, some of the attributes require new values; incremental semantic analysis is performed by updating attribute values to again make them all consistent. The thesis presents several algorithms for this process that are asymptotically optimal in time. The chief disadvantage of attribute grammars is that they use large amounts of storage. The thesis discusses three aspects of utilizing storage efficiently in such systems. One way to reduce the amount of storage used is to reduce the number of atttribute values retained at any stage of attribute evaluation. The thesis establishes two results concerning this idea: it presents one algorithm for evaluating an n-attribute tree that never saves more than $O(n$ attribute values, and it presents a second algorithm that never saves more than $O(log n)$ attribute values. A second method for reducing the amount of storage is to share the space used for storing attributes whose values are complex data structures; the thesis presents a very general method for such sharing that can be applied to attributes of many types. Finally, the thesis describes how, by restricting the class of attribute grammars, it is possible to reduce the amount of storage overhead required for updating trees in optimal time.
BibTeX:
@techreport{Reps84,
  author = {Thomas Reps},
  title = {Generating Language-based Environments},
  year = {1984},
  number = {1982).}
}
Reps, T. & Alpern, B. (1984), "Interactive Proof Checking", In 11th ACM Symp. on Principles of Progr. Languages. Salt Lake City, Ut, January, 1984. , pp. 36-45. ACM press.
BibTeX:
@incollection{Reps84a,
  author = {Thomas Reps and Bowen Alpern},
  title = {Interactive Proof Checking},
  booktitle = {11th ACM Symp. on Principles of Progr. Languages},
  publisher = {ACM press},
  year = {1984},
  pages = {36--45}
}
Reps, T. & Teitelbaum, T. (1984), "The Synthesizer Generator", In ACM SIGSOFT/SIGPLAN Symp. on Practical Software Development Environments. Pittsburgh, PA, April, 1984. , pp. 42-48. ACM press.
BibTeX:
@incollection{Reps84b,
  author = {Thomas Reps and Tim Teitelbaum},
  title = {The Synthesizer Generator},
  booktitle = {ACM SIGSOFT/SIGPLAN Symp. on Practical Software Development Environments},
  publisher = {ACM press},
  year = {1984},
  pages = {42--48},
  note = {Joint issue with Software Eng. Notes 9, 3.Published as ACM SIGPLAN Notices, volume 19, number 5}
}
Reps, T. & Demers, A.J. (1984), "Sublinear-Space Evaluation Algorithms for Attribute Grammars". Cornell University, Computer Science Department, Technical Report CORNELLCS//TR84-630, August, 1984.
Abstract: The chief hindrance to the widespread adoption of attribute-grammar-based systems has been that they are profligate consumers of storage. This paper concerns new storage management techniques that reduce the amount of storage used by reducing the number of attribute values retained at any stage of attribute evaluation; it presents one algorithm for evaluating an $n$-attribute tree that never retains more than $O(n)$ attribute values, and it presents a second algorithm that never retains more than $O(log n)$ attribute values.
BibTeX:
@techreport{Reps84c,
  author = {Thomas Reps and Alan J. Demers},
  title = {Sublinear-Space Evaluation Algorithms for Attribute Grammars},
  year = {1984},
  number = {CORNELLCS//TR84-630},
  pages = {25},
  url = {http://cs-tr.cs.cornell.edu:80/Dienst/UI/2.0/Describe/ncstrl.cornell%2fTR84-630}
}
(1984), "Vorträge des Problemseminar ``Attributierte Grammatiken und ihre Anwendungen''" Rostock, October, 1984. Sektion Informatik, W.-Pieck University.
BibTeX:
@book{Riedewald84,,
  title = {Vorträge des Problemseminar ``Attributierte Grammatiken und ihre Anwendungen''},
  publisher = {Sektion Informatik, W.-Pieck University},
  year = {1984}
}
Sassa, M. & Ishizuka, H. (1984), "Description of PL/0 Compiler by ecLR-attributed Grammars". Institute of Information Sciences. An International Journal, University of Tsukuba, Technical Report PL-2, 1984.
BibTeX:
@techreport{Sassa84,
  author = {Masataka Sassa and Harushi Ishizuka},
  title = {Description of PL/0 Compiler by ecLR-attributed Grammars},
  year = {1984},
  number = {PL-2},
  note = {(in Japanese)}
}
Shi, Q.Y. (1984), "Semantic-Syntax-Directed Translation and its Application to Image Processing", Information Sciences. An International Journal. Vol. 32, pp. 75-90.
BibTeX:
@article{Shi84,
  author = {Q. Y. Shi},
  title = {Semantic-Syntax-Directed Translation and its Application to Image Processing},
  journal = {Information Sciences. An International Journal},
  year = {1984},
  volume = {32},
  pages = {75--90}
}
Simon, E. (1984), "Language Extension in HLP/SZ", Acta Cybernetica. Szeged Vol. 7(1), pp. 89-97.
BibTeX:
@article{Simon84,
  author = {Endre Simon},
  title = {Language Extension in HLP/SZ},
  journal = {Acta Cybernetica},
  year = {1984},
  volume = {7},
  number = {1},
  pages = {89--97}
}
Skordalakis, E. & Papakonstantinou, G. (1984), "Towards an attribute grammar for the description of ECG waveforms", In 7th International Conference on Pattern Recognition. IEEE Computer Society Press.
BibTeX:
@inproceedings{SkoPap84,
  author = {E. Skordalakis and G Papakonstantinou},
  title = {Towards an attribute grammar for the description of ECG waveforms},
  booktitle = {7th International Conference on Pattern Recognition},
  publisher = {IEEE Computer Society Press},
  year = {1984}
}
Tarhio, J. (1984), "Bottom-up and Top-down Attributed Grammars", In Proc. Winter School on Theoretical Computer Science., pp. 290-302. Finnish Society of Inf. Proc. Sc..
BibTeX:
@inproceedings{Tarhio84,
  author = {Jorma Tarhio},
  title = {Bottom-up and Top-down Attributed Grammars},
  booktitle = {Proc. Winter School on Theoretical Computer Science},
  publisher = {Finnish Society of Inf. Proc. Sc.},
  year = {1984},
  pages = {290--302}
}
Watt, D.A. (1984), "Contextual Constraints", In Methods and Tools for Compiler Construction. New York, New York , pp. 45-80. Cambridge University Press.
BibTeX:
@incollection{Watt84,
  author = {David A. Watt},
  title = {Contextual Constraints},
  booktitle = {Methods and Tools for Compiler Construction},
  publisher = {Cambridge University Press},
  year = {1984},
  pages = {45--80}
}
Wilhelm, R. (1984), "Inverse Currying Transformation on Attribute Grammars", In 11th ACM Symp. on Principles of Progr. Languages. Salt Lake City, Ut, January, 1984. , pp. 140-147. ACM press.
Abstract: Inverse currying transformation of an attribute grammar moves a context condition to places in the grammar where the violation of the condition can be detected as soon as the semantic information used in the condition is computed. It thereby takes into account the evaluation order chosen for the attribute grammar. Inverse currying transformations can be used to enhance context sensitive parsing using predicates on attributes, to eliminate sources of backtrack when parsing according to ambiguous grammars, and to facilitate semantics-supported error correction.
BibTeX:
@incollection{Wilhelm84,
  author = {Reinhard Wilhelm},
  title = {Inverse Currying Transformation on Attribute Grammars},
  booktitle = {11th ACM Symp. on Principles of Progr. Languages},
  publisher = {ACM press},
  year = {1984},
  pages = {140--147}
}
Yellin, D.M. (1984), "A Survey of Tree-walk Evaluation Strategies for Attribute Grammars". Department of Comp. Sc., Columbia University, September, 1984.
BibTeX:
@techreport{Yellin84,
  author = {Daniel M. Yellin},
  title = {A Survey of Tree-walk Evaluation Strategies for Attribute Grammars},
  year = {1984}
}
Alblas, H. (1985), "Finding Minimal Pass Sequences for Attribute Grammars", SIAM Journal on Computing., November, 1985. Vol. 14(4), pp. 889-914.
BibTeX:
@article{Alblas85,
  author = {Henk Alblas},
  title = {Finding Minimal Pass Sequences for Attribute Grammars},
  journal = {SIAM Journal on Computing},
  year = {1985},
  volume = {14},
  number = {4},
  pages = {889--914}
}
Barrett, W.A., Bates, R., Gustafson, D. & Couch, J. (1985), "Compiler Construction: Theory and Practice" SRA Inc..
BibTeX:
@book{Barrett85,
  author = {W. A. Barrett and R. Bates and D. Gustafson and J. Couch},
  title = {Compiler Construction: Theory and Practice},
  publisher = {SRA Inc.},
  year = {1985},
  edition = {2nd}
}
Beney, J. & Boulicaut, J.-F. (1985), "Des spécifications grammaticales à la programmation logique: le compromis STARLET". Laboratoire d'Informatique, INSA, June, 1985.
BibTeX:
@techreport{Beney85,
  author = {Jean Beney and Jean-Francois Boulicaut},
  title = {Des spécifications grammaticales à la programmation logique: le compromis STARLET},
  year = {1985}
}
Berg, A., Bocking, D.A., Peachey, D.R., Sorenson, P.G., Tremblay, J.P. & Wald, J.A. (1985), "VATS---the Visible Attributed Translation System", In 1985 ACM SIGSMALL Symp. on Small Systems. Danvers, May, 1985. , pp. 70-81. ACM press.
BibTeX:
@incollection{Berg85,
  author = {A. Berg and D. A. Bocking and D. R. Peachey and P. G. Sorenson and J. P. Tremblay and J. A. Wald},
  title = {VATS---the Visible Attributed Translation System},
  booktitle = {1985 ACM SIGSMALL Symp. on Small Systems},
  publisher = {ACM press},
  year = {1985},
  pages = {70--81},
  note = {See also: report 84-19, Dept. of Computational Science, University of Saskatchewan, Saskatoon, Canada (1984).}
}
Beshers, G.M. & Campbell, R.H. (1985), "Maintained and Constructor Attributes", In ACM SIGPLAN '85 Symp. on Language Issues in Programming Environments. Seattle, WA, June, 1985. , pp. 34-42. ACM press.
BibTeX:
@incollection{Beshers85,
  author = {George M. Beshers and Roy H. Campbell},
  title = {Maintained and Constructor Attributes},
  booktitle = {ACM SIGPLAN '85 Symp. on Language Issues in Programming Environments},
  publisher = {ACM press},
  year = {1985},
  pages = {34--42},
  note = {Published as ACM SIGPLAN Notices, volume 20, number 7}
}
Corbett, R.P. (1985), "Static Semantics and Compiler Error Recovery". Comp. Sc. Department, University of California, Technical Report UCB-CSD-85-251, 1985.
BibTeX:
@techreport{Corbett85,
  author = {R. P. Corbett},
  title = {Static Semantics and Compiler Error Recovery},
  year = {1985},
  number = {UCB-CSD-85-251}
}
Demers, A., Rogers, A. & Zadeck, F.K. (1985), "Attribute Propagation by Message Passing", In ACM SIGPLAN '85 Symp. on Language Issues in Programming Environments. Seattle, Wa, June, 1985. , pp. 43-59. ACM press.
BibTeX:
@incollection{Demers85,
  author = {Alan Demers and Anne Rogers and F. Kenneth Zadeck},
  title = {Attribute Propagation by Message Passing},
  booktitle = {ACM SIGPLAN '85 Symp. on Language Issues in Programming Environments},
  publisher = {ACM press},
  year = {1985},
  pages = {43--59},
  note = {See also: report RC11109, IBM T.J. Watson Research Center, Yorktown Heights, NY (1985).Published as ACM SIGPLAN Notices, volume 20, number 6}
}
Deransart, P. & Maluszynski, J. (1985), "Relating Logic Programs and Attribute Grammars", Journal of Logic Programming. Vol. 2(2), pp. 119-155.
BibTeX:
@article{Deransart85,
  author = {Pierre Deransart and Jan Maluszynski},
  title = {Relating Logic Programs and Attribute Grammars},
  journal = {Journal of Logic Programming},
  year = {1985},
  volume = {2},
  number = {2},
  pages = {119--155},
  note = {Also published as a report, Linköping Institute of Technology (October 1984), and as rapport RR 393, INRIA, Rocquencourt (1985).}
}
Deransart, P. & Maluszynski, J. (1985), "Relating logic programs and attribute grammars". Institut National de Recherche en Informatique et en Automatique (INRIA), Technical Report 393, 1985.
BibTeX:
@techreport{Deransart85a,
  author = {Pierre Deransart and Jan Maluszynski},
  title = {Relating logic programs and attribute grammars},
  year = {1985},
  number = {393}
}
Eulenstein, M. (1985), "POCO---Compiler Generator User Manual". University des Saarlandes, Technical Report A2/85, 1985.
BibTeX:
@techreport{Eulenstein85,
  author = {Michael Eulenstein},
  title = {POCO---Compiler Generator User Manual},
  year = {1985},
  number = {A2/85}
}
Farrow, R. (1985), "Attribute Grammars and Single-Assignment Languages". Department of Comp. Sc., Columbia University, Technical Report CUCS-158-85, March, 1985.
BibTeX:
@techreport{Farrow85,
  author = {Rodney Farrow},
  title = {Attribute Grammars and Single-Assignment Languages},
  year = {1985},
  number = {CUCS-158-85}
}
Gallier, J.H., Manion, F.J. & McEnerney, J. (1985), "CISV3: a Compiler Generator based on Attribute Evaluation". Department of Comp. Inf. Sc., Moore School of Elec. Eng. D2, University of Pennsylvania, October, 1985.
BibTeX:
@techreport{Gallier85,
  author = {Jean H. Gallier and Frank J. Manion and John McEnerney},
  title = {CISV3: a Compiler Generator based on Attribute Evaluation},
  year = {1985}
}
Ganapathi, M. & Fischer, C.N. (1985), "Affix Grammar Driven Code Generation", ACM Trans. Progr. Languages and Systems., October, 1985. Vol. 7(4), pp. 560-599.
BibTeX:
@article{Ganapathi85,
  author = {Mahadevan Ganapathi and Charles N. Fischer},
  title = {Affix Grammar Driven Code Generation},
  journal = {ACM Trans. Progr. Languages and Systems},
  year = {1985},
  volume = {7},
  number = {4},
  pages = {560--599}
}
Gombás, E. & Bartha, M. (1985), "A Multi-visit Characterization of Absolutely Noncircular Attribute Grammars", Acta Cybernetica. Vol. 7, pp. 19-31.
BibTeX:
@article{Gombas85,
  author = {E. Gombás and M. Bartha},
  title = {A Multi-visit Characterization of Absolutely Noncircular Attribute Grammars},
  journal = {Acta Cybernetica},
  year = {1985},
  volume = {7},
  pages = {19--31}
}
Göttler, H. & Grabska, E. (1985), "Attributed Graph-Grammars and Composition-Nets", In Int. Workshop on Graphtheoretic Concepts in Computer Science (WG '85). Würzburg. June 1985., pp. 119-130. Trauner Verlag.
BibTeX:
@inproceedings{Gottler85,
  author = {Herbert Göttler and Ewa Grabska},
  title = {Attributed Graph-Grammars and Composition-Nets},
  booktitle = {Int. Workshop on Graphtheoretic Concepts in Computer Science (WG '85)},
  publisher = {Trauner Verlag},
  year = {1985},
  pages = {119--130}
}
Gray, R. (1985), "Comparing Semantic Analysis Efficiency of a GAG Generated Compiler vs. Hand Written Compilers". Comp. Sc. Department, University of Colorado, Technical Report ECE~690, December, 1985.
BibTeX:
@techreport{Gray85,
  author = {Robert Gray},
  title = {Comparing Semantic Analysis Efficiency of a GAG Generated Compiler vs. Hand Written Compilers},
  year = {1985},
  number = {ECE~690}
}
Haas, O. (1985), "Formal Protocol Specification based on Attribute Grammars", In 5th Internat. Workshop on Protocol Specification, Testing, and Verification. Amsterdam. June 1985., pp. 39-48. Elsevier/North-Holland.
BibTeX:
@inproceedings{Haas85,
  author = {O. Haas},
  title = {Formal Protocol Specification based on Attribute Grammars},
  booktitle = {5th Internat. Workshop on Protocol Specification, Testing, and Verification},
  publisher = {Elsevier/North-Holland},
  year = {1985},
  pages = {39--48},
  note = {Toulouse-Moissac}
}
Herndon, Jr., R.M. (1985), "The Incompleat AG User's Guide and Reference Manual". Comp. Sc. Department, University of Minnesota, Technical Report 85-37, October, 1985.
BibTeX:
@techreport{Herndon85,
  author = {Robert M. Herndon, Jr.},
  title = {The Incompleat AG User's Guide and Reference Manual},
  year = {1985},
  number = {85-37}
}
Herndon, Jr., R.M. & Berzins, V.A. (1985), "AG: a Useful Attribute Grammar Translator Generator". Comp. Sc. Department, University of Minnesota, Technical Report 85-25, August, 1985.
BibTeX:
@techreport{Herndon85a,
  author = {Robert M. Herndon, Jr. and Valdis A. Berzins},
  title = {AG: a Useful Attribute Grammar Translator Generator},
  year = {1985},
  number = {85-25}
}
Hoffmann, B. (1985), "Unifying van-Wijngaarden and Attribute Grammars by Transformation". University Bremen, 1985.
BibTeX:
@techreport{Hoffmann85,
  author = {Berthold Hoffmann},
  title = {Unifying van-Wijngaarden and Attribute Grammars by Transformation},
  year = {1985}
}
Horwitz, S. (1985), "Generating Language-Based Editors: a Relationaly-Attributed Approach". School: Department of Comp. Sc., Cornell University. Ithaca, NY, August, 1985. (report TR 85-696)
BibTeX:
@phdthesis{Horwitz85,
  author = {Susan Horwitz},
  title = {Generating Language-Based Editors: a Relationaly-Attributed Approach},
  school = {Department of Comp. Sc., Cornell University},
  year = {1985},
  number = {report TR 85-696},
  url = {http://cs-tr.cs.cornell.edu:80/Dienst/UI/2.0/Describe/ncstrl.cornell%2fTR85-696}
}
Horwitz, S. & Teitelbaum, T. (1985), "Relations and Attributes: a Symbiotic Basis for Editing Environments", In ACM SIGPLAN '85 Symp. on Language Issues in Programming Environments. Seattle, WA, June, 1985. , pp. 93-106. ACM press.
BibTeX:
@incollection{Horwitz85a,
  author = {Susan Horwitz and Tim Teitelbaum},
  title = {Relations and Attributes: a Symbiotic Basis for Editing Environments},
  booktitle = {ACM SIGPLAN '85 Symp. on Language Issues in Programming Environments},
  publisher = {ACM press},
  year = {1985},
  pages = {93--106},
  note = {Published as ACM SIGPLAN Notices, volume 20, number 7}
}
Ishizuka, H. & Sassa, M. (1985), "A Compiler Generator Based on Attribute Grammars", In Procs. of 26th Programming Symposium. Hakone., pp. 69-80. IPS Japan.
BibTeX:
@inproceedings{Ishizuka85,
  author = {Harushi Ishizuka and Masataka Sassa},
  title = {A Compiler Generator Based on Attribute Grammars},
  booktitle = {Procs. of 26th Programming Symposium},
  publisher = {IPS Japan},
  year = {1985},
  pages = {69--80},
  note = {(in Japanese)}
}
Iwamoto, N. (1985), "Relational Attribute Grammars". Department of Comp. Sc., Yamanashi University, 1985.
BibTeX:
@techreport{Iwamoto85,
  author = {N. Iwamoto},
  title = {Relational Attribute Grammars},
  year = {1985},
  note = {(in Japanese)}
}
Jalili, F. (1985), "A General Incremental Evaluator for Attribute Grammars", Science of Computer Programming., February, 1985. Vol. 5(1), pp. 83-96.
BibTeX:
@article{Jalili85,
  author = {Fahimeh Jalili},
  title = {A General Incremental Evaluator for Attribute Grammars},
  journal = {Science of Computer Programming},
  year = {1985},
  volume = {5},
  number = {1},
  pages = {83--96}
}
Jia, X. & Qian, J. (1985), "Incremental Evaluation of Attributed Grammars for Incremental Programming Environments", In IEEE COMPSAC '85. Chicago, Il, October, 1985. , pp. 342-349.
BibTeX:
@incollection{Jia85,
  author = {Xiaoping Jia and Jiahua Qian},
  title = {Incremental Evaluation of Attributed Grammars for Incremental Programming Environments},
  booktitle = {IEEE COMPSAC '85},
  year = {1985},
  pages = {342--349}
}
Johnson, G.F. & Fischer, C.N. (1985), "A Meta-Language and System for Nonlocal Incremental Attribute Evaluation in Language-based Editors", In 12th ACM Symp. on Principles of Progr. Languages. New-Orleans, LA, January, 1985. , pp. 141-151. ACM press.
BibTeX:
@incollection{Johnson85,
  author = {Gregory F. Johnson and Charles N. Fischer},
  title = {A Meta-Language and System for Nonlocal Incremental Attribute Evaluation in Language-based Editors},
  booktitle = {12th ACM Symp. on Principles of Progr. Languages},
  publisher = {ACM press},
  year = {1985},
  pages = {141--151}
}
Johnsson, T. (1985), "Lambda Lifting: Transforming Programs to Recursive Equations", In Conf. on Func. Prog. Languages and Computer Architecture.. Mancy. ACM Press.
BibTeX:
@inproceedings{Johnsson85,
  author = {Thomas Johnsson},
  title = {Lambda Lifting: Transforming Programs to Recursive Equations},
  booktitle = {Conf. on Func. Prog. Languages and Computer Architecture.},
  publisher = {ACM Press},
  year = {1985},
  url = {http://www.cs.chalmers.se/ohnsson/Papers/lambda-lifting.ps.gz}
}
Jourdan, M. (1985), "Évaluation récursive des grammaires attribuées: deux implantations". INRIA, Technical Report 409, May, 1985.
BibTeX:
@techreport{Jourdan85,
  author = {Martin Jourdan},
  title = {Évaluation récursive des grammaires attribuées: deux implantations},
  year = {1985},
  number = {409},
  note = {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).}
}
Kaiser, G.E. (1985), "Specification of Interpreters and Debuggers using an Extension of Attribute Grammars". Department of Comp. Sc., Columbia University, Technical Report CUCS-196-85, November, 1985.
BibTeX:
@techreport{Kaiser85,
  author = {Gail E. Kaiser},
  title = {Specification of Interpreters and Debuggers using an Extension of Attribute Grammars},
  year = {1985},
  number = {CUCS-196-85}
}
Kaiser, G.E. (1985), "Semantics of Structure Editing Environments". School: Department of Comp. Sc., Carnegie-Mellon University. (report CMU-CS-85-131)
Abstract: This thesis addresses the processing of semantics by structure editor-based programming environments. This processing is peformed incrementally while the user writes and tests her programs. The semantics processing involves the manipulation of two kinds of properties, static and dynamic. Static properties can be determined by inspection of the program while dynamic properties reflect the interaction between the user and the programming environment. The implementor of a programming environment describes the semantics processing in terms of these properties. For example, symbol resolution, type checking, and code generation involve static properties while interpretation, run-time support and language-oriented debugging involve dynamic properties. Recent research in structure editing environments has focused on the generation of programming environments from descriptions. Several mechanisms have been proposed for writing the semantics description, and the most successful of these have been action routines and attribute grammars. However, action routines are written as a collection of imperative subroutines and it has proved difficult for an implementor need not be concerned with subtle interactions because all interactions among attribute grammar rules are handled automatically. Unfortunately, attribute grammars have been successfully applied only to the description of static properties, and have hitherto seemed unsuited to the description of dynamic properties. This thesis describes a very large extension to attribute grammars that solves this problem. The extended paradigm is called action equations. Action equations are written in a declarative notation that retains the flavor of attribute grammars but adds an easy means to express dynamic properties as well as static properties. The extensions to attribute grammars include attaching particular attribute grammar-style rules to events that represent uer commands; supporting propagation of events as well as supporting propagation of change with respect to attribute values; and limited support for non-applicative mechanisms, allowing attributes to be treated as variables and permitting modification in addition to replacement for changing the values of attributes. Together, these extensions are sufficient to support dynamic properties.
BibTeX:
@phdthesis{Kaiser85a,
  author = {Gail E. Kaiser},
  title = {Semantics of Structure Editing Environments},
  school = {Department of Comp. Sc., Carnegie-Mellon University},
  year = {1985},
  number = {report CMU-CS-85-131}
}
Kontos, J. (1985), "Natural Language Processing of Scientific/Technical Data, Knowledge and Text Bases", In Artint Workshop. Luxembourg.
BibTeX:
@inproceedings{Kontos85,
  author = {John Kontos},
  title = {Natural Language Processing of Scientific/Technical Data, Knowledge and Text Bases},
  booktitle = {Artint Workshop},
  year = {1985},
  note = {Re'fe'rence a` comple'ter.}
}
Koskimies, K. (1985), "A Note on One-Pass Evaluation of Attribute Grammars", BIT. Vol. 25, pp. 439-450.
BibTeX:
@article{Koskimies85,
  author = {Kai Koskimies},
  title = {A Note on One-Pass Evaluation of Attribute Grammars},
  journal = {BIT},
  year = {1985},
  volume = {25},
  pages = {439--450}
}
Lepp, M.V., Vooglaid, A.O. & Vyhandu, L.K. (1985), "ELMA---an Instrumental Tool to Build Programming Systems", In Soviet-French Symp. on Computer Science. Tallinn, May, 1985. , pp. 130-136. Institute of Cybernetics of the Academy of Sciences of the SSR of Estonia.
BibTeX:
@incollection{Lepp85,
  author = {M. V. Lepp and Aare O. Vooglaid and Leo K. Vyhandu},
  title = {ELMA---an Instrumental Tool to Build Programming Systems},
  booktitle = {Soviet-French Symp. on Computer Science},
  publisher = {Institute of Cybernetics of the Academy of Sciences of the SSR of Estonia},
  year = {1985},
  pages = {130--136}
}
Manion, F. (1985), "An Attribute Based Compiler Generator for Unrestricted Conditional Attribute Grammars". School: Department of Comp. Inf. Sc., Moore School of Elec. Eng. D2, University of Pennsylvania. Philadelphia, PA
BibTeX:
@mastersthesis{Manion85,
  author = {Frank Manion},
  title = {An Attribute Based Compiler Generator for Unrestricted Conditional Attribute Grammars},
  school = {Department of Comp. Inf. Sc., Moore School of Elec. Eng. D2, University of Pennsylvania},
  year = {1985}
}
Méristé, M.B. (1985), "Mixed Strategy Implementation of Attribute Grammars", In Soviet-French Symp. on Computer Science. Tallinn, May, 1985. , pp. 120-125. Institute of Cybernetics of the Academy of Sciences of the SSR of Estonia.
BibTeX:
@incollection{Meriste85,
  author = {Merik B. Méristé},
  title = {Mixed Strategy Implementation of Attribute Grammars},
  booktitle = {Soviet-French Symp. on Computer Science},
  publisher = {Institute of Cybernetics of the Academy of Sciences of the SSR of Estonia},
  year = {1985},
  pages = {120--125}
}
Möncke, U. (1985), "Generierung von Systemen zur Transformation attributierter Operatorbäume: Komponenten des Systems und Mechanismen der Generierung". School: University des Saarlandes. Saarbrücken
BibTeX:
@phdthesis{Moncke85,
  author = {Ulrich Möncke},
  title = {Generierung von Systemen zur Transformation attributierter Operatorbäume: Komponenten des Systems und Mechanismen der Generierung},
  school = {University des Saarlandes},
  year = {1985}
}
Mueckstein, E.-M.M. (1985), "Controlled Natural Language Interfaces: the Best of Three Worlds", In ACM Computer Science Conf.., March, 1985. ACM press.
BibTeX:
@incollection{Mueckstein85,
  author = {Eva-Maria M. Mueckstein},
  title = {Controlled Natural Language Interfaces: the Best of Three Worlds},
  booktitle = {ACM Computer Science Conf.},
  publisher = {ACM press},
  year = {1985}
}
Mughal, K.A. (1985), "Control Flow Aspects of Generating Runtime Facilities for Language-based Programming Environments", In IEEE Conf. on Software Tools. New York, NY, April, 1985. , pp. 85-91.
BibTeX:
@incollection{Mughal85,
  author = {Khalid A. Mughal},
  title = {Control Flow Aspects of Generating Runtime Facilities for Language-based Programming Environments},
  booktitle = {IEEE Conf. on Software Tools},
  year = {1985},
  pages = {85--91}
}
Naini, M. (1985), "Design of Attribute Evaluators and Attribute Machines". School: Department of Comp. Inf. Sc., Moore School of Elec. Eng. D2, University of Pennsylvania. Philadelphia, PA
BibTeX:
@phdthesis{Naini85,
  author = {M. Naini},
  title = {Design of Attribute Evaluators and Attribute Machines},
  school = {Department of Comp. Inf. Sc., Moore School of Elec. Eng. D2, University of Pennsylvania},
  year = {1985}
}
Parigot, D. (1985), "Un système interactif de trace des circularités dans une grammaire attribuée et optimisation du test de circularité". University de Paris-Sud, September, 1985.
BibTeX:
@techreport{Parigot85,
  author = {Didier Parigot},
  title = {Un système interactif de trace des circularités dans une grammaire attribuée et optimisation du test de circularité},
  year = {1985}
}
Raoult, J.-C. & Sethi, R. (1985), "On Finding Stacked Attributes". Laboratoire de Recherche en Informatique, University de Paris-Sud, Technical Report 206, February, 1985.
BibTeX:
@techreport{Raoult85,
  author = {Jean-Claude Raoult and Ravi Sethi},
  title = {On Finding Stacked Attributes},
  year = {1985},
  number = {206}
}
Rechenberg, P. & Mössenböck, H. (1985), "Ein Compiler-Generator für Mikrocomputer" München Hanser Verlag.
BibTeX:
@book{Rechenberg85,
  author = {P. Rechenberg and H. Mössenböck},
  title = {Ein Compiler-Generator für Mikrocomputer},
  publisher = {Hanser Verlag},
  year = {1985}
}
Riedewald, Gü. (1985), "Ein Modell für Programmiersprachen und Compiler auf der Basis Universeller Algebren", Journal of Information Processing Cybern.. Vol. 21(3), pp. 101-127.
BibTeX:
@article{Riedewald85,
  author = {Günter Riedewald},
  title = {Ein Modell für Programmiersprachen und Compiler auf der Basis Universeller Algebren},
  journal = {Journal of Information Processing Cybern.},
  year = {1985},
  volume = {21},
  number = {3},
  pages = {101--127}
}
Sasaki, H. (1985), "Global Storage Allocation in Attribute Evaluation". School: Department of Comp. Sc., Tokyo Institute of Technology.
BibTeX:
@phdthesis{Sasaki85,
  author = {Hisashi Sasaki},
  title = {Global Storage Allocation in Attribute Evaluation},
  school = {Department of Comp. Sc., Tokyo Institute of Technology},
  year = {1985}
}
Sassa, M., Ishizuka, H. & Nakata, I. (1985), "A Compiler Generator based on LR-attributed Grammars". Institute of Information Sciences. An International Journal, University of Tsukuba, Technical Report PL-7, 1985.
BibTeX:
@techreport{Sassa85,
  author = {Masataka Sassa and Harushi Ishizuka and Ikuo Nakata},
  title = {A Compiler Generator based on LR-attributed Grammars},
  year = {1985},
  number = {PL-7}
}
Sassa, M., Ishizuka, H. & Nakata, I. (1985), "A Contribution to LR-attributed Grammars", Journal of Information Processing., January, 1985. Vol. 8(3), pp. 196-206.
BibTeX:
@article{Sassa85a,
  author = {Masataka Sassa and Harushi Ishizuka and Ikuo Nakata},
  title = {A Contribution to LR-attributed Grammars},
  journal = {Journal of Information Processing},
  year = {1985},
  volume = {8},
  number = {3},
  pages = {196--206}
}
Sonnenschein, M. (1985), "Global Storage Cells for Attributes in an Attribute Grammar", Acta Informatica. Vol. 22, pp. 397-420.
BibTeX:
@article{Sonnenschein85,
  author = {Michael Sonnenschein},
  title = {Global Storage Cells for Attributes in an Attribute Grammar},
  journal = {Acta Informatica},
  year = {1985},
  volume = {22},
  pages = {397--420}
}
Thürmel, S. (1985), "Self-composability of Attribute Coupled Grammars". Institut für Informatik, Tech. University München, Technical Report TUM-I8518, August, 1985.
BibTeX:
@techreport{Thurmel85,
  author = {Sabine Thürmel},
  title = {Self-composability of Attribute Coupled Grammars},
  year = {1985},
  number = {TUM-I8518}
}
Yellin, D.M. & Mueckstein, E.-M.M. (1985), "Two-Way Translators based on Attribute Grammar Inversion", In 8th Int. Conf. on Software Engineering. London, August, 1985. , pp. 36-42.
BibTeX:
@incollection{Yellin85,
  author = {Daniel M. Yellin and Eva-Maria M. Mueckstein},
  title = {Two-Way Translators based on Attribute Grammar Inversion},
  booktitle = {8th Int. Conf. on Software Engineering},
  year = {1985},
  pages = {36--42}
}
Aho, A.V., Sethi, R. & Ullman, J.D. (1986), "Compilers: Principles, Techniques and Tools" Reading, MA Addison Wesley.
BibTeX:
@book{Aho86,
  author = {Alfred V. Aho and Ravi Sethi and Jeffrey D. Ullman},
  title = {Compilers: Principles, Techniques and Tools},
  publisher = {Addison Wesley},
  year = {1986}
}
op den Akker, R. (1986), "Deterministic Parsing of Attribute Grammars, part I: Top-down Strategies". Onderafdeling der Informatica, Tech. Hogeschool Twente, Technical Report INF-86-19, 1986.
BibTeX:
@techreport{Akker86,
  author = {Rieks op den Akker},
  title = {Deterministic Parsing of Attribute Grammars, part I: Top-down Strategies},
  year = {1986},
  number = {INF-86-19}
}
Alblas, H. (1986), "Incremental Simple Multi-pass Attribute Evaluation", In Procs. NGI/SION Symp. 1986., pp. 319-342.
BibTeX:
@inproceedings{Alblas86,
  author = {Henk Alblas},
  title = {Incremental Simple Multi-pass Attribute Evaluation},
  booktitle = {Procs. NGI/SION Symp. 1986},
  year = {1986},
  pages = {319--342},
  note = {See also: memorandum INF-86-27, Onderafdeling der Informatica, Tech. Hogeschool Twente (August 1986).}
}
Arbab, B. (1986), "Compiling Circular Attribute Grammars into Prolog", International Business Machines Corporation. Journal of Research and Development., May, 1986. Vol. 30(3), pp. 294-309.
BibTeX:
@article{Arbab86,
  author = {Bijan Arbab},
  title = {Compiling Circular Attribute Grammars into Prolog},
  journal = {International Business Machines Corporation. Journal of Research and Development},
  year = {1986},
  volume = {30},
  number = {3},
  pages = {294--309},
  note = {Also published as a report, IBM Los Angeles Scientific Center (July 1985).}
}
Bonnet, J. (1986), "Étude des principaux langages de description de grammaires attribuées et spécification d'un nouveau langage basé sur des grammaires abstraites". University d'Orléans, September, 1986.
BibTeX:
@techreport{Bonnet86,
  author = {Joël Bonnet},
  title = {Étude des principaux langages de description de grammaires attribuées et spécification d'un nouveau langage basé sur des grammaires abstraites},
  year = {1986}
}
(1986), "BULLET" Écully, January, 1986. Dépt. M.S.I., Ecole Centrale de Lyon.
BibTeX:
@book{Boulicaut86,,
  title = {BULLET},
  publisher = {Dépt. M.S.I., Ecole Centrale de Lyon},
  year = {1986},
  note = {This is a local journal. Complete address is: BP 163, F-69131 Écully Cedex (France).}
}
Chirica, L.M. & Martin, D.F. (1986), "Toward Compiler Implementation Correctness Proofs", ACM Trans. Progr. Languages and Systems., April, 1986. Vol. 8(2), pp. 185-214.
BibTeX:
@article{Chirica86,
  author = {Laurian M. Chirica and David F. Martin},
  title = {Toward Compiler Implementation Correctness Proofs},
  journal = {ACM Trans. Progr. Languages and Systems},
  year = {1986},
  volume = {8},
  number = {2},
  pages = {185--214}
}
Dencker, P. (1986), "Generative Attributierte Grammatiken". GMD, Technical Report 158, 1986.
BibTeX:
@techreport{Dencker86,
  author = {Peter Dencker},
  title = {Generative Attributierte Grammatiken},
  year = {1986},
  number = {158}
}
Edelstein, O. & Sagiv, S. (1986), "Machine Independent Optimizations via Attribute Grammars". IBM Israel Scientific Center, Technical Report TR88.187, 1986.
BibTeX:
@techreport{Edelstein86,
  author = {O. Edelstein and S. Sagiv},
  title = {Machine Independent Optimizations via Attribute Grammars},
  year = {1986},
  number = {TR88.187}
}
Engelfriet, J. (1986), "The Complexity of Languages Generated by Attribute Grammars", SIAM Journal on Computing., February, 1986. Vol. 15(1), pp. 70-86.
BibTeX:
@article{Engelfriet86,
  author = {Joost Engelfriet},
  title = {The Complexity of Languages Generated by Attribute Grammars},
  journal = {SIAM Journal on Computing},
  year = {1986},
  volume = {15},
  number = {1},
  pages = {70--86},
  note = {See also: memorandum INF-82-13, Onderafdeling der Informatica, Tech. Hogeschool Twente (November 1982).}
}
Engelfriet, J. (1986), "Context-Free Grammars with Storage". Vakgroep Informatica, Rijksuniversiteit Leiden, Technical Report 86-11, July, 1986.
BibTeX:
@techreport{Engelfriet86a,
  author = {Joost Engelfriet},
  title = {Context-Free Grammars with Storage},
  year = {1986},
  number = {86-11}
}
Farrow, R. (1986), "Automatic Generation of Fixed-point-finding Evaluators for Circular, but Well-defined, Attribute Grammars", In ACM SIGPLAN '86 Symp. on Compiler Construction. Palo Alto, CA, June, 1986. , pp. 85-98. ACM press.
BibTeX:
@incollection{Farrow86,
  author = {Rodney Farrow},
  title = {Automatic Generation of Fixed-point-finding Evaluators for Circular, but Well-defined, Attribute Grammars},
  booktitle = {ACM SIGPLAN '86 Symp. on Compiler Construction},
  publisher = {ACM press},
  year = {1986},
  pages = {85--98},
  note = {Published as ACM SIGPLAN Notices, volume 21, number 7}
}
Farrow, R. & Yellin, D.M. (1986), "A Comparison of Storage Optimizations in Automatically-Generated Attribute Evaluators", Acta Informatica. Vol. 23(4), pp. 393-427.
BibTeX:
@article{Farrow86a,
  author = {Rodney Farrow and Daniel M. Yellin},
  title = {A Comparison of Storage Optimizations in Automatically-Generated Attribute Evaluators},
  journal = {Acta Informatica},
  year = {1986},
  volume = {23},
  number = {4},
  pages = {393--427},
  note = {See also: Technical Report, Department of Comp. Sc., Columbia University, New York, NY (January 1985).}
}
Filé, G. (1986), "Machines for Attribute Grammars", Information and Control. Vol. 69(1-3), pp. 41-124.
BibTeX:
@article{File86,
  author = {Gilberto Filé},
  title = {Machines for Attribute Grammars},
  journal = {Information and Control},
  year = {1986},
  volume = {69},
  number = {1-3},
  pages = {41--124},
  note = {See also: memorandum INF-83-2, Onderafdeling der Informatica, Tech. Hogeschool Twente (January 1983).}
}
Filé, G. (1986), "Classical and Incremental Attribute Evaluation by Means of Recursive Procedures", In 11th Coll. on Trees in Algebra and Programming (CAAP '86). New York--Heidelberg--Berlin, March, 1986. Vol. 214, pp. 112-126. Springer-Verlag.
BibTeX:
@incollection{File86a,
  author = {Gilberto Filé},
  title = {Classical and Incremental Attribute Evaluation by Means of Recursive Procedures},
  booktitle = {11th Coll. on Trees in Algebra and Programming (CAAP '86)},
  publisher = {Springer-Verlag},
  year = {1986},
  volume = {214},
  pages = {112--126},
  note = {Nice}
}
Ganzinger, H., Giegerich, R. & Vach, M. (1986), "MARVIN: a Tool for Applicative and Modular Compiler Specifications". Fachbereich Informatik, University Dortmund, Technical Report 220, July, 1986.
BibTeX:
@techreport{Ganzinger86,
  author = {Harald Ganzinger and Robert Giegerich and Martin Vach},
  title = {MARVIN: a Tool for Applicative and Modular Compiler Specifications},
  year = {1986},
  number = {220}
}
Giegerich, R. (1986), "On the Relation between Descriptional Composition and Evaluation of Attribute Coupled Grammars". Fachbereich Informatik, University Dortmund, Technical Report 221, July, 1986.
BibTeX:
@techreport{Giegerich86,
  author = {Robert Giegerich},
  title = {On the Relation between Descriptional Composition and Evaluation of Attribute Coupled Grammars},
  year = {1986},
  number = {221}
}
Greim, M., Pistorius, S., Solsbacher, M. & Weisgerber, B. (1986), "POPSY and OPTRAN Manual". , Technical Report R.3.0, March, 1986.
BibTeX:
@techreport{Greim86,
  author = {Michael Greim and Stefan Pistorius and Monika Solsbacher and Beatrix Weisgerber},
  title = {POPSY and OPTRAN Manual},
  year = {1986},
  number = {R.3.0},
  note = {Revised by Ulrich Möncke (August 1986).}
}
Herndon, Jr., R.M. & Berzins, V.A. (1986), "A Method for the Construction of Dynamic, Lazy Evaluators for Functional Attribute Grammars". Comp. Sc. Department, University of Minnesota, Technical Report 86-6, February, 1986.
BibTeX:
@techreport{Herndon86,
  author = {Robert M. Herndon, Jr. and Valdis A. Berzins},
  title = {A Method for the Construction of Dynamic, Lazy Evaluators for Functional Attribute Grammars},
  year = {1986},
  number = {86-6}
}
Hirvonen, P. (1986), "An Implementation of Pascal using HLP '84". Department of Comp. Sc., University of Helsinki, Technical Report C-1986-5, 1986.
BibTeX:
@techreport{Hirvonen86,
  author = {P. Hirvonen},
  title = {An Implementation of Pascal using HLP '84},
  year = {1986},
  number = {C-1986-5},
  note = {(in Finnish)}
}
Hoover, R. (1986), "Dynamically Bypassing Copy Rule Chains in Attribute Grammars", In 13th ACM Symp. on Principles of Progr. Languages. St Petersburg Beach, Fl, January, 1986. , pp. 14-25. ACM press.
Abstract: Attribute grammars require copy rules to transfer values between attribute instances distant in an attributed parse tree. We introduce copy bypass attribute propagation that dynamically replaces copy rules with nonlocal dependencies, resulting in faster incremental evaluation. An evaluation strategy is used that approximates a topological ordering of attribute instances. The result is an efficient incremental evaluator that allows multiple subtree replacement on any noncircular attribute grammar.
BibTeX:
@incollection{Hoover86,
  author = {Roger Hoover},
  title = {Dynamically Bypassing Copy Rule Chains in Attribute Grammars},
  booktitle = {13th ACM Symp. on Principles of Progr. Languages},
  publisher = {ACM press},
  year = {1986},
  pages = {14--25}
}
Hoover, R. & Teitelbaum, T. (1986), "Efficient Incremental Evaluation of Aggregate Values in Attribute Grammars", In ACM SIGPLAN '86 Symp. on Compiler Construction. Palo Alto, CA, June, 1986. , pp. 39-50. ACM press.
BibTeX:
@incollection{Hoover86a,
  author = {Roger Hoover and Tim Teitelbaum},
  title = {Efficient Incremental Evaluation of Aggregate Values in Attribute Grammars},
  booktitle = {ACM SIGPLAN '86 Symp. on Compiler Construction},
  publisher = {ACM press},
  year = {1986},
  pages = {39--50},
  note = {Published as ACM SIGPLAN Notices, volume 21, number 7}
}
Horwitz, S. & Teitelbaum, T. (1986), "Generating Editing Environments Based on Relations and Attributes", ACM Trans. Progr. Languages and Systems., October, 1986. Vol. 8(4), pp. 577-608.
BibTeX:
@article{Horwitz86,
  author = {Susan Horwitz and Tim Teitelbaum},
  title = {Generating Editing Environments Based on Relations and Attributes},
  journal = {ACM Trans. Progr. Languages and Systems},
  year = {1986},
  volume = {8},
  number = {4},
  pages = {577--608}
}
Hudson, S.E. (1986), "A User Interface Management System which Supports Direct Manipulation". School: Department of Comp. Sc., University of Colorado. Boulder
BibTeX:
@phdthesis{Hudson86,
  author = {Scott E. Hudson},
  title = {A User Interface Management System which Supports Direct Manipulation},
  school = {Department of Comp. Sc., University of Colorado},
  year = {1986}
}
Hudson, S.E. & King, R. (1986), "A Generator of Direct Manipulation Office Systems", ACM Trans. on Office Inf. Sys.. Vol. 4(2), pp. 132.
Abstract: A system for generating direct manipulation office systems is described. In these systems, the user directly manipulates graphical representations of office entities instead of dealing with these entities abstractly through a command language or menu system. These systems employ a new semantic data model to describe office entities. New techniques based on attribute grammars and incremental attribute evaluation are used to implement this data model in an efficient manner. In addition, the system provides a means of generating sophisticated graphics-based user interfaces that are integrated with the underlying semantic model. Finally, the generated systems contain a general user reversal and recovery (or undo) mechanism that allows them to be much more tolerant of human errors.
BibTeX:
@article{Hudson86a,
  author = {S. E. Hudson and R. King},
  title = {A Generator of Direct Manipulation Office Systems},
  journal = {ACM Trans. on Office Inf. Sys.},
  year = {1986},
  volume = {4},
  number = {2},
  pages = {132}
}
Hudson, S.E. & King, R. (1986), "Implementing a User Interface as a System of Attributes", In ACM Conf. on Programming Environments. New York--Heidelberg--Berlin, June, 1986. Vol. 244, pp. 143-149. Springer-Verlag.
BibTeX:
@incollection{Hudson86b,
  author = {Scott E. Hudson and Roger King},
  title = {Implementing a User Interface as a System of Attributes},
  booktitle = {ACM Conf. on Programming Environments},
  publisher = {Springer-Verlag},
  year = {1986},
  volume = {244},
  pages = {143--149},
  note = {Trondheim}
}
Jones, L.G. (1986), "Incremental VLSI Design Systems Based on Circular Attribute Grammars". School: Comp. Sc. Department, Pennsylvania State University.
BibTeX:
@phdthesis{Jones86,
  author = {Larry G. Jones},
  title = {Incremental VLSI Design Systems Based on Circular Attribute Grammars},
  school = {Comp. Sc. Department, Pennsylvania State University},
  year = {1986}
}
Jones, L.G. & Simon, J. (1986), "Hierarchical VLSI Design Systems Based on Attribute Grammars", In 13th ACM Symp. on Principles of Progr. Languages. St Petersburg Beach, FL, January, 1986. , pp. 58-69. ACM press.
BibTeX:
@incollection{Jones86a,
  author = {Larry G. Jones and Janos Simon},
  title = {Hierarchical VLSI Design Systems Based on Attribute Grammars},
  booktitle = {13th ACM Symp. on Principles of Progr. Languages},
  publisher = {ACM press},
  year = {1986},
  pages = {58--69}
}
Julié, C. (1986), "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". Dépt. d'Informatique, University d'Orléans, September, 1986.
BibTeX:
@techreport{Julie86,
  author = {Catherine Julié},
  title = {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},
  year = {1986}
}
Kaiser, G.E. (1986), "Generation of Run-time Environments", In ACM SIGPLAN '86 Symp. on Compiler Construction. Palo Alto, CA, June, 1986. , pp. 51-57. ACM press.
Abstract: Attribute grammars have been used for many years for automated compiler construction. Attribute grammars support the description of semantic analysis, code generation and some code optimization in a formal declarative style. Other tools support the automation of lexical analysis and parsing. However, there is one large part of compiler construction that is missing from our toolkit: run-time environments. This paper introduces an extension of attribute grammars that supports the generation of run-time environments. The extension also supports the generation of interpreters, symbolic debugging tools, and other execution-time facilities.
BibTeX:
@incollection{Kaiser86,
  author = {Gail E. Kaiser},
  title = {Generation of Run-time Environments},
  booktitle = {ACM SIGPLAN '86 Symp. on Compiler Construction},
  publisher = {ACM press},
  year = {1986},
  pages = {51--57},
  note = {Published as ACM SIGPLAN Notices, volume 21, number 7}
}
Kaiser, G.E. & Garlan, D. (1986), "MELD: A Declarative Language for Writing Methods". Carnegie-Mellon University, June, 1986.
Abstract: Object-oriented programs are written as collections of messages. When an object receives a message, the system attempts to find a method with the same name as given in the message. The system queries the class that defines the object. If the class provides a corresponding method, the method is performed. The method may return a value to the sender of the message. It may have side-effects on the local memory of the object. The method may send messages to additional objects as part of it computation. This notion of encapsulating operations, in the form of methods, within the definition of an object is common to essentially all object-oriented programming languages. Messages and methods are currently written in what is fundamentally a procedural style. A messagge is a procedure call with several parameters, where one parameter is distinguished as the object to which the message is sent. A method is a procedure: it may return a value, have side-effects, and invoke other procedures by sending messages. We believe that the object-oriented framework lends itself quite easily to the description of programs in a declarative language. In this paper, we propose a declarative language for writing messages and methods. Our notation retains all the important features of object-oriented programming, but adds a higher level of abstraction to the description of object behavior. Our language, called MELD, is an extension of attribute grammars. Its implementation takes advantage of algorithms developed for incremental attribute grammar evaluation in the context of language-based programming environments.
BibTeX:
@techreport{kaiser86a,
  author = {G. E. Kaiser and D. Garlan},
  title = {MELD: A Declarative Language for Writing Methods},
  year = {1986},
  pages = {1--20}
}
Kaplan, S.M. (1986), "Incremental Attribute Evaluation on Graphs". University of Illinois at Urbana-Champaign, Technical Report UIUC-DCS-86-1309, December, 1986.
BibTeX:
@techreport{Kaplan86,
  author = {Simon M. Kaplan},
  title = {Incremental Attribute Evaluation on Graphs},
  year = {1986},
  number = {UIUC-DCS-86-1309},
  note = {revised version}
}
Kaplan, S.M., Goering, S.K. & Campbell, R.H. (1986), "Supporting the Software Development Process with Attributed NLC Graph Grammars", In Third Int. Workshop on Graph Grammars and their Application to Computer Science. New York--Heidelberg--Berlin. December 1986. Volume 291, pp. 309-325. Springer-Verlag.
BibTeX:
@inproceedings{Kaplan86a,
  author = {Simon M. Kaplan and Steven K. Goering and Roy H. Campbell},
  title = {Supporting the Software Development Process with Attributed NLC Graph Grammars},
  booktitle = {Third Int. Workshop on Graph Grammars and their Application to Computer Science},
  publisher = {Springer-Verlag},
  year = {1986},
  volume = {291},
  pages = {309--325},
  note = {Warrenton}
}
Kaplan, S.M. & Kaiser, G.E. (1986), "Incremental Attribute Evaluation in Distributed Language-based Environments", In 5th ACM Symp. on Principles of Distributed Computing. Calgary, August, 1986. , pp. 121-130. ACM press.
BibTeX:
@incollection{Kaplan86b,
  author = {Simon M. Kaplan and Gail E. Kaiser},
  title = {Incremental Attribute Evaluation in Distributed Language-based Environments},
  booktitle = {5th ACM Symp. on Principles of Distributed Computing},
  publisher = {ACM press},
  year = {1986},
  pages = {121--130},
  note = {See also: report UIUCDCS-R-86-1294, University of Illinois at Urbana-Champaign (September 1986).}
}
Kastens, U. & Schmidt, M. (1986), "Lifetime Analysis for Procedure Parameters", In European Symp. on Programming (ESOP '86). New York--Heidelberg--Berlin, March, 1986. Vol. 213, pp. 53-69. Springer-Verlag.
BibTeX:
@incollection{Kastens86,
  author = {Uwe Kastens and M. Schmidt},
  title = {Lifetime Analysis for Procedure Parameters},
  booktitle = {European Symp. on Programming (ESOP '86)},
  publisher = {Springer-Verlag},
  year = {1986},
  volume = {213},
  pages = {53--69},
  note = {Saarbrücken}
}
Katayama, T. & Sasaki, H. (1986), "Global Storage Allocation in Attribute Evaluation", In 13th ACM Symp. on Principles of Progr. Languages. St Petersburg Beach, Fl, January, 1986. , pp. 26-37. ACM press.
BibTeX:
@incollection{Katayama86,
  author = {Takuya Katayama and Hisashi Sasaki},
  title = {Global Storage Allocation in Attribute Evaluation},
  booktitle = {13th ACM Symp. on Principles of Progr. Languages},
  publisher = {ACM press},
  year = {1986},
  pages = {26--37},
  note = {Extended version in RIMS Symp. on Software Science and Engineering II, Kyoto, LNCS 220, Springer-Verlag, pp. 181-211 (1984).}
}
Koskimies, K. (1986), "Object-oriented Language Processing with HLP84". Department of Comp. Sc., University of Helsinki, Technical Report C-1986-3, 1986.
Abstract: Language processor generators are systems that produce various language processors (including compilers) on the basis of a high-level specification. The design of language processor generators is discussed on the basis of experiments with a traditional compiler writing system (HLP78) employing pure LALR parsing and general attribute grammars. It is argued that these methods are too primitive from the practical point of view: the concepts of the specification language should be on a higher abstraction level. The design of a new language processor generator, HLP84, is based on this view. This system is an attempt to provide high-level tools for a restricted class of applications (one-pass analysis). The syntactic facilities include regular expressions on the right-hand sides of productions, a disambiguating mechanism that is integrated with regular expressions, and a mechanism for using semantic information to aid parsing; the semantic facilities include e.g. a built-in database for storing the descriptors of program entities and a simple mechanism for semantic error handling. Early experiences with the new system show that in spite of the general overhead caused by the higher automation level, the system allows the generation of reasonably efficient processors.
BibTeX:
@techreport{Koskimies86,
  author = {Kai Koskimies},
  title = {Object-oriented Language Processing with HLP84},
  year = {1986},
  number = {C-1986-3}
}
Kuiper, M.F. & Swierstra, S.D. (1986), "Using Attribute Grammars to Derive Efficient Functional Programs". Utrecht University, Technical Report RUU--CS--86--16, 1986.
BibTeX:
@techreport{Kuiper86,
  author = {Matthijs F. Kuiper and S. Doaitse Swierstra},
  title = {Using Attribute Grammars to Derive Efficient Functional Programs},
  year = {1986},
  number = {RUU--CS--86--16},
  url = {ftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1986/1986-16.ps.gz}
}
Lecocq, B. (1986), "Optimisation d'Évaluateurs d'Attributs". University de Bordeaux~I, 1986.
BibTeX:
@techreport{Lecocq86,
  author = {B. Lecocq},
  title = {Optimisation d'Évaluateurs d'Attributs},
  year = {1986}
}
Lepp, M.V., Vooglaid, A.O. & Vyhandu, L.K. (1986), "ELMA as an Instrumental System for Building Practical Programming Systems", In TPI '86 (Data Processing, Compiler Writing, Programming). Tallinn , pp. 85-92. Faculty of Economics LIX.
Abstract: sur ELMA (pd)
BibTeX:
@incollection{Lepp86,
  author = {M. V. Lepp and Aare O. Vooglaid and Leo K. Vyhandu},
  title = {ELMA as an Instrumental System for Building Practical Programming Systems},
  booktitle = {TPI '86 (Data Processing, Compiler Writing, Programming)},
  publisher = {Faculty of Economics LIX},
  year = {1986},
  pages = {85--92}
}
Lipps, P. (1986), "Komplexe Attribute---Mechanismen zur Verwaltung und Berechnung in einem baumtransformierenden System". School: FB~10 -- Informatik, University des Saarlandes. Saarbrücken
BibTeX:
@phdthesis{Lipps86,
  author = {Peter Lipps},
  title = {Komplexe Attribute---Mechanismen zur Verwaltung und Berechnung in einem baumtransformierenden System},
  school = {FB~10 -- Informatik, University des Saarlandes},
  year = {1986}
}
Melichar, B. (1986), "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.
BibTeX:
@inproceedings{Melichar86,
  author = {Borivoj Melichar},
  title = {Attributed Translation Directed by LR Parser and its Implementation},
  booktitle = {Proc. of the Bautzen Workshop on Compiler Compilers and Incremental Compilation},
  publisher = {Akad. der Wissenschaften der DDR},
  year = {1986}
}
Möncke, U., Weisgerber, B. & Wilhelm, R. (1986), "Generative Support for Transformational Programming", In ESPRIT '85: Status Report of Continuing Work. Amsterdam--New York , pp. 511-527. Elsevier.
BibTeX:
@incollection{Moncke86,
  author = {Ulrich Möncke and Beatrix Weisgerber and Reinhard Wilhelm},
  title = {Generative Support for Transformational Programming},
  booktitle = {ESPRIT '85: Status Report of Continuing Work},
  publisher = {Elsevier},
  year = {1986},
  pages = {511--527}
}
Moraitis, C. & Papakonstantinou (1986), "Attribute grammars in decision making", In 25th IEEE Conference on Decision and Control. Athens, Greece.
BibTeX:
@inproceedings{MorPap86,
  author = {C. Moraitis and Papakonstantinou},
  title = {Attribute grammars in decision making},
  booktitle = {25th IEEE Conference on Decision and Control},
  year = {1986}
}
Moraitis, C., Papakonstantinou, G. & Tzafestas, S. (1986), "Attribute grammars as a diagnostic tool", In First European Workshop on Fault Diagnostics, Reliability and Rel ated Knowledge-Based Approaches. Rhodes, Greece.
BibTeX:
@inproceedings{MorPapTza86,
  author = {C. Moraitis and G. Papakonstantinou and S. Tzafestas},
  title = {Attribute grammars as a diagnostic tool},
  booktitle = {First European Workshop on Fault Diagnostics, Reliability and Rel ated Knowledge-Based Approaches},
  year = {1986}
}
Nakata, I. & Sassa, M. (1986), "L-attributed LL(1) Grammars are LR-attributed", Information Processing Letters., December, 1986. Vol. 23(6), pp. 325-328.
BibTeX:
@article{Nakata86,
  author = {Ikuo Nakata and Masataka Sassa},
  title = {L-attributed LL(1) Grammars are LR-attributed},
  journal = {Information Processing Letters},
  year = {1986},
  volume = {23},
  number = {6},
  pages = {325--328}
}
Nilsson, U. (1986), "AID: an Alternative Implementation of DCGs", New Generation Computing. Vol. 4
BibTeX:
@article{Nilsson86,
  author = {U. Nilsson},
  title = {AID: an Alternative Implementation of DCGs},
  journal = {New Generation Computing},
  year = {1986},
  volume = {4}
}
Olk, M. (1986), "Generierung eines effizienten Attributschedulers für ein baumtransformierendes System". School: FB~10 -- Informatik, University des Saarlandes. Saarbrücken
BibTeX:
@phdthesis{Olk86,
  author = {Matthias Olk},
  title = {Generierung eines effizienten Attributschedulers für ein baumtransformierendes System},
  school = {FB~10 -- Informatik, University des Saarlandes},
  year = {1986}
}
Paakki, J. (1986), "The Implementation of the Semantic Part of HLP84". Department of Comp. Sc., University of Helsinki, Technical Report C-1986-4, 1986.
BibTeX:
@techreport{Paakki86,
  author = {Jukka Paakki},
  title = {The Implementation of the Semantic Part of HLP84},
  year = {1986},
  number = {C-1986-4}
}
Papakonstantinou, G.K. & Kontos, J. (1986), "Knowledge Representation with Attribute Grammars", The Computer Journal. Vol. 29(3), pp. 241-245.
Abstract: The use of attribute grammars for knowledge representation is examined in the present paper. It is shown how data knowledge and knowledge-base knowledge can be represented using syntactic and semantic notation. Control knowledge is represented by the parsing mechanism of the interpreter used. It is proposed that attribute grammar evaluators may prove useful knowledge engineering tools.
BibTeX:
@article{Papakonstantin86,
  author = {George K. Papakonstantinou and John Kontos},
  title = {Knowledge Representation with Attribute Grammars},
  journal = {The Computer Journal},
  year = {1986},
  volume = {29},
  number = {3},
  pages = {241--245}
}
Papakonstantinou, G., Moraitis, C. & Panayiotopoulos, T. (1986), "An attribute grammar interpreter as a knowledge engineering tool", Angewandte Informatik. (9), pp. 382-388.
BibTeX:
@article{PapMorPan86,
  author = {G. Papakonstantinou and C. Moraitis and T. Panayiotopoulos},
  title = {An attribute grammar interpreter as a knowledge engineering tool},
  journal = {Angewandte Informatik},
  year = {1986},
  number = {9},
  pages = {382--388}
}
Papakonstantinou, G., Skordalakis, E. & Gritzali, F. (1986), "An attribute grammar for QRS detection", Pattern Recognition. Vol. 19(4), pp. 297-303.
BibTeX:
@article{PapSkoGri86,
  author = {G. Papakonstantinou and E. Skordalakis and F. Gritzali},
  title = {An attribute grammar for QRS detection},
  journal = {Pattern Recognition},
  year = {1986},
  volume = {19},
  number = {4},
  pages = {297--303}
}
Pfreundschuh, M. (1986), "A Model for Building Modular Systems Based on Attribute Grammars". School: University of Iowa.
BibTeX:
@phdthesis{Pfreundschuh86,
  author = {Mary Pfreundschuh},
  title = {A Model for Building Modular Systems Based on Attribute Grammars},
  school = {University of Iowa},
  year = {1986}
}
Räihä, K.-J. & Tarhio, J. (1986), "A Globalizing Transformation for Attribute Grammars", In ACM SIGPLAN '86 Symp. on Compiler Construction. Palo Alto, CA, June, 1986. , pp. 74-84. ACM press.
BibTeX:
@incollection{Raiha86,
  author = {Kari-Jouko Räihä and Jorma Tarhio},
  title = {A Globalizing Transformation for Attribute Grammars},
  booktitle = {ACM SIGPLAN '86 Symp. on Compiler Construction},
  publisher = {ACM press},
  year = {1986},
  pages = {74--84},
  note = {Published as ACM SIGPLAN Notices, volume 21, number 7}
}
Reps, T., Marceau, C. & Teitelbaum, T. (1986), "Remote Attribute Updating for Language-based Editors", In 13th ACM Symp. on Principles of Progr. Languages. St Petersburg Beach, FL, January, 1986. , pp. 1-13. ACM press.
Abstract: A major drawback to the use of attribute grammars in language-based editors has been that attributes can only depend on neighboring attributes in a program's syntax tree. This paper concerns new attribute-grammar-based methods that, for a suitable class of grammars, overcome this fundamental limitation. The techniques presented allow the updating algorithm to skip over arbitrarily large sections of the tree than more straightforward updating methods visit node by node. These techniques are then extended to deal with aggregate values, so that the attribute updating procedure need only follow dependencies due to a changed component of an aggregate value. Although our methods work only for a restricted class of attribute grammars, satisfying the necessary restrictions should not place an undue burden on the writer of the grammar.
BibTeX:
@incollection{Reps86,
  author = {Thomas Reps and Carla Marceau and Tim Teitelbaum},
  title = {Remote Attribute Updating for Language-based Editors},
  booktitle = {13th ACM Symp. on Principles of Progr. Languages},
  publisher = {ACM press},
  year = {1986},
  pages = {1--13}
}
Reps, T. & Snelting, G. (1986), "Context Relations Implemented with Attribute Grammars". Department of Comp. Sc., Cornell University, January, 1986.
BibTeX:
@techreport{Reps86a,
  author = {Thomas Reps and Georg Snelting},
  title = {Context Relations Implemented with Attribute Grammars},
  year = {1986}
}
Serebryakov, V.A. (1986), "Attribute Translation Techniques" Moscow Programming Languages.
BibTeX:
@book{Serebryakov86,
  author = {Vladimir A. Serebryakov},
  title = {Attribute Translation Techniques},
  publisher = {Programming Languages},
  year = {1986}
}
Shinoda, Y. (1986), "Specification of Dynamic Systems based on Attribute Grammar". Department of Comp. Sc., Tokyo Inst. of Technology, Technical Report CS-SSE-86-2, 1986.
BibTeX:
@techreport{Shinoda86,
  author = {Yoichi Shinoda},
  title = {Specification of Dynamic Systems based on Attribute Grammar},
  year = {1986},
  number = {CS-SSE-86-2}
}
Sideri, M., Papakonstantinou, G., Skordalakis, E. & Efraimidis, S. (1986), "Error recovery using attribute grammars", In First European Workshop on Fault Diagnostics, Reliability and Related Knowledge-Based Approaches. Rhodes, Greece.
BibTeX:
@inproceedings{SidPapSkoEfr86,
  author = {M. Sideri and G. Papakonstantinou and E. Skordalakis and S. Efraimidis},
  title = {Error recovery using attribute grammars},
  booktitle = {First European Workshop on Fault Diagnostics, Reliability and Related Knowledge-Based Approaches},
  year = {1986}
}
Simon, E. (1986), "A new Programming Methodology using Attribute Grammars", Acta Cybernetica. Szeged Vol. 7(4), pp. 425-436.
BibTeX:
@article{Simon86,
  author = {Endre Simon},
  title = {A new Programming Methodology using Attribute Grammars},
  journal = {Acta Cybernetica},
  year = {1986},
  volume = {7},
  number = {4},
  pages = {425--436}
}
Simon, E. (1986), "Program Specification using Attribute Grammar", In Conf. on Automata, Languages and Programming Systems. Budapest, May, 1986. , pp. 216-229. Dept. of Mathematics and Computer Science, Karl Marx University of Economics.
BibTeX:
@incollection{Simon86a,
  author = {Endre Simon},
  title = {Program Specification using Attribute Grammar},
  booktitle = {Conf. on Automata, Languages and Programming Systems},
  publisher = {Dept. of Mathematics and Computer Science, Karl Marx University of Economics},
  year = {1986},
  pages = {216--229},
  note = {Salgótarján, Hungary}
}
Tiemann, M.D. (1986), "Attribute Grammar Tutorial: the Implementation of mini-Pascal". Microelectronic and Computer Technology Corporation, Technical Report PP-410-86, December, 1986.
BibTeX:
@techreport{Tiemann86,
  author = {Michael D. Tiemann},
  title = {Attribute Grammar Tutorial: the Implementation of mini-Pascal},
  year = {1986},
  number = {PP-410-86}
}
Tiemann, M.D. (1986), "ICC: an Incremental Compiler Compiler based on Attribute Evaluation". Microelectronic and Computer Technology Corporation, Technical Report PP-412-86, December, 1986.
BibTeX:
@techreport{Tiemann86a,
  author = {Michael D. Tiemann},
  title = {ICC: an Incremental Compiler Compiler based on Attribute Evaluation},
  year = {1986},
  number = {PP-412-86}
}
Tittelbach, H. (1986), "Effiziente Attributspeicherverwaltung für ein baumtransformierendes System". School: FB~10 -- Informatik, University des Saarlandes. Saarbrücken
BibTeX:
@phdthesis{Tittelbach86,
  author = {Heiner Tittelbach},
  title = {Effiziente Attributspeicherverwaltung für ein baumtransformierendes System},
  school = {FB~10 -- Informatik, University des Saarlandes},
  year = {1986}
}
Toczki, J., Simon, E., Garai, T., Kocsis, F. & Gyimóthy, T. (1986), "Automatic Compiler Generation", In Conf. on Automata, Languages and Programming Systems. Budapest, May, 1986. , pp. 289-297. Dept. of Math. and Comput. Sc., Karl Marx University of Economics.
BibTeX:
@incollection{Toczki86,
  author = {Janos Toczki and Endre Simon and T. Garai and Ferenc Kocsis and Tibor Gyimóthy},
  title = {Automatic Compiler Generation},
  booktitle = {Conf. on Automata, Languages and Programming Systems},
  publisher = {Dept. of Math. and Comput. Sc., Karl Marx University of Economics},
  year = {1986},
  pages = {289--297},
  note = {Salgótarján, Hungary}
}
Tokuda, T. (1986), "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. Vol. E69(9), pp. 980-987.
BibTeX:
@article{Tokuda86,
  author = {Takehiro Tokuda},
  title = {Transformation of Attribute Grammars into Efficient Action Routines by Patch Introduction},
  journal = {The Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E},
  year = {1986},
  volume = {E69},
  number = {9},
  pages = {980--987}
}
Tokuda, T. (1986), "Two Methods for Eliminating Redundant Copy Operations from the Evaluation of Attribute Grammars", Journal of Information Processing. Vol. 9(2), pp. 79-85.
BibTeX:
@article{Tokuda86a,
  author = {Takehiro Tokuda},
  title = {Two Methods for Eliminating Redundant Copy Operations from the Evaluation of Attribute Grammars},
  journal = {Journal of Information Processing},
  year = {1986},
  volume = {9},
  number = {2},
  pages = {79--85}
}
Watt, D.A. (1986), "Executable Semantic Descriptions", Software---Practice and Experience. Vol. 16(1), pp. 13-43.
BibTeX:
@article{Watt86,
  author = {David A. Watt},
  title = {Executable Semantic Descriptions},
  journal = {Software---Practice and Experience},
  year = {1986},
  volume = {16},
  number = {1},
  pages = {13--43}
}
Yellin, D.M. & Mueckstein, E.-M.M. (1986), "The Automatic Inversion of Attribute Grammars", Institute of Electrical and Electronics Engineers. Transactions on Software Engineering., May, 1986. Vol. SE-12(5), pp. 590-599.
BibTeX:
@article{Yellin86,
  author = {Daniel M. Yellin and Eva-Maria M. Mueckstein},
  title = {The Automatic Inversion of Attribute Grammars},
  journal = {Institute of Electrical and Electronics Engineers. Transactions on Software Engineering},
  year = {1986},
  volume = {SE-12},
  number = {5},
  pages = {590--599},
  note = {See also: report RC 10957, IBM T.J. Watson Research Center, Yorktown Heights, NY (January 1985).}
}
Alblas, H. (1987), "Iteration of Transformation Passes over Attributed Program Trees". Onderafdeling der Informatica, Tech. Hogeschool Twente, Technical Report INF-87-28, September, 1987.
BibTeX:
@techreport{Alblas87,
  author = {Henk Alblas},
  title = {Iteration of Transformation Passes over Attributed Program Trees},
  year = {1987},
  number = {INF-87-28}
}
Alblas, H. (1987), "One-pass Transformations of Attributed Program Trees", Acta Informatica., June, 1987. Vol. 24(3), pp. 299-352.
BibTeX:
@article{Alblas87a,
  author = {Henk Alblas},
  title = {One-pass Transformations of Attributed Program Trees},
  journal = {Acta Informatica},
  year = {1987},
  volume = {24},
  number = {3},
  pages = {299--352},
  note = {See also: memorandum INF-86-30, Onderafdeling der Informatica, Tech. Hogeschool Twente (October 1986).}
}
Alblas, H. (1987), "Pass-oriented Attribute Evaluation and Attributed Tree Transformations". School: Onderafdeling der Informatica, Tech. Hogeschool Twente., October, 1987.
BibTeX:
@phdthesis{Alblas87b,
  author = {Henk Alblas},
  title = {Pass-oriented Attribute Evaluation and Attributed Tree Transformations},
  school = {Onderafdeling der Informatica, Tech. Hogeschool Twente},
  year = {1987}
}
Alpern, B., Carle, A., Rosen, B., Sweeney, P. & Zadeck, F.K. (1987), "Incremental Evaluation of Attributed Graphs". IBM T.J. Watson Research Center, Technical Report 13205, October, 1987.
BibTeX:
@techreport{Alpern87,
  author = {Bowen Alpern and Alan Carle and Barry Rosen and Peter Sweeney and F. Kenneth Zadeck},
  title = {Incremental Evaluation of Attributed Graphs},
  year = {1987},
  number = {13205},
  note = {Also published as Technical Report CS-87-29, Department of Comp. Sc., Brown University, Providence, RI}
}
Ayrault, C. (1987), "Implantation en C des structures de données du langage OLGA". University d'Orléans, September, 1987.
BibTeX:
@techreport{Ayrault87,
  author = {Christine Ayrault},
  title = {Implantation en C des structures de données du langage OLGA},
  year = {1987}
}
Barbar, K. (1987), "Attributed Context-free Tree Grammars". Dépt. d'Informatique, University de Bordeaux~I, Technical Report I-8716, April, 1987.
BibTeX:
@techreport{Barbar87,
  author = {Kablan Barbar},
  title = {Attributed Context-free Tree Grammars},
  year = {1987},
  number = {I-8716}
}
Barford, L.A. & Zanden, B.T.V. (1987), "Attribute Grammars in Constraint-based Graphics Systems". Cornell University, Computer Science Department, Technical Report CORNELLCS//TR87-838, June, 1987.
Abstract: A constraint-based graphics system provides a flexible, intuitive framework for describing relationships among graphical objects in applications such as document preparation, font design, and solid modelling. This paper describes two constraint-based graphics systems, micro-COSM and the IDEAL Synthesizer, and their implementation in terms of attribute grammars. The implementation of these two systems is noteworthy since they represent the first interactive constraint-based graphics systems that are implemented using attribute grammars. Our experiences with attribute grammars suggest that they provide a powerful framework for representing constraints and extracting important semantic information such as the equations to be solved by the constraint solver. We discuss the advantages of using attribute grammars in constraint-based graphics and from our experiences make several observations about the way attribute grammars should be used.
BibTeX:
@techreport{Barford87,
  author = {Lee Alton Barford and Bradley T. Vander Zanden},
  title = {Attribute Grammars in Constraint-based Graphics Systems},
  year = {1987},
  number = {CORNELLCS//TR87-838},
  pages = {30}
}
Böhm, H.-Jü. & Zwanepoel, W. (1987), "Parallel Attribute Grammar Evaluation", In 7th Int. Conf. on Distributed Computing Systems. Berlin, September, 1987. , pp. 347-354.
BibTeX:
@incollection{Bohm87,
  author = {Hans-Jürgen Böhm and Willy Zwanepoel},
  title = {Parallel Attribute Grammar Evaluation},
  booktitle = {7th Int. Conf. on Distributed Computing Systems},
  year = {1987},
  pages = {347--354}
}
Christ-Neumann, M.-L. & Schmidt, H.-W. (1987), "ASDL---an Object-oriented Specification Language for Syntax-Directed Environments", In European Software Eng. Conf. (ESEC '87). Strasbourg, September, 1987. , pp. 77-85.
BibTeX:
@incollection{Christ-Neumann87,
  author = {M.-L. Christ-Neumann and H.-W. Schmidt},
  title = {ASDL---an Object-oriented Specification Language for Syntax-Directed Environments},
  booktitle = {European Software Eng. Conf. (ESEC '87)},
  year = {1987},
  pages = {77--85}
}
Eloranta, J. & Tarpila, K. (1987), "The Implementation of an Estelle-Pascal Preprocessor". Department of Comp. Sc., University of Helsinki, Technical Report C-1987-22, 1987.
BibTeX:
@techreport{Eloranta87,
  author = {J. Eloranta and K. Tarpila},
  title = {The Implementation of an Estelle-Pascal Preprocessor},
  year = {1987},
  number = {C-1987-22}
}
Engelfriet, J., Leith, G. & Rozenberg, G. (1987), "Apex Graph Grammars and Attribute Grammars". Vakgroep Informatica, Rijksuniversiteit Leiden, Technical Report 87-04, March, 1987.
BibTeX:
@techreport{Engelfriet87,
  author = {Joost Engelfriet and G. Leith and Grzegorz Rozenberg},
  title = {Apex Graph Grammars and Attribute Grammars},
  year = {1987},
  number = {87-04}
}
Farrow, R. & Yellin, D.M. (1987), "Generalized Inversion of Translation Specifications". IBM T.J. Watson Research Center, Technical Report 12925, July, 1987.
BibTeX:
@techreport{Farrow87,
  author = {Rodney Farrow and Daniel M. Yellin},
  title = {Generalized Inversion of Translation Specifications},
  year = {1987},
  number = {12925}
}
Feng, A., Sugiyama, Y., Fujii, M. & Torii, K. (1987), "Generating Practical Prolog Programs from Attribute Grammars", In IEEE COMPSAC '87. Tokyo, October, 1987. , pp. 605-612.
BibTeX:
@incollection{Feng87,
  author = {An Feng and Yuji Sugiyama and Mamoru Fujii and Koji Torii},
  title = {Generating Practical Prolog Programs from Attribute Grammars},
  booktitle = {IEEE COMPSAC '87},
  year = {1987},
  pages = {605--612}
}
Feng, A., Sugiyama, Y., Fujii, M. & Torii, K. (1987), "Optimizations in a Processor of Attribute Grammars". IPS Japan, Technical Report SF20-5, 1987.
BibTeX:
@techreport{Feng87a,
  author = {An Feng and Yuji Sugiyama and Mamoru Fujii and Koji Torii},
  title = {Optimizations in a Processor of Attribute Grammars},
  year = {1987},
  number = {SF20-5},
  note = {(in Japanese)}
}
Filé, G. (1987), "Classical and Incremental Attribute Evaluation by Means of Recursive Procedures", Theoretical Computer Science., January, 1987. Vol. 53(1), pp. 25-65.
BibTeX:
@article{File87,
  author = {Gilberto Filé},
  title = {Classical and Incremental Attribute Evaluation by Means of Recursive Procedures},
  journal = {Theoretical Computer Science},
  year = {1987},
  volume = {53},
  number = {1},
  pages = {25--65}
}
Garcia, J., Jourdan, M. & Rizk, A. (1987), "An Implementation of PARLOG Using High-Level Tools", In ESPRIT '87: Achievements and Impact. Amsterdam, November, 1987. , pp. 1265-1275. North-Holland.
BibTeX:
@incollection{Garcia87,
  author = {José Garcia and Martin Jourdan and Antoine Rizk},
  title = {An Implementation of PARLOG Using High-Level Tools},
  booktitle = {ESPRIT '87: Achievements and Impact},
  publisher = {North-Holland},
  year = {1987},
  pages = {1265--1275},
  note = {Brussels}
}
Grossmann, R., Hutschenreiter, J., Lampe, J., Lötzsch, J. & Mager, K. (1987), "Fachsprachensystem DEPOT2a". , 1987.
BibTeX:
@techreport{Grossmann87,
  author = {R. Grossmann and J. Hutschenreiter and J. Lampe and J. Lötzsch and K. Mager},
  title = {Fachsprachensystem DEPOT2a},
  year = {1987}
}
Gyimóthy, T. & Toczki, J. (1987), "Syntactic Pattern Recognition in the HLP/PAS System", Acta Cybernetica. Szeged Vol. 8(1), pp. 79-88.
BibTeX:
@article{Gyimothy87,
  author = {Tibor Gyimóthy and Janos Toczki},
  title = {Syntactic Pattern Recognition in the HLP/PAS System},
  journal = {Acta Cybernetica},
  year = {1987},
  volume = {8},
  number = {1},
  pages = {79--88}
}
Hall, M.L. (1987), "The Optimization of Automatically Generated Compilers". School: Department of Comp. Sc. University of Colorado. Boulder
BibTeX:
@phdthesis{Hall87,
  author = {M. L. Hall},
  title = {The Optimization of Automatically Generated Compilers},
  school = {Department of Comp. Sc. University of Colorado},
  year = {1987}
}
Hoover, R. (1987), "Incremental Graph Evaluation". School: Department of Comp. Sc., Cornell University. Ithaca, NY, May, 1987. (report TR 87-836)
BibTeX:
@phdthesis{Hoover87,
  author = {Roger Hoover},
  title = {Incremental Graph Evaluation},
  school = {Department of Comp. Sc., Cornell University},
  year = {1987},
  number = {report TR 87-836},
  url = {http://cs-tr.cs.cornell.edu:80/Dienst/UI/2.0/Describe/ncstrl.cornell%2fTR87-836}
}
Hudson, S.E. (1987), "Incremental Attribute Evaluation: an Algorithm for Lazy Evaluation in Graphs". University of Arizona, Technical Report TR~87--20, 1987.
BibTeX:
@techreport{Hudson87,
  author = {Scott E. Hudson},
  title = {Incremental Attribute Evaluation: an Algorithm for Lazy Evaluation in Graphs},
  year = {1987},
  number = {TR~87--20}
}
Johnsson, T. (1987), "Attribute Grammars as a Functional Programming Paradigm", In Func. Prog. Languages and Computer Architecture. New York--Heidelberg--Berlin, September, 1987. Vol. 274, pp. 154-173. Springer-Verlag.
BibTeX:
@incollection{Johnsson87,
  author = {Thomas Johnsson},
  title = {Attribute Grammars as a Functional Programming Paradigm},
  booktitle = {Func. Prog. Languages and Computer Architecture},
  publisher = {Springer-Verlag},
  year = {1987},
  volume = {274},
  pages = {154--173},
  note = {Portland}
}
Johnsson, T. (1987), "Target code generation from the G-machine code". Programming Methodology Group, University of Goteborg and Chalmers University of Technology, Technical Report 39, February, 1987.
Abstract: G machine is a stack machine for von-Neumann-like execution of lazy functional languages using graph reduction. Paper describes target code generation from G-machine code in a compiler for lazy-ML. 2 methods: (a) generates naive code like macro expansion (b) better, avoids redundant operations Code generation expressed as an attribute grammar over G-machine code sequences. http://cs.chalmers.se/welcome.eng.html (CSci Chalmers) ('94)
BibTeX:
@techreport{Johnsson87a,
  author = {T. Johnsson},
  title = {Target code generation from the G-machine code},
  year = {1987},
  number = {39},
  note = {Part of the PhD thesis: Compiling Lazy Functional Languages, 1987. Presented at the Graph Reduction Workshop, Santa Fe, Sep 1986}
}
Kaiser, G.E., Kaplan, S.M. & Micallef, J. (1987), "Multi-user, Distributed Language-Based Environments", IEEE Software., November, 1987. Vol. ??, pp. 58-67.
BibTeX:
@article{Kaiser87,
  author = {Gail E. Kaiser and Simon M. Kaplan and Josephine Micallef},
  title = {Multi-user, Distributed Language-Based Environments},
  journal = {IEEE Software},
  year = {1987},
  volume = {??},
  pages = {58--67}
}
Kaplan, S.M. (1987), "Incremental Attribute Evaluation on Node-label Controlled Graphs". Department of Comp. Sc., University of Illinois at Urbana-Champaign, Technical Report UIUCDCS-R-87-1309, May, 1987.
BibTeX:
@techreport{Kaplan87,
  author = {Simon M. Kaplan},
  title = {Incremental Attribute Evaluation on Node-label Controlled Graphs},
  year = {1987},
  number = {UIUCDCS-R-87-1309}
}
Kastens, U. (1987), "Lifetime Analysis for Attributes", Acta Informatica., November, 1987. Vol. 24(6), pp. 633-652.
BibTeX:
@article{Kastens87,
  author = {Uwe Kastens},
  title = {Lifetime Analysis for Attributes},
  journal = {Acta Informatica},
  year = {1987},
  volume = {24},
  number = {6},
  pages = {633--652}
}
Knopp, Jü. & Hudson, S.E. (1987), "Attributierte Transitionsnetze und ihre Anwendungen in Programmierumgebungen Incremental Attribute Evaluation: a Flexible Algorithm for Lazy Update", ACM Trans. Progr. Languages and Systems., July, 1987. Vol. 13(3), pp. 315-341. Institut für Informatik, Tech. University München.
BibTeX:
@article{Knopp87,
  author = {Jürgen Knopp and Scott E. Hudson},
  title = {Attributierte Transitionsnetze und ihre Anwendungen in Programmierumgebungen Incremental Attribute Evaluation: a Flexible Algorithm for Lazy Update},
  journal = {ACM Trans. Progr. Languages and Systems},
  publisher = {Institut für Informatik, Tech. University München},
  year = {1987},
  volume = {13},
  number = {3},
  pages = {315--341},
  note = {Bericht TUM-INFO-10-87-I14-350}
}
Koskimies, K. & Paakki, J. (1987), "TOOLS: a Unifying Approach to Object-Oriented Language Interpretation", In ACM SIGPLAN '87 Symp. on Interpreters and Interpretetive Techniques. St. Paul, MN, June, 1987. , pp. 153-164. ACM press.
BibTeX:
@incollection{Koskimies87,
  author = {Kai Koskimies and Jukka Paakki},
  title = {TOOLS: a Unifying Approach to Object-Oriented Language Interpretation},
  booktitle = {ACM SIGPLAN '87 Symp. on Interpreters and Interpretetive Techniques},
  publisher = {ACM press},
  year = {1987},
  pages = {153--164},
  note = {Published as ACM SIGPLAN Notices, volume 22, number 7}
}
Krieg-Brückner, B., Hoffmann, B., Ganzinger, H., Broy, M., Wilhelm, R., Möncke, U., Weisgerber, B., McGettrick, A.D., Campbell, I.G. & Winterstein, G. (1987), "PROSPECTRA: Program Development by Specification and Transformation", In ESPRIT '86: Results and Achievements. Amsterdam--New York Elsevier.
BibTeX:
@incollection{Krieg-Bruckner87,
  author = {Bernd Krieg-Brückner and Berthold Hoffmann and Harald Ganzinger and Manfred Broy and Reinhard Wilhelm and Ulrich Möncke and Beatrix Weisgerber and A. D. McGettrick and Ian G. Campbell and Georg Winterstein},
  title = {PROSPECTRA: Program Development by Specification and Transformation},
  booktitle = {ESPRIT '86: Results and Achievements},
  publisher = {Elsevier},
  year = {1987},
  note = {Bruxelles}
}
Lehtonen, T. (1987), "HLP84: Pascal Implementation of the Semantic Metalanguage". Department of Comp. Sc., University of Helsinki, Technical Report C-1987-27, 1987.
BibTeX:
@techreport{Lehtonen87,
  author = {Tapio Lehtonen},
  title = {HLP84: Pascal Implementation of the Semantic Metalanguage},
  year = {1987},
  number = {C-1987-27}
}
Leszezylowski, J., Bonnier, S. & Maluszynski, J. (1987), "Logic Programs with External Procedures: Introducing S-Unification", April, 1987.
BibTeX:
@unpublished{Leszezylowski87,
  author = {J. Leszezylowski and S. Bonnier and Jan Maluszynski},
  title = {Logic Programs with External Procedures: Introducing S-Unification},
  year = {1987},
  note = {University of Linköping}
}
Lötzsch, J. (1987), "Specialised Language Centered Communication and its Automatic Implementation", In Problem Solving Environments for Scientific Computing. Amsterdam North-Holland.
BibTeX:
@incollection{Lotzsch87,
  author = {J. Lötzsch},
  title = {Specialised Language Centered Communication and its Automatic Implementation},
  booktitle = {Problem Solving Environments for Scientific Computing},
  publisher = {North-Holland},
  year = {1987}
}
Mamrak, S.A., Kaebling, M.J., Nicholas, C.K. & Share, M. (1987), "A Software Architecture for Supporting the Exchange of Electronic Manuscripts", Communications of the Association for Computing Machinery., May, 1987. Vol. 30(5), pp. 408-414.
BibTeX:
@article{Mamrak87,
  author = {S. A. Mamrak and M. J. Kaebling and C. K. Nicholas and M. Share},
  title = {A Software Architecture for Supporting the Exchange of Electronic Manuscripts},
  journal = {Communications of the Association for Computing Machinery},
  year = {1987},
  volume = {30},
  number = {5},
  pages = {408--414}
}
Möncke, U. (1987), "Grammar Flow Analysis". University des Saarlandes, Technical Report S.1.3.--R-2.2, March 1986, revised January, 1987.
BibTeX:
@techreport{Moncke87,
  author = {Ulrich Möncke},
  title = {Grammar Flow Analysis},
  year = {1987},
  number = {S.1.3.--R-2.2}
}
Niemi, T. (1987), "A Systematic Specification Schema based on Attribute Grammars for Multi-level Database Applications". Department of Comp. Sc., University of Tampere, Technical Report A-1987-5, March, 1987.
BibTeX:
@techreport{Niemi87,
  author = {Timo Niemi},
  title = {A Systematic Specification Schema based on Attribute Grammars for Multi-level Database Applications},
  year = {1987},
  number = {A-1987-5}
}
Nishino, T. (1987), "The Intrinsically Exponential Complexity of the k-visit Property Problem for Attribute Grammars". , 1987.
BibTeX:
@techreport{Nishino87,
  author = {T. Nishino},
  title = {The Intrinsically Exponential Complexity of the k-visit Property Problem for Attribute Grammars},
  year = {1987}
}
O'Connor, M.A. & Lemone, K.A. (1987), "A Method to Improve Testing and Debugging in Robotic Programs Using Attribute Grammars", In ACM Missouri ???., February, 1987. , pp. 225-230.
BibTeX:
@incollection{OConnor87,
  author = {Mary Ann O'Connor and Karen A. Lemone},
  title = {A Method to Improve Testing and Debugging in Robotic Programs Using Attribute Grammars},
  booktitle = {ACM Missouri ???},
  year = {1987},
  pages = {225--230}
}
Parigot, D. (1987), "Mise en œuvre des grammaires attribuées: transformation, évaluation incrémentale, optimisations". University de Paris-Sud, September, 1987.
BibTeX:
@techreport{Parigot87,
  author = {Didier Parigot},
  title = {Mise en œuvre des grammaires attribuées: transformation, évaluation incrémentale, optimisations},
  year = {1987}
}
Reps, T. & Demers, A. (1987), "Sublinear-Space Evaluation Algorithms for Attribute Grammars", ACM Trans. Progr. Languages and Systems., July, 1987. Vol. 9(3), pp. 408-440.
BibTeX:
@article{Reps87,
  author = {Thomas Reps and Alan Demers},
  title = {Sublinear-Space Evaluation Algorithms for Attribute Grammars},
  journal = {ACM Trans. Progr. Languages and Systems},
  year = {1987},
  volume = {9},
  number = {3},
  pages = {408--440}
}
Röhrich, J. (1987), "Graph Attribution with Multiple Attribute Grammars", ACM SIGPLAN Notices., November, 1987. Vol. 22(11), pp. 55-70.
Abstract: Attributed graphs are well suited to represent structured sets of data objects. A multiple attribute grammar, MTAG, consists of several attribute grammars that describe an attributed graph as a union of attributed trees. Thus, from an MTAG one can automatically generate attribute evaluators for graphs. Dependency analysis at generation time of the attribute evaluator leads to fast attribute evaluation, and to significant space savings due to attribute overlay.
BibTeX:
@article{Rohrich87,
  author = {Johannes Röhrich},
  title = {Graph Attribution with Multiple Attribute Grammars},
  journal = {ACM SIGPLAN Notices},
  year = {1987},
  volume = {22},
  number = {11},
  pages = {55--70}
}
Rörich, J. (1987), "Graph Attribution with Multiple Attribute Grammars", ACM SIGPLAN Notices., November, 1987. Vol. 22(11), pp. 55-70.
BibTeX:
@article{Rorich87,
  author = {Johannes Rörich},
  title = {Graph Attribution with Multiple Attribute Grammars},
  journal = {ACM SIGPLAN Notices},
  year = {1987},
  volume = {22},
  number = {11},
  pages = {55--70}
}
Rosselet, A. (1987), "Language Definition Based Compiler Development", J. Systems and Software., June, 1987. Vol. 7, pp. 145-161.
BibTeX:
@article{Rosselet87,
  author = {A. Rosselet},
  title = {Language Definition Based Compiler Development},
  journal = {J. Systems and Software},
  year = {1987},
  volume = {7},
  pages = {145--161}
}
Ryder, B.G. & Carroll, M.D. (1987), "Incremental Data Flow Analysis via Attributes". Department of Comp. Sc., Rutgers University, Technical Report LCSR-TR-93, June, 1987.
BibTeX:
@techreport{Ryder87,
  author = {Barbara G. Ryder and M. D. Carroll},
  title = {Incremental Data Flow Analysis via Attributes},
  year = {1987},
  number = {LCSR-TR-93}
}
Sassa, M., Ishizuka, H. & Nakata, I. (1987), "ECLR-attributed Grammars: a Practical Class of LR-attributed Grammars", Information Processing Letters., January, 1987. Vol. 24(1), pp. 31-41.
BibTeX:
@article{Sassa87,
  author = {Masataka Sassa and Harushi Ishizuka and Ikuo Nakata},
  title = {ECLR-attributed Grammars: a Practical Class of LR-attributed Grammars},
  journal = {Information Processing Letters},
  year = {1987},
  volume = {24},
  number = {1},
  pages = {31--41}
}
Schütte, A. (1987), "Spezifikation une Generierung von Übersetzern für Graph-Sprachen durch attributierte Graph-Grammatiken". School: EXpress-Edition. Berlin
BibTeX:
@phdthesis{Schutte87,
  author = {A. Schütte},
  title = {Spezifikation une Generierung von Übersetzern für Graph-Sprachen durch attributierte Graph-Grammatiken},
  school = {EXpress-Edition},
  year = {1987}
}
Serebryakov, V.A. (1987), "Construction of Efficient Multi-stage Compilers with the Attribute TWS" Moscow, (?), 1987.
BibTeX:
@unpublished{Serebryakov87,
  author = {Vladimir A. Serebryakov},
  title = {Construction of Efficient Multi-stage Compilers with the Attribute TWS},
  year = {1987},
  note = {Comp. Center of the Academy of Sciences}
}
Sonnenschein, M. (1987), "Graph Translation Schemes to Generate Compiler Parts", #TOPLAS#., October, 1987. Vol. 9(4), pp. 473-490. ACM.
Abstract: Graph translation schemes-GTSs-are a generalization of attribute grammars and of some ideas in Koster's language CDL2. They are specially designed to support a compiler writer in defining parts of the back-end of his compiler, but they can also be useful for the specification of the analysis pass of a compiler. GTSs combine elements of functional and of algorithmic specification techniques to allow iterative attribute evaluation and attributing of program graphs. GTSs consist of only a few syntactical elements. We present operational semantics and discuss improvements in the efficiency of the prosposed implementation of GTSs.
BibTeX:
@article{sonnenschein87,
  author = {M. Sonnenschein},
  title = {Graph Translation Schemes to Generate Compiler Parts},
  journal = {#TOPLAS#},
  publisher = {ACM},
  year = {1987},
  volume = {9},
  number = {4},
  pages = {473--490}
}
Souah, A. (1987), "Système de transformation d'arbres attribués: étude des principaux systèmes et spécification d'un nouveau système". University d'Orléans, September, 1987.
BibTeX:
@techreport{Souah87,
  author = {Aziz Souah},
  title = {Système de transformation d'arbres attribués: étude des principaux systèmes et spécification d'un nouveau système},
  year = {1987}
}
Spyropoulos, C.D. & Kontos, J. (1987), "Automatic Organization Diagnosis based on Behavioural Modelling with Grammars", In Int. Conf. on Modelling and Simulation. Karlsruhe
BibTeX:
@incollection{Spyropoulos87,
  author = {C. D. Spyropoulos and John Kontos},
  title = {Automatic Organization Diagnosis based on Behavioural Modelling with Grammars},
  booktitle = {Int. Conf. on Modelling and Simulation},
  year = {1987},
  note = {Re'fe'rence a` comple'ter.}
}
Tarhio, J. & Räihä, K.-J. (1987), "A Simplifying Transformation for Attribute Grammars". Department of Comp. Sc., University of Tampere, Technical Report A-1987-4, 1987.
BibTeX:
@techreport{Tarhio87,
  author = {Jorma Tarhio and Kari-Jouko Räihä},
  title = {A Simplifying Transformation for Attribute Grammars},
  year = {1987},
  number = {A-1987-4}
}
Tiemann, M.D. (1987), "Removing Redundancy in Attribute Grammars". Parallel Processing Program, Microelectronic and Computer Technology Corporation, July, 1987.
BibTeX:
@techreport{Tiemann87,
  author = {Michael D. Tiemann},
  title = {Removing Redundancy in Attribute Grammars},
  year = {1987}
}
Tokuda, T. (1987), "Code Improvement Techniques in the Transformation of Attribute Grammars into Efficient Action Routines", Journal of Information Processing. Vol. 10(1), pp. 27-32.
BibTeX:
@article{Tokuda87,
  author = {Takehiro Tokuda},
  title = {Code Improvement Techniques in the Transformation of Attribute Grammars into Efficient Action Routines},
  journal = {Journal of Information Processing},
  year = {1987},
  volume = {10},
  number = {1},
  pages = {27--32}
}
Yamashita, Y., Sassa, M. & Nakata, I. (1987), "A Friendship Club Problem and its Application to Attribute Grammars", Computer Software. Vol. 4(3), pp. 28-40.
BibTeX:
@article{Yamashita87,
  author = {Y. Yamashita and Masataka Sassa and Ikuo Nakata},
  title = {A Friendship Club Problem and its Application to Attribute Grammars},
  journal = {Computer Software},
  year = {1987},
  volume = {4},
  number = {3},
  pages = {28--40},
  note = {(in Japanese)}
}
op den Akker, R. (1988), "Deterministic Parsing of Attribute Grammars, part II: Left-corner Strategies". Onderafdeling der Informatica, Tech. Hogeschool Twente, Technical Report INF-88-67, 1988.
BibTeX:
@techreport{Akker88,
  author = {Rieks op den Akker},
  title = {Deterministic Parsing of Attribute Grammars, part II: Left-corner Strategies},
  year = {1988},
  number = {INF-88-67}
}
Alblas, H. (1988), "Attributed Tree Transformations with Delayed and Smart Reevaluation". Onderafdeling der Informatica, Tech. Hogeschool Twente, Technical Report INF-88-45, 1988.
BibTeX:
@techreport{Alblas88,
  author = {Henk Alblas},
  title = {Attributed Tree Transformations with Delayed and Smart Reevaluation},
  year = {1988},
  number = {INF-88-45}
}
Alpern, B., Carle, A., Rosen, B., Sweeney, P. & Zadeck, F.K. (1988), "Graph Attribution as a Specification Paradigm", In ACM SIGSOFT/SIGPLAN Symp. on Practical Software Development Environments. Boston, MA, November, 1988. , pp. 121-129. ACM press.
Abstract: An interactive software development environment can be viewed as a structure-based editor, provided that structure is broadly interpreted. The user sees and manipulates complex objects at various levels of detail. To help provide these services in a uniform way that can readily respond to changes in the programming language(s) supported or in the preferences of individual users, some programming environments use attribute grammars. The attributed graph specifications (AGSs) defined are inspired by attribute grammars but are free of their restriction to structures expressible by parse trees generated by context-free grammars. An AGS deals with whatever structure is appropriate in a given application. The graph concept is not tied to any decision about pictorial representation. The AGS formalism is a uniform paradigm for specifying the desired relations among many and varied chunks of information, some of which are changed by the user. The benefits of the original attribute grammar formalism were confined to parse trees and severely restricted manipulations of parse trees. The AGS paradigm extends those benefits to software development on a larger scale.
BibTeX:
@incollection{Alpern88,
  author = {Bowen Alpern and Alan Carle and Barry Rosen and Peter Sweeney and F. Kenneth Zadeck},
  title = {Graph Attribution as a Specification Paradigm},
  booktitle = {ACM SIGSOFT/SIGPLAN Symp. on Practical Software Development Environments},
  publisher = {ACM press},
  year = {1988},
  pages = {121--129},
  note = {Joint issue with ACM SIGPLAN Notices 24, 2 (February 1989)Published as SIGSOFT Software Eng. Notes, volume 13, number 5}
}
Alpern, B., Hoover, R., Rosen, B., Sweeney, P. & Zadeck, F.K. (1988), "Maintaining Solutions to Changing Interdependent Equations". Department of Comp. Sc., Brown University, Technical Report CS-88-13, November, 1988.
BibTeX:
@techreport{Alpern88a,
  author = {Bowen Alpern and Roger Hoover and Barry Rosen and Peter Sweeney and F. Kenneth Zadeck},
  title = {Maintaining Solutions to Changing Interdependent Equations},
  year = {1988},
  number = {CS-88-13}
}
Alpern, B., Hoover, R., Rosen, B.K., Sweeney, P.F. & Zadeck, F.K. (1988), "Keeping Priorities Straight: an Investigation of Incremental Algorithms". Department of Comp. Sc., Brown University, Technical Report CS--88--13, November, 1988.
BibTeX:
@techreport{Alpern88b,
  author = {Bowen Alpern and Roger Hoover and Barry K. Rosen and Peter F. Sweeney and F. Kenneth Zadeck},
  title = {Keeping Priorities Straight: an Investigation of Incremental Algorithms},
  year = {1988},
  number = {CS--88--13}
}
Anderson, D.P. (1988), "Automated Protocol Implementation with RTAG", IEEE Transactions on Software Engineering., March, 1988. Vol. 14(3), pp. 291-300.
Abstract: RTAG is a language based on an attribute grammar notation for specifying protocols. Its main design goals are: 1) to support concise and easily understood expression of complex real-world protocols, and 2) to serve as the basis of a portable software system for automated protocol implementation. This paper summarizes the RTAG language, gives examples of its use, sketches the algorithms used in generating implementation from these specifications, and describes a UNIX-based automated implementation system for RTAG.
BibTeX:
@article{Anderson88,
  author = {D. P. Anderson},
  title = {Automated Protocol Implementation with RTAG},
  journal = {IEEE Transactions on Software Engineering},
  year = {1988},
  volume = {14},
  number = {3},
  pages = {291--300}
}
Attali, I. (1988), "Compiling Typol with Attribute Grammars", In Programming Languages Implementation and Logic Programming. New York--Heidelberg--Berlin, May, 1988. Vol. 348, pp. 252-272. Springer-Verlag.
BibTeX:
@incollection{Attali88,
  author = {Isabelle Attali},
  title = {Compiling Typol with Attribute Grammars},
  booktitle = {Programming Languages Implementation and Logic Programming},
  publisher = {Springer-Verlag},
  year = {1988},
  volume = {348},
  pages = {252--272},
  note = {Orléans}
}
Attali, I. & Franchi-Zannettacci, P. (1988), "Unification-Free Execution of Typol Programs by Semantic Attribute Evaluation", In Actes du Séminaire Franco-Soviétique Informatika 88. Nice, February, 1988. , pp. 9-26. INRIA.
BibTeX:
@incollection{Attali88a,
  author = {Isabelle Attali and Paul Franchi-Zannettacci},
  title = {Unification-Free Execution of Typol Programs by Semantic Attribute Evaluation},
  booktitle = {Actes du Séminaire Franco-Soviétique Informatika 88},
  publisher = {INRIA},
  year = {1988},
  pages = {9--26},
  note = {See also: rapport RR-864, INRIA, Rocquencourt (July 1988)}
}
Belmonte, M. (1988), "A Practical Attribute Grammar Circularity Test". Department of Comp. Sc., Cornell University, Technical Report TR~88-920, June, 1988.
BibTeX:
@techreport{Belmonte88,
  author = {Matthew Belmonte},
  title = {A Practical Attribute Grammar Circularity Test},
  year = {1988},
  number = {TR~88-920},
  url = {http://cs-tr.cs.cornell.edu:80/Dienst/UI/2.0/Describe/ncstrl.cornell%2fTR88-920}
}
Benary, J. (1988), "Attributed Grammars and Two-dimensional Formula Languages", In Specialized Languages as Tools for Programming Technology. Tallinn, January, 1988. , pp. 7-15.
BibTeX:
@incollection{Benary88,
  author = {J. Benary},
  title = {Attributed Grammars and Two-dimensional Formula Languages},
  booktitle = {Specialized Languages as Tools for Programming Technology},
  year = {1988},
  pages = {7--15}
}
Boulicaut, J.-F. & Beney, J. (1988), "Métacompilation et programmation: des règles méthodologiques pour la spécification et la programmation", Génie Logiciel & Systèmes Experts., March, 1988. (11), pp. 36-48.
BibTeX:
@article{Boulicaut88,
  author = {Jean-Francois Boulicaut and Jean Beney},
  title = {Métacompilation et programmation: des règles méthodologiques pour la spécification et la programmation},
  journal = {Génie Logiciel & Systèmes Experts},
  year = {1988},
  number = {11},
  pages = {36--48}
}
Carroll, M.D. & Ryder, B.G. (1988), "Incremental Data Flow Analysis via Dominator and Attribute Updates", In 15th ACM Symp. on Principles of Progr. Languages. San Diego, CA, January, 1988. , pp. 274-284. ACM press.
BibTeX:
@incollection{Carroll88,
  author = {M. D. Carroll and Barbara G. Ryder},
  title = {Incremental Data Flow Analysis via Dominator and Attribute Updates},
  booktitle = {15th ACM Symp. on Principles of Progr. Languages},
  publisher = {ACM press},
  year = {1988},
  pages = {274--284}
}
Chabrier, B., Lextrait, V. & Franchi-Zannettacci, P. (1988), "GIGAS: a Graphical Interface Generator from Attribute Specifications", In Actes des Journées Int. ``Le Génie Logiciel et ses Applications''. Paris, December, 1988. , pp. 1265-1283. EC2.
BibTeX:
@incollection{Chabrier88,
  author = {Bruno Chabrier and Vincent Lextrait and Paul Franchi-Zannettacci},
  title = {GIGAS: a Graphical Interface Generator from Attribute Specifications},
  booktitle = {Actes des Journées Int. ``Le Génie Logiciel et ses Applications''},
  publisher = {EC2},
  year = {1988},
  pages = {1265--1283},
  note = {Toulouse}
}
Chapman, N.P. (1988), "Attribute Grammars and Finite Automata". Comp. Sc. Department, University College, Technical Report RN/88/9, March, 1988.
BibTeX:
@techreport{Chapman88,
  author = {Nigel P. Chapman},
  title = {Attribute Grammars and Finite Automata},
  year = {1988},
  number = {RN/88/9}
}
Christiansen, H. (1988), "Structure Sharing in Attribute Grammars", In Programming Languages Implementation and Logic Programming. New York--Heidelberg--Berlin, May, 1988. Vol. 348, pp. 180-200. Springer-Verlag.
BibTeX:
@incollection{Christiansen88,
  author = {Henning Christiansen},
  title = {Structure Sharing in Attribute Grammars},
  booktitle = {Programming Languages Implementation and Logic Programming},
  publisher = {Springer-Verlag},
  year = {1988},
  volume = {348},
  pages = {180--200},
  note = {Orléans}
}
Courcelle, B. & Deransart, P. (1988), "Proofs of Partial Correctness for Attribute Grammars with Application to Recursive Procedures and Logic Programming", Information and Computation., July, 1988. Vol. 78(1), pp. 1-55.
BibTeX:
@article{Courcelle88,
  author = {Bruno Courcelle and Pierre Deransart},
  title = {Proofs of Partial Correctness for Attribute Grammars with Application to Recursive Procedures and Logic Programming},
  journal = {Information and Computation},
  year = {1988},
  volume = {78},
  number = {1},
  pages = {1--55}
}
Deransart, P., Jourdan, M. & Lorho, B. (1988), "Attribute Grammars: Definitions, Systems and Bibliography" New York--Heidelberg--Berlin, August, 1988. Vol. 323 Springer-Verlag.
BibTeX:
@book{Deransart88,
  author = {Pierre Deransart and Martin Jourdan and Bernard Lorho},
  title = {Attribute Grammars: Definitions, Systems and Bibliography},
  publisher = {Springer-Verlag},
  year = {1988},
  volume = {323}
}
Deransart, P. & Maluszynski, J. (1988), "A Grammatical View of Logic Programming", In Programming Languages Implementation and Logic Programming. New York--Heidelberg--Berlin, May, 1988. Vol. 348, pp. 219-251. Springer-Verlag.
BibTeX:
@incollection{Deransart88a,
  author = {Pierre Deransart and Jan Maluszynski},
  title = {A Grammatical View of Logic Programming},
  booktitle = {Programming Languages Implementation and Logic Programming},
  publisher = {Springer-Verlag},
  year = {1988},
  volume = {348},
  pages = {219--251},
  note = {Orléans}
}
Dueck, G.D.P. & Cormack, G.V. (1988), "Modular Attribute Grammars". University of Waterloo, Technical Report CS-88-19, May, 1988.
BibTeX:
@techreport{Dueck88,
  author = {Gerald D. P. Dueck and Gordon V. Cormack},
  title = {Modular Attribute Grammars},
  year = {1988},
  number = {CS-88-19}
}
Durin, O. (1988), "Traduction en OLGA d'une grammaire attribuée écrite en Lisp". École Polytechnique, July, 1988.
BibTeX:
@techreport{Durin88,
  author = {Olivier Durin},
  title = {Traduction en OLGA d'une grammaire attribuée écrite en Lisp},
  year = {1988}
}
Efremidis, S., Papadimitriou, C.H. & Sideris, M. (1988), "Complexity Characterizations of Attribute Grammar Languages", Inform. and Comput.. Vol. 78(3), pp. 178-186.
BibTeX:
@article{Efremidis88,
  author = {Sophocles Efremidis and Christos H. Papadimitriou and Martha Sideris},
  title = {Complexity Characterizations of Attribute Grammar Languages},
  journal = {Inform. and Comput.},
  year = {1988},
  volume = {78},
  number = {3},
  pages = {178--186}
}
Engelfriet, J., Leih, G. & Rozenberg, G. (1988), "Apex Graph-Grammars and Attribute Grammars", Acta Informatica. Vol. 25, pp. 537-571.
BibTeX:
@article{Engelfriet88,
  author = {Joost Engelfriet and George Leih and Grzegorz Rozenberg},
  title = {Apex Graph-Grammars and Attribute Grammars},
  journal = {Acta Informatica},
  year = {1988},
  volume = {25},
  pages = {537--571}
}
Eulenstein, M. (1988), "POCO---Ein portables System zur Generierung portabler Compiler" New York--Heidelberg--Berlin Vol. 164 Springer-Verlag.
BibTeX:
@book{Eulenstein88,
  author = {Michael Eulenstein},
  title = {POCO---Ein portables System zur Generierung portabler Compiler},
  publisher = {Springer-Verlag},
  year = {1988},
  volume = {164},
  note = {Reprint of Diplomarbeit, University des Saarlandes, Saarbrücken (December 1983).}
}
Frécon, L. (1988), "Programmation Grammaticale", In Actes du Séminaire Franco-Soviétique Informatika 88. Nice, February, 1988. , pp. 181-198. INRIA.
BibTeX:
@incollection{Frecon88,
  author = {Louis Frécon},
  title = {Programmation Grammaticale},
  booktitle = {Actes du Séminaire Franco-Soviétique Informatika 88},
  publisher = {INRIA},
  year = {1988},
  pages = {181--198}
}
Giegerich, R. (1988), "Composition and Evaluation of Attribute Coupled Grammars", Acta Informatica. Vol. 25, pp. 355-423.
BibTeX:
@article{Giegerich88,
  author = {Robert Giegerich},
  title = {Composition and Evaluation of Attribute Coupled Grammars},
  journal = {Acta Informatica},
  year = {1988},
  volume = {25},
  pages = {355--423}
}
Hanus, M. (1988), "Formal Specification of a Prolog Compiler", In Programming Languages Implementation and Logic Programming. New York--Heidelberg--Berlin, May, 1988. Vol. 348, pp. 273-282. Springer-Verlag.
BibTeX:
@incollection{Hanus88,
  author = {Michael Hanus},
  title = {Formal Specification of a Prolog Compiler},
  booktitle = {Programming Languages Implementation and Logic Programming},
  publisher = {Springer-Verlag},
  year = {1988},
  volume = {348},
  pages = {273--282},
  note = {Orléans}
}
Henriques, P.R. (1988), "A Semantic Evaluator Generating System in Prolog", In Programming Languages Implementation and Logic Programming. New York--Heidelberg--Berlin, May, 1988. Vol. 348, pp. 201-218. Springer-Verlag.
BibTeX:
@incollection{Henriques88,
  author = {Pedro Rangel Henriques},
  title = {A Semantic Evaluator Generating System in Prolog},
  booktitle = {Programming Languages Implementation and Logic Programming},
  publisher = {Springer-Verlag},
  year = {1988},
  volume = {348},
  pages = {201--218},
  note = {Orléans}
}
Herndon, Jr., R.M. & Berzins, V.A. (1988), "The Realizable Benefits of a Language Prototyping Language", Institute of Electrical and Electronics Engineers. Transactions on Software Engineering., June, 1988. Vol. 14(6), pp. 803-809.
BibTeX:
@article{Herndon88,
  author = {Robert M. Herndon, Jr. and Valdis A. Berzins},
  title = {The Realizable Benefits of a Language Prototyping Language},
  journal = {Institute of Electrical and Electronics Engineers. Transactions on Software Engineering},
  year = {1988},
  volume = {14},
  number = {6},
  pages = {803--809}
}
Hudson, S.E. & King, R. (1988), "Semantic Feedback in the Higgen UIMS", Institute of Electrical and Electronics Engineers. Transactions on Software Engineering., August, 1988. Vol. SE-14(8), pp. 1188-1206.
BibTeX:
@article{Hudson88,
  author = {Scott E. Hudson and Roger King},
  title = {Semantic Feedback in the Higgen UIMS},
  journal = {Institute of Electrical and Electronics Engineers. Transactions on Software Engineering},
  year = {1988},
  volume = {SE-14},
  number = {8},
  pages = {1188--1206}
}
Jourdan, M. & Parigot, D. (1988), "More on Speeding up Circularity Tests for Attribute Grammars". INRIA, Technical Report RR-828, April, 1988.
BibTeX:
@techreport{Jourdan88,
  author = {Martin Jourdan and Didier Parigot},
  title = {More on Speeding up Circularity Tests for Attribute Grammars},
  year = {1988},
  number = {RR-828}
}
Kaiser, G.E. & Kaplan, S.M. (1988), "Parallel and Distributed Incremental Attribute Evaluation". Department of Comp. Sc., Columbia University, Technical Report CUCS-412-88, September, 1988.
BibTeX:
@techreport{Kaiser88,
  author = {Gail E. Kaiser and Simon M. Kaplan},
  title = {Parallel and Distributed Incremental Attribute Evaluation},
  year = {1988},
  number = {CUCS-412-88}
}
Kaiser, G.E., Feiler, P.H., Jalili, F. & Schlichter, J.H. (1988), "A Retrospective on DOSE: An Interpretive Approach to Structure Editor Generation", Software---Practice and Experience., August, 1988. Vol. 18(8), pp. 733-748.
BibTeX:
@article{Kaiser88a,
  author = {Gail E. Kaiser and Peter H. Feiler and Fahimeh Jalili and Johann H. Schlichter},
  title = {A Retrospective on DOSE: An Interpretive Approach to Structure Editor Generation},
  journal = {Software---Practice and Experience},
  year = {1988},
  volume = {18},
  number = {8},
  pages = {733--748}
}
Katayama, T. (1988), "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., pp. ???.
BibTeX:
@inproceedings{Katayama88,
  author = {Takuya Katayama},
  title = {Attribute Grammar as a Language for Describing the Conceptual Model of the Software Designer's Associate},
  booktitle = {Proc. of the 21st Hawai Internat. Conf. on Software Systems},
  year = {1988},
  pages = {???}
}
Keller, P. (1988), "Spezifikation und Implementierung eines Compilerfrontends für Ada: Deklarations- und Nameklassanalyse". School: FB~10 -- Informatik, University des Saarlandes. Saarbrücken
BibTeX:
@phdthesis{Keller88,
  author = {Paul Keller},
  title = {Spezifikation und Implementierung eines Compilerfrontends für Ada: Deklarations- und Nameklassanalyse},
  school = {FB~10 -- Informatik, University des Saarlandes},
  year = {1988}
}
Keller, P. & Maas, T. (1988), "An OPTRAN-generated Ada$DIANA front-end". FB~10 -- Informatik, University des Saarlandes, 1988.
BibTeX:
@techreport{Keller88a,
  author = {Paul Keller and Thomas Maas},
  title = {An OPTRAN-generated Ada$DIANA front-end},
  year = {1988}
}
Kontos, J. & Savouras, J.C. (1988), "Knowledge Acquisition from Technical Texts using Attribute Grammars", The Computer Journal. Vol. 31(6), pp. 525-530.
BibTeX:
@article{Kontos88,
  author = {John Kontos and J. C. Savouras},
  title = {Knowledge Acquisition from Technical Texts using Attribute Grammars},
  journal = {The Computer Journal},
  year = {1988},
  volume = {31},
  number = {6},
  pages = {525--530}
}
Koskimies, K., Elomaa, T., Lehtonen, T. & Paakki, J. (1988), "TOOLS/HLP84 Report and User Manual". Department of Comp. Sc., University of Helsinki, Technical Report A-1988-2, February, 1988.
BibTeX:
@techreport{Koskimies88,
  author = {Kai Koskimies and Tapio Elomaa and Tapio Lehtonen and Jukka Paakki},
  title = {TOOLS/HLP84 Report and User Manual},
  year = {1988},
  number = {A-1988-2}
}
Koskimies, K. & Méristé, M.B. (1988), "Experiences with Class-based Implementation of Programming Languages". Department of Comp. Sc., University of Helsinki, Technical Report A-1988-12, November, 1988.
BibTeX:
@techreport{Koskimies88a,
  author = {Kai Koskimies and Merik B. Méristé},
  title = {Experiences with Class-based Implementation of Programming Languages},
  year = {1988},
  number = {A-1988-12}
}
Koskimies, K., Nurmi, O., Paakki, J. & Sippu, S. (1988), "The Design of a Language Processor Generator", Software---Practice and Experience., February, 1988. Vol. 18(2), pp. 107-135.
BibTeX:
@article{Koskimies88b,
  author = {Kai Koskimies and Otto Nurmi and Jukka Paakki and Seppo Sippu},
  title = {The Design of a Language Processor Generator},
  journal = {Software---Practice and Experience},
  year = {1988},
  volume = {18},
  number = {2},
  pages = {107--135}
}
Kurochkin, V.M. (1988), "A Universal Economical Algorithm of Attribute Evaluation", In Actes du Séminaire Franco-Soviétique Informatika 88. Nice, February, 1988. , pp. 1-6. INRIA.
BibTeX:
@incollection{Kurochkin88,
  author = {V. M. Kurochkin},
  title = {A Universal Economical Algorithm of Attribute Evaluation},
  booktitle = {Actes du Séminaire Franco-Soviétique Informatika 88},
  publisher = {INRIA},
  year = {1988},
  pages = {1--6}
}
Lipps, P., Möncke, U., Olk, M. & Wilhelm, R. (1988), "Attribute (Re)evaluation in OPTRAN", Acta Informatica. Vol. 26, pp. 213-239.
BibTeX:
@article{Lipps88,
  author = {Peter Lipps and Ulrich Möncke and Matthias Olk and Reinhard Wilhelm},
  title = {Attribute (Re)evaluation in OPTRAN},
  journal = {Acta Informatica},
  year = {1988},
  volume = {26},
  pages = {213--239},
  note = {See also: ESPRIT PROSPECTRA Project Report S.1.3 - R.4.0, University des Saarlandes, Saarbrücken (1986).}
}
Lipps, P., Möncke, U. & Wilhelm, R. (1988), "OPTRAN: A Language/System for the Specification of Program Transformations---System Overview and Experiences", In Compiler Compilers and High Speed Compilation. New York--Heidelberg--Berlin, October, 1988. Vol. 371, pp. 52-65. Springer-Verlag.
BibTeX:
@incollection{Lipps88a,
  author = {Peter Lipps and Ulrich Möncke and Reinhard Wilhelm},
  title = {OPTRAN: A Language/System for the Specification of Program Transformations---System Overview and Experiences},
  booktitle = {Compiler Compilers and High Speed Compilation},
  publisher = {Springer-Verlag},
  year = {1988},
  volume = {371},
  pages = {52--65},
  note = {Berlin}
}
Lötzsch, J. & Mager, K. (1988), "A System for Design, Implementation and Application of Specialized Languages", In Specialized Languages as Tools for Programming Technology. Tallinn, January, 1988. , pp. 31-42.
BibTeX:
@incollection{Lotzsch88,
  author = {J. Lötzsch and K. Mager},
  title = {A System for Design, Implementation and Application of Specialized Languages},
  booktitle = {Specialized Languages as Tools for Programming Technology},
  year = {1988},
  pages = {31--42}
}
Lu, Q. & Qian, J. (1988), "An Efficient Method for Incremental Attribute Evaluation by using Multi-dependency", In COMPSAC '88. Chicago, IL, October, 1988. , pp. 162-169.
BibTeX:
@incollection{Lu88,
  author = {Qi Lu and Jiahua Qian},
  title = {An Efficient Method for Incremental Attribute Evaluation by using Multi-dependency},
  booktitle = {COMPSAC '88},
  year = {1988},
  pages = {162--169}
}
Lu, Q. & Qian, J. (1988), "Design, Proof and Analysis of New Efficient Algorithms for Incremental Attribute Evaluation", In Mathematical Foundations of Computer Science 1988. New York--Heidelberg--Berlin, August, 1988. Vol. 324, pp. 483-491. Springer-Verlag.
BibTeX:
@incollection{Lu88a,
  author = {Qi Lu and Jiahua Qian},
  title = {Design, Proof and Analysis of New Efficient Algorithms for Incremental Attribute Evaluation},
  booktitle = {Mathematical Foundations of Computer Science 1988},
  publisher = {Springer-Verlag},
  year = {1988},
  volume = {324},
  pages = {483--491},
  note = {Carlsbad}
}
Maas, T. (1988), "Spezifikation und Implementierung eines Compilerfrontends für Ada: Auflösung der Überladung und Erzeugung von DIANA". School: FB~10 -- Informatik, University des Saarlandes. Saarbrücken
BibTeX:
@phdthesis{Maas88,
  author = {Thomas Maas},
  title = {Spezifikation und Implementierung eines Compilerfrontends für Ada: Auflösung der Überladung und Erzeugung von DIANA},
  school = {FB~10 -- Informatik, University des Saarlandes},
  year = {1988}
}
Méristé, M.B. & Penjam, J. (1988), "Computational Models and Semantics of Programming Languages", In Specialized Languages as Tools for Programming Technology. Tallinn, January, 1988. , pp. 79-94.
BibTeX:
@incollection{Meriste88,
  author = {Merik B. Méristé and Jaan Penjam},
  title = {Computational Models and Semantics of Programming Languages},
  booktitle = {Specialized Languages as Tools for Programming Technology},
  year = {1988},
  pages = {79--94}
}
Micallef, J. & Kaiser, G.E. (1988), "Version and Configuration Control in Distributed Language-Based Environments", In Intl. Workshop on Software Version and Configuration Control. Stuttgart. January 1988., pp. 119-143. B. G. Teubner.
BibTeX:
@inproceedings{Micallef88,
  author = {Josephine Micallef and Gail E. Kaiser},
  title = {Version and Configuration Control in Distributed Language-Based Environments},
  booktitle = {Intl. Workshop on Software Version and Configuration Control},
  publisher = {B. G. Teubner},
  year = {1988},
  pages = {119--143}
}
Micallef, J. (1988), "Incremental Evaluation of Ordered Attribute Grammars for Asynchronous Subtree Replacements". Department of Comp. Sc., Columbia University, Technical Report CUCS-380-88, July, 1988.
BibTeX:
@techreport{Micallef88a,
  author = {Josephine Micallef},
  title = {Incremental Evaluation of Ordered Attribute Grammars for Asynchronous Subtree Replacements},
  year = {1988},
  number = {CUCS-380-88}
}
Mughal, K.A. (1988), "Generation of Runtime Facilities for Program Editors". School: Department of Informatics, University of Bergen. Norway
BibTeX:
@phdthesis{Mughal88,
  author = {Khalid A. Mughal},
  title = {Generation of Runtime Facilities for Program Editors},
  school = {Department of Informatics, University of Bergen},
  year = {1988}
}
Neirynck, A. (1988), "Static Analysis of Aliases and Side Effects in Higher-Order Languages". Cornell University, Computer Science Department, Technical Report TR88-896, February, 1988.
Abstract: In recent years, there has been substantial interest in the development of programming languages for new parallel architectures. A basic design conflict arises because languages with simple semantics tend to use storage inefficiently, whereas languages allowing the programmer to access storage explicitly are difficult to analyze. We present a compile-time estimation scheme for determining whether an expression in an imperative language either uses or updates the store. We also determine the aliasing behavior of expressions and in general, we can tell whether the evaluation of two expressions interfere. Current interprocedural dataflow techniques for aliasing and side effect inference are valid for first-order languages. Our inference schemes provide information about aliasing and side effects in a higher-order expression language with call-by-value semantics. The higher order character of the language represents only a partial obstacle. On the other hand, the presence of l-valued expressions has the consequence that aliasing information must be computed for all expressions, and cannot be represented as a relation among identifiers. Furthermore, the introduction of pointers make aliasing and side effects flow-dependent properties. Abstract interpretation techniques allow us to define compositional static inference schemes for aliasing and side effects, which can be proved sound with respect to the standard semantics by structural induction. The abstract interpretation functions are easy to modify, in case a different type of information is requested. We also discuss how different language features may affect the static analyses, simplifying them or making them untractable. The abstract interpretation functions implicitly define static inference algorithms, which can easily be implemented by an attribute grammar, or any other tool capable of performing computations on the abstract syntax tree. The accuracy of these algorithms is better than for the dataflow ones, because we make use of control flow information. Our algorithms also compare favorably in complexity, but the dataflow approach is probably cheaper in most practical settings. In addition, our schemes can give information even in the presence of dynamically allocated data structures.
BibTeX:
@techreport{Neirynck88,
  author = {Anne Neirynck},
  title = {Static Analysis of Aliases and Side Effects in Higher-Order Languages},
  year = {1988},
  number = {TR88-896},
  pages = {139},
  url = {http://cs-tr.cs.cornell.edu:80/Dienst/UI/1.0/Display/ncstrl.cornell/TR88-896}
}
Nord, R.L. & Pfenning, F. (1988), "The Ergo Attribute System", In ACM SIGSOFT/SIGPLAN Symp. on Practical Software Development Environments. Boston, MA, November, 1988. , pp. 110-120. ACM press.
Abstract: The Ergo Attribute System was designed to satisfy the requirements for attributes in a language-generic program derivation environment. It consists of three components: an abstract data type of attributes that guarantees attribute consistency; a Common Lisp implementation which combines demand-driven and incremental attribute evaluation in a novel way while allowing for attribute persistence over many generations of a program; and an attribute-grammar compiler producing code based on this abstract data type from a high-level specification. Experience with three major applications (one being the attribute-grammar compiler itself) confirms that the overhead in storing and accessing attributes incurred by the implementation scheme is more than offset by the gains from the demand-driven, incremental, and persistent nature of attribution.
BibTeX:
@incollection{Nord88,
  author = {Robert L. Nord and Frank Pfenning},
  title = {The Ergo Attribute System},
  booktitle = {ACM SIGSOFT/SIGPLAN Symp. on Practical Software Development Environments},
  publisher = {ACM press},
  year = {1988},
  pages = {110--120},
  note = {Joint issue with ACM SIGPLAN Notices 24, 2 (February 1989)Published as SIGSOFT Software Eng. Notes, volume 13, number 5}
}
Paakki, J. (1988), "Generating One-pass Semantic Analysis for a Compiler". Department of Comp. Sc., University of Helsinki, Technical Report A-1988-8, March, 1988.
BibTeX:
@techreport{Paakki88,
  author = {Jukka Paakki},
  title = {Generating One-pass Semantic Analysis for a Compiler},
  year = {1988},
  number = {A-1988-8}
}
Paakki, J. (1988), "Experimental Comparison of Compiler Writing Methods". Gesellschaft fuer Mathematik und Datenverarbeitung mbH, Technical Report \#314, 1988.
BibTeX:
@techreport{Paakki88a,
  author = {Jukka Paakki},
  title = {Experimental Comparison of Compiler Writing Methods},
  year = {1988},
  number = {314}
}
Paakki, J. (1988), "A note on the Speed of Prolog", ACM SIGPLAN Notices., August, 1988. Vol. 23(8), pp. 73-82.
BibTeX:
@article{Paakki88b,
  author = {Jukka Paakki},
  title = {A note on the Speed of Prolog},
  journal = {ACM SIGPLAN Notices},
  year = {1988},
  volume = {23},
  number = {8},
  pages = {73--82}
}
Paakki, J. (1988), "A Prolog-Based Compiler Writing Tool", In Compiler Compilers and High Speed Compilation. New York--Heidelberg--Berlin, October, 1988. Vol. 371, pp. 107-117. Springer-Verlag.
BibTeX:
@incollection{Paakki88c,
  author = {Jukka Paakki},
  title = {A Prolog-Based Compiler Writing Tool},
  booktitle = {Compiler Compilers and High Speed Compilation},
  publisher = {Springer-Verlag},
  year = {1988},
  volume = {371},
  pages = {107--117},
  note = {Berlin}
}
Panayiotopoulos, T., Papakonstantinou, G. & Stamatopoulos, G. (1988), "Attribute Grammars and Logic Programming (AI-Debot paper)", Angewandte Informatik. (5)
BibTeX:
@article{PanPapSta88a,
  author = {T. Panayiotopoulos and G. Papakonstantinou and G. Stamatopoulos},
  title = {Attribute Grammars and Logic Programming (AI-Debot paper)},
  journal = {Angewandte Informatik},
  year = {1988},
  number = {5}
}
Panayiotopoulos, T., Papakonstantinou, G. & Stamatopoulos, G. (1988), "Attribute grammar theorem prover", Information and Software Technology., November, 1988. Vol. 30(9), pp. 553-560.
BibTeX:
@article{PanPapSta88b,
  author = {T. Panayiotopoulos and G. Papakonstantinou and G. Stamatopoulos},
  title = {Attribute grammar theorem prover},
  journal = {Information and Software Technology},
  year = {1988},
  volume = {30},
  number = {9},
  pages = {553--560}
}
Papakonstoninou, G. & Tsanakas, P. (1988), "Attribute grammars and dataflow computing", Inf. Softw. Technol.., June, 1988. Vol. 30(5), pp. 306-313.
BibTeX:
@article{Papakonstoninou88,
  author = {G Papakonstoninou and P Tsanakas},
  title = {Attribute grammars and dataflow computing},
  journal = {Inf. Softw. Technol.},
  year = {1988},
  volume = {30},
  number = {5},
  pages = {306--313}
}
Papakonstantinou, G. & Tsanakas, P. (1988), "Attribute Grammars and Dataflow Computing", Information and Software Technology., June, 1988. Vol. 30(5), pp. 306-313.
BibTeX:
@article{PapTsa88,
  author = {G. Papakonstantinou and P. Tsanakas},
  title = {Attribute Grammars and Dataflow Computing},
  journal = {Information and Software Technology},
  year = {1988},
  volume = {30},
  number = {5},
  pages = {306--313}
}
Parigot, D. (1988), "Transformations, Évaluation Incrémentale et Optimisations des Grammaires Attribués: Le Système FNC-2". School: Université de Paris-Sud. Orsay
BibTeX:
@phdthesis{Parigot88,
  author = {Didier Parigot},
  title = {Transformations, Évaluation Incrémentale et Optimisations des Grammaires Attribués: Le Système FNC-2},
  school = {Université de Paris-Sud},
  year = {1988},
  url = {http://www.inria.fr/RRRT/TU-0044.html}
}
Pfreundschuh-Wagner, M. & Ford, R. (1988), "Using Attribute Grammars to Control Incremental, Concurrent Builds of Modular Systems", In Intl. Workshop on Software Version and Configuration Control. Stuttgart. January 1988., pp. 285-304. B. G. Teubner.
BibTeX:
@inproceedings{Pfreundschuh-W88,
  author = {Mary Pfreundschuh-Wagner and Ray Ford},
  title = {Using Attribute Grammars to Control Incremental, Concurrent Builds of Modular Systems},
  booktitle = {Intl. Workshop on Software Version and Configuration Control},
  publisher = {B. G. Teubner},
  year = {1988},
  pages = {285--304}
}
Pugh, W.W. (1988), "Incremental Computation and the Incremental Evaluation of Functional Programs". Cornell University, Computer Science Department, Technical Report CORNELLCS//TR88-936, August, 1988.
Abstract: Incremental computation is generally thought of as the technique of efficiently updating the result of a computation when the input is changed. This idea is used in doing semantic checking in programming environments, document formatting in WYSIWYG editors and other applications. More generally, incremental computation is the technique of efficiently applying a function to a series of similar inputs. Much of the previous work on incremental computation has centered on incremental attribute grammar and incremental dependency graph evaluation schemes, but these techniques are only suitable for certain applications. This thesis examines an alternative method for providing incremental computation. Our results provide practical methods that can be used for applications such as theorem provers for which attribute grammars are unusable. Even for those problems for which attribute grammars are best suited, our methods perform almost as well as attribute grammars. We describe an incremental evaluator for functional programs that makes use of function caching. Function caching, or memoising, allows reuse of solutions to problems that were solved previously. We examine how function caching can be effectively used when solving problems that are similar to problems that were solved previously. In order for function caching to provide incremental evaluation, two similar problems must be solved by decomposing them into sub-problems in such a way that they share many common sub-problems. We formalize and quantify this idea with the notion of a stable decomposition, and we present data structures for representing sets and sequences that have stable decompositions. We solve several problems related to the efficient implementation of function caching. To perform function caching efficiently, one must be able to determine if two values are equal in constant time and perform updates applicatively. The data structures we present for sets and sequences support these features. This was previously an open problem for representations that also supported efficient updates. We also examine how to calculate hash keys and perform fast equality tests for S-expressions and how to determine what to purge from a function cache when it is full. We report benchmarks that show our function caching implementation produces significant speed-ups in complex programs such as incremental theorem provers.
BibTeX:
@techreport{Pugh88,
  author = {William W. Pugh},
  title = {Incremental Computation and the Incremental Evaluation of Functional Programs},
  year = {1988},
  number = {CORNELLCS//TR88-936},
  pages = {80},
  url = {http://cs-tr.cs.cornell.edu:80/Dienst/UI/2.0/Describe/ncstrl.cornell%2fTR88-936}
}
Reps, T. (1988), "Incremental Evaluation for Attribute Grammars with Unrestricted Movement Between Tree Modifications", Acta Informatica. Vol. 25(2), pp. 155-178.
BibTeX:
@article{Reps88,
  author = {Thomas Reps},
  title = {Incremental Evaluation for Attribute Grammars with Unrestricted Movement Between Tree Modifications},
  journal = {Acta Informatica},
  year = {1988},
  volume = {25},
  number = {2},
  pages = {155--178}
}
Riedewald, Gü. (1988), "A Short Survey on some Projects of the Research Group ``Programming Languages'' at thew Wilhelm Pieck University in Rostock, Department of Computer Science", In Specialized Languages as Tools for Programming Technology. Tallinn, January, 1988. , pp. 120-125.
BibTeX:
@incollection{Riedewald88,
  author = {Günter Riedewald},
  title = {A Short Survey on some Projects of the Research Group ``Programming Languages'' at thew Wilhelm Pieck University in Rostock, Department of Computer Science},
  booktitle = {Specialized Languages as Tools for Programming Technology},
  year = {1988},
  pages = {120--125}
}
Riedewald, Gü. & Lämmel, U. (1988), "Using an Attribute Grammar as a Logic Program", In Programming Languages Implementation and Logic Programming. New York--Heidelberg--Berlin, May, 1988. Vol. 348, pp. 161-179. Springer-Verlag.
BibTeX:
@incollection{Riedewald88a,
  author = {Günter Riedewald and Uwe Lämmel},
  title = {Using an Attribute Grammar as a Logic Program},
  booktitle = {Programming Languages Implementation and Logic Programming},
  publisher = {Springer-Verlag},
  year = {1988},
  volume = {348},
  pages = {161--179},
  note = {Orléans}
}
Sassa, M. (1988), "Incremental Attribute Evaluation and Parsing based on ECLR-Attributed Grammars". Department of Comp. Sc., University of Helsinki, Technical Report A-1988-9, March, 1988.
BibTeX:
@techreport{Sassa88,
  author = {Masataka Sassa},
  title = {Incremental Attribute Evaluation and Parsing based on ECLR-Attributed Grammars},
  year = {1988},
  number = {A-1988-9},
  note = {Also published as: Technical Report ISE-TR-88-66, Institute of Information Sciences. An International Journal and Electronics, University of Tsukuba (March 1988)}
}
Serebriakov, V.A. (1988), "Construction of Efficient Multi-Stage Compilers with the Attribute TWS", In Actes du Séminaire Franco-Soviétique Informatika 88. Nice, February, 1988. , pp. 27-38. INRIA.
BibTeX:
@incollection{Serebriakov88,
  author = {Vladimir A. Serebriakov},
  title = {Construction of Efficient Multi-Stage Compilers with the Attribute TWS},
  booktitle = {Actes du Séminaire Franco-Soviétique Informatika 88},
  publisher = {INRIA},
  year = {1988},
  pages = {27--38}
}
Serebriakov, V.A. (1988), "Application of Compiler Writing Systems for Implementing Efficient Compilers", In Specialized Languages as Tools for Programming Technology. Tallinn, January, 1988. , pp. 164-175.
BibTeX:
@incollection{Serebriakov88a,
  author = {Vladimir A. Serebriakov},
  title = {Application of Compiler Writing Systems for Implementing Efficient Compilers},
  booktitle = {Specialized Languages as Tools for Programming Technology},
  year = {1988},
  pages = {164--175},
  note = {(in Russian)}
}
Shinoda, Y. & Katayama, T. (1988), "Attribute Grammar Based Programming and its Environment", In Proc. of the 21st Hawai Internat. Conf. on Software Systems ???., pp. 612-620.
BibTeX:
@inproceedings{Shinoda88,
  author = {Yoichi Shinoda and Takuya Katayama},
  title = {Attribute Grammar Based Programming and its Environment},
  booktitle = {Proc. of the 21st Hawai Internat. Conf. on Software Systems ???},
  year = {1988},
  pages = {612--620}
}
Stiefel, B. & Thiel, P. (1988), "Application of Attributed Grammar for Syntax and Attribute-directed Bottom-up Translation", In Compiler Compilers and High Speed Compilation. New York--Heidelberg--Berlin, October, 1988. Vol. 371, pp. 222-238. Springer-Verlag.
BibTeX:
@incollection{Stiefel88,
  author = {B. Stiefel and P. Thiel},
  title = {Application of Attributed Grammar for Syntax and Attribute-directed Bottom-up Translation},
  booktitle = {Compiler Compilers and High Speed Compilation},
  publisher = {Springer-Verlag},
  year = {1988},
  volume = {371},
  pages = {222--238},
  note = {Berlin}
}
Taouil, S. (1988), "Étude et implantation des grammaires couplées par attributs dans le système FNC-2". Dépt. d'Informatique, University d'Orléans, September, 1988.
BibTeX:
@techreport{Taouil88,
  author = {Souad Taouil},
  title = {Étude et implantation des grammaires couplées par attributs dans le système FNC-2},
  year = {1988}
}
Tarhio, J. (1988), "Attribute Grammars for One-pass Compilation". School: Department of Comp. Sc., University of Helsinki., May, 1988. (report A-1988-11)
BibTeX:
@phdthesis{Tarhio88,
  author = {Jorma Tarhio},
  title = {Attribute Grammars for One-pass Compilation},
  school = {Department of Comp. Sc., University of Helsinki},
  year = {1988},
  number = {report A-1988-11}
}
Tarhio, J. (1988), "The Compiler Writing System Metauncle". Department of Comp. Sc., University of Helsinki, Technical Report C-1988-23, 1988.
BibTeX:
@techreport{Tarhio88a,
  author = {Jorma Tarhio},
  title = {The Compiler Writing System Metauncle},
  year = {1988},
  number = {C-1988-23}
}
Tarhio, J. (1988), "A Compiler Generator for Attribute Evaluation during LR Parsing", In Compiler Compilers and High Speed Compilation. New York--Heidelberg--Berlin, October, 1988. Vol. 371, pp. 146-159. Springer-Verlag.
BibTeX:
@incollection{Tarhio88b,
  author = {Jorma Tarhio},
  title = {A Compiler Generator for Attribute Evaluation during LR Parsing},
  booktitle = {Compiler Compilers and High Speed Compilation},
  publisher = {Springer-Verlag},
  year = {1988},
  volume = {371},
  pages = {146--159},
  note = {Berlin}
}
Tavernini, V.E. (1988), "Translating Natural Semantic Specifications to Attribute Grammars". Department of Comp. Sc., University of Illinois at Urbana-Champaign, Technical Report UIUCDCS-R-88-1407, May, 1988.
BibTeX:
@techreport{Tavernini88,
  author = {Victor E. Tavernini},
  title = {Translating Natural Semantic Specifications to Attribute Grammars},
  year = {1988},
  number = {UIUCDCS-R-88-1407}
}
Toczki, J., Gyimóthy, T., Kocsis, F. & Horváth, T. (1988), "Automatic Software Generation in Practice: New Features in the HLP/PAS System", In Specialized Languages as Tools for Programming Technology. Tallinn, January, 1988. , pp. 103-119.
BibTeX:
@incollection{Toczki88,
  author = {Janos Toczki and Tibor Gyimóthy and Ferenc Kocsis and Tamás Horváth},
  title = {Automatic Software Generation in Practice: New Features in the HLP/PAS System},
  booktitle = {Specialized Languages as Tools for Programming Technology},
  year = {1988},
  pages = {103--119}
}
Tokuda, T. (1988), "An Attribute Assignment View of Non-procedural Computing Systems", Journal of Information Processing. Vol. 11(3), pp. 165-174.
BibTeX:
@article{Tokuda88,
  author = {Takehiro Tokuda},
  title = {An Attribute Assignment View of Non-procedural Computing Systems},
  journal = {Journal of Information Processing},
  year = {1988},
  volume = {11},
  number = {3},
  pages = {165--174}
}
Uddeborg, G.O. (1988), "A functional parser generator.". Programming Methodology Group, University of Goteborg and Chalmers University of Technology., Technical Report 43, February, 1988.
Abstract: a parser generator, written in LML, to accept attribute grammars.
BibTeX:
@techreport{Uddeborg88,
  author = {G. O. Uddeborg},
  title = {A functional parser generator.},
  year = {1988},
  number = {43}
}
Vyhandu, L.K. & Vooglaid, A.O. (1988), "Practical Problems of Automatic Software Generation", In Specialized Languages as Tools for Programming Technology. Tallinn, January, 1988. , pp. 126-132 syst.ELMA.
BibTeX:
@incollection{Vyhandu88,
  author = {Leo K. Vyhandu and Aare O. Vooglaid},
  title = {Practical Problems of Automatic Software Generation},
  booktitle = {Specialized Languages as Tools for Programming Technology},
  year = {1988},
  pages = {126--132 syst.ELMA}
}
Wagner, M.P. & Ford, R. (1988), "Using Attribute Grammars to Control Incremental, Concurrent Builds of Modular Systems", In Proceedings of the International Workshop on Software Version and Configuration Control. Grassau, Germany. January 1988., pp. 285-304.
BibTeX:
@inproceedings{wagner,
  author = {Mary Pfreundschuh Wagner and Ray Ford},
  title = {Using Attribute Grammars to Control Incremental, Concurrent Builds of Modular Systems},
  booktitle = {Proceedings of the International Workshop on Software Version and Configuration Control},
  year = {1988},
  pages = {285--304}
}
Walz, J.A. & Johnson, G.F. (1988), "Incremental Evaluation for a General Class of Circular Attribute Grammars", In ACM SIGPLAN '88 Conf. on Progr. Languages Design and Implementation. Atlanta, GA, July, 1988. , pp. 209-221. ACM press.
BibTeX:
@incollection{Walz88,
  author = {Janet A. Walz and Gregory F. Johnson},
  title = {Incremental Evaluation for a General Class of Circular Attribute Grammars},
  booktitle = {ACM SIGPLAN '88 Conf. on Progr. Languages Design and Implementation},
  publisher = {ACM press},
  year = {1988},
  pages = {209--221},
  note = {Published as ACM SIGPLAN Notices, volume 23, number 7}
}
Yeh, D. & Kastens, U. (1988), "Improvements of an Incremental Evaluation Algorithm for Ordered Attributed Grammars", ACM SIGPLAN Notices., December, 1988. Vol. 23(12), pp. 45-50.
BibTeX:
@article{Yeh88,
  author = {Dashing Yeh and Uwe Kastens},
  title = {Improvements of an Incremental Evaluation Algorithm for Ordered Attributed Grammars},
  journal = {ACM SIGPLAN Notices},
  year = {1988},
  volume = {23},
  number = {12},
  pages = {45--50}
}
Yellin, D.M. (1988), "Attribute Grammar Inversion and Source-to-source Translation". Springer-Verlag, Technical Report (1987)., 1988.
BibTeX:
@techreport{Yellin88,
  author = {Daniel M. Yellin},
  title = {Attribute Grammar Inversion and Source-to-source Translation},
  year = {1988},
  volume = {302},
  number = {(1987).}
}
Zanden, B.T.V. (1988), "Incremental Constraint Satisfaction and its Application to Graphical Interfaces". Cornell University, Computer Science Department, Technical Report CORNELLCS//TR88-941, October, 1988.
Abstract: Software that emphasizes pictures, rather than text, has become increasingly popular since the introduction of the Macintosh computer. Creating this software is a time-consuming task that can take months or years. Researchers have attempted to speed up this process by developing constraint-based tools that automate portions of the software development cycle. However, these tools are often limited in the types of applications they can generate, since 1) they lack powerful editing models that can manipulate complex data structures, such as lists, trees, and sets; and 2) in large applications, they cannot perform constraint satisfaction quickly enough to provide instantaneous feedback to the user. We present tools for overcoming each of these difficulties. First, we describe a new model, called constraint grammars, that integrates aspects of both attribute grammars and constraint-based, object systems to produce a powerful specification language for graphical interfaces. Constraint grammars integrate important concepts such as the part-whole hierarchy, almost-hierarchical structures, and multidirectional constraints. These features are augmented with a pattern-matching editing model that permits a designer to manipulate complex data structures. We then present techniques for incrementally resatisfying multidirectional, noncircular sets of constraints. It is shown that minimizing the number of re-solved constraints is NP-complete. We therefore describe an approach that attempts to minimize the amount of time spent updating the constraint solution. This technique divides constraint solving into two phases-a planning phase that linearly orders the constraints and an evaluation phase that solves the constraints using this linear order. Previous approaches have thrown away the linear order whenever the constraint system changes. However, this is unnecessary since only a local portion of the linear order is typically modified. We exploit this fact to develop an algorithm that incrementally updates this order. We the augment this algorithm with a heuristic that attempts to choose a linear order that minimizes the number of equations that the evaluation stage must solve. We present benchmarks that show that these algorithms can significantly reduce the number of equations examined by the planning phase and the number of equations solved by the evaluation phase.
BibTeX:
@techreport{Zanden88,
  author = {Bradley T. Vander Zanden},
  title = {Incremental Constraint Satisfaction and its Application to Graphical Interfaces},
  year = {1988},
  number = {CORNELLCS//TR88-941},
  pages = {312}
}
Alblas, H. (1989), "Attribute Evaluation Methods". Onderafdeling der Informatica, Tech. Hogeschool Twente, Technical Report INF-89-20, 1989.
BibTeX:
@techreport{Alblas89,
  author = {Henk Alblas},
  title = {Attribute Evaluation Methods},
  year = {1989},
  number = {INF-89-20}
}
Alblas, H. (1989), "Optimal Incremental Simple Multi-pass Attribute Evaluation", Information Processing Letters., October, 1989. Vol. 32(6), pp. 289-295.
BibTeX:
@article{Alblas89a,
  author = {Henk Alblas},
  title = {Optimal Incremental Simple Multi-pass Attribute Evaluation},
  journal = {Information Processing Letters},
  year = {1989},
  volume = {32},
  number = {6},
  pages = {289--295}
}
Attali, I. (1989), "Compilation de programmes TYPOL par attributs sémantiques". School: Université de Nice., April, 1989.
BibTeX:
@phdthesis{Attali89,
  author = {Isabelle Attali},
  title = {Compilation de programmes TYPOL par attributs sémantiques},
  school = {Université de Nice},
  year = {1989}
}
Barford, L.A. & Vander Zanden, B.T. (1989), "Attribute Grammars in Constraint-based Graphics Systems", Software---Practice and Experience., April, 1989. Vol. 19(4), pp. 309-328.
Abstract: A constraint-based graphics system provides a flexible, intuitive framework for describing relationships among graphical objects in applications such as document preparation, font design, and solid modelling. This paper describes two constraint-based graphics systems, micro-COSM and the IDEAL Synthesizer, and their implementation in terms of attribute grammars. The implementation of these two systems is noteworthy since they represent the first interactive constraint-based graphics systems that are implemented using attribute grammars. Our experiences with attribute grammars suggest that they provide a powerful framework for representing constraints and extracting important semantic information such as the equations to be solved by the constraint solver. We discuss the advantages of using attribute grammars in constraint-based graphics and from our experiences make several observations about the way attribute grammars should be used.
BibTeX:
@article{Barford89,
  author = {Lee A. Barford and Bradley T. Vander Zanden},
  title = {Attribute Grammars in Constraint-based Graphics Systems},
  journal = {Software---Practice and Experience},
  year = {1989},
  volume = {19},
  number = {4},
  pages = {309--328}
}
Berzins, L.V. & Lee, Y. (1989), "Generating Displays for Specifications Using Attribute Grammars", In Proceedings COMPSAC89. September 1989., pp. 596-602.
BibTeX:
@inproceedings{Berzins93,
  author = {Luqi V. Berzins and Y. Lee},
  title = {Generating Displays for Specifications Using Attribute Grammars},
  booktitle = {Proceedings COMPSAC89},
  year = {1989},
  pages = {596--602}
}
Buckles, B.P., Petry, F.E. & Cheung, Y.-Y. (1989), "Attribute grammars for the heuristic translation of query languages", Information Systems. Vol. 14(6), pp. 507-514.
BibTeX:
@article{Buckles89,
  author = {Bill P. Buckles and Frederick E. Petry and Yuet-Ying Cheung},
  title = {Attribute grammars for the heuristic translation of query languages},
  journal = {Information Systems},
  year = {1989},
  volume = {14},
  number = {6},
  pages = {507--514}
}
Chapman, N.P. (1989), "Regular Attribute Grammars and Finite State Machine", ACM SIGPLAN Notices., June, 1989. Vol. 24(6), pp. 97-105.
BibTeX:
@article{Chapman89,
  author = {Nigel P. Chapman},
  title = {Regular Attribute Grammars and Finite State Machine},
  journal = {ACM SIGPLAN Notices},
  year = {1989},
  volume = {24},
  number = {6},
  pages = {97--105},
  note = {See also: report RN/88/9, Department of Comp. Sc., University College London (March 1988)}
}
Christiansen, H. (1989), "Structure Sharing in Incremental Systems", Struct. Programm.. Vol. 10(4), pp. 169-186.
BibTeX:
@article{Christiansen89,
  author = {Henning Christiansen},
  title = {Structure Sharing in Incremental Systems},
  journal = {Struct. Programm.},
  year = {1989},
  volume = {10},
  number = {4},
  pages = {169--186}
}
Delest, M.-P. & Fedou, J.-M. (1989), "Attribute Grammars are Useful for Combinatorics". LaBRI, University de Bordeaux~I, Technical Report 89-122, November, 1989.
BibTeX:
@techreport{Delest89,
  author = {Marie-Pierre Delest and Jean-Marc Fedou},
  title = {Attribute Grammars are Useful for Combinatorics},
  year = {1989},
  number = {89-122}
}
Delest, M.-P. & Fedou, J.-M. (1989), "Attribute Grammars are Useful for Combinatorics". LaBRI, University de Bordeaux~I, Technical Report 89--122, November, 1989.
BibTeX:
@techreport{Delest89a,
  author = {Marie-Pierre Delest and Jean-Marc Fedou},
  title = {Attribute Grammars are Useful for Combinatorics},
  year = {1989},
  number = {89--122}
}
Dill, J.M. (1989), "A Counter-example for ``A Simpler Construction for Showing the Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars''", J. ACM., January, 1989. Vol. 36(1), pp. 92-96.
BibTeX:
@article{Dill89,
  author = {Jens M. Dill},
  title = {A Counter-example for ``A Simpler Construction for Showing the Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars''},
  journal = {J. ACM},
  year = {1989},
  volume = {36},
  number = {1},
  pages = {92--96}
}
Durin, O. (1989), "Génération en LeLisp d'évaluateurs d'attributs spécifiés en Olga". École Normale Supérieure, September, 1989.
BibTeX:
@techreport{Durin89,
  author = {Olivier Durin},
  title = {Génération en LeLisp d'évaluateurs d'attributs spécifiés en Olga},
  year = {1989}
}
Engelfriet, J. & Filé, G. (1989), "Passes, Sweeps and Visits in Attribute Grammars", J. ACM., October, 1989. Vol. 36(4), pp. 841-869.
BibTeX:
@article{Engelfriet89,
  author = {Joost Engelfriet and Gilberto Filé},
  title = {Passes, Sweeps and Visits in Attribute Grammars},
  journal = {J. ACM},
  year = {1989},
  volume = {36},
  number = {4},
  pages = {841--869}
}
Engelfriet, J. & Heyker, L.M. (1989), "The Term-generating Power of Context-free Hypergraph Grammar and Attribute Grammars". Vakgroep Informatica, Rijksuniversiteit te Leiden, Technical Report 89--17, November, 1989.
BibTeX:
@techreport{Engelfriet89a,
  author = {Joost Engelfriet and Linda M. Heyker},
  title = {The Term-generating Power of Context-free Hypergraph Grammar and Attribute Grammars},
  year = {1989},
  number = {89--17}
}
Farrow, R. (1989), "The Linguist Translator-writing System---User's Manual" Palo Alto, CA, June, 1989. Declarative Systems Inc..
BibTeX:
@book{Farrow89,
  author = {Rodney Farrow},
  title = {The Linguist Translator-writing System---User's Manual},
  publisher = {Declarative Systems Inc.},
  year = {1989},
  note = {version 6.25}
}
Farrow, R. & Stanculescu, A.G. (1989), "A VHDL Compiler based on Attribute Grammar Methodology", In ACM SIGPLAN '89 Conf. on Progr. Languages Design and Implementation. Portland, OR, July, 1989. , pp. 120-130. ACM press.
BibTeX:
@incollection{Farrow89a,
  author = {Rodney Farrow and Alec G. Stanculescu},
  title = {A VHDL Compiler based on Attribute Grammar Methodology},
  booktitle = {ACM SIGPLAN '89 Conf. on Progr. Languages Design and Implementation},
  publisher = {ACM press},
  year = {1989},
  pages = {120--130},
  note = {Published as ACM SIGPLAN Notices, volume 24, number 7}
}
Franchi-Zannettacci, P. (1989), "Attribute Specifications for Graphical Interface Generation", In Information Processing '89. Amsterdam, August, 1989. , pp. 149-155. North-Holland.
BibTeX:
@incollection{Franchi-Zannet89,
  author = {Paul Franchi-Zannettacci},
  title = {Attribute Specifications for Graphical Interface Generation},
  booktitle = {Information Processing '89},
  publisher = {North-Holland},
  year = {1989},
  pages = {149--155},
  note = {San Francisco, CA}
}
Franchi-Zannettacci, P. & Arnon, D.S. (1989), "Context-sensitive Semantics as a Basis for Processing Structured Documents", BIGRE., May, 1989. Vol. 63--64, pp. 135-146.
BibTeX:
@article{Franchi-Zannet89a,
  author = {Paul Franchi-Zannettacci and Dennis S. Arnon},
  title = {Context-sensitive Semantics as a Basis for Processing Structured Documents},
  journal = {BIGRE},
  year = {1989},
  volume = {63--64},
  pages = {135--146}
}
Frost, R.A. (1989), "Application Programming as the Construction of Language Interpreters", ACM SIGPLAN Notices., September, 1989. Vol. 24(9), pp. 142-151.
BibTeX:
@article{Frost89,
  author = {Richard A. Frost},
  title = {Application Programming as the Construction of Language Interpreters},
  journal = {ACM SIGPLAN Notices},
  year = {1989},
  volume = {24},
  number = {9},
  pages = {142--151}
}
Frost, R.A. (1989), "The Use of Attribute Grammars in Application Programming". School of Comp. Sci., University of Windsor, Technical Report 89-001, 1989.
BibTeX:
@techreport{Frost89a,
  author = {Richard A. Frost},
  title = {The Use of Attribute Grammars in Application Programming},
  year = {1989},
  number = {89-001}
}
Frost, R.A. (1989), "The Use of Lazy Attribute Grammars in Application Programming". School of Comp. Sci., University of Windsor, Technical Report 89--007, 1989.
BibTeX:
@techreport{Frost89b,
  author = {Richard A. Frost},
  title = {The Use of Lazy Attribute Grammars in Application Programming},
  year = {1989},
  number = {89--007}
}
Gil & Makay (1989), "Parallel Programming Structures and Attribute Grammars", ACTACYB: Acta Cybernetica. Vol. 9
BibTeX:
@article{Gil89,
  author = {Gil and Makay},
  title = {Parallel Programming Structures and Attribute Grammars},
  journal = {ACTACYB: Acta Cybernetica},
  year = {1989},
  volume = {9}
}
Gombas & Bartha (1989), "Two Transformations on Attribute Grammars Improving the Complexity of their Evaluation", ACTACYB: Acta Cybernetica. Vol. 9
BibTeX:
@article{Gombas89,
  author = {Gombas and Bartha},
  title = {Two Transformations on Attribute Grammars Improving the Complexity of their Evaluation},
  journal = {ACTACYB: Acta Cybernetica},
  year = {1989},
  volume = {9}
}
Hedin, G. (1989), "An object-oriented notation for attribute grammars", In the 3rd European Conference on Object-Oriented Programming (ECOOP'89). Nottingham, U.K.. July 1989., pp. 329-345. Cambridge University Press.
Abstract: This paper presents an attribute grammar notation which is based on the object-oriented concepts of classification hierarchies, inheritance, and late binding. The notation allows compact and flexible language specification through the use of inheritance and equation overriding. Furthermore, demand attributes can be implemented efficiently by using a technique similar to the one used for virtual procedures in Simula. Such attributes are important especially in incremental langauge-based environments as they do not consume storage. The notation also makes it possible to define general attributes which can be accessed without knowledge of the particular langauge modelled by the grammar. This can be utilized for integration of grammar independent tools. The notation is based on a single-inheritance classification, and a discussion is given on the problems which would arise if the notation was augmented to multiple-inheritance.
BibTeX:
@inproceedings{Hedin89,
  author = {G. Hedin},
  title = {An object-oriented notation for attribute grammars},
  booktitle = {the 3rd European Conference on Object-Oriented Programming (ECOOP'89)},
  publisher = {Cambridge University Press},
  year = {1989},
  pages = {329--345},
  note = {Also published in LU-CS-TR:89-42},
  url = {http://www.dna.lth.se/Research/ProgEnv/Abstracts/LU-CS-TR:89-42.html}
}
Heleviki, Jü. & Méristé, M.B. (1989), "Problems in Incremental Construction of Language Processors", In Procs. of the Soviet-French Symposium Informatika '89. Tallinn. May 1989., pp. 70-75.
BibTeX:
@inproceedings{Heleviki89,
  author = {Jüri Heleviki and Merik B. Méristé},
  title = {Problems in Incremental Construction of Language Processors},
  booktitle = {Procs. of the Soviet-French Symposium Informatika '89},
  year = {1989},
  pages = {70--75}
}
Hernek, D. & Anderson, D.P. (1989), "Efficient Automated Protocol Implementation Using RTAG". California Berkeley, Technical Report UCB//CSD-89-526, August, 1989.
Abstract: RTAG is a system for automated implementation of communication protocols from formal specifications. The RTAG specification language is based on attribute grammars, and allows complex protocols to be specified concisely and with minimal need for additional program code. This paper describes a set of techniques for efficient automated implementation of protocols from RTAG specifications, and compares the performance to that of hand-coded protocol implementations. We conclude that in many cases the performance of RTAG-based protocol implementation is acceptable for experimental or production uses
BibTeX:
@techreport{Hernek89,
  author = {Diane Hernek and David P. Anderson},
  title = {Efficient Automated Protocol Implementation Using RTAG},
  year = {1989},
  number = {UCB//CSD-89-526},
  url = {ftp://tr-ftp.cs.berkeley.edu/pub/tech-reports/csd/csd-89-526/}
}
Johmann, K.R. (1989), "A Modified Attribute Grammar and its Applications to Software Maintenance Environments". Department of Comp. Inf. Sc., University of Florida, November, 1989.
BibTeX:
@techreport{Johmann89,
  author = {K. R. Johmann},
  title = {A Modified Attribute Grammar and its Applications to Software Maintenance Environments},
  year = {1989}
}
Jourdan, M. & Parigot, D. (1989), "The FNC-2 System User's Guide and Reference Manual" Rocquencourt, February, 1989. INRIA.
BibTeX:
@book{Jourdan89,
  author = {Martin Jourdan and Didier Parigot},
  title = {The FNC-2 System User's Guide and Reference Manual},
  publisher = {INRIA},
  year = {1989},
  note = {release 0.4 This manual is periodically updated.}
}
Jourdan, M. & Parigot, D. (1989), "The FNC-2 System: Advances in Attribute Grammar Technology", In Procs. of the Soviet-French Symposium Informatika '89. Tallinn. May 1989., pp. 94-118.
BibTeX:
@inproceedings{Jourdan89a,
  author = {Martin Jourdan and Didier Parigot},
  title = {The FNC-2 System: Advances in Attribute Grammar Technology},
  booktitle = {Procs. of the Soviet-French Symposium Informatika '89},
  year = {1989},
  pages = {94--118},
  note = {See also: rapport RR-834, INRIA, Rocquencourt (April 1988).}
}
Julié, C. (1989), "Optimisation de l'espace mémoire pour l'évaluation de grammaires attribuées". School: Université d'Orléans., September, 1989. (th{\`e}se)
BibTeX:
@phdthesis{Julie89,
  author = {Catherine Julié},
  title = {Optimisation de l'espace mémoire pour l'évaluation de grammaires attribuées},
  school = {Université d'Orléans},
  year = {1989},
  number = {thèse}
}
Kaplan, S.M. & Goering, S.K. (89), "Priority Controlled Incremental Attribute Evaluation in Attributed Graph Grammars", In TAPSOFT '89, Vol.~1: Coll. on Trees in Algebra and Programming (CAAP '89). New York--Heidelberg--Berlin Vol. 351, pp. 306-320. Springer-Verlag.
BibTeX:
@incollection{Kaplan89,
  author = {Simon M. Kaplan and Steven K. Goering},
  title = {Priority Controlled Incremental Attribute Evaluation in Attributed Graph Grammars},
  booktitle = {TAPSOFT '89, Vol.~1: Coll. on Trees in Algebra and Programming (CAAP '89)},
  publisher = {Springer-Verlag},
  year = {89},
  volume = {351},
  pages = {306--320},
  note = {Barcelona}
}
Klaiber & Gokhale (1989), "Parallel Evaluation of Attribute Grammars", In ICPP: 18th International Conference on Parallel Processing.
BibTeX:
@inproceedings{Klaiber89,
  author = {Klaiber and Gokhale},
  title = {Parallel Evaluation of Attribute Grammars},
  booktitle = {ICPP: 18th International Conference on Parallel Processing},
  year = {1989}
}
Klein, E. & Koskimies, K. (1989), "The Parallelization of One-Pass Compilers". GMD, Technical Report 416, November, 1989.
BibTeX:
@techreport{Klein89,
  author = {Eduard Klein and Kai Koskimies},
  title = {The Parallelization of One-Pass Compilers},
  year = {1989},
  number = {416}
}
Kuiper, M.F. (1989), "Parallel Attribute Evaluation". School: Faculteit Wiskunde en Informatica, Rijksuniv. Utrecht., November, 1989.
BibTeX:
@phdthesis{Kuiper89,
  author = {Matthijs F. Kuiper},
  title = {Parallel Attribute Evaluation},
  school = {Faculteit Wiskunde en Informatica, Rijksuniv. Utrecht},
  year = {1989}
}
Kuiper, M.F. & Dijkstra, A. (1989), "Attribute Evaluation on a Network of Transputers", In Developing Transputer Applications. Amsterdam , pp. 142-149. IOS.
BibTeX:
@incollection{Kuiper89a,
  author = {Matthijs F. Kuiper and Atze Dijkstra},
  title = {Attribute Evaluation on a Network of Transputers},
  booktitle = {Developing Transputer Applications},
  publisher = {IOS},
  year = {1989},
  pages = {142--149}
}
Le Bellec, C. (1989), "Spécification de règles sémantiques manquantes". Dépt. d'Informatique, University d'Orléans, September, 1989.
BibTeX:
@techreport{LeBellec89,
  author = {Carole Le Bellec},
  title = {Spécification de règles sémantiques manquantes},
  year = {1989}
}
Liu, S.-S. & Johmann, K.R. (1989), "A Tool Specification Language for Software Maintenance: Part I Language Design". Software Engineering Research Centre, Technical Report SERC-TR-36-F, November, 1989.
Abstract: Software maintenance tools can help reduce the number of errors which maintenance programmers make when they modify programs. Attribute grammars have been used to create programming development environments, as has been done using the Synthesizer Generator and its Synthesizer Specification Language (SSL). However, conventional attribute-grammar languages, such as SSL, lack modularity and information sharing and are used with difficulty to specify a group of integrated tools. To overcome this difficulty and to improve system performance, a modified attribute-grammar language, to be used for specifying tools in a software maintenance environment, is proposed. This language is called Tool Specification Language (TSL). TSL allows an orderly sharing of specifications between different tools. It also allows the sharing of computed attribute values between different tools. For a suite of related tools which would support the maintenance programmer, using TSL as the specification language would result in a concise, shared specification. There would also be the benefit of less memory space and faster tool execution when computed attribute values are shared.
BibTeX:
@techreport{Liu89,
  author = {Sying-Syang Liu and Kurt R. Johmann},
  title = {A Tool Specification Language for Software Maintenance: Part I Language Design},
  year = {1989},
  number = {SERC-TR-36-F}
}
Mathieu, P. & Keisu, T. (1989), "Relating Attribute Grammars and a Constraints-Prolog Programming Environment", In Workshop on Programming Environment. Nässlingen (?). August 1989.
BibTeX:
@inproceedings{mathieu89,
  author = {Philippe Mathieu and Torbjörn Keisu},
  title = {Relating Attribute Grammars and a Constraints-Prolog Programming Environment},
  booktitle = {Workshop on Programming Environment},
  year = {1989},
  note = {SICS Research Report 0283-3638 (?)}
}
Micallef, J., Cycowicz, Y.J. & Kaiser, G.E. (1989), "Merging Scheduling Graphs during Incremental Attribute Evaluation of Asynchronous Subtree Replacements". Department of Comp. Sc., Columbia University, Technical Report CUCS-450-89, July, 1989.
BibTeX:
@techreport{Micallef89,
  author = {Josephine Micallef and Yael J. Cycowicz and Gail E. Kaiser},
  title = {Merging Scheduling Graphs during Incremental Attribute Evaluation of Asynchronous Subtree Replacements},
  year = {1989},
  number = {CUCS-450-89}
}
Micallef, J. (1989), "Incremental Attribute Evaluation with Applications to Multi-user Language-based Environments". Department of Comp. Sc., Columbia University, Technical Report CUCS-444-89, April, 1989.
BibTeX:
@techreport{Micallef89a,
  author = {Josephine Micallef},
  title = {Incremental Attribute Evaluation with Applications to Multi-user Language-based Environments},
  year = {1989},
  number = {CUCS-444-89}
}
Murching, A.M. & Srikant, Y.N. (1989), "Incremental Attribute Evaluation Through Recursive Procedures", Comput. Lang.. Vol. 14(4), pp. 225-237.
BibTeX:
@article{Murching89,
  author = {Arvind M. Murching and Y. N. Srikant},
  title = {Incremental Attribute Evaluation Through Recursive Procedures},
  journal = {Comput. Lang.},
  year = {1989},
  volume = {14},
  number = {4},
  pages = {225--237}
}
Paakki, J. (1989), "Comparison of Compiler Writing Methods: an Experiment", In 13th Information Technologies Conference. Sarajevo. Volume R122 Science and Research Council of Bosnia and Hertzegovina.
BibTeX:
@inproceedings{Paakki89,
  author = {Jukka Paakki},
  title = {Comparison of Compiler Writing Methods: an Experiment},
  booktitle = {13th Information Technologies Conference},
  publisher = {Science and Research Council of Bosnia and Hertzegovina},
  year = {1989},
  volume = {R122}
}
Papakonstantinou, G. & Tzafestas, S. (1989), "Attribute grammar approach to knowledge-based system building: Application to fault diagnosis", In Knowledge-based system diagnosis,supervision and control. Plenum Press.
BibTeX:
@incollection{PapTza89,
  author = {G. Papakonstantinou and S. Tzafestas},
  title = {Attribute grammar approach to knowledge-based system building: Application to fault diagnosis},
  booktitle = {Knowledge-based system diagnosis,supervision and control},
  publisher = {Plenum Press},
  year = {1989}
}
Planes, É. (1989), "PPAT: un décompilateur d'arbres attribués pour le système FNC-2". Dépt. d'Informatique, University d'Orléans, September, 1989.
BibTeX:
@techreport{Planes89,
  author = {Étienne Planes},
  title = {PPAT: un décompilateur d'arbres attribués pour le système FNC-2},
  year = {1989}
}
Reps, T. & Teitelbaum, T. (1989), "The Synthesizer Generator" New York--Heidelberg--Berlin Springer-Verlag.
BibTeX:
@book{Reps89,
  author = {Thomas Reps and Tim Teitelbaum},
  title = {The Synthesizer Generator},
  publisher = {Springer-Verlag},
  year = {1989}
}
Reps, T. & Teitelbaum, T. (1989), "The Synthesizer Generator Reference Manual" New York--Heidelberg--Berlin Springer-Verlag.
BibTeX:
@book{Reps89a,
  author = {Thomas Reps and Tim Teitelbaum},
  title = {The Synthesizer Generator Reference Manual},
  publisher = {Springer-Verlag},
  year = {1989},
  edition = {3rd}
}
Riedewald, G. & Lämmel, U. (1989), "Using an Attribute Grammar as a Logic Program", In Programming Language Implementation and Logic Programming (PLILP '89). Orléans. Volume 348, pp. 161-179. Springer-Verlag.
BibTeX:
@inproceedings{Riedewald98,
  author = {Günter Riedewald and Uwe Lämmel},
  title = {Using an Attribute Grammar as a Logic Program},
  booktitle = {Programming Language Implementation and Logic Programming (PLILP '89)},
  publisher = {Springer-Verlag},
  year = {1989},
  volume = {348},
  pages = {161--179}
}
Sagiv, S., Edelstein, O., Francez, N. & Rodeh, M. (1989), "Resolving Circularity in Attribute Grammars with Applications to Data Flow Analysis", In 16th ACM Symp. on Principles of Progr. Languages. Austin, TX, January, 1989. , pp. 36-48. ACM press.
BibTeX:
@incollection{Sagiv89,
  author = {S. Sagiv and O. Edelstein and Nissim Francez and M. Rodeh},
  title = {Resolving Circularity in Attribute Grammars with Applications to Data Flow Analysis},
  booktitle = {16th ACM Symp. on Principles of Progr. Languages},
  publisher = {ACM press},
  year = {1989},
  pages = {36--48}
}
Sarbo, J.J. & Moritz, M. (1989), "Translator Inversion", Comput. Lang.. Vol. 14(3), pp. 205-224.
BibTeX:
@article{Sarbo89,
  author = {Janos J. Sarbo and Matthias Moritz},
  title = {Translator Inversion},
  journal = {Comput. Lang.},
  year = {1989},
  volume = {14},
  number = {3},
  pages = {205--224}
}
Schürr, A. (1989), "Introduction to PROGRESS, an Attribute Graph Grammar Based Specification Language", In Graph-Theoretic Concepts in Computer Science. New York--Heidelberg--Berlin Vol. 411 Springer-Verlag.
BibTeX:
@incollection{Schurr89,
  author = {Andy Schürr},
  title = {Introduction to PROGRESS, an Attribute Graph Grammar Based Specification Language},
  booktitle = {Graph-Theoretic Concepts in Computer Science},
  publisher = {Springer-Verlag},
  year = {1989},
  volume = {411}
}
Sennhauser, R. (1989), "Übersetzung attributierter Grammatiken". School: Dept. Informatik, Inst. für Computersysteme, Eidgenössische Tech. Hochschule. Zürich
BibTeX:
@phdthesis{Sennhauser89,
  author = {R. Sennhauser},
  title = {Übersetzung attributierter Grammatiken},
  school = {Dept. Informatik, Inst. für Computersysteme, Eidgenössische Tech. Hochschule},
  year = {1989}
}
Serebriakov, V.A. (1989), "Attribute Visibility Control in CWS Super and Implementation of Import-Export Facilities in Modula-2 Front-End", In Procs. of the Soviet-French Symposium Informatika '89. Tallinn. May 1989., pp. 38-45.
BibTeX:
@inproceedings{Serebriakov89,
  author = {Vladimir A. Serebriakov},
  title = {Attribute Visibility Control in CWS Super and Implementation of Import-Export Facilities in Modula-2 Front-End},
  booktitle = {Procs. of the Soviet-French Symposium Informatika '89},
  year = {1989},
  pages = {38--45}
}
Sideri, M., Efremidis, S. & Papakonstantinou, G. (1989), "Semantically Driven Parsing of Context Free Languages", The Computer Journal. Vol. 32(1), pp. 91-93.
BibTeX:
@article{SidEfrPap89,
  author = {M. Sideri and S. Efremidis and G. Papakonstantinou},
  title = {Semantically Driven Parsing of Context Free Languages},
  journal = {The Computer Journal},
  year = {1989},
  volume = {32},
  number = {1},
  pages = {91--93}
}
Thieser, E. (1989), "Attributauswertung für zyklische Attributierung". School: FB~10 -- Informatik, University des Saarlandes. Saarbrücken
BibTeX:
@phdthesis{Thieser89,
  author = {E. Thieser},
  title = {Attributauswertung für zyklische Attributierung},
  school = {FB~10 -- Informatik, University des Saarlandes},
  year = {1989}
}
Thome, W. & Wilhelm, R. (1989), "Simulating Circular Attribute Grammars Through Attribute Reevaluation", Information Processing Letters., November, 1989. Vol. 33, pp. 79-81.
BibTeX:
@article{Thome89,
  author = {Winfried Thome and Reinhard Wilhelm},
  title = {Simulating Circular Attribute Grammars Through Attribute Reevaluation},
  journal = {Information Processing Letters},
  year = {1989},
  volume = {33},
  pages = {79--81}
}
Thome, W. (1989), "Konzept zur Hintereinanderschaltung von Transformationseinheiten sowie zur Implementierung zyklischer Attributierungen durch nichtzyklische unter Benutzung der Reattributierung". School: FB~10 -- Informatik, University des Saarlandes. Saarbrücken
BibTeX:
@phdthesis{Thome89a,
  author = {Winfried Thome},
  title = {Konzept zur Hintereinanderschaltung von Transformationseinheiten sowie zur Implementierung zyklischer Attributierungen durch nichtzyklische unter Benutzung der Reattributierung},
  school = {FB~10 -- Informatik, University des Saarlandes},
  year = {1989}
}
Vogt, H.H., Swierstra, S.D. & Kuiper, M.F. (1989), "Higher Order Attribute Grammars", In ACM SIGPLAN '89 Conf. on Progr. Lang. Design and Implementation. Portland, OR. July 1989., pp. 131-145. ACM press.
BibTeX:
@inproceedings{Vogt89,
  author = {Harald H. Vogt and S. Doaitse Swierstra and Matthijs F. Kuiper},
  title = {Higher Order Attribute Grammars},
  booktitle = {ACM SIGPLAN '89 Conf. on Progr. Lang. Design and Implementation},
  publisher = {ACM press},
  year = {1989},
  pages = {131--145},
  note = {Published as sl ACM SIGPLAN Notices, 24(7)}
}
Waite, W.M., Grosch, J. & Schröer, F.-W. (1989), "Three Compiler Specifications". GMD, Technical Report Nr.~166, August, 1989.
BibTeX:
@techreport{Waite89,
  author = {William M. Waite and Josef Grosch and Friedrich-Wilhelm Schröer},
  title = {Three Compiler Specifications},
  year = {1989},
  number = {Nr.~166}
}
Walz, J.A. (1989), "Extending Attribute Grammar and Type Inference Algorithms". School: Cornell University., February, 1989. (Technical Report TR-89-968)
Abstract: Gated attribute grammars and error-tolerant unification expand upon the usual views of attribute grammars and unification. Normally, attribute grammars are constrained to be noncircular; gated attribute grammars allow fairly general circularities. Most unification algorithms do not behave well when given inconsistent input; the new unification paradigm proposed here not only tolerates inconsistencies but extracts information from them. The expanded views prove to be useful in interactive language-based programming environments. Generalized unification allows the environment to help the user find the sources of type errors in a program, while gated attribute grammars allow the environment to provide an interpreter for incremental reevaluation of programs after small changes to the code. The defining feature of gated attribute grammars is the appearance of a gate attribute (indicating where cycle evaluation should begin and end) within every cycle. Attributes are ordered by collapsing strongly connected components in the dependency graph and topologically sorting the result. The smaller dependency graph for each component (ignoring edges leading to the gate) can be recursively collapsed to provide further ordering. use of the evaluation order defined in this manner allows gated attribute grammars to do without the restrictions on functions within a component needed by the other varieties of circular attribute grammars. Initial and incremental evaluation algorithms are given, as well as a sample grammar allowing an editor for a small language to become an incremental interpreter. Counting unification defines unique solutions to sets of input equations that contain conflicting type information. These solutions are derived from the potential variable constraints implied by the input equations. For each type variable, each branch (a portion of a constraint) is assigned a weight indicating the number of times the input set implied such a constraint. When the input equations are derived from the static analysis of a program, the relative branch weights for a conflicting variable give the overall pattern of uses of that variable and can direct attention to parts of the program that disagree with the majority of uses. A number of error-tolerant unification algorithms are presented.
BibTeX:
@phdthesis{Walz89,
  author = {Janet A. Walz},
  title = {Extending Attribute Grammar and Type Inference Algorithms},
  school = {Cornell University},
  year = {1989},
  number = {Technical Report TR-89-968},
  url = {http://cs-tr.cs.cornell.edu:80/Dienst/UI/1.0/Display/ncstrl.cornell/TR89-968}
}
op den Akker, R., Melichar, B. & Tarhio, J. (1990), "The Hierarchy of LR-attributed Grammars", In Attribute Grammars and their Applications (WAGA). New York--Heidelberg--Berlin, September, 1990. Vol. 461, pp. 13-28. Springer-Verlag.
Abstract: A survey of the various subclasses of L-AGs for LR parsing, presented in a unified formalism. (mj)
BibTeX:
@incollection{Akker90,
  author = {Rieks op den Akker and Bou rivoj Melichar and Jorma Tarhio},
  title = {The Hierarchy of LR-attributed Grammars},
  booktitle = {Attribute Grammars and their Applications (WAGA)},
  publisher = {Springer-Verlag},
  year = {1990},
  volume = {461},
  pages = {13--28},
  note = {Paris}
}
Alblas, H. (1990), "Concurrent Incremental Attribute Evaluation", In Attribute Grammars and their Applications (WAGA). New York--Heidelberg--Berlin, September, 1990. Vol. 461, pp. 343-358. Springer-Verlag.
BibTeX:
@incollection{Alblas90,
  author = {Henk Alblas},
  title = {Concurrent Incremental Attribute Evaluation},
  booktitle = {Attribute Grammars and their Applications (WAGA)},
  publisher = {Springer-Verlag},
  year = {1990},
  volume = {461},
  pages = {343--358},
  note = {Paris}
}
Alexin, Z., Gyimóthy, T., Horváth, T. & Fábricz, K. (1990), "Attribute Grammar Specification for a Natural Language Understanding Interface", In Attribute Grammars and their Applications (WAGA). New York--Heidelberg--Berlin, September, 1990. Vol. 461, pp. 313-326. Springer-Verlag.
BibTeX:
@incollection{Alexin90,
  author = {Zoltan Alexin and Tibor Gyimóthy and Tamas Horváth and Karoly Fábricz},
  title = {Attribute Grammar Specification for a Natural Language Understanding Interface},
  booktitle = {Attribute Grammars and their Applications (WAGA)},
  publisher = {Springer-Verlag},
  year = {1990},
  volume = {461},
  pages = {313--326},
  note = {Paris}
}
Alexin, Z., Dombi, J., Fábricz, K., Gyimóthy, T. & Horváth, T. (1990), "CONSTRUCTOR: A Natural Language Interface Based on Attribute Grammars", Acta Cybernetica. Vol. 9(3), pp. 247-255.
BibTeX:
@article{Alexin90a,
  author = {Zoltan Alexin and J. Dombi and Karoly Fábricz and Tibor Gyimóthy and T. Horváth},
  title = {CONSTRUCTOR: A Natural Language Interface Based on Attribute Grammars},
  journal = {Acta Cybernetica},
  year = {1990},
  volume = {9},
  number = {3},
  pages = {247--255}
}
Attali, I. & Chazarain, J. (1990), "Functional Evaluation of Strongly Non-circular Typol Specifications", In Attribute Grammars and their Applications (WAGA). New York--Heidelberg--Berlin, September, 1990. Vol. 461, pp. 157-176. Springer-Verlag.
BibTeX:
@incollection{Attali90,
  author = {Isabelle Attali and Jacques Chazarain},
  title = {Functional Evaluation of Strongly Non-circular Typol Specifications},
  booktitle = {Attribute Grammars and their Applications (WAGA)},
  publisher = {Springer-Verlag},
  year = {1990},
  volume = {461},
  pages = {157--176},
  note = {Paris}
}
Augusteijn, L. (1990), "The Elegant Compiler Generation System", In Attribute Grammars and their Applications (WAGA). New York--Heidelberg--Berlin, September, 1990. Vol. 461, pp. 238-254. Springer-Verlag.
BibTeX:
@incollection{Augusteijn90,
  author = {Lex Augusteijn},
  title = {The Elegant Compiler Generation System},
  booktitle = {Attribute Grammars and their Applications (WAGA)},
  publisher = {Springer-Verlag},
  year = {1990},
  volume = {461},
  pages = {238--254},
  note = {Paris}
}
van den Berg, A. (1990), "Attribute Grammar Based Transformation Systems". School: Utrecht University. The Netherlands, June, 1990.
BibTeX:
@mastersthesis{Berg90,
  author = {A. van den Berg},
  title = {Attribute Grammar Based Transformation Systems},
  school = {Utrecht University},
  year = {1990}
}
Chapman, N.P. (1990), "Defining, Analysing and Implementing Communication Protocols Using Attribute Grammars", Formal Aspects of Computing. Vol. 2(4), pp. 359-392.
BibTeX:
@article{Chapman90,
  author = {Nigel P. Chapman},
  title = {Defining, Analysing and Implementing Communication Protocols Using Attribute Grammars},
  journal = {Formal Aspects of Computing},
  year = {1990},
  volume = {2},
  number = {4},
  pages = {359--392}
}
Chapman, N.P. (1990), "On Extended Attribute Grammars". Comp. Sc. Department, University College, Technical Report RN/90/27, 1990.
Abstract: Extended attribute grammars (EAGs) is presented, in an attempt to overcome certain perceived technical deficiencies of their original definition. The new definition is purely syntactical. Well-formed EAGs are characterized in terms of this new definition; a stronger condition, substitution-transformability is introduced, which Several useful attribute types are shown to satisfy the necessary conditions to be used in substitution-transformable EAGs.
BibTeX:
@techreport{Chapman90a,
  author = {Nigel P. Chapman},
  title = {On Extended Attribute Grammars},
  year = {1990},
  number = {RN/90/27}
}
Delest, M.-P. & Fedou, J.-M. (1990), "Counting Polyominoes Using Attribute Grammars", In Attribute Grammars and their Applications (WAGA). New York--Heidelberg--Berlin, September, 1990. Vol. 461, pp. 46-60. Springer-Verlag.
Abstract: A very interesting, although a bit theoretical, application of the AG formalism to help solve combinatorics problems. The presentation at WAGA was brilliant. (mj)
BibTeX:
@incollection{Delest90,
  author = {Marie-Pierre Delest and Jean-Marc Fedou},
  title = {Counting Polyominoes Using Attribute Grammars},
  booktitle = {Attribute Grammars and their Applications (WAGA)},
  publisher = {Springer-Verlag},
  year = {1990},
  volume = {461},
  pages = {46--60},
  note = {Paris}
}
(1990), "Attribute Grammars and their Applications (WAGA)" New York--Heidelberg--Berlin, September, 1990. Vol. 461 Springer-Verlag.
Abstract: Proceedings of the first workshop entirely devoted to AGs.
BibTeX:
@book{Deransart90,,
  title = {Attribute Grammars and their Applications (WAGA)},
  publisher = {Springer-Verlag},
  year = {1990},
  volume = {461},
  note = {Paris}
}
Devillard, D. (1990), "Amélioration de l'implantation en C des évaluateurs d'attributs produits par FNC-2". Université d'Orléans, September, 1990.
BibTeX:
@techreport{Devillard90,
  author = {David Devillard},
  title = {Amélioration de l'implantation en C des évaluateurs d'attributs produits par FNC-2},
  year = {1990}
}
Dobler, H. & Pirklbauer, K. (1990), "Coco-2 -- A New Compiler-Compiler". Inst. für Informatik, University Linz, Technical Report TR~90/1, 1990.
BibTeX:
@techreport{Dobler90,
  author = {H. Dobler and K. Pirklbauer},
  title = {Coco-2 -- A New Compiler-Compiler},
  year = {1990},
  number = {TR~90/1}
}
Dueck, G.D.P. & Cormack, G.V. (1990), "Modular Attribute Grammars", The Computer Journal. Vol. 33, pp. 164-172.
Abstract: Attribute grammars provide a formal declarative notation for describing the semantics and translation of programming languages. Describing any real programming language is a significant software engineering challenge. From a software engineering viewpoint, current notations for attribute grammars have two flaws: tedious repetition of essentially the same attribute computations is inevitable, and the various components of the description cannt be decomposed into modules -- they must be merged (and hence closely coupled) with the syntax specification. This paper describes a tool that generated attribute grammars from pattern oriented specifications. These specifications can be grouped according to the separation of concerns arising from individual aspects of the compilation process. Implementation and use of the attribute grammar generator MAGGIE is described.
BibTeX:
@article{Dueck90,
  author = {Gerald D. P. Dueck and Gordon V. Cormack},
  title = {Modular Attribute Grammars},
  journal = {The Computer Journal},
  year = {1990},
  volume = {33},
  pages = {164--172},
  note = {See also: research report CS-88-19, University of Waterloo (May 1988)}
}
van Eijk, P. (1990), "Attribute Grammar Applications in Prototyping LOTOS Tools", In Attribute Grammars and their Applications (WAGA). New York--Heidelberg--Berlin, September, 1990. Vol. 461, pp. 91-100. Springer-Verlag.
Abstract: What is the practical applicability of attribute grammars? As we show in this paper, attribute grammars are at least good enough for the prototyping of fully functional interactive tools. Going from a definition of a language and the functionality of its tools to an attribute grammar is a discipline in need of a systematic approach, for which we given some initial material. As is inevitable when a system is extensively used (in our case the Cornell Synthesizer Generator), this paper also proposes extensions to the attribute grammar formalism and its supporting systems.
BibTeX:
@incollection{Eijk90,
  author = {Peter van Eijk},
  title = {Attribute Grammar Applications in Prototyping LOTOS Tools},
  booktitle = {Attribute Grammars and their Applications (WAGA)},
  publisher = {Springer-Verlag},
  year = {1990},
  volume = {461},
  pages = {91--100},
  note = {Paris},
  url = {http://www.phil.ruu.nl/home/pve/txt/waga.ps}
}
Engelfriet, J. & de Jong, W. (1990), "Attribute Storage Optimization by Stacks", Acta Informatica. Vol. 27, pp. 567-581.
BibTeX:
@article{Engelfriet90,
  author = {Joost Engelfriet and Willem de Jong},
  title = {Attribute Storage Optimization by Stacks},
  journal = {Acta Informatica},
  year = {1990},
  volume = {27},
  pages = {567--581},
  note = {Preliminary version: rapport 88-30, Vakgroep Informatica, Rijksuniv. te Leiden (December 1988).}
}
Fédéle, C. (1990), "Construction automatisée des compilateurs: le système Cigale". I3S, University de Nice--Sophia Antipolis, 1990.
BibTeX:
@techreport{Fedele90,
  author = {Carine Fédéle},
  title = {Construction automatisée des compilateurs: le système Cigale},
  year = {1990}
}
Feng, A., Kikuno, T. & Torii, K. (1990), "Incremental Attribute Evaluation for Multiple Subtree Replacements in Structure-oriented Environments", In Attribute Grammars and their Applications (WAGA). New York--Heidelberg--Berlin, September, 1990. Vol. 461, pp. 192-206. Springer-Verlag.
BibTeX:
@incollection{Feng90,
  author = {An Feng and Tohru Kikuno and Koji Torii},
  title = {Incremental Attribute Evaluation for Multiple Subtree Replacements in Structure-oriented Environments},
  booktitle = {Attribute Grammars and their Applications (WAGA)},
  publisher = {Springer-Verlag},
  year = {1990},
  volume = {461},
  pages = {192--206},
  note = {Paris}
}
Frost, R.A. (1990), "Constructing Programs in a Calculus of Lazy Interpreters"
BibTeX:
@unpublished{Frost90,
  author = {Richard A. Frost},
  title = {Constructing Programs in a Calculus of Lazy Interpreters},
  year = {1990},
  note = {University of Windsor}
}
Frost, R.A. & Saba, W.S. (1990), "A Database Interface Based on Montague's Approach to the Interpretation of Natural Language", International Journal of Man-Machine Studies. Vol. 33(2), pp. 149-176.
Abstract: In this paper we describe a database interface that is loosely based upon some of the concepts proposed by Richard Montague in his approach to the interpretation of natural language. The system is implemented as an executable attribute grammar specified in a higher order, lazy, pure functional programming language. The attribute grammar formalism provides a simple means of implementing Montague's notion of "semantic rule to syntactic rule correspondence" and the higher order functional language in which the attributes grammar is constructed provides an appropriate vehicle for implementing Montague's higher order semantics. The purpose of the paper is two-fold: (i) to demonstrate that many of Montague's ideas can be used to advantage in creating natural language interfaces to databases, and (ii) to introduce a method for implementing attribute grammars in functional languages that is suitable for investigating both grammars and semantic theories of language.
BibTeX:
@article{Frost90a,
  author = {R. A. Frost and W. S. Saba},
  title = {A Database Interface Based on Montague's Approach to the Interpretation of Natural Language},
  journal = {International Journal of Man-Machine Studies},
  year = {1990},
  volume = {33},
  number = {2},
  pages = {149--176}
}
Gupta, R., Pollock, L. & Soffa, M.L. (1990), "Parallelizing Data Flow Analysis", In Proceedings of the Workshop on Parallel Compilation. Kingston, Ontario, Canada, May, 1990.
BibTeX:
@conference{Gupta90a,
  author = {Rajiv Gupta and Lori Pollock and Mary Lou Soffa},
  title = {Parallelizing Data Flow Analysis},
  booktitle = {Proceedings of the Workshop on Parallel Compilation},
  year = {1990}
}
Susan Horwitz, Thomas Reps & Binkley, D. (1990), "Interprocedural Slicing Using Dependence Graphs", #TOPLAS#. (1)
Abstract: he notion of a program slice, originally introduced by Mark Weiser, is useful in program debugging, automatic parallelization, and program integration. A slice of a program is taken with respect to a program point p and a variable x; the slice consists of all statements of the program that might affect the value of x at point p. This paper concerns the problem of interprocedural slicing---generating a slice of an entire program, where the slice crosses the boundaries of procedure calls. To solve this problem, we introduce a new kind of graph to represent programs, called a system dependence graph, which extends previous dependence representations to incorporate collections of procedures (with procedure calls) rather than just monolithic programs. Our main result is an algorithm for interprocedural slicing that uses the new representation. (It should be noted that our work concerns a somewhat restricted kind of slice: Rather than permitting a program to be sliced with respect to program point p and an arbitrary variable, a slice must be taken with respect to a variable that is defined or used at p.) The chief difficulty in interprocedural slicing is correctly accounting for the calling context of a called procedure. To handle this problem, system dependence graphs include some data-dependence edges that represent transitive dependences due to the effects of procedure calls, in addition to the conventional direct-dependence edges. These edges are constructed with the aid of an auxiliary structure that represents calling and parameter-linkage relationships. This structure takes the form of an attribute grammar. The step of computing the required transitive-dependence edges is reduced to the construction of the subordinate characteristic graphs for the grammar's nonterminals
BibTeX:
@article{Horwitz90,
  author = { Susan Horwitz, Thomas Reps and David Binkley},
  title = {Interprocedural Slicing Using Dependence Graphs},
  journal = {#TOPLAS#},
  year = {1990},
  number = {1}
}
Jones, L.G. (1990), "Efficient Evaluation of Circular Attribute Grammars", ACM Trans. Progr. Languages and Systems., July, 1990. Vol. 12(3), pp. 429-462.
BibTeX:
@article{Jones90,
  author = {Larry G. Jones},
  title = {Efficient Evaluation of Circular Attribute Grammars},
  journal = {ACM Trans. Progr. Languages and Systems},
  year = {1990},
  volume = {12},
  number = {3},
  pages = {429--462}
}
Jourdan, M., Parigot, D., Julié, C., Durin, O. & Le Bellec, C. (1990), "Design, Implementation and Evaluation of the FNC-2 Attribute Grammar System", In Conf. on Programming Languages Design and Implementation. White Plains, NY. June 1990., pp. 209-222.
Abstract: FNC-2 is a new attribute grammar processing system aiming at expressive power, efficiency, ease of use and versatility. Its development at INRIA started in 1986, and a first running prototype is available since early 1989. Its most important features are: efficient exhaustive and incremental visit-sequence-based evaluation of strongly (absolutely) non-circular AGs; extensive space optimizations; a specially-designed AG-description language, with provisions for true modularity; portability and versatility of the generated evaluators; complete environment for application development. This paper briefly describes the design and implementation of FNC-2 and its peripherals. Then preliminary experience with the system is reported.
BibTeX:
@inproceedings{Jourdan90,
  author = {Martin Jourdan and Didier Parigot and Catherine Julié and Olivier Durin and Carole Le Bellec},
  title = {Design, Implementation and Evaluation of the FNC-2 Attribute Grammar System},
  booktitle = {Conf. on Programming Languages Design and Implementation},
  year = {1990},
  pages = {209--222},
  note = {Published as sl ACM SIGPLAN Notices, 25(6) scriptsize http://www-sop.inria.fr/members/Didier.Parigot/publications/sgpln90-t.ps.gz},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/sgpln90-t.ps.gz}
}
Jourdan, M. & Parigot, D. (1990), "Techniques for Improving Grammar Flow Analysis", In European Symp. on Programming (ESOP '90). Copenhague. Volume 432, pp. 240-255. Springer-Verlag.
Abstract: Grammar Flow Analysis (GFA) is a computation framework that can be applied to a large number of problems expressed on context-free grammars. In this framework, as was done on programs with Data Flow Analysis, those problems are split into a general resolution procedure and a set of specific propagation functions. This paper presents a number of improvement techniques that act on the resolution procedure, and hence apply to every GFA problem: grammar partitioning, non-terminals static ordering, weak stability and semantic stability. Practical experiments using circularity tests for attribute grammars will show the benefit of these improvements.
BibTeX:
@inproceedings{Jourdan90a,
  author = {Martin Jourdan and Didier Parigot},
  title = {Techniques for Improving Grammar Flow Analysis},
  booktitle = {European Symp. on Programming (ESOP '90)},
  publisher = {Springer-Verlag},
  year = {1990},
  volume = {432},
  pages = {240--255},
  note = {scriptsize http://www-sop.inria.fr/members/Didier.Parigot/publications/esop90-t.ps.gz},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/esop90-t.ps.gz}
}
Jourdan, M., Bellec, C.L. & Parigot, D. (1990), "The Olga Attribute Grammar Description Language: Design, Implementation and Evaluation". New York--Heidelberg--Berlin. September 1990. Volume 461, pp. 222-237. Springer-Verlag.
Abstract: Olga is the input language of the FNC-2 attribute grammar processing system, currently under development at INRIA. As such, it is designed for the specification of attribute grammars and is specialized for this purpose. The features of Olga can be classified into those which make it a powerful general-purpose applicative language and those which make it a specialized AG-description language. A remarkable feature of Olga is its strong support for modularity. The paper discusses the design goals for Olga and presents the most important aspects of the language. It also includes comparisons with other existing languages, an overview of the implementation of Olga, namely the FNC-2 system, and an account of the experience gained in using Olga.
BibTeX:
@inproceedings{Jourdan90b,
  author = {Martin Jourdan and Carole Le Bellec and Didier Parigot},
  title = {The Olga Attribute Grammar Description Language: Design, Implementation and Evaluation},
  publisher = {Springer-Verlag},
  year = {1990},
  volume = {461},
  pages = {222--237},
  note = {scriptsize http://www-sop.inria.fr/members/Didier.Parigot/publications/olga-t.ps.gz},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/olga-t.ps.gz}
}
Jourdan, M. & Parigot, D. (1990), "Application Development with the FNC-2 Attribute Grammar System", In Compiler Compilers '90. Schwerin Vol. 477, pp. 11-25. Springer-Verlag.
Abstract: FNC-2 is an advanced attribute grammar system aiming at production-quality, currently under development at INRIA. After a brief tour through its internals and a short presentation of its input language Olga, the talk will concentrate on how FNC-2 and its companions can be used to develop large language-processing applications. The key feature for enhancing programmers' productivity and supporting teamwork is FNC-2 constructs for modularity. This will be exemplified by the development of FNC-2 itself. Finally we'll present how FNC-2 can be combined with other tools under development at INRIA to form a complete, high-quality compiler production workbench.
BibTeX:
@incollection{Jourdan90c,
  author = {Martin Jourdan and Didier Parigot},
  title = {Application Development with the FNC-2 Attribute Grammar System},
  booktitle = {Compiler Compilers '90},
  publisher = {Springer-Verlag},
  year = {1990},
  volume = {477},
  pages = {11--25},
  note = {scriptsize http://www-sop.inria.fr/members/Didier.Parigot/publications/CC90-t.ps.gz},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/CC90-t.ps.gz}
}
Julié, C. & Parigot, D. (1990), "Space Optimization in the FNC-2 Attribute Grammar System", In Attribute Grammars and their Applications (WAGA). Paris. September 1990. Volume 461, pp. 29-45. Springer-Verlag.
Abstract: Memory space management for attribute evaluators is a vital requirement in practice. In fact, using attribute grammars (AGs) will very quickly meet the problem of memory space if it isn't taken into special consideration. We consider this problem for evaluators of the simple multi-visit class, also called $l$-ordered, because it is the largest possible AGs class for which we can find, at construction time, a method for memory space optimization. We present a new algorithm which decides, at generation time, if it is possible to store attribute instances in global stacks or global variables. The purpose of this approach is to reduce not only memory space, but also as much as possible the number of attributes to be stored in the nodes of the tree. This method is implemented in the new attribute grammar processing system, named FNC--2. Finally we present our first practical results which seem very promising.
BibTeX:
@inproceedings{Julie90,
  author = {Catherine Julié and Didier Parigot},
  title = {Space Optimization in the FNC-2 Attribute Grammar System},
  booktitle = {Attribute Grammars and their Applications (WAGA)},
  publisher = {Springer-Verlag},
  year = {1990},
  volume = {461},
  pages = {29--45},
  note = {scriptsize http://www-sop.inria.fr/members/Didier.Parigot/publications/optim-t.ps.gz},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/optim-t.ps.gz}
}
Julié, C. & Parigot, D. (1990), "Space Optimization in the FNC-2 Attribute Grammar System". INRIA, Technical Report 1165, 1990.
Abstract: Memory space management for attribute evaluators is a vital requirement in practice. In fact, using attribute grammars (AGs) will very quickly meet the problem of memory space if it isn't taken into special consideration. We consider this problem for evaluators of the simple multi-visit class, also called $l$-ordered, because it is the largest possible AGs class for which we can find, at construction time, a method for memory space optimization. We present a new algorithm which decides, at generation time, if it is possible to store attribute instances in global stacks or global variables. The purpose of this approach is to reduce not only memory space, but also as much as possible the number of attributes to be stored in the nodes of the tree. This method is implemented in the new attribute grammar processing system, named FNC--2. Finally we present our first practical results which seem very promising.
BibTeX:
@techreport{Julie90a,
  author = {Catherine Julié and Didier Parigot},
  title = {Space Optimization in the FNC-2 Attribute Grammar System},
  year = {1990},
  number = {1165}
}
Keller, P. & Maas, T. (1990), "An OPTRAN-generated Front-end for Ada", In Attribute Grammars and their Applications (WAGA). New York--Heidelberg--Berlin, September, 1990. Vol. 461, pp. 266-283. Springer-Verlag.
BibTeX:
@incollection{Keller90,
  author = {Paul Keller and Thomas Maas},
  title = {An OPTRAN-generated Front-end for Ada},
  booktitle = {Attribute Grammars and their Applications (WAGA)},
  publisher = {Springer-Verlag},
  year = {1990},
  volume = {461},
  pages = {266--283},
  note = {Paris}
}
Klein, E. & Koskimies, K. (1990), "Parallel One-pass Compilation", In Attribute Grammars and their Applications (WAGA). New York--Heidelberg--Berlin, September, 1990. Vol. 461, pp. 76-90. Springer-Verlag.
BibTeX:
@incollection{Klein90,
  author = {Eduard Klein and Kai Koskimies},
  title = {Parallel One-pass Compilation},
  booktitle = {Attribute Grammars and their Applications (WAGA)},
  publisher = {Springer-Verlag},
  year = {1990},
  volume = {461},
  pages = {76--90},
  note = {Paris}
}
Knuth, D.E. (1990), "The Genesis of Attribute Grammars", In Attribute Grammars and their Applications (WAGA). New York--Heidelberg--Berlin, September, 1990. Vol. 461, pp. 1-12. Springer-Verlag.
Abstract: Historical recollection of how AGs were born.
BibTeX:
@incollection{Knuth90,
  author = {Donald E. Knuth},
  title = {The Genesis of Attribute Grammars},
  booktitle = {Attribute Grammars and their Applications (WAGA)},
  publisher = {Springer-Verlag},
  year = {1990},
  volume = {461},
  pages = {1--12},
  note = {Paris}
}
Kuiper, M.F. & Swierstra, S.D. (1990), "Parallel Attribute Evaluation: Structure of Evaluators and Detection of Parallelism", In Attribute Grammars and their Applications (WAGA). New York--Heidelberg--Berlin, September, 1990. Vol. 461, pp. 61-75. Springer-Verlag.
Abstract: A summary of Kuiper's thesis. (mj)
BibTeX:
@incollection{Kuiper90,
  author = {Matthijs F. Kuiper and S. Doaitse Swierstra},
  title = {Parallel Attribute Evaluation: Structure of Evaluators and Detection of Parallelism},
  booktitle = {Attribute Grammars and their Applications (WAGA)},
  publisher = {Springer-Verlag},
  year = {1990},
  volume = {461},
  pages = {61--75},
  note = {Paris}
}
Levison, M. & Lessard, G. (1990), "Application of Attribute Grammars to Natural Language Sentence Generation", In Attribute Grammars and their Applications (WAGA). New York--Heidelberg--Berlin, September, 1990. Vol. 461, pp. 298-312. Springer-Verlag.
BibTeX:
@incollection{Levison90,
  author = {Michael Levison and Gregory Lessard},
  title = {Application of Attribute Grammars to Natural Language Sentence Generation},
  booktitle = {Attribute Grammars and their Applications (WAGA)},
  publisher = {Springer-Verlag},
  year = {1990},
  volume = {461},
  pages = {298--312},
  note = {Paris}
}
Lextrait, V. & Zarli, A. (1990), "Meta-Generation of Incremental and Graphical Structure-oriented Editors", BIGRE., September, 1990. (70)
BibTeX:
@article{Lextrait90,
  author = {Vincent Lextrait and Alain Zarli},
  title = {Meta-Generation of Incremental and Graphical Structure-oriented Editors},
  journal = {BIGRE},
  year = {1990},
  number = {70}
}
Lextrait, V. & Ceugniet, X. (1990), "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.
BibTeX:
@inproceedings{Lextrait90a,
  author = {Vincent Lextrait and Xavier Ceugniet},
  title = {NEXUS: The Meta-Generation of Versatile Graphical Multi-user Structure Editors Using Generalized Attribute Grammars},
  booktitle = {CHI '90 Workshop on Structure Editors Seattle},
  year = {1990}
}
Lichao, T., Shinoda, Y. & Katayama, T. (1990), "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. December 1990., pp. 56-65.
Abstract: Methods of dealing with change in an object management system OS/0 are discussed. OS/0 is a prototype of an attribute grammar based object management model, called object-oriented attribute grammars (OOAG) by Y. Shinoda et al. (1990). OOAG is a hybrid model that combines features of functional and object-oriented paradigms. Various aspects of software object databases can be described using its capabilities. Software objects in OOAG are managed as autonomous, hierarchical trees containing attributes. The OOAG is also capable of describing software processes as hierarchies of software objects, with data driven process enaction mechanism. Many aspects of changes to such a tree, including the evolution of the tree type definition, or the dynamic transformation of its internal structure can be dealt with easily by the benefits of a combined attribute grammars based and object oriented paradigm. The authors also introduce a mechanism that helps to provide an efficient way for manipulating changed objects. The mechanism is characterized by meta-objects that are used to control the evaluation of the changes. Meta-objects prove to be a suitable mechanism for handling change management tasks in evolving object environments.
BibTeX:
@inproceedings{Lichao90,
  author = {Tan. Lichao and Y. Shinoda and T. Katayama},
  title = {Coping with Changes in an Object Management System based on Attribute Grammars},
  booktitle = {Proceedings of the Fourth ACM SIGSOFT '90 Symposium on Software Development Environments},
  year = {1990},
  pages = {56--65},
  note = {Published as SIGSOFT Software Engineering Notes, volume 15, number 6.}
}
Lämmel, U. & Forbrig, P. (1990), "Mixed Dialogue Control Defined by an Attribute Grammar", In Compiler Compilers '90. Schwerin Vol. 477, pp. 219-221. Springer-Verlag.
BibTeX:
@incollection{Lämmel90,
  author = {Uwe Lämmel and Peter Forbrig},
  title = {Mixed Dialogue Control Defined by an Attribute Grammar},
  booktitle = {Compiler Compilers '90},
  publisher = {Springer-Verlag},
  year = {1990},
  volume = {477},
  pages = {219--221}
}
Marcelis, A.J.J.M. (1990), "On the Classification of Attribute Evaluation Algorithms", Science of Computer Programming., June, 1990. Vol. 14(1), pp. 1-24.
BibTeX:
@article{Marcelis90,
  author = {A. J. J. M. Marcelis},
  title = {On the Classification of Attribute Evaluation Algorithms},
  journal = {Science of Computer Programming},
  year = {1990},
  volume = {14},
  number = {1},
  pages = {1--24}
}
Marmol, B. (1990), "Évaluateurs d'attributs parallèles sur multi-processeurs à mémoire partagée". University d'Orléans, September, 1990.
Abstract: First (as far as I know) real implementation of a parallel attribute evaluator. (mj)
BibTeX:
@techreport{Marmol90,
  author = {Bruno Marmol},
  title = {Évaluateurs d'attributs parallèles sur multi-processeurs à mémoire partagée},
  year = {1990}
}
Mathieu, P. & Keisu, T. (1990), "Relating Attribute Grammars and a Constraints-Prolog Programming Environment". SICS Swedish Institute of Computer Science, Technical Report R90004, 1990.
BibTeX:
@techreport{mathieu90,
  author = {Philippe Mathieu and Torbjörn Keisu},
  title = {Relating Attribute Grammars and a Constraints-Prolog Programming Environment},
  year = {1990},
  number = {R90004},
  url = {http://www.sics.se/titles.html}
}
Meijer, H. (1990), "The Project on Extended Affix Grammars at Nijmegen", In Attribute Grammars and their Applications (WAGA). New York--Heidelberg--Berlin, September, 1990. Vol. 461, pp. 130-142. Springer-Verlag.
BibTeX:
@incollection{Meijer90,
  author = {Hans Meijer},
  title = {The Project on Extended Affix Grammars at Nijmegen},
  booktitle = {Attribute Grammars and their Applications (WAGA)},
  publisher = {Springer-Verlag},
  year = {1990},
  volume = {461},
  pages = {130--142},
  note = {Paris}
}
Micallef, J. & Kaiser, G.E. (1990), "Support Algorithms for Incremental Attribute Evaluation of Asynchronous Subtree Replacements". University of Columbia, Technical Report CUCS-033-90, 1990.
Abstract: We attack the problem of incremental attribute evaluation algorithm for multiple asynchronous subtree replacements applicable to arbitrary noncircular attribute grammars. Our algorithm supports multiple independent editing cursors. Concurrent evaluations processes proceed independently as long as they cover disjoint regions of the derivation tree. Evaluation processes are merged when they overlap, to prevent unnecessary attribute evaluations. The algorithm ensures that when evaluation terminates, the tree is consistently attributed. Our results fill two open problems in the original algorithm for asynchronous subtree replacements reported by Kaplan and Kaiser.
BibTeX:
@techreport{Micallef90,
  author = {Josephine Micallef and Gail E. Kaiser},
  title = {Support Algorithms for Incremental Attribute Evaluation of Asynchronous Subtree Replacements},
  year = {1990},
  number = {CUCS-033-90},
  url = {ftp://ftp.cs.columbia.edu/reports/reports-1990/cucs-033?-90.ps.Z}
}
Mössenböck, H. (1990), "Coco/R: A Generator for Fast Compiler Front-ends". Dept. Informatik, Inst. für Computersysteme, Eidgenössische Tech. Hochschule, Technical Report 127, February, 1990.
BibTeX:
@techreport{Mossenbock90,
  author = {Hans Mössenböck},
  title = {Coco/R: A Generator for Fast Compiler Front-ends},
  year = {1990},
  number = {127}
}
Paakki, J. (1990), "A Logic-Based Modification of Attribute Grammars for Practical Compiler Writing", In 7th Int. Conference on Logic Programming. Jerusalem., pp. 203-217. MIT Press.
BibTeX:
@inproceedings{Paakki90,
  author = {Jukka Paakki},
  title = {A Logic-Based Modification of Attribute Grammars for Practical Compiler Writing},
  booktitle = {7th Int. Conference on Logic Programming},
  publisher = {MIT Press},
  year = {1990},
  pages = {203--217}
}
Panayiotopoulos, T., Papakonstantinou, G. & Sgouros, N. (1990), "An attribute grammar interpreter for inexact reasoning", Information and Software Technology. Vol. 32(5), pp. 347-356.
BibTeX:
@article{PanPapSgo90,
  author = {T. Panayiotopoulos and G. Papakonstantinou and N. Sgouros},
  title = {An attribute grammar interpreter for inexact reasoning},
  journal = {Information and Software Technology},
  year = {1990},
  volume = {32},
  number = {5},
  pages = {347--356}
}
Pavlu, P. (1990), "Another Way to Evaluate Attributes in Parallel with LR Parsing". Dept. of Computers, Czech University of Technology, Technical Report DC--90--03, December, 1990.
BibTeX:
@techreport{Pavlu90,
  author = {Petr Pavlu},
  title = {Another Way to Evaluate Attributes in Parallel with LR Parsing},
  year = {1990},
  number = {DC--90--03}
}
Peckham, S.B. (1990), "Globally Partitionable Attribute Grammars", In Attribute Grammars and their Applications (WAGA). New York--Heidelberg--Berlin, September, 1990. Vol. 461, pp. 327-342. Springer-Verlag.
BibTeX:
@incollection{Peckham90,
  author = {Stephen B. Peckham},
  title = {Globally Partitionable Attribute Grammars},
  booktitle = {Attribute Grammars and their Applications (WAGA)},
  publisher = {Springer-Verlag},
  year = {1990},
  volume = {461},
  pages = {327--342},
  note = {Paris}
}
Peckham, S.B. (1990), "Incremental Attribute Evaluation and Multiple Subtree Replacements". Department of Comp. Sc., Cornell University, Technical Report TR90-1093, February, 1990.
Abstract: The standard model for incremental attribute evaluation allows single subtree replacements followed by attribute reevaluation to restore consistency to a derivation tree. This thesis advocates an extended model that allows multiple subtree replacements. A static (tree-walking) algorithm for performing incremental updating after such changes is developed. The algorithm cannot be used with all attribute grammars, but is restricted to grammars contained in the new class of ``globally partitionable attributer grammars'' (GPAGs). A test for determining whether an attribute grammar is GPAG is described. The multiple subtree replacement algorithm (GPAG-evaluate) in this thesis improves on two shortcomings of existing algorithms. First, many evaluators have a running time that depends linearly on the size of the derivation tree of on the number of concurrent subtree replacements. GPAG-evaluate has a running time of O(log n ot |AFFECTED|), where n is the number of nodes in the derivation tree and AFFECTED is the set of attributes needing reevaluation. Second, experience with incremental, attribute grammar-based environments demonstrates that dynamic evaluators are noticeably slower than static evaluators because they require time-consuming data structure manipulations. Most existing algorithms for multiple subtree replacements are dynamic, but GPAG-evaluate is static. A second problem treated in this thesis is asynchronous subtree replacements, that is, allowing changes to be made while propagation continues after previous changes. A method for analyzing the efficiency of asynchronous subtree replacement algorithms is presented. An asynchronous evaluator (ASYNCH-evaluate) is described that, like GPAG-evaluate, guarantees that no attributes will be evaluated unnecessarily. Under some restrictions, ASYNCH-evaluate is as efficient as GPAG-evaluate. In particular, propagation in trees containing dynamically generated, nonlocal dependency edges can be supported. Both GPAG-evaluate and ASYNCH-evaluate must find lowest common ancestors of nodes in a tree where subtree replacements were made. A simple technique performs this operation in time O(n). To make the evaluators more efficient, this thesis describes an algorithm that uses self-adjusting binary trees to perform the necessary operations in amortized O(log n) time. These operations are not restricted to attributed derivation trees, but can be used for any application using trees.
BibTeX:
@techreport{Peckham90a,
  author = {Stephen B. Peckham},
  title = {Incremental Attribute Evaluation and Multiple Subtree Replacements},
  year = {1990},
  number = {TR90-1093},
  url = {http://cs-tr.cs.cornell.edu:80/Dienst/UI/2.0/Describe/ncstrl.cornell%2fTR90-1093}
}
Pitt, J. & Cunningham, J. (1990), "Attribute Grammars and the Semantics of Natural Language". , 1990.
Abstract: When Knuth introduced attribute grammars, he observed that although ``oriented primarily towards programming languages, the same methods appear to be relevant also in the study of natural languages''. We demonstrate that his intuition is computationally justifiable, based on the algebraic equivalence of attribute grammars and Montague's theory of Universal Grammar. We discuss the relationship between attribute grammars, axiomatic theories and logic programming. We find that attribute grammars can be used to encode an algebraic specification of a natural language, attributed translation used to compute representations of the `meaning' of a sentence at different levels of abstraction, and that the specifications can be implemented as logic programs. We illustrate the application of non-deterministic attributed translation to natural language by the specification of a subset of Montague's PTQ, including a treatment of some semantic ambiguities
BibTeX:
@techreport{Pitt,
  author = {Jeremy Pitt and Jim Cunningham},
  title = {Attribute Grammars and the Semantics of Natural Language},
  year = {1990},
  url = {http://medlar.doc.ic.ac.uk/vp/abstracts.html#PC90}
}
Pitt, J.V. & Cunningham, R.J. (1990), "Attributed Translation and the Semantics of Natural Language", In Attribute Grammars and their Applications (WAGA). New York--Heidelberg--Berlin, September, 1990. Vol. 461, pp. 284-297. Springer-Verlag.
BibTeX:
@incollection{Pitt90,
  author = {J. V. Pitt and R. J. Cunningham},
  title = {Attributed Translation and the Semantics of Natural Language},
  booktitle = {Attribute Grammars and their Applications (WAGA)},
  publisher = {Springer-Verlag},
  year = {1990},
  volume = {461},
  pages = {284--297},
  note = {Paris}
}
Rosendahl, M. (1990), "Abstract Interpretation Using Attribute Grammars", In Attribute Grammars and their Applications (WAGA). New York--Heidelberg--Berlin, September, 1990. Vol. 461, pp. 143-156. Springer-Verlag.
Abstract: The paper deals with correctness proofs of attribute grammars using methods from abstract interpretation. The technique is described by defining a liveness analysis and proving it correct with respect to a continuation style semantics.
BibTeX:
@incollection{Rosendahl90,
  author = {Mads Rosendahl},
  title = {Abstract Interpretation Using Attribute Grammars},
  booktitle = {Attribute Grammars and their Applications (WAGA)},
  publisher = {Springer-Verlag},
  year = {1990},
  volume = {461},
  pages = {143--156},
  note = {Paris}
}
Sassa, M., Ishizuka, H., Sawatani, M. & Nakata, I. (1990), "Rie -- Introduction and User's Manual". Institute of Information Sciences. An International Journal and Electronics, University of Tsukuba, Technical Report ISE-TR-90-82, June, 1990.
BibTeX:
@techreport{Sassa90,
  author = {Masataka Sassa and Harushi Ishizuka and Motoki Sawatani and Ikuo Nakata},
  title = {Rie -- Introduction and User's Manual},
  year = {1990},
  number = {ISE-TR-90-82}
}
Shinoda, Y. & Katayama, T. (1990), "Object-oriented Extension of Attribute Grammars and its Implementation Using Distributed Attribute Evaluation Algorithm", In Attribute Grammars and their Applications (WAGA). New York--Heidelberg--Berlin, September, 1990. Vol. 461, pp. 177-191. Springer-Verlag.
BibTeX:
@incollection{Shinoda90,
  author = {Yoichi Shinoda and Takuya Katayama},
  title = {Object-oriented Extension of Attribute Grammars and its Implementation Using Distributed Attribute Evaluation Algorithm},
  booktitle = {Attribute Grammars and their Applications (WAGA)},
  publisher = {Springer-Verlag},
  year = {1990},
  volume = {461},
  pages = {177--191},
  note = {Paris}
}
Sideris, M. (1990), "On Attribute Grammars Without Attribute Synthesis", Information Processing Letters., June, 1990. Vol. 35, pp. 103-109.
BibTeX:
@article{Sideris90,
  author = {Martha Sideris},
  title = {On Attribute Grammars Without Attribute Synthesis},
  journal = {Information Processing Letters},
  year = {1990},
  volume = {35},
  pages = {103--109}
}
Souah, A. (1990), "Contribution à la sémantique déclarative des systèmes de transformation d'arbres attribués". School: Université d'Orléans., November, 1990.
BibTeX:
@phdthesis{Souah90,
  author = {Aziz Souah},
  title = {Contribution à la sémantique déclarative des systèmes de transformation d'arbres attribués},
  school = {Université d'Orléans},
  year = {1990}
}
Swierstra, S.D. & Vogt, H.H. (1990), "Higher Order Attribute Grammars: a Merge Between Functional and Object Oriented Programming". Utrecht University, Technical Report RUU--CS--90--12, March, 1990.
BibTeX:
@techreport{Swierstra90,
  author = {S. Doaitse Swierstra and Harald H. Vogt},
  title = {Higher Order Attribute Grammars: a Merge Between Functional and Object Oriented Programming},
  year = {1990},
  number = {RUU--CS--90--12}
}
Tarhio, J. (1990), "Uncle-attributed Grammars", BIT. Vol. 30, pp. 437-449.
BibTeX:
@article{Tarhio90,
  author = {Jorma Tarhio},
  title = {Uncle-attributed Grammars},
  journal = {BIT},
  year = {1990},
  volume = {30},
  pages = {437--449}
}
Thomas, L. & lara, S.C. (1990), "A Concurrent Object-Oriented Paradigm for Attribute Grammars". Centre de recherche en Informatique de Mancy, 1990.
BibTeX:
@techreport{Thomas90,
  author = {L Thomas and S. Cruz-lara},
  title = {A Concurrent Object-Oriented Paradigm for Attribute Grammars},
  year = {1990}
}
Téguia, M. (1990), "Construction de grammaires attribuées associées à un programme logique et application au problème du test d'occurrence". School: Orléans-LIFO.
BibTeX:
@phdthesis{Téguia90,
  author = {Michel Téguia},
  title = {Construction de grammaires attribuées associées à un programme logique et application au problème du test d'occurrence},
  school = {Orléans-LIFO},
  year = {1990}
}
na, F.V. (1990), "Semantic Formalization in Mathematical Modeling Languages". School: Computer Science Department, UCLA.
Abstract: Most existing languages for mathematical programming have semantics that are only incompletely formalized. This situation -- studied in detail for AMPL, GAMS, and LINGO -- inhibits efforts to achieve a high level of automation for diagnosing errors and generating major components of a computer-based modeling environment (e.g., language-based editors, type inference tools, and immediate expression evaluators). The focus of this dissertation is to demonstrate that attribute grammars furnish a suitable declarative formalism with which to overcome this serious deficiency. SML is the main target language, although a similar development should be possible for most other mathematical modeling languages. The feasibility of the proposed approach is demonstrated by expressing the full syntax and semantics of SML in attribute grammar equations, and by using them in conjunction with the Cornell Synthesizer Generator to generate a language-directed editor for SML on a UNIX workstation. Both the automatic detection of missing language constructs and the immediate evaluation of numerical and logical expressions are addressed.
BibTeX:
@phdthesis{Vicu90,
  author = {F. Vicu na},
  title = {Semantic Formalization in Mathematical Modeling Languages},
  school = {Computer Science Department, UCLA},
  year = {1990}
}
Vogt, H.H., van den Berg, A. & Freije, A. (1990), "Rapid Development of a Program Transformation System with Attribute Grammars and Dynamic Transformations", In Attribute Grammars and their Applications (WAGA). New York--Heidelberg--Berlin, September, 1990. Vol. 461, pp. 101-115. Springer-Verlag.
BibTeX:
@incollection{Vogt90,
  author = {Harald H. Vogt and Aswin van den Berg and Arend Freije},
  title = {Rapid Development of a Program Transformation System with Attribute Grammars and Dynamic Transformations},
  booktitle = {Attribute Grammars and their Applications (WAGA)},
  publisher = {Springer-Verlag},
  year = {1990},
  volume = {461},
  pages = {101--115},
  note = {Paris}
}
Vogt, H.H., Swierstra, S.D. & Kuiper, M.F. (1990), "On the Efficient Incremental Evaluation of Higher Order Attribute Grammars". Utrecht University, Technical Report RUU--CS--90--36, December, 1990.
BibTeX:
@techreport{Vogt90a,
  author = {Harald H. Vogt and S. Doaitse Swierstra and Matthijs F. Kuiper},
  title = {On the Efficient Incremental Evaluation of Higher Order Attribute Grammars},
  year = {1990},
  number = {RUU--CS--90--36}
}
Vorthmann, S.A. (1990), "Coordinated Incremental Attribute Evaluation on a DR-threaded Tree", In Attribute Grammars and their Applications (WAGA). New York--Heidelberg--Berlin, September, 1990. Vol. 461, pp. 207-221. Springer-Verlag.
BibTeX:
@incollection{Vorthmann90,
  author = {Scott A. Vorthmann},
  title = {Coordinated Incremental Attribute Evaluation on a DR-threaded Tree},
  booktitle = {Attribute Grammars and their Applications (WAGA)},
  publisher = {Springer-Verlag},
  year = {1990},
  volume = {461},
  pages = {207--221},
  note = {Paris}
}
Waite, W.A. (1990), "Use of Attribute Grammars in Compiler Construction", In Attribute Grammars and their Applications (WAGA). New York--Heidelberg--Berlin, September, 1990. Vol. 461, pp. 255-265. Springer-Verlag.
BibTeX:
@incollection{Waite90,
  author = {William A. Waite},
  title = {Use of Attribute Grammars in Compiler Construction},
  booktitle = {Attribute Grammars and their Applications (WAGA)},
  publisher = {Springer-Verlag},
  year = {1990},
  volume = {461},
  pages = {255--265},
  note = {Paris}
}
Wilhelm, R. (1990), "Tree Transformations, Functional Languages, and Attribute Grammars", In Attribute Grammars and their Applications (WAGA). New York--Heidelberg--Berlin, September, 1990. Vol. 461, pp. 116-129. Springer-Verlag.
Abstract: Title is explicit enough: it is an account of the experience gained in using OPTRAN and TrafoLa. Highly interesting. (mj)
BibTeX:
@incollection{Wilhelm90,
  author = {Reinhard Wilhelm},
  title = {Tree Transformations, Functional Languages, and Attribute Grammars},
  booktitle = {Attribute Grammars and their Applications (WAGA)},
  publisher = {Springer-Verlag},
  year = {1990},
  volume = {461},
  pages = {116--129},
  note = {Paris}
}
Zaring, A.K. (1990), "Parallel Evaluation in Attribute Grammar-based Systems". School: Department of Comp. Sc., Cornell University., August, 1990. (Technical Report 90-1149)
Abstract: Attributed context-free grammars provide a rigorous basis for the semantic analysis and translation of tree-structured objects and have been used to build a variety of systems. A number of programming language compiler, compiler generators, and language-based editor generators employing attribute grammars have been described in the literature. Many of these systems make use of l-ordered attribute grammars, attribute grammars for which particularly efficient methods for attributing derivation trees have been described. Derivation trees representing constructs of only moderate size may contain thousands of nodes and tens of thousands of attribute instances, and attribution of such trees on uniprocessor systems may require a significant amount of time. One possibility for reducing this time is to find techniques that exploit opportunities for parallelism in the attribution process and allow attribution to be performed on multiprocessor systems. Such techniques would permit attribute grammars to serve as a rigorous foundation for the development of parallel compilation systems and other parallel applications. We present several methods for the parallel attribution of trees derived from l-ordered attribute grammars. These methods take advantage of parallelism implicit in the attribution process and, thus, do not require any special considerations to be taken when constructing grammars. Methods appropriate for use on tightly - and loosely-coupled multiprocessor architectures and for use when complete and incremental tree attribution are required are presented. We present preliminary performance results obtained from implementations of some of the methods on a simple shared-memory multiprocessor simulator embedded within an attribute grammar-based editor generator system. The results suggest that the methods may provide useful reductions in attribution time in some cases.
BibTeX:
@phdthesis{Zaring90,
  author = {Alan K. Zaring},
  title = {Parallel Evaluation in Attribute Grammar-based Systems},
  school = {Department of Comp. Sc., Cornell University},
  year = {1990},
  number = {Technical Report 90-1149},
  url = {http://cs-tr.cs.cornell.edu:80/Dienst/UI/2.0/Describe/ncstrl.cornell%2fTR90-1149}
}
Zylberman, C. (1990), "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". Telecom Paris, 1990.
BibTeX:
@techreport{Zylberman90,
  author = {Catherine Zylberman},
  title = {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},
  year = {1990}
}
Adams, S.R. (1991), "Modular Grammar for Programming Language Prototyping". School: Southampton University.
BibTeX:
@phdthesis{Adams91,
  author = {Stephen R. Adams},
  title = {Modular Grammar for Programming Language Prototyping},
  school = {Southampton University},
  year = {1991}
}
op den Akker, R. & Sluiman, E. (1991), "Linear Data Structures for Storage Allocation in Attribute Evaluators". Twente University, Technical Report INF--91--14, March, 1991.
BibTeX:
@techreport{Akker91,
  author = {Rieks op den Akker and Erik Sluiman},
  title = {Linear Data Structures for Storage Allocation in Attribute Evaluators},
  year = {1991},
  number = {INF--91--14}
}
op den Akker, R. & Sluiman, E. (1991), "Storage Allocation for Attribute Evaluators Using Stack and Queues", In Attribute Grammars, Applications and Systems. New York--Heidelberg--Berlin, June, 1991. Vol. 545, pp. 140-150. Springer-Verlag.
BibTeX:
@incollection{Akker91a,
  author = {Rieks op den Akker and Erik Sluiman},
  title = {Storage Allocation for Attribute Evaluators Using Stack and Queues},
  booktitle = {Attribute Grammars, Applications and Systems},
  publisher = {Springer-Verlag},
  year = {1991},
  volume = {545},
  pages = {140--150},
  note = {Prague}
}
op den Akker, R., Melichar, B. & Tarhio, J. (1991), "Attribute Evaluation and Parsing", In Attribute Grammars, Applications and Systems. New York--Heidelberg--Berlin, June, 1991. Vol. 545, pp. 187-214. Springer-Verlag.
BibTeX:
@incollection{Akker91b,
  author = {Rieks op den Akker and Borivoj Melichar and Jorma Tarhio},
  title = {Attribute Evaluation and Parsing},
  booktitle = {Attribute Grammars, Applications and Systems},
  publisher = {Springer-Verlag},
  year = {1991},
  volume = {545},
  pages = {187--214},
  note = {Prague}
}
(1991), "Attribute Grammars, Applications and Systems" New York--Heidelberg--Berlin, June, 1991. Vol. 545 Springer-Verlag.
BibTeX:
@book{Alblas91,,
  title = {Attribute Grammars, Applications and Systems},
  publisher = {Springer-Verlag},
  year = {1991},
  volume = {545},
  note = {Prague}
}
Alblas, H. (1991), "Introduction to Attribute Grammars", In Attribute Grammars, Applications and Systems. New York--Heidelberg--Berlin, June, 1991. Vol. 545, pp. 1-15. Springer-Verlag.
BibTeX:
@incollection{Alblas91a,
  author = {Henk Alblas},
  title = {Introduction to Attribute Grammars},
  booktitle = {Attribute Grammars, Applications and Systems},
  publisher = {Springer-Verlag},
  year = {1991},
  volume = {545},
  pages = {1--15},
  note = {Prague}
}
Alblas, H. (1991), "Incremental Attribute Evaluation", In Attribute Grammars, Applications and Systems. New York--Heidelberg--Berlin, June, 1991. Vol. 545, pp. 215-233. Springer-Verlag.
Abstract: Transformations of attributed derivation trees are considered. A tree transformation may invalidate attribute instances, not only in the restructured part of the tree, but also elsewhere in the tree. To make the attribution of the tree correct again requires a reevaluator. For some evaluation strategies, reevaluators are defined that work optimally in the number of visits to tree nodes and the number of recomputations. To remove the restriction that every transformation of an attributed derivation tree should immediately be followed by a reevaluation of the tree, criteria are formulated that permit a delay in calling the reevaluator. These criteria allow a strategy of repeatedly applying alternate attribute-evaluation and tree-transformation phases. An attribute-evaluation phase consists of a tree walk in which all attributes receive their correct values. A tree-transformation phase consist of a tree walk in which as many tree transformations are performed as possible. The transformation phase is never interrupted to carry out reevaluation. Finally, the optimal-incremental strategy is applied to the case where there has been a delay in activating the reevaluator.
BibTeX:
@incollection{Alblas91c,
  author = {Henk Alblas},
  title = {Incremental Attribute Evaluation},
  booktitle = {Attribute Grammars, Applications and Systems},
  publisher = {Springer-Verlag},
  year = {1991},
  volume = {545},
  pages = {215--233},
  note = {Prague}
}
Dulz, W. & Hofmann, S. (1991), "Grammar-based Workload Modeling of Communication Systems", In Modeling Techniques and Tools for Computer Performance Evaluation. Turin.
Abstract: Profound results in the performance evaluation of communication systems can only be achieved if an abstract model of the system as well as the system's workload is given. Most techniques for workload characterization of communication systems either use stochastic descriptions based on characteristic performance parameters or represent the workload demands by deterministic sequences of service primitives. In this paper we present a new approach to describe workload models by means of attributed grammars: productions specify the syntax of protocol data units whereas attribute functions, as part of semantic rules, formalize the influence of characteristic workload parameters, such as packet length, interarrival times or timeouts. Proceeding from this basic model we built a grammatical inference system for automated construction of proper attributed grammars and a syntax-driven workload generator which can easily be adjusted to any performance modeling environment running under the UNIX operating system. We also show how attributed grammers can be used to emulate other workload characterizing techniques, i.e. compound poisson arrivals and train models.
BibTeX:
@inproceedings{Dulz91,
  author = {Winfried Dulz and Stefan Hofmann},
  title = {Grammar-based Workload Modeling of Communication Systems},
  booktitle = {Modeling Techniques and Tools for Computer Performance Evaluation},
  year = {1991},
  url = {http: //www7.informatik.uni-erlangen.de/ulz/own/own-papers/Grammar-based-Woarkload-Modeling/paper.html}
}
Fokkinga, M.M., Jeuring, J., Meertens, L. & Meijer, E. (1991), "A translation from attribute grammars to catamorphisms", The Squiggolist. Vol. 2(1), pp. 20-26.
BibTeX:
@article{Fokkinga91,
  author = {M. M. Fokkinga and J. Jeuring and L. Meertens and E. Meijer},
  title = {A translation from attribute grammars to catamorphisms},
  journal = {The Squiggolist},
  year = {1991},
  volume = {2},
  number = {1},
  pages = {20--26}
}
Forbig, P. (1991), "Using the Generative Aspect of Attribute Grammars in a Knowledge Based Way", In Attribute Grammars, Applications and Systems. New York--Heidelberg--Berlin, June, 1991. Vol. 545, pp. 438-459. Springer-Verlag.
Abstract: The principles of the program generation environment FLR, which has been implemented at our department, are described. The system supports the reuse of already developed specifications of various kinds and was motivated by the idea whose the source text of already running programs again. This knowledge of parts of programs or documents, which were specified already, is stored as attributed grammar rules in a database. New documented can be composed in an interactive way using this database. It is demonstrated to use [sic] FLR to generate programs and Attribute Grammars.
BibTeX:
@incollection{Forbig91,
  author = {Peter Forbig},
  title = {Using the Generative Aspect of Attribute Grammars in a Knowledge Based Way},
  booktitle = {Attribute Grammars, Applications and Systems},
  publisher = {Springer-Verlag},
  year = {1991},
  volume = {545},
  pages = {438--459},
  note = {Prague}
}
Baum, B. & Forbig, P. (1991), "The System FLR (Fast Laboratory for Recomposition)", In Programming Language Implementation and Logic Programming (PLILP '91). Volume 528, pp. 427-428.
BibTeX:
@inproceedings{Forbig91a,
  author = {Beate Baum and Peter Forbig},
  title = {The System FLR (Fast Laboratory for Recomposition)},
  booktitle = {Programming Language Implementation and Logic Programming (PLILP '91)},
  year = {1991},
  volume = {528},
  pages = {427--428},
  note = {system demonstration}
}
Franchi-Zannettacci, P. & Jourdan, M. (1991), "Conception des environnements de programmation, première partie: Attribute Grammars", In Actes de l'École Jeunes Chercheurs du GRECO de Programmation. Sophia-Antipolis, April, 1991. , pp. 71.
BibTeX:
@incollection{Franchi-Zannet91,
  author = {Paul Franchi-Zannettacci and Martin Jourdan},
  title = {Conception des environnements de programmation, première partie: Attribute Grammars},
  booktitle = {Actes de l'École Jeunes Chercheurs du GRECO de Programmation},
  year = {1991},
  pages = {71},
  note = {english}
}
Gyimóthy, T. (1991), "Natural Languages Interface Construction Using Attribute Grammars", In Attribute Grammars, Applications and Systems. New York--Heidelberg--Berlin, June, 1991. Vol. 545, pp. 460-468. Springer-Verlag.
Abstract: Natural language interfaces represent one of the most common applications of natural language processing. In the eighties, not only a considerable increase in natural language interface refinement has been achieved, but also methods for design and evaluation have been worked out. One might think that a natural language interface of the nineties would be properly described in terms of three parameters, viz. itemize item transportability item modifiability by the user item generality itemize We have implemented a software package for plane geometry constructions called THALESTHALES is a product of Cogito Co., Ltd, Hungary supplied with a natural language interface. Our experience with THALES shows that none of these features is attainable in the near future. Rather, natural language interfaces based on well-defined subsets of languages and supplemented with possibly full semantics appear to be real candidates for applications in the following years.
BibTeX:
@incollection{Gyimothy91,
  author = {Tibor Gyimóthy},
  title = {Natural Languages Interface Construction Using Attribute Grammars},
  booktitle = {Attribute Grammars, Applications and Systems},
  publisher = {Springer-Verlag},
  year = {1991},
  volume = {545},
  pages = {460--468},
  note = {Prague}
}
Hedin, Gö. (1991), "Incremental Static-Semantics Analysis for Object-Oriented Languages Using Door Attribute Grammars", In Attribute Grammars, Applications and Systems. New York--Heidelberg--Berlin, June, 1991. Vol. 545, pp. 374-379. Springer-Verlag.
BibTeX:
@incollection{Hedin91,
  author = {Görel Hedin},
  title = {Incremental Static-Semantics Analysis for Object-Oriented Languages Using Door Attribute Grammars},
  booktitle = {Attribute Grammars, Applications and Systems},
  publisher = {Springer-Verlag},
  year = {1991},
  volume = {545},
  pages = {374--379},
  note = {Prague}
}
Hohenstein, U. & Engels, G. (1991), "SQL/EER - Syntax and Semantics of an Entity-Relationship-Based Query Language". Technischen Universität Braunschweig, 1991.
Abstract: This paper presents the high-level query language SQL/EER for an extended Entity- Relationship model (EER model). SQL/EER directly supports all the concepts of the EER model and takes into account well-known features that are integral part of contemporary query languages, e.g., arithmetic and aggregate functions. In contrast to usual descriptions of query languages, we give SQL/EER a complete formal specification of syntax and semantics. The syntax is defined by using an attribute grammar which fixes the context-free structure and the context-sensitive rules. The operational semantics is defined by formally translating SQL/EER queries into queries of an existing, semantically well-defined calculus. This translation is also described by this attribute grammar. The query language SQL/EER is used in a database design environment. In this context, the formal specification of its syntax and the semantics has been used to implement a syntax-directed editor and a query interpreter for SQL/EER.
BibTeX:
@techreport{Hohenstein91,
  author = {U. Hohenstein and G. Engels},
  title = {SQL/EER - Syntax and Semantics of an Entity-Relationship-Based Query Language},
  year = {1991}
}
Isakowitz, T. (1991), "Can we transform Logic Programs into Attribute Grammars?", Journal of Theoretical Informatics and Application. Vol. 25(6), pp. 499-543.
BibTeX:
@article{Isakowitz91,
  author = {Tomás Isakowitz},
  title = {Can we transform Logic Programs into Attribute Grammars?},
  journal = {Journal of Theoretical Informatics and Application},
  year = {1991},
  volume = {25},
  number = {6},
  pages = {499--543}
}
Jourdan, M. & Parigot, D. (1991), "Internals and Externals of the FNC-2 Attribute Grammar System", In Attribute Evaluation Methods. New York--Heidelberg--Berlin. June 1991. Volume 545, pp. 485-504. Springer-Verlag.
Abstract: FNC-2 is a modern attribute grammar processing system aiming at expressive power, efficiency, ease of use and versatility. This paper provides the reader with a brief tour inside FNC-2, presenting the most important features of its ``engine'': efficient sequential exhaustive, parallel exhaustive and sequential incremental evaluation of strongly non-circular AGs. These methods are based on the visit-sequence paradigm; the first one makes use of extensive space optimizations. Then we describe the external features of the system---attribute coupled grammar view of an AG, specially-designed AG-description language, with provisions for true modularity, and complete environment---that make it really usable for developing large-scale applications. Experience with the system is briefly reported.
BibTeX:
@inproceedings{Jourdan91a,
  author = {Martin Jourdan and Didier Parigot},
  title = {Internals and Externals of the FNC-2 Attribute Grammar System},
  booktitle = {Attribute Evaluation Methods},
  publisher = {Springer-Verlag},
  year = {1991},
  volume = {545},
  pages = {485--504},
  note = {scriptsize http://www-sop.inria.fr/members/Didier.Parigot/publications/fnc2-t.ps.gz},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/fnc2-t.ps.gz}
}
Jouve, J.-P. (1991), "Réalisation du décompilateur d'arbres attribués du système FNC-2: ppat". École Polytechnique, 1991.
BibTeX:
@techreport{Jouve90,
  author = {Jean-Philippe Jouve},
  title = {Réalisation du décompilateur d'arbres attribués du système FNC-2: ppat},
  year = {1991},
  note = {scriptsize http://www-sop.inria.fr/members/Didier.Parigot/publications/Rapport/ppat.ps.gz},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/Rapport/ppat.ps.gz}
}
Kastens, U. (1991), "Implementation of Visit-Oriented Attribute Evaluators", In Attribute Grammars, Applications and Systems. New York--Heidelberg--Berlin, June, 1991. Vol. 545, pp. 114-139. Springer-Verlag.
BibTeX:
@incollection{Kastens91a,
  author = {Uwe Kastens},
  title = {Implementation of Visit-Oriented Attribute Evaluators},
  booktitle = {Attribute Grammars, Applications and Systems},
  publisher = {Springer-Verlag},
  year = {1991},
  volume = {545},
  pages = {114--139},
  note = {Prague}
}
Kastens, U. (1991), "Attribute Grammars in a Compiler Construction Environment", In Attribute Grammars, Applications and Systems. New York--Heidelberg--Berlin, June, 1991. Vol. 545, pp. 380-400. Springer-Verlag.
Abstract: Attribute Grammar (AG) specifications are implemented by attribute evaluators which perform computations on tree structures as specified. An AT system should concentrate on generating that implementation. In compiler construction the attribute evaluator has to be combined with other modules, like scanner, parser, tree construction, data bases, and translation modules. Those are generated by other compiler tools, taken from library, or implemented for the specific application. These components have to fit together properly on the specification level as well as on the level of module interfaces. In this paper those relationships are demonstrated using the LIGA system within the compiler construction environment Eli as an example.
BibTeX:
@incollection{Kastens91b,
  author = {Uwe Kastens},
  title = {Attribute Grammars in a Compiler Construction Environment},
  booktitle = {Attribute Grammars, Applications and Systems},
  publisher = {Springer-Verlag},
  year = {1991},
  volume = {545},
  pages = {380--400},
  note = {Prague}
}
Keller, W. (1991), "Automated Generation of Code Using Backtracking Parsers for Attribute Grammars", ACM SIGPLAN Notices., February, 1991. Vol. 26(2), pp. 109-117.
BibTeX:
@article{Keller91,
  author = {Wolfgang Keller},
  title = {Automated Generation of Code Using Backtracking Parsers for Attribute Grammars},
  journal = {ACM SIGPLAN Notices},
  year = {1991},
  volume = {26},
  number = {2},
  pages = {109--117}
}
Koskimies, K. & Paakki, J. (1991), "High-level Tools for Language Implementation", J. of Systems and Software., May, 1991. Vol. 15(2), pp. 115-132.
BibTeX:
@article{Koskimies91,
  author = {Kai Koskimies and Jukka Paakki},
  title = {High-level Tools for Language Implementation},
  journal = {J. of Systems and Software},
  year = {1991},
  volume = {15},
  number = {2},
  pages = {115--132}
}
Koskimies, K. (1991), "Object-Orientation in Attribute Grammars", In Attribute Grammars, Applications and Systems. New York--Heidelberg--Berlin, June, 1991. Vol. 545, pp. 297-329. Springer-Verlag.
Abstract: Object-orientation is a language design and programming paradigm aiming at better structuring, reusing, and maintaining properties of software. This paradigm has been successfully combined with conventional programming languages, as well as functional and logic programming languages; it seems obvious that object-orientation has come to stay. Recently, some suggestions to extend the attribute grammar formalism with features supporting object-orientation have been proposed. These proposals are reviewed, and the approach taken in the TOOLS system is described and motivated. It is demonstrated that object-orientation contributes to the uniformity and applicability of attribute grammar descriptions.
BibTeX:
@incollection{Koskimies91a,
  author = {Kai Koskimies},
  title = {Object-Orientation in Attribute Grammars},
  booktitle = {Attribute Grammars, Applications and Systems},
  publisher = {Springer-Verlag},
  year = {1991},
  volume = {545},
  pages = {297--329},
  note = {Prague}
}
Koskimies, K. (1991), "Object-orientation in attribute grammars". Department of Computer Science, University of Tampere, Technical Report A-1991-1, 1991.
BibTeX:
@techreport{Koskimies91b,
  author = {Kai Koskimies},
  title = {Object-orientation in attribute grammars},
  year = {1991},
  number = {A-1991-1},
  note = {available as a paper copy only}
}
Koster, K. (1991), "Affix Grammars for Programming Languages", In Attribute Grammars, Applications and Systems. New York--Heidelberg--Berlin, June, 1991. Vol. 545, pp. 358-373. Springer-Verlag.
Abstract: Affix Grammars are members of the family of Two-Level Grammars, along with W-grammars, Metamorphosis Grammars and Attribute Grammars. In this tutorial we shall be concerned with the nature and rationale of Affix Grammars and their application in describing programming languages. Some parsing and affix evaluation methods for deterministic and nondeterministic Affix Grammars are discussed. By means of an example, a comparison is made with W-grammars and Attribute Grammars.
BibTeX:
@incollection{Koster91,
  author = {Kees Koster},
  title = {Affix Grammars for Programming Languages},
  booktitle = {Attribute Grammars, Applications and Systems},
  publisher = {Springer-Verlag},
  year = {1991},
  volume = {545},
  pages = {358--373},
  note = {Prague}
}
Koster, K. (1991), "Affix Grammars for Natural Languages", In Attribute Grammars, Applications and Systems. New York--Heidelberg--Berlin, June, 1991. Vol. 545, pp. 469-484. Springer-Verlag.
Abstract: Attribute Grammars over a Finite Lattice (AGFLs), a simple form of two-level grammar admitting quite efficient implementations, are proposed as a formalism to express the syntax of natural languages. In this paper the concepts and notation of AGFLs are described. A brief example is given of their use in describing a fragment of the English language, followed by a discussion of issues like parsing and ambiguity.
BibTeX:
@incollection{Koster91a,
  author = {Kees Koster},
  title = {Affix Grammars for Natural Languages},
  booktitle = {Attribute Grammars, Applications and Systems},
  publisher = {Springer-Verlag},
  year = {1991},
  volume = {545},
  pages = {469--484},
  note = {Prague}
}
Lämmel, R. (1991), "The Translator Writing System RUEGEN-KS", In Attribute Grammars, Applications and Systems. New York--Heidelberg--Berlin, June, 1991. Vol. 545, pp. 508-513. Springer-Verlag.
BibTeX:
@incollection{Lammel91,
  author = {Ralf Lämmel},
  title = {The Translator Writing System RUEGEN-KS},
  booktitle = {Attribute Grammars, Applications and Systems},
  publisher = {Springer-Verlag},
  year = {1991},
  volume = {545},
  pages = {508--513},
  note = {Prague}
}
Lipps, P., Möncke, U. & Wilhelm, R. (1991), "An Overview of the OPTRAN System", In Attribute Grammars, Applications and Systems. New York--Heidelberg--Berlin, June, 1991. Vol. 545, pp. 505-506. Springer-Verlag.
BibTeX:
@incollection{Lipps91,
  author = {Peter Lipps and Ulrich Möncke and Reinhard Wilhelm},
  title = {An Overview of the OPTRAN System},
  booktitle = {Attribute Grammars, Applications and Systems},
  publisher = {Springer-Verlag},
  year = {1991},
  volume = {545},
  pages = {505--506},
  note = {Prague}
}
Maluszyński, J. (1991), "Attribute Grammars and Logic Programs: a Comparison of Concepts", In Attribute Grammars, Applications and Systems. New York--Heidelberg--Berlin, June, 1991. Vol. 545, pp. 330-357. Springer-Verlag.
Abstract: The paper presents a unified view of attribute grammars and definite logic programs that allows for comparison of concepts and techniques used in both fields. A common basic notion of both formalisms is that of labelled tree. The semantics of attribute grammars can be defined in terms of decorated parse trees while the semantics of logic programs can be defined in terms of proof trees. The comparison of concepts shows that attribute grammars have several features not present in definite logic programs. These are: the concept of the language derived, many-sorted types, the notion of dependency relation and the notion of semantic domain with the semantic functions. After having identified these differences we mention some extensions proposed to the field of logic programming, which essentially amount to enriching definite programs with these features. The conclusions of this discussion is that a possible common denominator for logic programs and attribute grammars is the concept of constraint logic program. As a justification of this comparative study the paper gives references to the results obtained by transfer of methods between attribute grammars and logic programs.
BibTeX:
@incollection{Maluszynski91,
  author = {Jan Maluszyński},
  title = {Attribute Grammars and Logic Programs: a Comparison of Concepts},
  booktitle = {Attribute Grammars, Applications and Systems},
  publisher = {Springer-Verlag},
  year = {1991},
  volume = {545},
  pages = {330--357},
  note = {Prague}
}
McNamee, C.M. & Olsson, R.A. (1991), "An Attribute Grammar Approach to Compiler Optimization of IntraModule Interprocess Communication", International Journal of Parallel Programming., June, 1991. Vol. 20(3), pp. 181-202.
BibTeX:
@article{McNamee91,
  author = {Carole M. McNamee and Ronald A. Olsson},
  title = {An Attribute Grammar Approach to Compiler Optimization of IntraModule Interprocess Communication},
  journal = {International Journal of Parallel Programming},
  year = {1991},
  volume = {20},
  number = {3},
  pages = {181--202}
}
Micallef, J. (1991), "Incremental attribute evaluation for multi-user semantics-based editors". School: Computer Science, Columbia University. (CUCS-023-91)
Abstract: This thesis addresses two fundamental problems associated with performing incremental attribute evaluation in multi-user editors based on the attribute grammar formalism: (1) multiple asynchronous modifications of the attributed derivation tree, and (2) segmentation of the tree into separate modular units. Solutions to these problems make it possible to construct semantics-based editors for use by teams of programmers developing or maintaining large software systems. Multi-user semantics-based editors improve software productivity by reducing communication costs and snafus. The objectives of an incremental attribute evaluation algorithm for multiple asynchronous changes are that (a) all attributes of the derivation tree have correct values when evaluation terminates, and (b) the cost of evaluating attributes necessary to reestablish a correctly attributed derivation tree is minimized. We present a family of algorithms that differ in how they balance the tradeoff between algorithm efficiency and expressiveness of the attribute grammar. This is important because multi-user editors seem a practical basis for many areas of computer-supported cooperative work, not just programming. Different application areas may have distinct definitions of efficiency, and may impose different requirements on the expressiveness of the attribute grammar. The characteristics of the application domain can then be used to select the most efficient strategy for each particular editor. To address the second problem, we define an extension of classical attribute grammars that allows the specification of interface consistency checking for programs composed of many modules. Classical attribute grammars can specify the static semantics of monolithic programs or modules, but not inter-module semantics; the latter was done in the past using @i[ad hoc] techniques. Extended attribute grammars support programming-in-the-large constructs found in real programming languages, including textual inclusion, multiple kinds of modular units and nested modular units. We discuss attribute evaluation in the context of programming-in-the-large, particularly the separation of concerns between the local evaluator for each modular unit and the global evaluator that propagates attribute flows across module boundaries. The result is a uniform approach to formal specification of both intra-module and inter-module static semantic properties, with the ability to use attribute evaluation algorithms to carry out a complete static semantic analysis of a multi-module program.
BibTeX:
@phdthesis{Micallef91,
  author = {Josephine Micallef},
  title = {Incremental attribute evaluation for multi-user semantics-based editors},
  school = {Computer Science, Columbia University},
  year = {1991},
  number = {CUCS-023-91}
}
Miloucheva, I. & Loeper, H. (1991), "Compiler structure engineering with attribute grammars", SIGPLAN Notices., October, 1991. Vol. 26(10), pp. 73-82.
BibTeX:
@article{miloucheva91,
  author = {I. Miloucheva and H. Loeper},
  title = {Compiler structure engineering with attribute grammars},
  journal = {SIGPLAN Notices},
  year = {1991},
  volume = {26},
  number = {10},
  pages = {73--82}
}
Möncke, U. & Wilhelm, R. (1991), "Grammar Flow Analysis", In Attribute Grammars, Applications and Systems. New York--Heidelberg--Berlin, June, 1991. Vol. 545, pp. 151-186. Springer-Verlag.
Abstract: This paper specifies the theoretical basis for the implementation of different generators of the OPTRAN system. Grammar Flow analysis uses the techniques of data flow analysis at the meta level of compiler construction. The analogue of the states in data flow analysis are the syntax trees together with some information that is associated with trees by propagation functions. One example is the association of characteristic graphs, another example is the association of sets of matching tree patterns.
BibTeX:
@incollection{Moncke91,
  author = {Ulrich Möncke and Reinhard Wilhelm},
  title = {Grammar Flow Analysis},
  booktitle = {Attribute Grammars, Applications and Systems},
  publisher = {Springer-Verlag},
  year = {1991},
  volume = {545},
  pages = {151--186},
  note = {Prague}
}
Paakki, J. (1991), "Paradigms for Attribute-grammar-based Language Implementation". School: Department of Comp. Sc., University of Helsinki., February, 1991. (report A-1991-1)
Abstract: Attribute grammars are a formalism for specifying and implementing programming languages. Methods and techniques are presented expressing attribute grammars themselves as a language. These methods are based on relating attribute grammars with programming paradigms. The presented formalisms are classified as structured, object-oriented, functional, logic, and concurrent attribute grammars. The characteristics of these attribute grammar paradigms are reviewed and analyzed. The central results of seven self-standing papers are summarized. These papers discuss empirically and theoretically the practical significance of relating the nonterminal concept of attribute grammars with the block concept of programming languages, the nonterminal concept with the class concept, and the attribute concept with the logical variable concept. Accordingly, structured, object-oriented, and logic attribute grammars are emphasized.
BibTeX:
@phdthesis{Paakki91,
  author = {Jukka Paakki},
  title = {Paradigms for Attribute-grammar-based Language Implementation},
  school = {Department of Comp. Sc., University of Helsinki},
  year = {1991},
  number = {report A--1991--1}
}
Paakki, J., Miloucheva, I. & Loeper, H. (1991), "Prolog in Practical Compiler Writing Compiler Structure Engineering with Attribute Grammars", The Computer Journal ACM SIGPLAN Notices., October, 1991. Vol. ? 26(2 10), pp. 73-82.
BibTeX:
@article{Paakki91a,
  author = {Jukka Paakki and Ilka Miloucheva and Hans Loeper},
  title = {Prolog in Practical Compiler Writing Compiler Structure Engineering with Attribute Grammars},
  journal = {The Computer Journal ACM SIGPLAN Notices},
  year = {1991},
  volume = {? 26},
  number = {2 10},
  pages = {73--82}
}
Paakki, J. (1991), "PROFIT: a System Integrating Logic Programming and Attribute Grammars", In Programming Language Implementation and Logic Programming (PLILP '93). Passau Germany. Volume 528, pp. 243-254. Springer-Verlag.
BibTeX:
@inproceedings{Paakki91b,
  author = {Jukka Paakki},
  title = {PROFIT: a System Integrating Logic Programming and Attribute Grammars},
  booktitle = {Programming Language Implementation and Logic Programming (PLILP '93)},
  publisher = {Springer-Verlag},
  year = {1991},
  volume = {528},
  pages = {243--254}
}
Papakonstantinou, G., Tsanakas, P., Stafylopatis, A. & Kollias, S. (1991), "The transputer implementation of a parallel attribute grammar evaluator", In ESPRIT/Parallel Computing Action, Workshop III. Bonn Germany.
BibTeX:
@inproceedings{PapTsaStaKol91,
  author = {G. Papakonstantinou and P. Tsanakas and A. Stafylopatis and S. Kollias},
  title = {The transputer implementation of a parallel attribute grammar evaluator},
  booktitle = {ESPRIT/Parallel Computing Action, Workshop III},
  year = {1991}
}
Pittman, T. & Peters, J. (1991), "The Art of Compiler Design" Englewood Cliffs, NJ, November, 1991. Prentice-Hall.
Abstract: The advertising notice reads: ``More emphasis on the attribute grammar approach than any book on the market.''
BibTeX:
@book{Pittman91,
  author = {Thomas Pittman and James Peters},
  title = {The Art of Compiler Design},
  publisher = {Prentice-Hall},
  year = {1991}
}
Riedewald, Gü. (1991), "Prototyping by Using an Attribute Grammar as a Logic Program", In Attribute Grammars, Applications and Systems. New York--Heidelberg--Berlin, June, 1991. Vol. 545, pp. 401-437. Springer-Verlag.
Abstract: The problem of prototyping software and languages by attribute grammars is considered. The applied attribute grammars -- Grammars of Syntactical Functions (GSF) -- are very closely related to logical programs. Therefore, prototyping exploiting PROLOG systems is suggested.
BibTeX:
@incollection{Riedewald91,
  author = {Günter Riedewald},
  title = {Prototyping by Using an Attribute Grammar as a Logic Program},
  booktitle = {Attribute Grammars, Applications and Systems},
  publisher = {Springer-Verlag},
  year = {1991},
  volume = {545},
  pages = {401--437},
  note = {Prague}
}
Rosendahl, M. (1991), "Abstract Interpretation and Attribute Grammars". School: Cambridge University.
Abstract: The thesis explores the connection between attribute grammars and abstract interpretation as frameworks in program analysis. It is shown how methods from abstract interpretation can be used for proving the correctness of attribute grammars and how attribute grammars can be used to implement abstract interpretations
BibTeX:
@phdthesis{Rosendahl91,
  author = {Mads Rosendahl},
  title = {Abstract Interpretation and Attribute Grammars},
  school = {Cambridge University},
  year = {1991}
}
Swierstra, S.D. & Vogt, H.H. (1991), "Higher Order Attribute Grammars", In Attribute Grammars, Applications and Systems. New York--Heidelberg--Berlin. June 1991. Volume 545, pp. 256-296. Springer-Verlag.
Abstract: Higher Order Attribute Grammars (HAGs) are an extension of normal attribute grammars in the sense that the distinction between the domain of parse-trees and the domain of attributes has disappeared: parse trees may be computed in attributes and grafted to the parse tree at various places. As a result semantic functions may be described by attribute evaluation. We will present the basic definition for HAGs, and compare them with attribute coupled grammars, extended affix grammars and functional programming languages. We will indicate how multi-pass compilers and a compiler for supercombinators can be described this way. It will be shown that, especially in the case of incremental evaluation, the conventional execution model has to be generalised. Such a model, based on function caching, hash-consing and combinator construction will be discussed. This model encompasses many of the more ad-hoc optimisations one finds in standard implementations of normal attribute grammars.
BibTeX:
@inproceedings{Swierstra91,
  author = {S. Doaitse Swierstra and Harald H. Vogt},
  title = {Higher Order Attribute Grammars},
  booktitle = {Attribute Grammars, Applications and Systems},
  publisher = {Springer-Verlag},
  year = {1991},
  volume = {545},
  pages = {256--296}
}
Wilhelm, R. (1991), "Attribute Reevaluation in OPTRAN", In Attribute Grammars, Applications and Systems. New York--Heidelberg--Berlin, June, 1991. Vol. 545, pp. 507. Springer-Verlag.
BibTeX:
@incollection{Wilhelm91,
  author = {Reinhard Wilhelm},
  title = {Attribute Reevaluation in OPTRAN},
  booktitle = {Attribute Grammars, Applications and Systems},
  publisher = {Springer-Verlag},
  year = {1991},
  volume = {545},
  pages = {507},
  note = {Prague}
}
Dimitriadis, Y.A. & end Cristina de la Maza, J.L.C. (1991), "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. Saint Malo, France. octobre 1991., pp. 885-893.
BibTeX:
@inproceedings{,
  author = {Yannis A. Dimitriadis and Juan Lopez Coronado end Cristina de la Maza},
  title = {A new interactive mathematical editor, using on-line handwritten symbol recognition, and error detection-correction with an attribute grammar},
  booktitle = {Proceedings of First International Conference on Document Analysis and Recognition},
  year = {1991},
  pages = {885--893}
}
Bazet, P. (1992), "Pattern-matching en priorité spécifique sur des types avec constructeurs commutatifs". Université de Paris~11, September, 1992.
BibTeX:
@techreport{Bazet92,
  author = {Philippe Bazet},
  title = {Pattern-matching en priorité spécifique sur des types avec constructeurs commutatifs},
  year = {1992}
}
Bischoff, K.M. (1992), "User Manual for Ox: An Attribute-Grammar Compiling System based on Yacc, Lex, and C". , Technical Report IASTATECS//TR92-30, December 1, 1992.
Abstract: User Manual for Ox: An Attribute Grammar Compiling System based on Yacc, Lex, and C by Kurt M. Bischoff TR92-30 Iowa State University December 1992 Ox generalizes the function of Yacc in the way that attribute grammars generalize context-free grammars. Ordinary Yacc and Lex specifications may be augmented with definitions of synthesized and inherited attributes written in C syntax. From these specifications, Ox generates a program that builds and decorates attributed parse trees. Ox accepts a most general class of attribute grammars. The user may specify postdecoration traversals for easy ordering of side effects such as code generation. Ox handles the tedious and error-prone details of writing code for parse-tree management, so its use eases problems of security and maintainability associated with that aspect of translator development. The translators generated by Ox use internal memory management that is often much faster than the common technique of calling malloc once for each parse-tree node. Ox is a Yacc/Lex/C preprocessor, and is designed to bring attribute grammars closer to the mainstream of Unix-based language development. Ox inherits all of the familiar syntax and semantics of Yacc, Lex, and C. It is relatively easy to convert programs between Ox code and "pure Yacc/Lex/C" code. Ox has been used to build a compiler for a small (eighty grammar rules) block-structured imperative programming language. This document is the main reference for using Ox.
BibTeX:
@techreport{Bischoff92,
  author = {Kurt M. Bischoff},
  title = {User Manual for Ox: An Attribute-Grammar Compiling System based on Yacc, Lex, and C},
  year = {1992},
  number = {IASTATECS//TR92-30}
}
Bischoff, K.M. (1992), "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.
BibTeX:
@techreport{Bischoff92a,
  author = {Kurt M. Bischoff},
  title = {Design, Implementation, Use, and Evaluation of Ox: An Attribute-Grammar Compiling System based on Yacc, Lex, and C},
  year = {1992},
  number = {IASTATECS//TR92-31}
}
Bouquart, J.-L. (1992), "Etude des rapports entre grammaires attribuées et programmation logique: application au test d'occurrence et à l'analyses statique". School: Orléans-LIFO.
BibTeX:
@phdthesis{Bouquart92,
  author = {Jean-Louis Bouquart},
  title = {Etude des rapports entre grammaires attribuées et programmation logique: application au test d'occurrence et à l'analyses statique},
  school = {Orléans-LIFO},
  year = {1992}
}
Carle, A. (1992), "Hierarchical Attribute Grammars: Language, Evaluation and Applications". School: Computer Science, Rice University.
BibTeX:
@phdthesis{Carle92,
  author = {Alan Carle},
  title = {Hierarchical Attribute Grammars: Language, Evaluation and Applications},
  school = {Computer Science, Rice University},
  year = {1992},
  url = {http://www.cs.rice.edu/arle/hierarchical.ps}
}
Chapman (1992), "On Extended Attribute Grammars", BEATCS: Bulletin of the European Association for Theoretical Computer Science. Vol. 46
BibTeX:
@article{Chapman92,
  author = {Chapman},
  title = {On Extended Attribute Grammars},
  journal = {BEATCS: Bulletin of the European Association for Theoretical Computer Science},
  year = {1992},
  volume = {46}
}
Cheng, H.D. & Cheng, X. (1992), "Attribute Grammar for Shape Recognition and Its VLSI Implementation", In International Conference on Pattern Recognition ICPR'92., pp. I:104-107.
BibTeX:
@inproceedings{Cheng92,
  author = {H. D. Cheng and X. Cheng},
  title = {Attribute Grammar for Shape Recognition and Its VLSI Implementation},
  booktitle = {International Conference on Pattern Recognition ICPR'92},
  year = {1992},
  pages = {I:104--107}
}
Cohen, R.F. (1992), "Combine and Conquer". Department of Computer Science, Brown University, Technical Report CS-92-45, October, 1992.
Abstract: The development of dynamic algorithms and data structures is a challenging area of research that has received much attention in the last years. For example, generalized techniques have been developed to dynamize large classes of geometric algorithms. In the area of graph algorithms such techniques are lacking. The goal of this thesis is to demonstrate generalized techniques to maintain the solutions of dynamic algorithms for graph problems, and to present dynamic algorithms based on our techniques. We provide a framework, called tree attribute system, for maintaining the values of attributes on trees in a fully-dynamic environment. Our technique extends and generalizes the dynamic trees of Sleator and Tarjan and the decomposable search problems of Overmars. We use this technique to show two new dynamic data structures, linear expression tree and linear attribute grammar, for maintaining the solutions to tree-based expressions. These data structures are used to present fully-dynamic algorithms for a large class of problems on tree-width-two graphs, a class of graphs which include trees and series-parallel graphs. Additionally, we present a framework for the dynamic drawing of planar graphs, and demonstrate a number of fully-dynamic algorithms to draw trees, series-parallel graphs, planar $st$-graphs, and general planar graphs.
BibTeX:
@techreport{Cohen92,
  author = {Robert F. Cohen},
  title = {Combine and Conquer},
  year = {1992},
  number = {CS-92-45},
  note = {Sun, 13 Jul 1997 18:30:16 GMT},
  url = {ftp://ftp.cs.brown.edu/pub/techreports/92/cs92-45.ps.Z}
}
Delest, M.P. & Fedou, J.M. (1992), "Attribute grammars are useful for combinatorics", Theoretical Computer Science., May, 1992. Vol. 98(1), pp. 65-76.
BibTeX:
@article{Delest92,
  author = {M. P. Delest and J. M. Fedou},
  title = {Attribute grammars are useful for combinatorics},
  journal = {Theoretical Computer Science},
  year = {1992},
  volume = {98},
  number = {1},
  pages = {65--76}
}
Engelfriet, J. & Heyker, L. (1992), "Context-Free Hypergraph Grammars Have the Same Term-Generating Power as Attribute Grammars", Acta Informatica. Vol. 29, pp. 161-210.
BibTeX:
@article{Engelfriet92,
  author = {Joost Engelfriet and Linda Heyker},
  title = {Context-Free Hypergraph Grammars Have the Same Term-Generating Power as Attribute Grammars},
  journal = {Acta Informatica},
  year = {1992},
  volume = {29},
  pages = {161--210}
}
Farnum, C. (1992), "Pattern-Based Tree Attribution", In Conference Record of the 19th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. Albuquerque, New Mexico. January 19--22 1992., pp. 211-222.
Abstract: Attribute grammars have been used for many language-oriented tasks, including the formal description of semantics and the implementation of compilation tasks from simple type checking through code generation. Despite their successful use, attribute grammars have some disadvantages, including the monolithic nature of the grammar and the fixed factoring of all attribute descriptions by a single set of grammar productions. Attribute pattern sets provide a more expressive attribution system by using pattern matching, instead of grammar productions, to perform case analysis. Attribute pattern sets can be implemented in terms of attribute grammars in a way that maintains the dependency structure of the attribute system, making it straightforward to convert many of the practical results from attribute grammar theory to similar results for attribute pattern sets
BibTeX:
@inproceedings{Farnum92,
  author = {Charles Farnum},
  title = {Pattern-Based Tree Attribution},
  booktitle = {Conference Record of the 19th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages},
  year = {1992},
  pages = {211--222}
}
Farrow, R., Marlowe, T.J. & Yellin, D.M. (1992), "Composable Attribute Grammars: Support for Modularity in Translator Design and Implementation", In 19th ACM Symp. on Principles of Programming Languages. Albuquerque, NM. January 1992., pp. 223-234. ACM press.
Abstract: This paper introduces composable attribute grammars (CAGs), a formalism that extends classical attribute grammars to allow for the modular composition of translation specifications and of translators. CAGs bring to complex translator-writing systems the same benefits of modularity found in modern programming languages, including comprehensibility, reusability, and incremental meta-compilation. After introducing CAGs by way of an example, we provide a formal definition of CAGs and their semantics. We describe a subclass of CAGs, called separable CAGs, that have favorable implementation properties. We discuss the novel aspects of CAGs, compare them to other proposals for inserting modularity into attribute grammars, and relate our experience using CAGs in the Linguist translator-writing system. (27 Refs.)
BibTeX:
@inproceedings{Farrow92,
  author = {Rodney Farrow and Thomas J. Marlowe and Daniel M. Yellin},
  title = {Composable Attribute Grammars: Support for Modularity in Translator Design and Implementation},
  booktitle = {19th ACM Symp. on Principles of Programming Languages},
  publisher = {ACM press},
  year = {1992},
  pages = {223--234}
}
Gray, R.W., Heuring, V.P., Levi, S.P. & Sloane, A.M. (1992), "Eli: A Complete, Flexible Compiler Construction System", Communications of the ACM., Februar, 1992. Vol. 35(2), pp. 121-131.
BibTeX:
@article{Gray92,
  author = {R. W. Gray and V. P. Heuring and S. P. Levi and A. M. Sloane},
  title = {Eli: A Complete, Flexible Compiler Construction System},
  journal = {Communications of the ACM},
  year = {1992},
  volume = {35},
  number = {2},
  pages = {121--131}
}
Groller, E. (1992), "Fractals and solid modeling", Computer Graphics Forum., ????, 1992. Vol. 11(3), pp. C415-C424, C484-C485.
BibTeX:
@article{Groller92,
  author = {E. Groller},
  title = {Fractals and solid modeling},
  journal = {Computer Graphics Forum},
  year = {1992},
  volume = {11},
  number = {3},
  pages = {C415--C424, C484--C485}
}
Groller, E. (1992), "Fractals and solid modeling". September 1992. Volume 11(3), pp. 415-424.
BibTeX:
@inproceedings{Groller92a,
  author = {Eduard Groller},
  title = {Fractals and solid modeling},
  journal = {Computer Graphics Forum (EUROGRAPHICS '92 Proceedings)},
  year = {1992},
  volume = {11},
  number = {3},
  pages = {415--424}
}
Grosch, J. (1992), "Multiple Inheritance in Object-Oriented Attribute Grammars". GMD, Karlsruhe University, Technical Report 28, 1992.
BibTeX:
@techreport{Grosch92,
  author = {Josef Grosch},
  title = {Multiple Inheritance in Object-Oriented Attribute Grammars},
  year = {1992},
  number = {28}
}
Grönfors, T. (1992), "Peak Identification of Auditory Brainstem Responses with Multifilters and Attributed Automaton". University of Turku, Technical Report R-92-4, 1992.
Abstract: An attributed automaton, a special case of attribute grammar, is a flexible tool in pattern recognition. It allows the utilization of contextual information from previously analyzed patterns in the analysis of the current pattern, and offers the possibility of describing those structural characteristics of patterns which cannot be described by classic methods of syntactic pattern recognition. Auditory brainstem responses are routinely used in audiology and otoneurology. Many studies on using the spectral analysis of averaged auditory brainstem responses have described at least two frequency bands, corresponding to the slow fast components. Selective nonrecursive digital filters for each frequency band in the spectrum of the auditory brainstem response have revealed enhancement or attenuation of components, depending on the band. In this study, multifilters and an attributed automaton were combined for the identification peaks.
BibTeX:
@techreport{Grönfors92,
  author = {Tapio Grönfors},
  title = {Peak Identification of Auditory Brainstem Responses with Multifilters and Attributed Automaton},
  year = {1992},
  number = {R-92-4},
  url = {http://www.cs.utu.fi/reports/R-92-4.html}
}
Gyimóthy, T., Alexin, Z. & Szücs, R. (1992), "Integrated Graphic Environment to Develop Applications based on Attribute Grammars", In Proceedings of the Fourth International Conference on Compiler Construction CC'92. Volume 641, pp. 51-58.
BibTeX:
@inproceedings{Gyimóthy92,
  author = {T. Gyimóthy and Z. Alexin and R. Szücs},
  title = {Integrated Graphic Environment to Develop Applications based on Attribute Grammars},
  booktitle = {Proceedings of the Fourth International Conference on Compiler Construction CC'92},
  year = {1992},
  volume = {641},
  pages = {51--58}
}
Jacob, T. & Cahill, P. (1992), "Software Product Metrics as Attributes in an Attribute Grammar", In Proceedings of the Second International Conference on Software Quality. Research Triangle Park, NC. October 1992., pp. 40-49.
BibTeX:
@inproceedings{Jacob92,
  author = {T. Jacob and P. Cahill},
  title = {Software Product Metrics as Attributes in an Attribute Grammar},
  booktitle = {Proceedings of the Second International Conference on Software Quality},
  year = {1992},
  pages = {40--49}
}
Jourdan, M. (1992), "Des bienfaits de l'analyse statique sur la mise en œuvre des grammaires attribuées". School: Département de Mathématiques et d'Informatique, Université d'Orléans.
BibTeX:
@phdthesis{Jourdan92a,
  author = {Martin Jourdan},
  title = {Des bienfaits de l'analyse statique sur la mise en œuvre des grammaires attribuées},
  school = {Département de Mathématiques et d'Informatique, Université d'Orléans},
  year = {1992},
  note = {scriptsize http://www-sop.inria.fr/members/Didier.Parigot/publications/theses/habilit-martin.ps.gz},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/theses/habilit-martin.ps.gz}
}
Klaiber, A. & Gokhale, M. (1992), "Parallel evaluation of attribute grammars", IEEE Transactions on Parallel and Distributed Systems., March, 1992. Vol. 3(2), pp. 206-220.
BibTeX:
@article{Klaiber92,
  author = {Alexander Klaiber and Maya Gokhale},
  title = {Parallel evaluation of attribute grammars},
  journal = {IEEE Transactions on Parallel and Distributed Systems},
  year = {1992},
  volume = {3},
  number = {2},
  pages = {206--220}
}
Liang, Y.-M. (1992), "The Equational Logic Transformation System". School: Department of Computer Science Cornell University. Ithaca, New York, December, 1992.
BibTeX:
@mastersthesis{Liang92,
  author = {Yu-Min Liang},
  title = {The Equational Logic Transformation System},
  school = {Department of Computer Science Cornell University},
  year = {1992},
  note = {CS Masters of Engineering Project (CS MEng 445416)},
  url = {http://www.cs.cornell.edu/Info/People/aswin/Fun/liang.ps.Z}
}
Marti, R. & Murer, T. (1992), "Extensible Attribute Grammars". Swiss Federal Institute of Technology Zurick, December, 1992.
Abstract: This report introduces a new idea to make attribute grammars (AG) extensible. Both the context-free grammar and the attribution system of an AG may be extended. This concept is a valuable structuring technique when defining language-based programming environments or compilers. For instance, it allows passes of a multipass compiler to be decomposed into different grammar levels, which renders the definition much clearer. Another application consists of defining an interface for an external tool (browser) on an independent grammar level neatly separated from the actual language definition. The concept of extensible attribute grammars is first introduced using a formal model, and thereafter practical examples demonstrate possible applications.
BibTeX:
@techreport{Marti92,
  author = {R. Marti and T. Murer},
  title = {Extensible Attribute Grammars},
  year = {1992},
  url = {http://www.tik.ee.ethz.ch/Publications/TIK-Reports/TIK-Report6abstract.html}
}
Nishino, T. (1992), "Relating Attribute grammars and Lexical-Functional Grammars.", Information sciences.. Vol. 66(1/2), pp. 1.
BibTeX:
@article{Nishino:92,
  author = {Tetsuro Nishino},
  title = {Relating Attribute grammars and Lexical-Functional Grammars.},
  journal = {Information sciences.},
  year = {1992},
  volume = {66},
  number = {1/2},
  pages = {1}
}
Noll, T. & Vogler, H. (92), "Top-down Parsing with Simultaneous Evaluation on Noncircular Attribute Grammars". Aachen University of Technology, Technical Report 92-14, 92.
Abstract: This paper introduces a machinery called attributed top-down parsing automaton which performs top--down parsing of strings and, simultaneously, the evaluation of arbitrary noncircular attribute grammars. The strategy of the machinery is based on a single depth--first left--to--right traversal over the syntax tree. There is no need to traverse parts of the syntax tree more than once, and hence, the syntax tree itself does not have to be maintained. Attribute values are stored in a graph component, and values of attributes which are needed but not yet computed are represented by particular nodes. Values of attributes which refer to such uncomputed attributes are represented by trees over operation symbols in which pointers to the particular nodes at their leaves are maintained. Whenever eventually the needed attribute value is computed, it is glued into the graph at the appropriate nodes. [Note: In this PostScript version in some figures the edges are missing because they were added by hand afterwards. ]
BibTeX:
@techreport{Noll92,
  author = {Th. Noll and H. Vogler},
  title = {Top-down Parsing with Simultaneous Evaluation on Noncircular Attribute Grammars},
  year = {92},
  number = {92-14},
  url = {ftp://ftp.informatik.rwth-aachen.de/pub/reports/1992/92-14.ps.gz}
}
Papakonstantinou, G., Panayiotopoulos, T. & Dimitriou, G. (1992), "AGP: a parallel processor for knowledge and software engineering", The Computer Journal.
BibTeX:
@article{PapPanDim92,
  author = {G. Papakonstantinou and T. Panayiotopoulos and G. Dimitriou},
  title = {AGP: a parallel processor for knowledge and software engineering},
  journal = {The Computer Journal},
  year = {1992}
}
Pennings, M., Swierstra, D. & Vogt, H. (1992), "Using Cached Functions and Constructors for Incremental Attribute Evaluation", In Proceedings of the 4th International Symposium of Programming Language Implementation and Logic Programming, Leuven, BE: PLILP '92. Berlin, DE., pp. 130-144. Springer-Verlag.
Abstract: A technique is presented for the efficient incremental evaluation of attribute grammars. Through its generality, the applied approach may be affective too in the evaluation of higher order attribute grammars. The authors' approach is an extension of a simpler algorithm for incremental evaluation, where functions, corresponding to visit sequences, are cached. Consequently, attributes are either found in the cache or they are recomputed, so there is no longer need to represent the attributed tree explicitly. One may share common subtrees, avoiding repeated attribute evaluation, thus solving a typical HAG problem. The authors propose the following change: instead of explicitly representing the tree and calling visit sequence functions to compute the attributes, the tree is represented through a set of visit functions corresponding to the successive visits. These functions are constructed using the visit sequences as building blocks. This technique has two major advantages. Firstly, a visit function characterizes precisely that part of the tree that would actually have been visited in the previous approach, thus increasing the number of cache hits. Secondly, copyrules may be removed during the construction phase. This results in shortcircuiting copychains and in minimizing the number of recomputed functions.
BibTeX:
@inproceedings{Pennings92,
  author = {M. Pennings and D. Swierstra and H. Vogt},
  title = {Using Cached Functions and Constructors for Incremental Attribute Evaluation},
  booktitle = {Proceedings of the 4th International Symposium of Programming Language Implementation and Logic Programming, Leuven, BE: PLILP '92},
  publisher = {Springer-Verlag},
  year = {1992},
  pages = {130--144}
}
Perraud, J., Roux, O. & Huou, M. (1992), "Operational semantics of a kernel of the language ELECTRE", Theoretical Computer Science., April, 1992. Vol. 97(1), pp. 83-103.
BibTeX:
@article{Perraud92,
  author = {J. Perraud and O. Roux and M. Huou},
  title = {Operational semantics of a kernel of the language ELECTRE},
  journal = {Theoretical Computer Science},
  year = {1992},
  volume = {97},
  number = {1},
  pages = {83--103}
}
Reps, T. (1992), "Scan Grammars: Parallel Attribute Evaluation Via Data-Parallelism". University of Wisconsin-Madison, Technical Report TR 1120a, November, 1992.
Abstract: This paper concerns the problem of how to exploit parallelism during the phases of compilation involving syntax-directed analysis and translation. In particular, we address the problem of how to exploit parallelism during the evaluation of the attributes of a derivation tree of a non-circular attribute grammar. What distinguishes the ideas presented in this paper from earlier work on parallel attribute evaluation is the use of a data-parallel model: We define a new variant of attribute grammars, called scan grammars, that incorporates a data-parallel attribution construct
BibTeX:
@techreport{Reps92,
  author = {Thomas Reps},
  title = {Scan Grammars: Parallel Attribute Evaluation Via Data-Parallelism},
  year = {1992},
  number = {TR 1120a},
  note = {Revised March 1993},
  url = {ftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1120a.ps.Z}
}
Rosendahl, M. (1992), "Strictness analysis for attribute grammars", In Programming Language Implementation and Logic Programming (PLILP '92). Vol. 631, pp. 145-157. Springer-Verlag.
BibTeX:
@incollection{Rosendahl92,
  author = {Mads Rosendahl},
  title = {Strictness analysis for attribute grammars},
  booktitle = {Programming Language Implementation and Logic Programming (PLILP '92)},
  publisher = {Springer-Verlag},
  year = {1992},
  volume = {631},
  pages = {145--157},
  url = {http://www.diku.dk/research-groups/topps/bibliography/1992.html#D-132}
}
Rushall, D. (1992), "An Attribute Evaluator in Haskell". Manchester University, September, 1992.
BibTeX:
@techreport{Rushall92,
  author = {David Rushall},
  title = {An Attribute Evaluator in Haskell},
  year = {1992},
  url = {ftp://ftp.informatik.rwth-aachen.de/pub/reports/1992/92-19.dir/92-19-16.ps.gz}
}
Thomas, L. & Cruz-Lara, S. (1992), "A Concurrent Object-Oriented Paradigm for Attribute Grammars", In Plenum Publishing Corporation 1992 COMPUTER SCIENCE : Research and Applications.
BibTeX:
@inproceedings{Thomas91,
  author = {L. Thomas and S. Cruz-Lara},
  title = {A Concurrent Object-Oriented Paradigm for Attribute Grammars},
  booktitle = {Plenum Publishing Corporation 1992 COMPUTER SCIENCE : Research and Applications},
  year = {1992},
  url = {http://web.yl.is.s.u-tokyo.ac.jp/members/thomas/mypap.html}
}
Vilo, J. (1992), "Attribute grammars and computational models as combined language development tools". Institute of Cybernetics of Estonian Academy of Sciences, Technical Report CS 43/92, 1992.
Abstract: We will describe the implementation of languages based on attribute grammars and computational models. Computational models allow automatic program synthesis(using intuitionistic propositional calculus) and thus can be used to synthesize syntax tree decoration algorithms both dynamically and statically. The easy way to build language models that allow implementation of wide class of attribute grammars will be described. The form and properties of computational models that allow automatic synthesis of multi-visit tree traversal algorithms are considered more closely. Experimental tools used to implement attribute grammars by such strategy will be presented and further directions to improve such systems will be outlined
BibTeX:
@techreport{Vilo92,
  author = {Jaak Vilo},
  title = {Attribute grammars and computational models as combined language development tools},
  year = {1992},
  number = {CS 43/92},
  url = {http://greta.cs.ioc.ee/soft/science/papers/res/1992/aru92.htm}
}
Vilo, J. (1992), "Implementing Attribute Grammars by Computational Models", In Programming Language Implementation and Logic Programming (PLILP '92). Leuven, Belgium., pp. 485-486. LNCS 631, Springer-Verlag.
BibTeX:
@inproceedings{Vilo92a,
  author = {J. Vilo},
  title = {Implementing Attribute Grammars by Computational Models},
  booktitle = {Programming Language Implementation and Logic Programming (PLILP '92)},
  publisher = {LNCS 631, Springer-Verlag},
  year = {1992},
  pages = {485--486}
}
Augusteijn, L. (1993), "Functional Programming, Program Transformations and Compiler Construction". School: Eindhoven Technical University., October, 1993.
BibTeX:
@phdthesis{Augusteijn93,
  author = {Lex Augusteijn},
  title = {Functional Programming, Program Transformations and Compiler Construction},
  school = {Eindhoven Technical University},
  year = {1993}
}
Benvel, H. (1993), "Réalisation d'un front-end Pascal avec le système FNC-2". Université de Paris~6, September, 1993.
BibTeX:
@techreport{Benvel93,
  author = {Hervé Benvel},
  title = {Réalisation d'un front-end Pascal avec le système FNC-2},
  year = {1993}
}
Deransart, P. & Maluszynski, J. (1993), "A Grammatical View of Logic Programming" The MIT Press.
BibTeX:
@book{Deransart93,
  author = {P. Deransart and J. Maluszynski},
  title = {A Grammatical View of Logic Programming},
  publisher = {The MIT Press},
  year = {1993}
}
Desmarais, M.C., Giroux, L. & Larochelle, S. (1993), "An Advice-Giving Interface Based on Plan-Recognition and User-Knowledge Assessment", International Journal of Man-Machine Studies. Vol. 39(6), pp. 901-924.
Abstract: Users of powerful but complex software packages do not take full advantage of the functionality of their tools. Advisory systems, or consultants, offer a solution to this problem by providing continuous and on-the-job help and training advice. However, consultants have not yet had any practical implementation outside an experimental setting. We propose an architecture for a consultant that is feasible and scalable in a practical context. The architecture is implemented in a system called EdCoach. It addresses two important issues for advisory systems: (1) the task analysis problem and (2) the user knowledge assessment problem. The system's task analysis module infers the user's goals (task) from the analysis of actions and identifies the method chosen to complete the task. It is based on the parsing of user actions with an attribute grammar. The second component is an "overlay model" of the user's knowledge state (KS). The knowledge of the user is represented by a subset of known and unknown nodes in a set of knowledge units (KUs), representing the whole knowledge domain. The knowledge assessment module uses a probabilistic model combined with an implication network to infer user knowledge from the result of the task analysis. A third component of the system is the didactic module, which consists essentially in the application of a straightforward principle: if the user adopts an inefficient method to complete a goal, the system first checks that the efficient method is unknown and, if so, it advises the user about that method. The system's performance was empirically tested with a text-editing application. A simulation of all three modules integrated in EdCoach shows that after about two weeks, 75% of the potential recommendations were progressively and correctly administered, or withheld, according to whether or not the efficient methods were known or unknown. The advantages and limits of the general approach adopted in EdCoach are discussed.
BibTeX:
@article{Desmarais93,
  author = {Michel C. Desmarais and Luc Giroux and Serge Larochelle},
  title = {An Advice-Giving Interface Based on Plan-Recognition and User-Knowledge Assessment},
  journal = {International Journal of Man-Machine Studies},
  year = {1993},
  volume = {39},
  number = {6},
  pages = {901--924}
}
van Deursen, A. (1993), "Origin Tracking in Primitive Recursive Schemes", In Conference Proceedings Computing Science in the Netherlands (CSN'93)., pp. 132-143.
BibTeX:
@inproceedings{Deursen93,
  author = {A. van Deursen},
  title = {Origin Tracking in Primitive Recursive Schemes},
  booktitle = {Conference Proceedings Computing Science in the Netherlands (CSN'93)},
  year = {1993},
  pages = {132--143},
  url = {ftp://ftp.cwi.nl/pub/gipe/reports/Deu94.ps.Z}
}
Efremidis, S.G., Mughal, K.A. & Reppy, J.H. (1993), "AML: Attribute Grammars in ML". Cornell University, Computer Science Department, Technical Report TR93-1401, December, 1993.
Abstract: Attribute grammars are a valuable tool for constructing compilers and building user interfaces. This paper reports on a system we are developing, called AML (for Attribution in ML), which is an attribute grammar toolkit for building such applications as language-based programming environments using SML. This system builds on the proven technology of efficient attribute evaluation, while using a higher-level foundation for the implementation of interactive systems. It supports a general and uniform platform for building applications that can manipulate attributed terms and allow access to attribute values. We describe the design of the AML system, its current implementation status, and our plans for the future.
BibTeX:
@techreport{Efremidis93,
  author = {Sofoklis G. Efremidis and Khalid A. Mughal and John H. Reppy},
  title = {AML: Attribute Grammars in ML},
  year = {1993},
  number = {TR93-1401},
  url = {http://cs-tr.cs.cornell.edu:80/TR/CORNELLCS:TR93-1401}
}
Fegaras, L., Maier, D. & Sheard., T. (1993), "Specifying Rule-based Query Optimizers in a Reflective Framework", In Third International Conference on Deductive and Object-Oriented Databases. Phoenix, Arizona. December 1993., pp. 146-168.
Abstract: Numerous structures for database query optimizers have been proposed. Many of those proposals aimed at automating the construction of query optimizers from some kind of specification of optimizer behavior. These specification frameworks do a good job of partitioning and modularizing the kinds of information needed to generate a query optimizer. Most of them represent at least part of this information in a rule-like form. Nevertheless, large portions of these specifications still take a procedural form. The contributions of this work are threefold. We present a language for specifying optimizers that captures a larger portion of the necessary information in a declarative manner. This language is in turn based on a model of query rewriting where query expressions carry annotations that are propagated during query transformation and planning. This framework is reminiscent of inherited and synthesized attributes for attribute grammars, and we believe it is expressive of a wide range of information: logical and physical properties, both desired and delivered, cost estimates, optimization contexts, and control strategies. Finally, we present a mechanism for processing optimizer specifications that is based on compile-time reflection. This mechanism proves to be succinct and flexible, allowing modifications of the specification syntax, incorporation of new capabilities into generated optimizers, and retargeting the translation to a variety of optimization frameworks. We report on an implementation of our ideas using the CRML reflective functional language and on optimizer specifications we have written for several query algebras
BibTeX:
@inproceedings{Fegaras93,
  author = {L. Fegaras and D. Maier and T. Sheard.},
  title = {Specifying Rule-based Query Optimizers in a Reflective Framework},
  booktitle = {Third International Conference on Deductive and Object-Oriented Databases},
  year = {1993},
  pages = {146--168},
  url = {http://ranger.uta.edu/egaras/dood93.ps.Z}
}
Frost, R.A. & Karamatos, S. (1993), "Supporting the Attribute Grammar Programming Paradigm in a Lazy Functional Programming Language", In Functional Programming, Concurrency, Simulation and Automated Reasoning. Vol. 693, pp. 278-295. Springer Verlag.
Abstract: Attribute grammars were introduced in the late 60's. In the 70's they found use in compiler work, a use that is continuing to grow. A more recent development is that of the ``attribute grammar programming paradigm''. A number of environments have been built to support this paradigm. W/AGE is one such environment. It consists of several functions that extend the standard environment of the pure lazy functional programming language Miranda. W/AGE has been used in the construction of various types of program including natural language interpreters, database front-ends, file-processors, theorem provers, and VLSI specification transformers.
BibTeX:
@inbook{Frost93,
  author = {R. A. Frost and S. Karamatos},
  title = {Supporting the Attribute Grammar Programming Paradigm in a Lazy Functional Programming Language},
  booktitle = {Functional Programming, Concurrency, Simulation and Automated Reasoning},
  publisher = {Springer Verlag},
  year = {1993},
  volume = {693},
  pages = {278--295}
}
Frost, R.A. (1993), "Guarded Attribute Grammars", Software - Practice and Experience. Vol. 23(10), pp. 1139-1156.
Abstract: Contrary to a widely-held belief it is possible to construct executable specifications of language processors that use a top-down parsing strategy and which have structures that directly reflect the structure of grammars containing left-recursive productions. A novel technique has been discovered by which the non-termination that would otherwise occur is avoided by 'guarding' top-down left-recursive language processors by non-left-recursive recognizers. The use of a top-down parsing strategy increases modularity and the use of left-recursive productions facilitates specification of semantic equations. A combination of the two is of significant practical value because it results in modular and expressively clear executable specifications of language processors. The new approach has been tested in an attribute grammar programming environment that has been used in a number of projects including the development of natural language interfaces, SQL processors and circuit design transformers within a VLSI design package.
BibTeX:
@article{Frost93a,
  author = {R. A. Frost},
  title = {Guarded Attribute Grammars},
  journal = {Software - Practice and Experience},
  year = {1993},
  volume = {23},
  number = {10},
  pages = {1139--1156}
}
Fülöp, Z., Herrmann, F., Vágvölgyi, S. & Vogler, H. (1993), "Tree transducers with external functions", Theoret. Comput. Sci.. Vol. 108, pp. 185-236.
BibTeX:
@article{fulhervagvog93,
  author = {Z. Fülöp and F. Herrmann and S. Vágvölgyi and H. Vogler},
  title = {Tree transducers with external functions},
  journal = {Theoret. Comput. Sci.},
  year = {1993},
  volume = {108},
  pages = {185--236}
}
Gaál, T. (1993), "Parallel Compiler Generation", In Euromicro '93 Short Notes Program. Barcelona.
BibTeX:
@inproceedings{Gaal93,
  author = {Tamás Gaál},
  title = {Parallel Compiler Generation},
  booktitle = {Euromicro '93 Short Notes Program},
  year = {1993},
  note = {Paru dans it Microprocessing and Microprogramming, 39 (1993), pp.~147--150}
}
van den Broek, P.M. & van Gilst, F.A. (1993), "A new programming methodology for lazy functional languages". University of Twente, 1993.
Abstract: In this paper we present a new programming methodology for lazy functional programming languages. It is based on divide and conquer: the division of problems into sub problems. Such a division will be represented by a call graph. A class of program schemes, which implement call graphs, is derived based on Johnsson's approach to attribute evaluation in attribute grammars. The key idea is to consider the passing of arguments to functions and the return of results by functions in a call graph as the propagation of inherited and synthesised attributes respectively in an attribute grammar. The new methodology is illustrated by several small examples and a case study: the design and implementation of a compiler generator.
BibTeX:
@techreport{Gilst93,
  author = {P. M. van den Broek and F. A. van Gilst},
  title = {A new programming methodology for lazy functional languages},
  year = {1993}
}
Gondow, K. & Katayama, T. (1993), "Attribute grammars as record calculus". Tokyo Institute of Technology, Technical Report 93TR-0047, 1993.
Abstract: We present a new denotational semantics of attribute grammars that are based on Cardelli's record and lambda calculus. Our goal is to define, using the semantics, computational models based on attribute grammars for describing structure-oriented software development environments. As the first step toward the end, we present as extensions of the semantics formal definitions of OOAG (object oriented attribute grammars) and higher order attribute grammars. They have the capability to transform structures of attributed trees depending on their attribute values. The rest of this paper is written in Japanese.
BibTeX:
@techreport{Gondow93,
  author = {Katsuhiko Gondow and Takuya Katayama},
  title = {Attribute grammars as record calculus},
  year = {1993},
  number = {93TR-0047},
  url = {http://www.cs.titech.ac.jp/TR/tr-abst93.html#93TR-0047}
}
Gondow, K., Imaizumi, T., Shinoda, Y. & Katayama, T. (1993), "Change Management and Consistency Maintenance in Software Development Environments Using Object Oriented Attribute Grammars", In Object Technologies for Advanced Software. November 1993. Volume 742, pp. 77-94.
Abstract: In this paper, we consider describing software development environments (SDEs) using a computational model OOAG (Object Oriented Attribute Grammar), which incorporates functions for managing changes and maintaining consistency. In SDEs, the change management and consistency maintenance are key issues and OOAG is suitable for describing them. Software objects in SDEs have many derived values, and software objects and their derived values have complex relations with each other. Careless human activities often cause inconsistencies among software objects and it usually costs a lot to recover them. OOAG provides declarative descriptions to re-compute automatically derived values based on change propagation and to check relations among software objects, which help recovering activities of programmers. OOAG treats SDEs as aggregated active objects, i.e. tree structures, where software products are distributed. Managing changes of derived values and consistency among software objects are described over tree structures in declarative manner. Attributes associated with nodes are re-computed automatically, if necessary. OOAG is a computational model with the following extensions to standard attribute grammars (AGs): (1) OOAG can change tree structures depending upon their attribute values. (AGs hat have this function are called higher order attribute grammars). (2) OOAG can describe message passing which pastes temporary attributes and their attribution rules to the tree structure. The aim of this paper is to show that our approach of treating SDEs as aggregated objects is natural and OOAG's features are suited for the task of describing change management and consistency control in structure-oriented software development environments.
BibTeX:
@inproceedings{Gondow93a,
  author = {Katsuhiko Gondow and Takashi Imaizumi and Yoichi Shinoda and Takuya Katayama},
  title = {Change Management and Consistency Maintenance in Software Development Environments Using Object Oriented Attribute Grammars},
  booktitle = {Object Technologies for Advanced Software},
  year = {1993},
  volume = {742},
  pages = {77--94}
}
Kaiser, G.E. & Kaplan, S.M. (1993), "Parallel and Distributed Incremental Attribute Evaluation Algorithms for Multi-User Software Development Environments", In ACM Transactions on Software Engineering and Methodology., January, 1993. Vol. 2, pp. 47-92. ACM press.
Abstract: The problem of it change propagation in multiuser software development environments distributed across a local-area network is addressed. The program is modeled as an attributed parse tree segmented among multiple user processes and changes are modeled as subtree replacements requested asynchronously by inidividual users. Change propagation is then implemented using decentralised incremental evaluation of an attribute grammar that defines the static semantic properties of the programming language. Building up to our primary result, we first present algorithms that support parallel evaluation on a centralised tree in response to single edits using a single diting cursor and multiple dits with multiple editing cursors. Then we present our algorithm for parallel evaluation on a decentralized tree. We also present a protocol to guarantee reliability of the evaluation algorithm as components of the decentralized tree become unavailable due to failures and return to availability.
BibTeX:
@incollection{Kaiser93,
  author = {Gail E. Kaiser and Simon M. Kaplan},
  title = {Parallel and Distributed Incremental Attribute Evaluation Algorithms for Multi-User Software Development Environments},
  booktitle = {ACM Transactions on Software Engineering and Methodology},
  publisher = {ACM press},
  year = {1993},
  volume = {2},
  pages = {47--92}
}
Kastens, U. (1993), "Executable Specifications for Language Implementation", In Programming Language Implementation and Logic Programming (PLILP '93). Tallinn. Volume 714, pp. 1-11. Springer-Verlag.
BibTeX:
@inproceedings{Kastens93,
  author = {Uwe Kastens},
  title = {Executable Specifications for Language Implementation},
  booktitle = {Programming Language Implementation and Logic Programming (PLILP '93)},
  publisher = {Springer-Verlag},
  year = {1993},
  volume = {714},
  pages = {1--11}
}
Kikuchi, Y. (1993), "An evaluation method of an attribute grammar based language by extended term rewriting systems". Tokyo Institute of Technology, Technical Report 93TR-0033, 1993.
Abstract: I propose new rewriting systems and an evaluation method of the language AG on them. The rewriting systems are extended from regular term rewriting systems, that permit multi-valued function symbols and sharing computation trees. The language AG is a functional programming language based on attribute grammars, whose naive evaluator tends to make redundant copies of same attributes and evaluates only eagerly. An evaluator using the rewriting systems prevents needless copies and can work as lazy evaluation.
BibTeX:
@techreport{Kikuchi93,
  author = {Yutaka Kikuchi},
  title = {An evaluation method of an attribute grammar based language by extended term rewriting systems},
  year = {1993},
  number = {93TR-0033},
  url = {http://www.cs.titech.ac.jp/TR/tr-abst93.html#93TR-0033}
}
Le Bellec, C. (1993), "La généricité et les grammaires attribuées". School: Département de Mathématiques et d'Informatique, Université d'Orléans.
BibTeX:
@phdthesis{LeBellec93,
  author = {Carole Le Bellec},
  title = {La généricité et les grammaires attribuées},
  school = {Département de Mathématiques et d'Informatique, Université d'Orléans},
  year = {1993},
  note = {scriptsize http://www-sop.inria.fr/members/Didier.Parigot/publications/theses/lebellec.ps.gz},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/theses/lebellec.ps.gz}
}
Le Bellec, C., Jourdan, M., Parigot, D. & Roussel, G. (1993), "Specification and Implementation of Grammar Coupling Using Attribute Grammars", In Programming Language Implementation and Logic Programming (PLILP '93). Tallinn. August 1993. Volume 714, pp. 123-136. Springer-Verlag.
Abstract: This paper introduces the notion of a coupling of two grammars, defined by associations between their non-terminals and terminals. We present an algorithm for automatically producing, from these associations, an attribute grammar which specifies the translation from one grammar to the other. The motivation for, and context of, this algorithm is our work aiming at improving modularity and reusability of attribute grammars. When it is combined with descriptional composition, we obtain what we consider to be the most declarative framework for this to date.
BibTeX:
@inproceedings{LeBellec93a,
  author = {Carole Le Bellec and Martin Jourdan and Didier Parigot and Gilles Roussel},
  title = {Specification and Implementation of Grammar Coupling Using Attribute Grammars},
  booktitle = {Programming Language Implementation and Logic Programming (PLILP '93)},
  publisher = {Springer-Verlag},
  year = {1993},
  volume = {714},
  pages = {123--136},
  note = {scriptsize http://www-sop.inria.fr/members/Didier.Parigot/publications/couple-AG-plilp93.ps.gz},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/couple-AG-plilp93.ps.gz}
}
Luttighuis, P.H.W.M.O. (1993), "Parallel algorithms for parsing and attribute evaluation". School: University of Twente.
BibTeX:
@phdthesis{Luttighuis93,
  author = {P. H. W. M. Oude Luttighuis},
  title = {Parallel algorithms for parsing and attribute evaluation},
  school = {University of Twente},
  year = {1993},
  note = {ISBN 90-9006247-5}
}
Micallef, J. & Kaiser, G.E. (1993), "Extending Attribute Grammars to Support Programming-in-the-Large". Computer Science, Columbia University, Technical Report CUCS-003-93, 1993.
BibTeX:
@techreport{Micallef93,
  author = {Josephine Micallef and Gail E. Kaiser},
  title = {Extending Attribute Grammars to Support Programming-in-the-Large},
  year = {1993},
  number = {CUCS-003-93},
  url = {ftp://ftp.cs.columbia.edu/reports/reports-1993/cucs-003-93.ps.Z}
}
Micallef, J. & Kaiser, G.E. (1993), "Support Algorithms for Incremental Attribute Evaluation of Asynchronous Subtree Replacements", In IEEE Transactions on Software Engineering., March, 1993. Vol. 19, pp. 231-252.
BibTeX:
@incollection{Micallef93a,
  author = {Josephine Micallef and Gail E. Kaiser},
  title = {Support Algorithms for Incremental Attribute Evaluation of Asynchronous Subtree Replacements},
  booktitle = {IEEE Transactions on Software Engineering},
  year = {1993},
  volume = {19},
  pages = {231--252}
}
Paakki, J. (1993), "Multi-Pass Evaluation of Functional Logic Programs". Linköping University, Technical Report LiTH-IDA-R-93-02, 1993.
Abstract: An operational semantics for logic programming languages with external functions (procedures) is presented. The external procedures stand for arbitrary functions, implemented in any programming language. In addition to ordinary constructor terms, a program written in a functional logic language includes special functional terms that represent calls to external functions. The central dynamic requirement is that external functions can be called only with ground constructor terms as arguments. Methods are presented for statically analyzing the groundness of functional terms, and for arranging the corresponding external function calls into a proper execution order. The methods are based on techniques developed for attribute grammars. Consequently, execution of a functional logic program is divided into two phases: first an incomplete skeleton of a proof tree is constructed in conjunction with a modified SLD-resolution scheme, and then the skeleton is completed into a proof tree by traversing its labels and executing the associated function calls. The analysis guarantees that whenever a term is subject to functional evaluation, all its arguments are ground. The completing traversal phase can consist of multiple passes over the skeleton. The execution scheme is generated from an annotated version of the program, based on dividing the arguments of predicates into inherited and synthesized ones and on analyzing the data dependencies between them in the spirit of attribute grammars. Algorithms are given for automatically inferring a proper (partial) annotation. Several special program classes are defined. One-pass programs, such as L-annotated and one-sweep programs, can be executed during the modified SLD-resolution phase without building and traversing an explicit skeleton. This is not possible for general multi-pass programs, such as absolutely non-circular programs, that always require an explicit skeleton to be constructed due to complex mutual data dependencies between different atoms of the program.Finally, implementation and optimization methods in terms of the operatio- nal semantics are discussed
BibTeX:
@techreport{Paakki93,
  author = {J. Paakki},
  title = {Multi-Pass Evaluation of Functional Logic Programs},
  year = {1993},
  number = {LiTH-IDA-R-93-02}
}
Reps, T. (1993), "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.
Abstract: This paper concerns the problem of how to exploit parallelism during the phases of compilation involving syntax-directed analysis and translation. In particular, we address the problem of how to exploit parallelism during the evaluation of the attributes of a derivation tree of a non-circular attribute grammar. What distinguishes the ideas presented in this paper from earlier work on parallel attribute evaluation is the use of a data-parallel model: We define a new variant of attribute grammars, called scan grammars, that incorporates a data-parallel attribution construct
BibTeX:
@inproceedings{Reps93,
  author = {Thomas Reps},
  title = {Scan Grammars: Parallel Attribute Evaluation Via Data-Parallelism},
  booktitle = {Proceedings of the Fifth ACM Symposium on Parallel Algorithms and Architectures},
  publisher = {ACM},
  year = {1993}
}
Rouzier, P. (1993), "Réalisation d'une interface entre les systèmes Centaur, FNC-2 et Syntax". Université de Paris~11, September, 1993.
BibTeX:
@techreport{Rouzier93,
  author = {Philippe Rouzier},
  title = {Réalisation d'une interface entre les systèmes Centaur, FNC-2 et Syntax},
  year = {1993},
  note = {scriptsize http://www-sop.inria.fr/members/Didier.Parigot/publications/Rapport/rouzier_dea.ps.gz},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/Rapport/rouzier_dea.ps.gz}
}
ao Saraiva, J. & Henriques, P. (1993), "Concurrent Attribute Evaluation", In VEC/PAR'93, First International Meeting on Vector and Parallel Processing. Set 1993. Pergamon Press.
BibTeX:
@inproceedings{Saraiva93,
  author = {João Saraiva and P. Henriques},
  title = {Concurrent Attribute Evaluation},
  booktitle = {VEC/PAR'93, First International Meeting on Vector and Parallel Processing},
  publisher = {Pergamon Press},
  year = {1993},
  url = {http://www.di.uminho.pt/as/Research/PUBLICACOES/CONC_ATTRIB_EVAL/Relat.ps}
}
Suzuki, M., Katayama, T. & Schlichting, R.D. (1993), "A Functional and Attribute Based Computational Model for Fault-Tolerant Software". Arizona University, Computer Science, Technical Report TR93-08, 1993.
BibTeX:
@techreport{Suzuki93,
  author = {Masato Suzuki and Takuya Katayama and Richard D. Schlichting},
  title = {A Functional and Attribute Based Computational Model for Fault-Tolerant Software},
  year = {1993},
  number = {TR93-08},
  url = {http://www.cs.arizona.edu/research/reports.html}
}
Tokuda, T. & Watanabe, Y. (1993), "An attribute grammar modelling of interactive figures". Tokyo Institute of Technology, Technical Report 93TR-0034, 1993.
Abstract: Interactive figures are figures which we can interact with, and we can perform semantic computations on the structure. This paper presents a new modelling of interactive figures based on the concept of attribute grammars. Traditional methodologies such as that of C++, HyperTalk, and Lingo cannot define semantic computations on figures in a clear way. Our model can define semantic computations inductively on the structure of the figure.
BibTeX:
@techreport{Tokuda93,
  author = {Takehiro Tokuda and Yoshimichi Watanabe},
  title = {An attribute grammar modelling of interactive figures},
  year = {1993},
  number = {93TR-0034},
  url = {http://www.cs.titech.ac.jp/TR/tr-abst93.html#93TR-0034}
}
Tokuda, T. & Watanabe, Y. (1993), "An efficient semantic evaluator for warped LC(1) attributed grammars". Tokyo Institute of Technology, Technical Report 93TR-0035, 1993.
Abstract: We present an efficient construction method for a new class of one-pass evaluatable attribute grammars called warped LC(1) attributed grammars. Unlike top-down parsing based LL-attributed grammars and bottom-up parsing based LR-attributed grammars, we use the left corner parsing (LC(k) parsing) method which is a combination of bottom-up parsing and top-down parsing. As a very wide class of LC(1) parsing based attribute grammars, there exists a class called LC-attributed grammars. LC-attributed grammars require a substantial precomputation for constructing an evaluator from a parser. Our warped LC(1) attributed grammars allow us to execute an evaluator simultaneously with an LC(1) parser without requiring any precomputation
BibTeX:
@techreport{Tokuda93a,
  author = {Takehiro Tokuda and Yoshimichi Watanabe},
  title = {An efficient semantic evaluator for warped LC(1) attributed grammars},
  year = {1993},
  number = {93TR-0035},
  url = {http://www.cs.titech.ac.jp/TR/tr-abst93.html#93TR-0035}
}
Tokuda, T. & Watanabe, Y. (1993), "An attribute evaluation of context-free languages". Tokyo Institute of Technology, Technical Report 93TR-0036, 1993.
Abstract: We present a method of evaluating attributes of input strings defined by attribute grammars having general context-free underlying grammars and naturally restricted semantic rules. Our attribute evaluation method is based on Earley's parsing method. Hence we can evaluate attributes without building corresponding derivation trees or attribute dependency graphs. Also we can compute all the possible attribute values for unambiguous or ambiguous context-free underlying grammars. Our method serves as a solution to the local constant inherited attribute problem
BibTeX:
@techreport{Tokuda93b,
  author = {Takehiro Tokuda and Yoshimichi Watanabe},
  title = {An attribute evaluation of context-free languages},
  year = {1993},
  number = {93TR-0036},
  url = {http://www.cs.titech.ac.jp/TR/tr-abst93.html#93TR-0036}
}
Vogt, H.H. (1993), "Higher order Attribute Grammars". School: Faculteit Wiskunde en Informatica.
BibTeX:
@phdthesis{Vogt93,
  author = {H. H. Vogt},
  title = {Higher order Attribute Grammars},
  school = {Faculteit Wiskunde en Informatica},
  year = {1993},
  url = {http://www.serc.nl/People/vogt/thesis/thesis.html}
}
Vorthmann, S.A. (1993), "Modelling and Specifying Name Visibility and Binding Semantics". Carnegie Mellon University, School of Computer Science, Technical Report CMU//CS-93-158, July, 1993.
Abstract: This paper describes visibility networks, a graphical model of static name visibility and binding. A visibility network is a visual representation of the search algorithm performed when binding a name reference to a declaration. In conjunction with an extended attribute grammar mechanism, visibility networks allow clear and precise specification of the naming semantics of programming languages. The power of the model is demonstrated through its description of several examples of complex visibility constraints in Ada. As a specification technique, the model has several advantages for the language designer, including support for prototyping, analysis, formal description, and documentation of naming semantics. Similar advantages make the visibility network model pedagogically attractive. Finally, it has been demonstrated that the specifications can be used to automatically generate naming semantics modules for compilers and language-based editors, reducing the burden of the language implementor.
BibTeX:
@techreport{Vorthmann93,
  author = {Scott A. Vorthmann},
  title = {Modelling and Specifying Name Visibility and Binding Semantics},
  year = {1993},
  number = {CMU//CS-93-158},
  pages = {15}
}
Wilhelm, R. (1993), "Inverse Currying Transformation on Attribute Grammars". California Berkeley, Technical Report UCB//CSD-83-129, July, 1993.
Abstract: Inverse currying transformation of an attribute grammar moves a context condition to places in the grammar where the violation of the condition can be detected as soon as the semantic information used in the condition is computed. It thereby takes into account the evaluation order chosen for the attribute grammar. Inverse currying transformations can be used to enhance context sensitive parsing using predicates on attributes, to eliminate sources of backtrack when parsing according to ambiguous grammars, and to facilitate semantics-supported error correction
BibTeX:
@techreport{Wilhelm93,
  author = {Reinhard Wilhelm},
  title = {Inverse Currying Transformation on Attribute Grammars},
  year = {1993},
  number = {UCB//CSD-83-129},
  url = {ftp://tr-ftp.cs.berkeley.edu/pub/tech-reports/csd/csd-83-129/}
}
Attali, I. & Parigot, D. (1994), "Integrating Natural Semantics and Attribute Grammars: the Minotaur System". INRIA, Technical Report 2339, 1994.
Abstract: This papers describes the principles and the functionalities of the Minotaur system. Minotaur is a generic interactive environment based on the integration of the Centaur system and the FNC-2 system, two systems widely used to specify syntax and semantics of programming languages and generate efficient semantic tools from these specifications. We show how Attribute Grammars techniques can be adequate for evaluation of a quite large subclass of Natural Semantics specifications, including specifications of an arithmetic calculator, a tree transformation, a type-checker for an Algol-like language, ... For this subclass of Natural Semantics specifications, the Minotaur system automatically generates an incremental and efficient (in time and memory) evaluator which gives to Natural Semantics an industrial strength implementation.
BibTeX:
@techreport{Attali94,
  author = {Isabelle Attali and Didier Parigot},
  title = {Integrating Natural Semantics and Attribute Grammars: the Minotaur System},
  year = {1994},
  number = {2339},
  url = {ftp://ftp.inria.fr/INRIA/publication/RR/RR-2339.ps.gz}
}
Barbar, K. & Musumbu, K. (1994), "Implementation of Abstract Interpretation Algorithm by means of Attribute Grammars", In Proceedings of the 26th Southeastern Symposium on System Theory. March 1994., pp. 87-93. IEEE Computer Society.
BibTeX:
@inproceedings{Barbar94,
  author = {K. Barbar and K. Musumbu},
  title = {Implementation of Abstract Interpretation Algorithm by means of Attribute Grammars},
  booktitle = {Proceedings of the 26th Southeastern Symposium on System Theory},
  publisher = {IEEE Computer Society},
  year = {1994},
  pages = {87--93},
  url = {http://www.labri.u-bordeaux.fr/Annuaire/musumbu.html}
}
Bauer, B. (1994), "Attributed Term Induction - A Proof Principle for Attribute Grammars". München University, Technical Report Bericht 9403, 1994.
BibTeX:
@techreport{Bauer94,
  author = {Bernhar Bauer},
  title = {Attributed Term Induction - A Proof Principle for Attribute Grammars},
  year = {1994},
  number = {Bericht 9403},
  url = {http://www2.informatik.tu-muenchen.de/persons/bauer/papers/tum.94.03.ps}
}
Boyland, J. & Graham, S.L. (1994), "Composing Tree Attributions", In 21st ACM Symp. on Principles of Programming Languages. Portland, Oregon. January 1994., pp. 375-388. ACM Press.
Abstract: Using the simple tree attributions described, attribute values can themselves be trees, enabling attribution to be used for tree transformations. Unlike higher order attribute grammars, simple tree attributions have the property of descriptional composition, which allows a complex transformation to be built up from simpler ones, yet be executed efficiently. In contrast to other formalisms that admit descriptional composition, notably composable attribute grammars, simple tree attributions have the expressive power to handle remote references and recursive syntactic (tree generating) functions, providing significantly more general forms of attribution and transformation
BibTeX:
@inproceedings{Boyland94,
  author = {John Boyland and Susan L. Graham},
  title = {Composing Tree Attributions},
  booktitle = {21st ACM Symp. on Principles of Programming Languages},
  publisher = {ACM Press},
  year = {1994},
  pages = {375--388}
}
Breuer, P.T. & Bowen, J.P. (1994), "Decompilation: the enumeration of types and grammars", ACM Trans. Progr. Languages and Systems., September, 1994. Vol. 16(5), pp. 1613-1647.
Abstract: While a compiler produces low-level object code from high-level source code, a decompiler produces high-level code from low-level code and has applications in the testing and validation of safety-critical software. The decompilation of an object code provides an independent demonstration of correctness that is hard to better for industrial purposes (an alternative is to prove the compiler correct). But, although compiler compilers are in common use in the software industry, a decompiler compiler is much more unusual. It turns out that a data type specification for a programming-language grammar can be remolded into a functional program that enumerates all of the abstract syntax trees of the grammar. This observation is the springboard for a general method for compiling decompilers from the specifications of (nonoptimizing) compilers. This paper deals with methods and theory, together with an application of the technique. The correctness of a decompiler generated from a simple occam-like compiler specification is demonstrated. The basic problem of enumerating the syntax trees of grammars, and then stopping, is shown to have no recursive solution, but methods of abstract interpretation can be used to guarantee the adequacy and completeness of our technique in practical instances, including the decompiler for the language presented here.
BibTeX:
@article{Breuer94,
  author = {Peter T. Breuer and Jonathan P. Bowen},
  title = {Decompilation: the enumeration of types and grammars},
  journal = {ACM Trans. Progr. Languages and Systems},
  year = {1994},
  volume = {16},
  number = {5},
  pages = {1613--1647}
}
The Compare Consortium (1994), "Extensions of the FNC-2 Attribute Grammar System for Programming-in-the-large" Rocquencourt
BibTeX:
@unpublished{CompareGA,
  author = {The Compare Consortium},
  title = {Extensions of the FNC-2 Attribute Grammar System for Programming-in-the-large},
  year = {1994},
  note = {En préparation}
}
Desainte-Catherine, M. & Barbar, K. (1994), "Using attribute grammars to find solutions for musical equational programs", ACM SIGPLAN Notices., September, 1994. Vol. 29(9), pp. 56-63.
BibTeX:
@article{Desainte-Catherine94,
  author = {M. Desainte-Catherine and K. Barbar},
  title = {Using attribute grammars to find solutions for musical equational programs},
  journal = {ACM SIGPLAN Notices},
  year = {1994},
  volume = {29},
  number = {9},
  pages = {56--63}
}
Duris, E. (1994), "Transformation de grammaires attribuées pour des mises à jour destructives". Université d'Orléans, September, 1994.
Abstract: Dans le domaine des langages fonctionnels, il existe un ensemble de travaux sur les problèmes de récupération de mémoire au moment de la compilation. Dans le domaine des grammaires attribuées, ce problème a donné lieu à l'étude de la notion de durée de vie des attributs. Dans ce rapport, nous étudions la possibilité de construire automatiquement la version ``destructive'' correspondant à une fonction de mise à jour applicative donnée. Par destructive, on entend le fait qu'elle puisse modifier physiquement la structure de son argument mis à jour, évitant ainsi de nombreuses allocations mémoire. D'autre part, nous devons déterminer sous quelles conditions un appel à une fonction de mise à jour applicative dans une grammaire attribuée peut être remplacé par un appel à sa version destructive. Ces optimisations permettent de réutiliser des structures de données complexes au lieu de les dupliquer. Dans ce cadre, nous fournissons des éléments de comparaison entre les travaux de Philip Wadler sur la déforestation et ceux de Gilles Roussel sur la méta-composition. Ces comparaisons sous forme d'observations peuvent constituer une amorce de rapprochement entre la programmation fonctionnelle et les grammaires attribuées.
BibTeX:
@techreport{Duris94,
  author = {Etienne Duris},
  title = {Transformation de grammaires attribuées pour des mises à jour destructives},
  year = {1994},
  note = {scriptsize http://www-sop.inria.fr/members/Didier.Parigot/publications/Rapport/etienne.ps.gz},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/Rapport/etienne.ps.gz}
}
An, A.F. & Wakayama, T. (1994), "SIMON: A Grammar-based Transformation System for Structured Documents", In Fifth International Conference on Electronic Publishing. Darmstadt, Germany., pp. 361-372. Origination, Dissemination, and Design (EPODD) EP '94.
Abstract: SIMON is a grammar-based transformation system for restructuring documents. Its target applications include meta-level specification of document assembly, view definition and retrieval for multiview documents, and document type evolution. The internal document model is based on attribute grammars, and it interfaces with external document models such as SGML through input and output conversion. The transformation engine of SIMON is an amalgamation of syntax-directed computation and content-oriented computation: the former is through higher-order (and related) extensions of attribute grammars, whereas the latter is done by externally defined programs and it is for computation not naturally amenable to the syntax-directed paradigm. The current implementation of SIMON employs the higher-order extension proposed by H. H. Vogt, S. D. Swierstra, and M. F. Kuiper for the syntax-directed computation, and C++ for the content-oriented computation
BibTeX:
@inproceedings{Feng94,
  author = {An Feng An and Toshiro Wakayama},
  title = {SIMON: A Grammar-based Transformation System for Structured Documents},
  booktitle = {Fifth International Conference on Electronic Publishing},
  publisher = {Origination, Dissemination, and Design (EPODD) EP '94},
  year = {1994},
  pages = {361--372}
}
Frost, R.A. (1994), "W/AGE : The Windsor Attribute Grammar Programming Environment". Winsdor University, May, 1994.
BibTeX:
@techreport{Frost94,
  author = {Richard A. Frost},
  title = {W/AGE : The Windsor Attribute Grammar Programming Environment},
  year = {1994},
  url = {ftp://ftp.cs.uwindsor.ca/pub/wage}
}
Hedin, G. (1994), "An Overview of Door Attribute Grammars", In 5th Int. Conf. on Compiler Construction (CC' 94). Edinburgh. April 1994. Volume 786, pp. 31-51.
BibTeX:
@inproceedings{Hedin94,
  author = {Görel Hedin},
  title = {An Overview of Door Attribute Grammars},
  booktitle = {5th Int. Conf. on Compiler Construction (CC' 94)},
  year = {1994},
  volume = {786},
  pages = {31--51},
  url = {http://www.dna.lth.se/Research/ProgEnv/Papers/LU-CS-TR:94-123.ps}
}
Jourdan, M., Marmol, B. & Parigot, D. (1994), "Experiments with a Real Parallel Attribute Evaluator"
Abstract: We present a simple but effective method for constructing efficient attribute evaluators for the class of lord attribute grammars that run on tightly-coupled (shared-memory) multi-processor machines. We also give an account of how we implemented this method in practice. Lastly, we give some figures drawn from realistic experiments, i.e. actual implementation of parallel evaluators for meaningful AGs and their runs on meaningful source texts. The results we have obtained are quite satisfactory, since we observe a quasi-linear speedup with a number of processors varying up to a reasonable number, while the performance with one processor is already quite acceptable.
BibTeX:
@unpublished{Jourdan94,
  author = {Martin Jourdan and Bruno Marmol and Didier Parigot},
  title = {Experiments with a Real Parallel Attribute Evaluator},
  year = {1994},
  note = {En préparation pour soumission},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/parevaldraff.ps.gz}
}
Kastens, U. & Waite, W.M. (1994), "Modularity and Reusability in Attribute Grammars", Acta Informatica. Vol. 31, pp. 601-627.
Abstract: An attribute grammar is a declarative specification of dependence among computations carried out at the nodes of a tree. Attribute grammars have proven remarkably difficult to decompose into logical fragments. As a result, they have not yet been accepted as a viable specification technique. By combining the ideas of remote attribute access and inheritance, we have been able to define ``attribution modules'' that can be reused in a variety of applications. As an example, we show how to define reusable modules for name analysis that embody different scope rules.
BibTeX:
@article{Kastens94,
  author = {Uwe Kastens and William M. Waite},
  title = {Modularity and Reusability in Attribute Grammars},
  journal = {Acta Informatica},
  year = {1994},
  volume = {31},
  pages = {601--627}
}
Kühnemann, A. & Vogler, H. (1994), "Synthesized and inherited functions - a new computational model for syntax-directed semantics", Acta Informatica. Vol. 31, pp. 431-477.
BibTeX:
@article{kuevog94a,
  author = {A. Kühnemann and H. Vogler},
  title = {Synthesized and inherited functions - a new computational model for syntax-directed semantics},
  journal = {Acta Informatica},
  year = {1994},
  volume = {31},
  pages = {431--477}
}
Kühnemann, A. & Vogler, H. (1994), "A pumping lemma for output languages of attributed tree transducers", Acta Cybernetica. Vol. 11, pp. 261-305.
BibTeX:
@article{kuevog94b,
  author = {A. Kühnemann and H. Vogler},
  title = {A pumping lemma for output languages of attributed tree transducers},
  journal = {Acta Cybernetica},
  year = {1994},
  volume = {11},
  pages = {261--305}
}
Leung, T.W. (1994), "Compiling Object-Oriented Queries". Department of Computer Science, Brown University, Technical Report CS-94-05, February, 1994.
Abstract: The effectiveness of database query optimization is dependent on the optimizer's ability to make efficient use of physical resources in a computer system. The optimizer decides how to use those resources in the plan generation step. We describe an approach to plan generation where physical level rewriting produces performance increases which cannot be obtained via source level transformations. Example optimizations serve as a demonstration of a new rule language based on list and tree pattern matching. A formalism similar to attribute grammars computes information needed by the plan generator. Many of the techniques presented are reminiscent of compiler optimizations. We conclude by describing the work that will be completed in the thesis.
BibTeX:
@techreport{Leung94,
  author = {Theodore W. Leung},
  title = {Compiling Object-Oriented Queries},
  year = {1994},
  number = {CS-94-05},
  url = {ftp://ftp.cs.brown.edu/pub/techreports/94/cs94-05.ps.Z}
}
Lämmel, R. (1994), "DSDL - Denotational Semantics Description Language". Rostocker Informatik-Berichte, Technical Report 16, 1994.
BibTeX:
@techreport{Lämmel94,
  author = {Ralf Lämmel},
  title = {DSDL - Denotational Semantics Description Language},
  year = {1994},
  number = {16}
}
Marmol, B. (1994), "La parallélisation et l'optimisation mémoire dans l'évaluation des grammaires attribuées". School: Université d'Orléans.
BibTeX:
@phdthesis{Marmol94,
  author = {Bruno Marmol},
  title = {La parallélisation et l'optimisation mémoire dans l'évaluation des grammaires attribuées},
  school = {Université d'Orléans},
  year = {1994},
  note = {scriptsize http://www-sop.inria.fr/members/Didier.Parigot/publications/theses/marmol.ps.gz},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/theses/marmol.ps.gz}
}
McAllester, D. (1994), "Variational Attribute Grammars for Computer Aided Design". MIT, Technical Report ADAGE-MIT-94-01, June, 1994.
BibTeX:
@techreport{McAllester94,
  author = {David McAllester},
  title = {Variational Attribute Grammars for Computer Aided Design},
  year = {1994},
  number = {ADAGE-MIT-94-01},
  url = {http://www.owego.com/dssa/mit-docs/mit9401.ps}
}
McAllester, D. (1994), "Variational Attribute Grammars for Computer Aided Design (Release 3.0)". MIT, Technical Report ADAGE-MIT-94-01, June, 1994.
BibTeX:
@techreport{McAllester94a,
  author = {David McAllester},
  title = {Variational Attribute Grammars for Computer Aided Design (Release 3.0)},
  year = {1994},
  number = {ADAGE-MIT-94-01},
  url = {http://www.owego.com/dssa/mit-docs/mit9402.ps}
}
Meijer, E. (1994), "More Advice on Proving Compilers Correct: Improve Correct Compilers", September, 1994.
Abstract: As an alternative to the classical approach to the compiler correctness problem where a given compiler is proved correct from scratch, we propose a method for deriving correct compilers from a denotational semantics via a series of refinements. Each such optimization step corresponds to an efficiency improvement in the corresponding compiler. Our technique combines the standard initial algebra semantics approach with aspects of Action Semantics. Instead of expressing semantic functions as homomorphisms from the initial algebra (syntax) to some semantic domain, they are factored through an algebra of actions. Compilers can then be obtained by viewing semantic functions as translations from the source language to the initial action algebra. We illustrate our method by deriving several compilers for a language of arithmetic expressions. Though simple, this example shows all the steps necessary to deal with more realistic languages.
BibTeX:
@unpublished{Meijer94,
  author = {Erik Meijer},
  title = {More Advice on Proving Compilers Correct: Improve Correct Compilers},
  year = {1994},
  url = {http://www.cs.ruu.nl/rik/advice.html}
}
van der Meulen, E.A. (1994), "Incremental Rewriting". School: University of Amsterdam.
BibTeX:
@phdthesis{Meulen94,
  author = {E. A. van der Meulen},
  title = {Incremental Rewriting},
  school = {University of Amsterdam},
  year = {1994},
  url = {ftp://ftp.cwi.nl/pub/gipe/reports/Meu94.ps.Z}
}
Micallef, J. & Kaiser, G.E. (1994), "Extending Attribute Grammars to Support Programming-in-the-Large", In ACM Transactions on Programming Languages and Systems., September, 1994. Vol. 16, pp. 1572-1612. ACM press.
BibTeX:
@incollection{Micallef94,
  author = {Josephine Micallef and Gail E. Kaiser},
  title = {Extending Attribute Grammars to Support Programming-in-the-Large},
  booktitle = {ACM Transactions on Programming Languages and Systems},
  publisher = {ACM press},
  year = {1994},
  volume = {16},
  pages = {1572--1612}
}
Khalid A. Mughal, John H. Reppy & Søraas, L. (1994), "ML Code Generation for AML specifications", In In Proceedings of the Nordic Workshop on Programming Environments Research (NWPER'94).
BibTeX:
@inproceedings{Mughal94,
  author = {Khalid A. Mughal, John H. Reppy and Lars Søraas},
  title = {ML Code Generation for AML specifications},
  booktitle = {In Proceedings of the Nordic Workshop on Programming Environments Research (NWPER'94)},
  year = {1994}
}
Muthukkaruppan, K. (1994), "Spine: A Synthesizer for Practical Incremental Evaluators". California Berkeley, Technical Report UCB//CSD-94-81, May, 1994.
Abstract: SPINE is a system for efficiently generating practical incremental evaluators based on recursive procedures for the Strongly Non-Circular class of attribute grammars. Several interactive language-based software development environments use incremental evaluation of attribute grammars for context-sensitive static semantic analysis. Ease of evaluator construction, effective consumption of space, applicability to a large class of AGs, ability to handle multiple site attribute tree transformations and close to optimal performance are the key advantages this system offers over other existing incremental AG systems. SPINE has been used innovatively in the Ensemble software environment to provide advanced incremental formatting of documents. As part of this work, an AG-description language, ASPEC, was developed to serve as the presentation (layout) specification tool for Ensemble documents. The ASPEC language provides several powerful default mechanisms that make presentation specifications very concise
BibTeX:
@techreport{Muthukkaruppan94,
  author = {Kannan Muthukkaruppan},
  title = {Spine: A Synthesizer for Practical Incremental Evaluators},
  year = {1994},
  number = {UCB//CSD-94-81},
  url = {ftp://tr-ftp.cs.berkeley.edu/pub/tech-reports/csd/csd-94-819/}
}
Post, K.E. (1994), "ANALYSIS AND TRANSFORMATION OF LOGIC PROGRAMS (Ph.D. Thesis)". University of California, Santa Cruz, Jack Baskin School of Engineering, Technical Report UCSC-CRL-94-38, September, 1994.
Abstract: Logic programming is based on the idea that inference can be viewed as a computation. The fact that both programs and their specifications can be expressed in the same language makes logic programming very useful for program development. But it is also known that clarity and efficiency are two rather incompatible demands to put on a programming language. It is thus important to develop techniques for systematically transforming clear but inefficient programs into efficient (although probably rather opaque) final programs. This thesis contains some contributions that hopefully bring us closer to this goal. Before transformation can take place the input program must be parsed and analyzed to extract properties that are not explicit in the program itself. Parsing is an area of computer science well understood, but with the advent of modern languages, like Prolog and ML, the programmer was able to introduce and change operator symbols. On one hand, operator symbols made the code more readable but it also complicated the parsing job; standard parsing techniques cannot accommodate dynamic grammars. In the first part of this thesis we present an LR parsing methodology, called ``deferred decision parsing", that handles dynamic operator declarations, that is, operators that are declared at run time. It uses a parser generator much like Yacc. Shift/reduce conflicts that involve dynamic operators are resolved at parse time rather than at parser construction time. As an example of our parser generator we present a grammar for Prolog, a language that has been in use for almost twenty years but still lacks a precise formal syntactic definition. The parser generator can also serve as a replacement implementation for Definite Clause Grammars, a novel parsing feature of Prolog. However, an LR parser does not normally support inherited attributes. In the next part of the thesis we present two transformation methods for (strong) non-circular attribute grammars that allows them to be evaluated within the environment of an LR parser. Our methods represent a compromise in that attribute evaluation is normally performed on the fly except when, in some evaluation rule, the referenced attributes are unavailable, and the execution of the rule has to be postponed. Suspension and resumption points for these evaluation rules can either be determined statically (method 1) or dynamically (method 2). For both methods we guarantee that resumption takes place as soon as possible. In the final part of the thesis we present a technique to detect that pairs of rules in a logic program are ``mutually exclusive''. In contrast to previous work our algorithm derives mutual exclusion by looking not only at built-in, but also user-defined predicates. This technique has applications to optimization of the execution of programs containing these rules. Additionally, the programmer is less dependent on non-logical language features, such as Prolog's ``cut'', thus creating more opportunities for parallel execution strategies.
BibTeX:
@techreport{ncstrl.ucsc_cse//UCSC-CRL-94-38,
  author = {Kjell Erik Post},
  title = {ANALYSIS AND TRANSFORMATION OF LOGIC PROGRAMS (Ph.D. Thesis)},
  year = {1994},
  number = {UCSC-CRL-94-38},
  url = {ftp://ftp.cse.ucsc.edu/pub/tr/ucsc-crl-94-38.ps.Z}
}
Paakki, J. (1994), "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. New York, NY, USA., pp. 361-374. ACM Press.
Abstract: An operational semantics for functional logic programs is presented. In such programs, functional terms provide for reduction of expressions, provided that they ground. The semantics is based on multi pass evaluation techniques originally developed for attribute grammars. Program execution is divided into two phases: construction of an incomplete proof tree; and its decoration into a complete proof tree. The construction phase applies a modified SLD resolution scheme, and the decoration phase a partial (multipass) traversal over the tree. The phase partition is generated by static analysis where data dependencies are extracted for the functional elements of the program. The method guarantees that all the functional terms of a program can be evaluated, and no dynamic groundness checks are needed.
BibTeX:
@inproceedings{Paakki94,
  author = {J. Paakki},
  title = {Multi-pass execution of functional logic programs},
  booktitle = {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},
  publisher = {ACM Press},
  year = {1994},
  pages = {361--374}
}
Papakonstantinou, G., Voliotis, C. & Sgouros, N. (1994), "Dependency-directed binding of variables for constraint logic programming", In DEXA 94 International Confrence. Athens, Greece.
BibTeX:
@inproceedings{PapVolSgo94,
  author = {G. Papakonstantinou and C. Voliotis and N. Sgouros},
  title = {Dependency-directed binding of variables for constraint logic programming},
  booktitle = {DEXA 94 International Confrence},
  year = {1994}
}
Pennings, M.C. (1994), "Generating incremental attribute evaluators". School: Computer Science, Utrecht University., November, 1994.
BibTeX:
@phdthesis{Pennings94,
  author = {Maarten C. Pennings},
  title = {Generating incremental attribute evaluators},
  school = {Computer Science, Utrecht University},
  year = {1994},
  url = {ftp://ftp.cs.ruu.nl/pub/RUU/CS/phdtheses/Pennings}
}
Roudet, C. (1994), "Visualisation graphique incrémentale par évaluation d'attributs". Université NICE, 1994.
BibTeX:
@techreport{Roudet94,
  author = {Christophe Roudet},
  title = {Visualisation graphique incrémentale par évaluation d'attributs},
  year = {1994}
}
Roussel, G., Parigot, D. & Jourdan, M. (1994), "Coupling Evaluators for Attribute Coupled Grammars", In 5th Int. Conf. on Compiler Construction (CC' 94). Edinburgh. April 1994. Volume 786, pp. 52-67. Springer-Verlag.
Abstract: Some years ago, the notion of attribute coupled grammars was introduced by Ganzinger and Giegerich, together with descriptional composition. The latter works essentially at the specification level, i.e., it produces an attribute grammar which specifies the composition of two attribute coupled grammars. We introduce a new approach to this composition of attribute coupled grammars. This composition no longer works at the specification level but at the evaluator level. It produces a special kind of attribute evaluator. For this purpose we have introduced the notion of coupling evaluator. The main advantage of this new approach, compared with descriptional composition, is that it is possible to build separately the coupling evaluator of each attribute coupled grammar; in other words it allows real separate compilation of AG modules. Another important advantage is that we do not need to check the attribute grammar class in order to construct the final sequence of evaluators; thus, this construction produces a new sort of evaluator.
BibTeX:
@inproceedings{Roussel94,
  author = {Gilles Roussel and Didier Parigot and Martin Jourdan},
  title = {Coupling Evaluators for Attribute Coupled Grammars},
  booktitle = {5th Int. Conf. on Compiler Construction (CC' 94)},
  publisher = {Springer-Verlag},
  year = {1994},
  volume = {786},
  pages = {52--67},
  note = {scriptsize http://www-sop.inria.fr/members/Didier.Parigot/publications/couplingevaluatorAG.ps.gz},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/couplingevaluatorAG.ps.gz}
}
Roussel, G. (1994), "Algorithmes de base pour la modularité et la réutilisabilité des grammaires attribuées". School: Département d'Informatique, Université de Paris~6., March, 1994.
BibTeX:
@phdthesis{Roussel94a,
  author = {Gilles Roussel},
  title = {Algorithmes de base pour la modularité et la réutilisabilité des grammaires attribuées},
  school = {Département d'Informatique, Université de Paris~6},
  year = {1994},
  note = {scriptsize http://www-sop.inria.fr/members/Didier.Parigot/publications/theses/roussel.ps.gz},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/theses/roussel.ps.gz}
}
Suzuki, M., Katayama, T. & Schlichting, R. (1994), "Implementing Fault-Tolerance with an Attribute and Functional Based Model", In 24th Symp. on Fault-Tolerant Computing. Austin. June 1994., pp. 244-253.
BibTeX:
@inproceedings{Suzuki94,
  author = {M. Suzuki and T. Katayama and R. Schlichting},
  title = {Implementing Fault-Tolerance with an Attribute and Functional Based Model},
  booktitle = {24th Symp. on Fault-Tolerant Computing},
  year = {1994},
  pages = {244--253},
  url = {http://cs.arizona.edu/japan/www/rick.html}
}
Søraas, L. (1994), "Generering av Attribueringsystemer for AML spesifikasjoner". School: University of Bergen., September, 1994.
BibTeX:
@phdthesis{Søraas94,
  author = {Lars Søraas},
  title = {Generering av Attribueringsystemer for AML spesifikasjoner},
  school = {University of Bergen},
  year = {1994},
  url = {http://www.ii.uib.no/arss/hovedoppgave.larss.ps.Z}
}
Uhl, J.S. & Horspool, N. (1994), "Flow Grammars - a Flow Analysis Methodology", In 5th Int. Conf. on Compiler Construction (CC' 94). Edinburgh. April 1994. Volume 786, pp. 203-217. Springer-Verlag.
BibTeX:
@inproceedings{Uhl94,
  author = {James S. Uhl and Nigel Horspool},
  title = {Flow Grammars - a Flow Analysis Methodology},
  booktitle = {5th Int. Conf. on Compiler Construction (CC' 94)},
  publisher = {Springer-Verlag},
  year = {1994},
  volume = {786},
  pages = {203--217},
  url = {http://www.csr.uvic.ca/ñigelh/Publications/flowGrammars.ps.gz}
}
Wilhelm, R. & Maurer, R. (1994), "Les compilateurs - theorie, construction, generation" Masson.
BibTeX:
@book{Wilhelm94,
  author = {Reinhard Wilhelm and R. Maurer},
  title = {Les compilateurs - theorie, construction, generation},
  publisher = {Masson},
  year = {1994}
}
Wills, L.M. (1994), "Using Attributed Flow Graph Parsing to Recognize Programs", In Int. Workshop on Graph Grammars and Their Application to Computer Science. Williamsburg, Virginia. November 1994.
BibTeX:
@inproceedings{Wills94,
  author = {Linda M. Wills},
  title = {Using Attributed Flow Graph Parsing to Recognize Programs},
  booktitle = {Int. Workshop on Graph Grammars and Their Application to Computer Science},
  year = {1994}
}
Andrey, L. (1995), "Protocoles de communication et grammaires attribuées". School: Université de Mancy.
BibTeX:
@phdthesis{Andrey95,
  author = {Laurent Andrey},
  title = {Protocoles de communication et grammaires attribuées},
  school = {Université de Mancy},
  year = {1995},
  url = {http://www.loria.fr/ãndrey/}
}
Andrey, L. & Schaff, A. (1995), "Description and prototyping of OSI protocol entities using attribute grammars". Centre de recherche en Informatique de Mancy, Technical Report 95-R-271, 1995.
BibTeX:
@techreport{Andrey95a,
  author = {Laurent Andrey and André Schaff},
  title = {Description and prototyping of OSI protocol entities using attribute grammars},
  year = {1995},
  number = {95-R-271}
}
Carle, A. & Pollock, L. (1995), "Matching-Based Incremental Evaluators for Hierarchical Attribute Grammar Dialects", #TOPLAS#., March, 1995. Vol. 17(2), pp. 394-429.
BibTeX:
@article{Carle95,
  author = {Alan Carle and Lori Pollock},
  title = {Matching-Based Incremental Evaluators for Hierarchical Attribute Grammar Dialects},
  journal = {#TOPLAS#},
  year = {1995},
  volume = {17},
  number = {2},
  pages = {394--429}
}
Carle, A. & Pollock, L. (1995), "A Context-Based Incremental Evaluator for Hierachical Attribute Grammars", Journal of Programming Languages., March, 1995. Vol. 3
BibTeX:
@article{Carle95a,
  author = {Alan Carle and Lori Pollock},
  title = {A Context-Based Incremental Evaluator for Hierachical Attribute Grammars},
  journal = {Journal of Programming Languages},
  year = {1995},
  volume = {3}
}
Duris, E., Parigot, D. & Jourdan, M. (1995), "Mises à jour destructives dans les grammaires attribuées". INRIA, Technical Report 2686, October, 1995.
Abstract: In the functional language domain, there exist several works on the problem of garbage collection at compile time. In the context of Attribute Grammars, the memory optimisation problem spawned a number of works on the notion of attribute lifetime. We present a method which, in this context, allows to replace some function calls with their destructive counterpart. If we consider the functional program which is equivalent to a given attribute grammar, our technique can be seen as a static method for its update-in-place transformation. This method uses the results obtained on the attribute lifetime notion. One of its features is that it uses only classical static analysis methods for attribute grammars.
BibTeX:
@techreport{Duris95,
  author = {Etienne Duris and Didier Parigot and Martin Jourdan},
  title = {Mises à jour destructives dans les grammaires attribuées},
  year = {1995},
  number = {2686},
  url = {ftp://ftp.inria.fr/INRIA/publication/RR/RR-2686.ps.gz}
}
Economakos, G., Papakonstantinou, G. & Tsanakas, P. (1995), "An Attribute Grammar Approach to High-Level Automated Hardware Synthesis", Information and Software Technology. Vol. 37(9), pp. 493-502.
BibTeX:
@article{Eco95IST,
  author = {G. Economakos and G. Papakonstantinou and P. Tsanakas},
  title = {An Attribute Grammar Approach to High-Level Automated Hardware Synthesis},
  journal = {Information and Software Technology},
  year = {1995},
  volume = {37},
  number = {9},
  pages = {493--502}
}
Economakos, G., Papakonstantinou, G. & Tsanakas, P. (1995), "An Attribute Grammar Approach to the High-Level Automated Hardware Synthesis", Information and Software Technology., January, 1995. Vol. 37(9)
Abstract: Attribute grammars have been used extensively in every phase of traditional compiler construction. Since some of these phases have also been used in automated hardware synthesis (hardware compilation), attribute grammars can be effectively adopted to handle the two major tasks of high level hardware synthesis, operation scheduling and hardware allocation, implementing various algorithms. The paper presents an attribute grammar driven scheduling system, as a more abstract way of handling the whole high level hardware synthesis task, while maintaining the desired functionality by the utilization of existing and well tested tools and techniques transferred from traditional compiler construction
BibTeX:
@article{Economakos95,
  author = {G. Economakos and G. Papakonstantinou and P. Tsanakas},
  title = {An Attribute Grammar Approach to the High-Level Automated Hardware Synthesis},
  journal = {Information and Software Technology},
  year = {1995},
  volume = {37},
  number = {9},
  url = {http://www.dsclab.ece.ntua.gr/eorge/publications.html}
}
Frost, R.A. (1995), "W/AGE The Windsor Attribute Grammar Programming Environment", In Schloss Dagstuhl International Workshop on funtional programming in the Real World. Dagstuhl, Germany.
BibTeX:
@inproceedings{Frost95,
  author = {R. A. Frost},
  title = {W/AGE The Windsor Attribute Grammar Programming Environment},
  booktitle = {Schloss Dagstuhl International Workshop on funtional programming in the Real World},
  year = {1995}
}
Gondow, K. & Katayama, T. (1995), "On formalization of object oriented attribute grammars OOAG and higher order attribute grammars using record calculus". Tokyo Institute of Technology, Technical Report 95TR-0020, 1995.
Abstract: The purpose of this paper is twofold. First we present a denotational semantics of attribute grammars(AGs) by using Cardelli's record calculus. The denotational semantics is simple and natural. In our semantics, an attributed tree is represented by nested records to preserve the structural information of the attributed tree, while in traditional denotational semantics AGs are formalized by either valuation mapping from attributes (often in the root) to their values or mapping from inherited attributes to synthesized attributes in the root. It is a positive characteristic of our semantics to deal with attributed tree as AG's semantics rather than attribute valuation. For the purpose of describing structure-oriented software development environments, many computational models based on AGs have already been proposed. These computational models are usually extended so as to deal with tree transformation. We believe that our semantics can be a good formal basis to define these computational models. To show this, we formalize OOAG(Object-Oriented AGs) and higher order AGs(HAGs) by extending our denotational semantics of AGs. This is the second purpose of this paper. Both of them are computational models to deal with tree transformation depending upon attribute values. As the result of these formalizations, we can formally discuss the differences between OOAG and HAGs. For example, we show that tree transformation in OOAG is modeled as a function to determine the next state, while that in HAGs is just a static tree construction. This paper is the revised English version of "Attribute Grammars as Record Calculus" (Technical Report No.93TR-0047), which is written in Japanese.
BibTeX:
@techreport{Gondow95,
  author = {Katsuhiko Gondow and Takuya Katayama},
  title = {On formalization of object oriented attribute grammars OOAG and higher order attribute grammars using record calculus},
  year = {1995},
  number = {95TR-0020},
  url = {http://www.cs.titech.ac.jp/TR/tr-abst95.html#95TR-0020}
}
Holdsworth, J. & Sloane, A.M. (1995), "Beyond Traditional Program Slicing". Department of Computer Science, James Cook University, Technical Report JCU-CS-95/8, August 1, 1995.
Abstract: Traditional program slices are based on variables and statements. Slices consist of statements that potentially affect (or are affected by) the value of a particular variable at a given statement. Two assumptions are implicit in this definition: 1) that variables and statements are concepts of the programming language in which the program is written, and 2) that slices consist solely of statements. $<$p$>$ Generalised slicing is an extension of traditional slicing where variables are replaced by arbitrary named program entities and statements by arbitrary program constructs. A model of generalised slicing is presented that allows the essence of any slicing tool to be reduced to a node marking process operating on a program syntax tree. Slicing tools can thus be implemented in a straight-forward way as reusable modules using tree-based techniques such as attribute grammars. $<$p$>$ A variety of useful program decompositions are shown to be instances of generalised slicing. Examples include call graph generation and interface extraction. To show the wide applicability of generalised slicing examples are also given of how slicing can enhance understanding of formal compiler specifications and make it possible to create subset language specifications. $<$p$>$
BibTeX:
@techreport{Holdsworth95,
  author = {Jason Holdsworth and Anthony M. Sloane},
  title = {Beyond Traditional Program Slicing},
  year = {1995},
  number = {JCU-CS-95/8},
  url = {http://www.cs.jcu.edu.au/ftp/pub/techreports/95-8.ps.gz}
}
Insalaco, C. & Tracz, W. (1995), "GLUE (Graphical Layout User Environment) User Guide". Loral Federal Systems, Technical Report ADAGE-LOR-94-04A, August, 1995.
Abstract: GLUE along with VAGS (Variational Attribute Grammar System) provide a graphical user interface for configuring/viewing the reference architecture with a multimedia help facility, constraint checker, and design decision rationale capture and playback mechanism.
BibTeX:
@techreport{Insalaco94,
  author = {C. Insalaco and W. Tracz},
  title = {GLUE (Graphical Layout User Environment) User Guide},
  year = {1995},
  number = {ADAGE-LOR-94-04A},
  url = {http://www.owego.com/dssa/lm-docs/LOR9404.ps}
}
Le Bâtard, G. (1995), "Réalisation dans le système FNC-2 d'un traducteur vers ML". IFI, Université de Marne-la-Vallée, July, 1995.
BibTeX:
@techreport{Lebatard95,
  author = {Gilles Le Bâtard},
  title = {Réalisation dans le système FNC-2 d'un traducteur vers ML},
  year = {1995}
}
Liu, Y.A. (1995), "CACHET:An interactive, incremental-attribution-based program transformation system for deriving incremental programs". Cornell University, 1995.
BibTeX:
@techreport{Liu95,
  author = {Yanhong A. Liu},
  title = {CACHET:An interactive, incremental-attribution-based program transformation system for deriving incremental programs},
  year = {1995},
  url = {ftp://ftp.cs.cornell.edu/pub/yanhong/Cachet-KBSE95.ps.Z}
}
Lämmel, R. & Riedewald, G. (1995), "Motivating Operations on Attribute Grammars". Rostocker Informatik-Berichte, November, 1995.
BibTeX:
@techreport{Lämmel95,
  author = {Ralf Lämmel and Günter Riedewald},
  title = {Motivating Operations on Attribute Grammars},
  year = {1995},
  url = {http://www.informatik.uni-rostock.de/~rlaemmel/papers.html}
}
Mernik, M., Korbar, N. & Zumer, V. (1995), "LISA: A Tool for Automatic Language Implementation", ACM SIGPLAN Notices., April, 1995. Vol. 30(4), pp. 71-79.
BibTeX:
@article{Mernik95,
  author = {Marjan Mernik and Nikolaj Korbar and Viljem Zumer},
  title = {LISA: A Tool for Automatic Language Implementation},
  journal = {ACM SIGPLAN Notices},
  year = {1995},
  volume = {30},
  number = {4},
  pages = {71--79},
  url = {http://marcel.uni-mb.si/nikolaj/sigplan.htm}
}
Mößle, A. & Vogler, H. (1995), "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..
BibTeX:
@inproceedings{Moble95,
  author = {Andrea Mößle and Heiko Vogler},
  title = {Efficient Call-by-value Evaluation Strategy of Primitive Recursive Program Schemes},
  booktitle = {Proceedings of the Fuji International Workshop in Functional and Logic Programming},
  publisher = {World Scientific Publishing Co. Pte Ltd.},
  year = {1995},
  url = {http://orchid.inf.tu-dresden.de/gdp/Fuji_FunLogProgr.ps.gz}
}
Mughal, K.A. & Søraas, L. (1995), "Attribute Evaluation using Neighbour Functions". Dept. of Informatics, University of Bergen, Technical Report 112, December, 1995.
BibTeX:
@techreport{Mughal95,
  author = {Khalid A. Mughal and Lars Søraas},
  title = {Attribute Evaluation using Neighbour Functions},
  year = {1995},
  number = {112},
  url = {ftp://ftp.ii.uib.no/pub/aml/TR.112.dec.95.ps.Z}
}
Nitta, T. (1995), "Construction of Compiler Generator based on the Attribute Grammar and Object-Oriented Language". School: Watanabe Laboratory.
Abstract: Present compiler generators have several problems. First, there are many restrictions in describing the specifications of compilers. Secondly, compilers generated by present compiler generators are hard to read. In this paper, we propose a compiler generator based on the attribute grammar and an object-oriented language. Compilers generated by the proposed method have the following properties: (1) a syntactic tree is constructed before evaluating attributes, (2) a top-down parsing without backtracking and left-recursion is used. By these properties, the class of attribute grammars acceptable by the compiler generator is larger than that of L-attribute grammars, and the readability of the generated compilers is better than that of compilers generated by other generators.
BibTeX:
@mastersthesis{Nitta95,
  author = {Tetsuya Nitta},
  title = {Construction of Compiler Generator based on the Attribute Grammar and Object-Oriented Language},
  school = {Watanabe Laboratory},
  year = {1995},
  url = {http://wonder2.aist-nara.ac.jp/mthesis95-e.html#tetuya-n}
}
Paakki, J. (1995), "Attribute Grammar Paradigms --- A High-Level Methodology in Language Implementation", ACM Computing Surveys., June, 1995. Vol. 27(2), pp. 196-255.
BibTeX:
@article{Paakki95,
  author = {Jukka Paakki},
  title = {Attribute Grammar Paradigms --- A High-Level Methodology in Language Implementation},
  journal = {ACM Computing Surveys},
  year = {1995},
  volume = {27},
  number = {2},
  pages = {196--255}
}
Parigot, D., Duris, E., Roussel, G. & Jourdan, M. (1995), "Attribute Grammars: a Declarative Functional Language". INRIA, Technical Report 2662, October, 1995.
Abstract: Although Attribute Grammars were introduced thirty years ago, their lack of expressiveness has resulted in limited use outside the domain of static language processing. In this paper we show that it is possible to extend this expressiveness. We claim that Attribute Grammars can be used to describe computations on structures that are not just trees, but also on abstractions allowing for infinite structures. To gain this expressiveness, we introduce two new notions: scheme productions and conditional productions. The result is a language that is comparable in power to most first-order functional languages, with a distinctive declarative character. Our extensions deal with a different part of the Attribute Grammar formalism than what is used in most works on Attribute Grammars, including global analysis and evaluator generation. Hence, most existing results are directly applicable to our extended Attribute Grammars, including efficient implementation (in our case, using the FNC-2 system http://www-rocq.inria.fr/oscar/www/fnc2/ for more information.)
BibTeX:
@techreport{Parigot95a,
  author = {Didier Parigot and Etienne Duris and Gilles Roussel and Martin Jourdan},
  title = {Attribute Grammars: a Declarative Functional Language},
  year = {1995},
  number = {2662},
  url = {ftp://ftp.inria.fr/INRIA/publication/RR/RR-2662.ps.gz}
}
Parigot, D., Duris, E., Roussel, G. & Jourdan, M. (1995), "Les grammaires attribuées: un langage fonctionnel déclaratif", In journées du GDR de programmation. Grenoble. November 1995.
Abstract: Bien que les Grammaires Attribuées aient été introduites il y a trente ans, leur manque de pouvoir d'expression les a confinées dans le domaine du traitement des langages de programmation. Dans cet article, nous montrons qu'il est possible d'étendre cette expressivité. Nous soutenons que les Grammaires Attribuées peuvent être utilisées pour décrire des calculs sur des structures qui ne sont pas uniquement des arbres, mais aussi des formes abstraites permettant de décrire des structures infinies. Afin d'atteindre cette expressivité, nous avons introduit deux nouvelles notions: les schémas de productions et les productions conditionnelles. Nous obtenons ainsi un langage dont le pouvoir d'expression est comparable à celui de la plupart des langages fonctionnels du premier ordre, avec un côté déclaratif beaucoup plus marqué. Nos extensions ne remettent pas en cause les bases du formalisme des Grammaires Attribuées sur lesquelles reposent la plupart des travaux concernant celles-ci, en particulier l'analyse statique et la génération d'évaluateurs. Ainsi, les résultats existants peuvent être appliqués directement à nos Grammaires Attribuées étendues, entre autre ceux permettant une implantation efficace (dans notre cas, en utilisant notre système FNC-2). L'intérêt de ces extensions est de redonner aux Grammaires Attribuées leur expressivité intrinsèque. De plus, elles nous permettent d'envisager de nouveaux axes de recherche en comparant nos techniques d'analyses à celles qui ont été développées dans des formalismes de même expressivité.
BibTeX:
@inproceedings{Parigot95b,
  author = {Didier Parigot and Etienne Duris and Gilles Roussel and Martin Jourdan},
  title = {Les grammaires attribuées: un langage fonctionnel déclaratif},
  booktitle = {journées du GDR de programmation},
  year = {1995},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/gdr95.ps.gz}
}
Roussel, G., Parigot, D. & Jourdan, M. (1995), "Static and Dynamic Coupling Attribute Evaluators". INRIA, Technical Report 2670, October, 1995.
Abstract: Several years ago, the notion of attribute coupled grammars was introduced by Ganzinger and Giegerich, together with their descriptional composition. The latter works essentially at the specification level, i.e., it produces an attribute grammar which specifies the composition of two attribute coupled grammars. We introduce a new approach to this composition of attribute coupled grammars. It no longer works at the specification level but rather at the evaluator level. It produces a special kind of attribute evaluator, called coupling evaluator. We present both a static version and a dynamic version of coupling evaluators. Both versions retain the good property of descriptional composition that intermediate trees are not physically constructed. In addition---and this is the main advantage of our approach, compared with descriptional composition---, it is possible to build separately the dynamic coupling evaluator of each attribute coupled grammar; in other words we achieve real separate compilation of AG modules.
BibTeX:
@techreport{Roussel95,
  author = {Gilles Roussel and Didier Parigot and Martin Jourdan},
  title = {Static and Dynamic Coupling Attribute Evaluators},
  year = {1995},
  number = {2670},
  url = {ftp://ftp.inria.fr/INRIA/publication/RR/RR-2670.ps.gz}
}
Sassa, M., Ishizuka, H. & Nakata, I. (1995), "Rie, a Compiler Generator Based on a One-pass-type Attribute Grammar", Software Practice and Experience., March, 1995. Vol. 25(3), pp. 229-250.
BibTeX:
@article{Sassa95,
  author = {M. Sassa and H. Ishizuka and I. Nakata},
  title = {Rie, a Compiler Generator Based on a One-pass-type Attribute Grammar},
  journal = {Software Practice and Experience},
  year = {1995},
  volume = {25},
  number = {3},
  pages = {229--250}
}
Walz, J.A. & Johnson, G.F. (1995), "Inductive Attribute Grammars: A Basis for Incremental Program Execution", Acta Informatica. Vol. 32(2), pp. 117-144.
BibTeX:
@article{WalzJ95,
  author = {Janet A. Walz and Gregory F. Johnson},
  title = {Inductive Attribute Grammars: A Basis for Incremental Program Execution},
  journal = {Acta Informatica},
  year = {1995},
  volume = {32},
  number = {2},
  pages = {117--144}
}
Wilhelm, R. & Maurer, R. (1995), "Compiler Design" Addison Wesley.
BibTeX:
@book{Wilhelm95,
  author = {Reinhard Wilhelm and R. Maurer},
  title = {Compiler Design},
  publisher = {Addison Wesley},
  year = {1995}
}
Wu, P.-C. & Wang, F.-J. (1995), "A Worst Case of Circularity Test Algorithms for Attribute Grammars", #TOPLAS#., March, 1995. Vol. 17(2), pp. 228-232.
BibTeX:
@article{Wu95,
  author = {Pei-Chi Wu and Feng-Jian Wang},
  title = {A Worst Case of Circularity Test Algorithms for Attribute Grammars},
  journal = {#TOPLAS#},
  year = {1995},
  volume = {17},
  number = {2},
  pages = {228--232}
}
Andrey, L. & Schaff, A. (1996), "Description et prototypage d'entité de protocole OSI par grammaire attribuées". Centre de recherche en Informatique de Mancy, 1996.
BibTeX:
@techreport{Andrey96,
  author = {Laurent Andrey and André Schaff},
  title = {Description et prototypage d'entité de protocole OSI par grammaire attribuées},
  year = {1996},
  url = {http://www.loria.fr/ãndrey/rir.ps}
}
Attali, I. (1996), "Sémantique Naturelle: Evaluation et Expressivité". School: Université de Nice Sophia Antipolis.
BibTeX:
@phdthesis{Attali96,
  author = {Isabelle Attali},
  title = {Sémantique Naturelle: Evaluation et Expressivité},
  school = {Université de Nice Sophia Antipolis},
  year = {1996},
  url = {http://www.inria.fr/croap/personnel/Isabelle.Attali}
}
Batory, D. & Geraci, B.J. (1996), "Validating Component Compositions in Software System Generators", In International Conference on Software Reuse. Florida.
Abstract: Generators synthesize software systems by composing components from reuse libraries. In general, not all syntactically correct compositions are semantically correct. In this paper, we present domain-independent algorithms for the GenVoca model of software generators to validate component compositions. Our work relies on attribute grammars and offers powerful debugging capabilities with explanation-based error reporting. We illustrate our approach by showing how compositions are debugged by a GenVoca generator for container data structures.
BibTeX:
@inproceedings{Batory96,
  author = {Don Batory and Bart J. Geraci},
  title = {Validating Component Compositions in Software System Generators},
  booktitle = {International Conference on Software Reuse},
  year = {1996},
  url = {http://www.cs.utexas.edu/users/schwartz/pub.htm}
}
Bloem, R. (1996), "Attribute Grammars and Monadic Second Order Logic". School: Leiden University. Leiden, The Netherlands, August, 1996.
Abstract: It is shown that formulas in monadic second order logic (MSO) with one free variable can be mimicked by attribute grammars with a designated boolean attribute and vice versa. We prove that MSO formulas with two free variables have the same power in defining binary relations on nodes of a tree as regular path languages have. For graphs in general, MSO formulas turn out to be stronger. We also compare path languages against the routing languages of Klarlund and Schwartzbach. We compute the complexity of evaluating MSO formulas with free variables, especially in the case where there is a dependency between free variables of the formula. Last, it is proven that MSO tree transducers have the same strength as attributed tree transducers with the single use requirement and flags
BibTeX:
@phdthesis{Bloem96,
  author = {Roderick Bloem},
  title = {Attribute Grammars and Monadic Second Order Logic},
  school = {Leiden University},
  year = {1996},
  url = {ftp://ftp.wi.leidenuniv.nl/pub/CS/MScTheses/bloem.96.ps.gz}
}
Boyland, J. (1996), "Conditional Attribute Grammars", #TOPLAS#., January, 1996. Vol. 18(1), pp. 73-108.
Abstract: Attribute grammars are a useful formalism for the specification of computations on structured terms. The classical definition of attribute grammars, however, has no way of treating conditionals nonstrictly. Consequently, the natural way of expressing many otherwise well-behaved computations involves a circularity. This article presents conditional attribute grammars, and extension of attribute grammars that enables more precise analysis of conditionals. In conditional attribute grammars, attribute equations may have guards. Equations are active only when their guards are satisfied. The standard attribute grammar evaluation classes are definable for conditional attribute grammars, and the corresponding evaluation techniques can be easily adapted. However, determining membership in standard evaluation classes such as 1-SWEEP, OAG, and SNC is NP-hard.
BibTeX:
@article{Boyland96,
  author = {John Boyland},
  title = {Conditional Attribute Grammars},
  journal = {#TOPLAS#},
  year = {1996},
  volume = {18},
  number = {1},
  pages = {73--108}
}
Boyland, J.T. (1996), "Descriptional Composition of Compiler Components". School: University of California, Berkeley., September, 1996.
BibTeX:
@phdthesis{boyland:96phd,
  author = {John Tang Boyland},
  title = {Descriptional Composition of Compiler Components},
  school = {University of California, Berkeley},
  year = {1996},
  note = {Available as technical report UCB//CSD-96-916},
  url = {http://cs-tr.cs.berkeley.edu:80/Dienst/UI/2.0/Describe/ncstrl.ucb%2fcsd-96-916?abstract=}
}
Carle, A. & Pollock, L. (1996), "On the Optimality of Change Propagation for Incremental Evaluation of Hierarchical Attribute Grammars", #TOPLAS#. Vol. 18(1)
BibTeX:
@article{Carle96,
  author = {Alan Carle and Lori Pollock},
  title = {On the Optimality of Change Propagation for Incremental Evaluation of Hierarchical Attribute Grammars},
  journal = {#TOPLAS#},
  year = {1996},
  volume = {18},
  number = {1}
}
Correnson, L. (1996), "Généricité dans les Grammaires Attribuées". École Polytechnique, 1996.
BibTeX:
@techreport{Correnson96,
  author = {Loïc Correnson},
  title = {Généricité dans les Grammaires Attribuées},
  year = {1996},
  note = {scriptsize http://www-sop.inria.fr/members/Didier.Parigot/publications/Rapport/correnso.ps.gz},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/Rapport/correnso.ps.gz}
}
Dumant, B. (1996), "Analyses statiques en programmation logique avec contraintes". School: Paris 7.
BibTeX:
@phdthesis{Dumant96,
  author = {Bruno Dumant},
  title = {Analyses statiques en programmation logique avec contraintes},
  school = {Paris 7},
  year = {1996}
}
Duris, E., Parigot, D., Roussel, G. & Jourdan, M. (1996), "Attribute Grammars and Folds: Generic Control Operators". INRIA, Technical Report 2957, August, 1996.
Abstract: Generic control operators, such as fold, have been introduced in functional programming to increase the power and applicability of data-structure-based transformations. This is achieved by making the structure of the data more explicit in program specifications. We argue that this very important property is one of the original concepts of attribute grammars. In this paper, we informally show the similarities between the fold formalism and attribute grammar specifications. We also compare their respective method to eliminate the intermediate data structures introduced by function composition (notion of deforestation or fusion): the normalization algorithm for programs expressed with folds and the descriptional composition of attribute grammars. Rather than identify the best way to achieve deforestation, the main goal of this paper is merely to intuitively present two programming paradigms to each other's supporting community and provide an unbiased account of their similarities and differences, in the hope that this leads to fruitful cross-fertilization.
BibTeX:
@techreport{Duris96,
  author = {Etienne Duris and Didier Parigot and Gilles Roussel and Martin Jourdan},
  title = {Attribute Grammars and Folds: Generic Control Operators},
  year = {1996},
  number = {2957},
  url = {ftp://ftp.inria.fr/INRIA/publication/RR/RR-2957.ps.gz}
}
Duris, E., Parigot, D., Roussel, G. & Jourdan, M. (1996), "Grammaires Attribuées et Folds: Opérateurs de Contrôle Génériques", In journées du GDR de programmation. Orléans.
Abstract: Les opérateurs de contrôle génériques tels que fold ont été introduits en programmation fonctionnelle pour augmenter la puissance et le champ d'application des transformations fondées sur la structure des données. Ceci est possible en rendant cette structure plus explicite dans la spécification des programmes. Nous considérons que cette caractéristique fondamentale est l'un des concepts de base des grammaires attribuées. Dans cet article, nous exposons informellement les similitudes qui existent entre le formalisme du fold et la spécification par grammaires attribuées. Nous comparons également leurs méthodes respectives d'élimination des structures intermédiaires introduites lors de la composition de fonctions (notion de déforestation ou de fusion): l'algorithme de normalisation pour les programmes exprimés à l'aide de folds et la composition descriptionnelle pour les grammaires attribuées. Le but principal de cet article est de présenter intuitivement chacun de ces deux paradigmes, ainsi que leurs similitudes qui offrent des possibilités de fertilisation croisée.
BibTeX:
@inproceedings{Duris96a,
  author = {Etienne Duris and Didier Parigot and Gilles Roussel and Martin Jourdan},
  title = {Grammaires Attribuées et Folds: Opérateurs de Contrôle Génériques},
  booktitle = {journées du GDR de programmation},
  year = {1996},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/gdr96.ps.gz}
}
Frost, R.A. & Szydlowski, B. (1996), "Memoizing purely-functional top-down backtracking language processors". University of Windsor, 1996.
BibTeX:
@techreport{Frost96,
  author = {R. A. Frost and Barbara Szydlowski},
  title = {Memoizing purely-functional top-down backtracking language processors},
  year = {1996},
  url = {ftp://ftp.cs.uwindsor.ca/pub/wage}
}
Ghani, A.A. & Hunter, R.B. (1996), "An Attribute Grammar Approach to Specifying Halstead's Metrics", Malaysian Journal of Computer Science. Vol. 9
BibTeX:
@article{Ghani96,
  author = {A. A Ghani and R. B. Hunter},
  title = {An Attribute Grammar Approach to Specifying Halstead's Metrics},
  journal = {Malaysian Journal of Computer Science},
  year = {1996},
  volume = {9}
}
Green, E.A., Viswanathan, M. & Krishnamoorthy, M.S. (1996), "Document Recognition: An Attribute Grammar Approach", In IS & T / SPIE Symposium on Electronic Imaging. January 1996.
BibTeX:
@inproceedings{Green96,
  author = {Edward A. Green and M. Viswanathan and M. S. Krishnamoorthy},
  title = {Document Recognition: An Attribute Grammar Approach},
  booktitle = {IS & T / SPIE Symposium on Electronic Imaging},
  year = {1996},
  url = {http://tardis.union.edu/reene/resume1.html}
}
Kutter, P.W. & Pierantonio, A. (1996), "Montages: Unified Static and Dynamic Semantics of Programming Languages". Universita de L'Aquila, Technical Report 118, July, 1996.
BibTeX:
@techreport{Kutter96,
  author = {Philipp W. Kutter and Alfonso Pierantonio},
  title = {Montages: Unified Static and Dynamic Semantics of Programming Languages},
  year = {1996},
  number = {118},
  url = {http://www.kestrel.edu/HTML/publications.html}
}
Kókai, G., Alexin, Z. & Gyimóthy, T. (1996), "Analyzing and Learning ECG Waveforms", In The Sixth International Workshop on Inductive Logic Programming (ILP'96). Stockholm, Sweden., pp. 152-171.
Abstract: The PECG system contains three main parts: the ECG processing, the IDT and graphic viewer modules. It is based on an attribute grammar approach of ECG waveform analysis published by Skordalakis.
BibTeX:
@inproceedings{Kókai,
  author = {G. Kókai and Z. Alexin and T. Gyimóthy},
  title = {Analyzing and Learning ECG Waveforms},
  booktitle = {The Sixth International Workshop on Inductive Logic Programming (ILP'96)},
  year = {1996},
  pages = {152--171},
  url = {http://www.inf.u-szeged.hu/okai/pecg.html}
}
Leibovitsch, S. (1996), "Relations entre la sémantique dénotationnelle et les grammaires attribuées". Université de Paris~VII, September, 1996.
BibTeX:
@techreport{Leibovitsch96,
  author = {Stéphane Leibovitsch},
  title = {Relations entre la sémantique dénotationnelle et les grammaires attribuées},
  year = {1996},
  note = {scriptsize http://www-sop.inria.fr/members/Didier.Parigot/publications/Rapport/leibovit.ps.gz},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/Rapport/leibovit.ps.gz}
}
Mernik, N.K.M. & Zumer, V. (1996), "Object-Oriented Evaluation Paradigm in Attribute Grammar-Based", Computing and Information., June, 1996. Vol. 2(1)
BibTeX:
@article{Mernik96,
  author = {Nikolaj Korbar Marjan Mernik and Vijem Zumer},
  title = {Object-Oriented Evaluation Paradigm in Attribute Grammar-Based},
  journal = {Computing and Information},
  year = {1996},
  volume = {2},
  number = {1},
  url = {http://phoenix.trentu.ca/jci/papers/icci96/E120/P001.html}
}
Mughal, K.A. & Søraas, L. (1996), "Yet Another Attribute Evaluator based on Recursive Functions", In Proceedings of the Nordic Workshop on Programming Environments Research (NWPER'96). Aalborg, Danmark. June 1996., pp. 335-344.
Abstract: In this paper we present an approach to attribute evaluation based on recursive neighbour functions, which is different from what has been reported in the literature. The approach is valid for simple multi-visit attribute grammars. Neighbour functions, comprising of visit and suspend functions, allow attribute evaluation to start at the node of subtree replacement, and the approach can readily be extended to implement incremental attribute evaluation.
BibTeX:
@inproceedings{Mughal96,
  author = {Khalid A. Mughal and Lars Søraas},
  title = {Yet Another Attribute Evaluator based on Recursive Functions},
  booktitle = {Proceedings of the Nordic Workshop on Programming Environments Research (NWPER'96)},
  year = {1996},
  pages = {335--344},
  url = {ftp://ftp.ii.uib.no/pub/aml/NWPER.96.ps.Z}
}
Murer, T. .., Würtz, A., Scherer, D. & Schweizer, D. (1996), "GIPSY: Generating Integrated Process Support Systems - Project Overview". Swiss Federal Institute of Technology Zurick, December, 1996.
Abstract: Cooperative software engineering requires integration of a distributed and heterogeneous world of actors and resources. Component technology will augment integration problems due to distributed development of large numbers of interoperating components. Extensible Attribute Grammars (EAG) are used for the specification and generation of highly integrated tool components that support the software process. Tool components are plugged into a process support framework which allows for the distributed definition and enactment of a software process. A common understanding of the process is provided by a 3D process model which supports tool integration on a high level so that developers perceive the tools as a homogeneous environment
BibTeX:
@techreport{Murer96,
  author = {T . Murer and A. Würtz and D. Scherer and D. Schweizer},
  title = {GIPSY: Generating Integrated Process Support Systems - Project Overview},
  year = {1996},
  url = {ftp://ftp.tik.ee.ethz.ch/pub/publications/TIK-Report22.ps.gz}
}
Parigot, D., Duris, E., Roussel, G. & Jourdan, M. (1996), "Les grammaires attribuées: un langage fonctionnel déclaratif", In Journées Francophones des Langages Applicatifs. Val-Morin, Québec. January 1996., pp. 263-279.
Abstract: Bien que les Grammaires Attribuées aient été introduites il y a trente ans, leur manque de pouvoir d'expression les a confinées dans le domaine du traitement des langages de programmation. Dans cet article, nous montrons qu'il est possible d'étendre cette expressivité. Nous soutenons que les Grammaires Attribuées peuvent être utilisées pour décrire des calculs sur des structures qui ne sont pas uniquement des arbres, mais aussi des formes abstraites permettant de décrire des structures infinies. Afin d'atteindre cette expressivité, nous avons introduit deux nouvelles notions: les schémas de productions et les productions conditionnelles. Nous obtenons ainsi un langage dont le pouvoir d'expression est comparable à celui de la plupart des langages fonctionnels du premier ordre, avec un côté déclaratif beaucoup plus marqué. Nos extensions ne remettent pas en cause les bases du formalisme des Grammaires Attribuées sur lesquelles reposent la plupart des travaux concernant celles-ci, en particulier l'analyse statique et la génération d'évaluateurs. Ainsi, les résultats existants peuvent être appliqués directement à nos Attribute Grammars étendues, entre autre ceux permettant une implantation efficace (dans notre cas, en utilisant notre système FNC-2). L'intérêt de ces extensions est de redonner aux Grammaires Attribuées leur expressivité intrinsèque. De plus, elles nous permettent d'envisager de nouveaux axes de recherche en comparant nos techniques d'analyses à celles qui ont été développées dans des formalismes de même expressivité.
BibTeX:
@inproceedings{Parigot95,
  author = {Didier Parigot and Etienne Duris and Gilles Roussel and Martin Jourdan},
  title = {Les grammaires attribuées: un langage fonctionnel déclaratif},
  booktitle = {Journées Francophones des Langages Applicatifs},
  year = {1996},
  pages = {263--279},
  note = {scriptsize http://www-sop.inria.fr/members/Didier.Parigot/publications/jfla96.ps.gz},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/jfla96.ps.gz}
}
Parigot, D., Roussel, G., Jourdan, M. & Duris, E. (1996), "Dynamic Attribute Grammars". INRIA, Technical Report 2881, May, 1996.
Abstract: Although Attribute Grammars were introduced long ago, their lack of expressiveness has resulted in limited use outside the domain of static language processing. With the new notion of Dynamic Attribute Grammars defined on top of Grammar Couples, informally presented in a previous paper, we show that it is possible to extend this expressiveness and to describe computations on structures that are not just trees, but also on abstractions allowing for infinite structures. The result is a language that is comparable in power to most first-order functional languages, with a distinctive declarative character. In this paper, we give a formal definition of Dynamic Attribute Grammars and show how to construct efficient visit-sequence-based evaluators for them, using traditional, well-established AG techniques (in our case, using the FNC-2 system). The major contribution of this approach is to restore the intrinsic power of Attribute Grammars and re-emphasize the effectiveness of analysis and implementation techniques developed for them.
BibTeX:
@techreport{Parigot96,
  author = {Didier Parigot and Gilles Roussel and Martin Jourdan and Etienne Duris},
  title = {Dynamic Attribute Grammars},
  year = {1996},
  number = {2881},
  url = {ftp://ftp.inria.fr/INRIA/publication/RR/RR-2881.ps.gz}
}
Parigot, D., Roussel, G., Jourdan, M. & Duris, E. (1996), "Dynamic Attribute Grammars", In Int. Symp. on Progr. Languages, Implementations, Logics and Programs (PLILP'96). Aachen. September 1996. Volume 1140, pp. 122-136. Springer-Verlag.
Abstract: Although Attribute Grammars were introduced long ago, their lack of expressiveness has resulted in limited use outside the domain of static language processing. With the new notion of Dynamic Attribute Grammars defined on top of Grammar Couples, we show that it is possible to extend this expressiveness and to describe computations on structures that are not just trees, but also on abstractions allowing for infinite structures. The result is a language that is comparable in power to most first-order functional languages, with a distinctive declarative character. In this paper, we give a formal definition of Dynamic Attribute Grammars and show how to construct efficient visit-sequence-based evaluators for them, using traditional, well-established AG techniques (in our case, using the FNC-2 system)
BibTeX:
@inproceedings{Parigot96a,
  author = {Didier Parigot and Gilles Roussel and Martin Jourdan and Etienne Duris},
  title = {Dynamic Attribute Grammars},
  booktitle = {Int. Symp. on Progr. Languages, Implementations, Logics and Programs (PLILP'96)},
  publisher = {Springer-Verlag},
  year = {1996},
  volume = {1140},
  pages = {122--136},
  note = {scriptsize http://www-sop.inria.fr/members/Didier.Parigot/publications/plilp96.ps.gz},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/plilp96.ps.gz}
}
(1996), "Le Grammatiche ad Attributi: Semantica dei Linguaggi artificiali" Milano Città Studi Ed..
BibTeX:
@book{Reghizzi96,,
  title = {Le Grammatiche ad Attributi: Semantica dei Linguaggi artificiali},
  publisher = {Città Studi Ed.},
  year = {1996},
  note = {(in Italian) (Attribute Grammars: Semantic of artificial Languages)}
}
Renault, S. (1996), "Verification de programmes normaux". School: Université d'Orléans-LIFO.
BibTeX:
@phdthesis{Renault96,
  author = {Sophie Renault},
  title = {Verification de programmes normaux},
  school = {Université d'Orléans-LIFO},
  year = {1996}
}
Ridoux, O. (1996), "Engineering Transformations of Attributed Grammars in LambdaProlog". IRISA Rennes, 1996.
BibTeX:
@techreport{Ridoux96,
  author = {Olivier Ridoux},
  title = {Engineering Transformations of Attributed Grammars in LambdaProlog},
  year = {1996},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/www/fnc2/Postscript/Ridoux96.ps}
}
Sloane, A.M. & Holdsworth, J. (1996), "Beyond Traditional Program Slicing", In the International Symposium on Software Testing and Analysis. San Diego, CA. January 1996., pp. 180-186. ACM Press.
BibTeX:
@inproceedings{Sloane96,
  author = {Anthony M. Sloane and Jason Holdsworth},
  title = {Beyond Traditional Program Slicing},
  booktitle = {the International Symposium on Software Testing and Analysis},
  publisher = {ACM Press},
  year = {1996},
  pages = {180--186},
  url = {http://www.comp.mq.edu.au/~asloane/pubs.html}
}
Suzuki, M., Katayama, T. & Schlichting, R. (1996), "FTAG: A Functional and Attribute Based Model for Writing Fault-Tolerant Software". Arizona University, Computer Science, Technical Report TR96-05, 1996.
BibTeX:
@techreport{Suzuki96,
  author = {Masato Suzuki and Takuya Katayama and Richard Schlichting},
  title = {FTAG: A Functional and Attribute Based Model for Writing Fault-Tolerant Software},
  year = {1996},
  number = {TR96-05},
  url = {http://www.cs.arizona.edu/research/reports.html}
}
Thanos, A. (1996), "A Grammatical Approach to Parallel Logic Programming for Expressing Software Evolution Reasoning", In 3rd CAiSE 96 Doctoral Consortium. Heraklion, Greece. May 20-21 1996.
BibTeX:
@inproceedings{Thanos96,
  author = {A. Thanos},
  title = {A Grammatical Approach to Parallel Logic Programming for Expressing Software Evolution Reasoning},
  booktitle = {3rd CAiSE 96 Doctoral Consortium},
  year = {1996}
}
Vivien, B. (1996), "Etude du système Syntax/FNC-2 pour la génération de compilateur". Conservatoire national des arts et metiers, Grenoble, 1996.
BibTeX:
@techreport{Vivien96,
  author = {Bruno Vivien},
  title = {Etude du système Syntax/FNC-2 pour la génération de compilateur},
  year = {1996},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/www/fnc2/Postscript/Vivien96.ps}
}
Voliotis, C., Sgouros, N. & Papakonstantinou, G. (1996), "Attribute grammar based modeling of concurrent constraint logic programming", International Journal on Artificial Intelligence Tools. Vol. 4(3), pp. 383-411.
BibTeX:
@article{Voliotis96,
  author = {C. Voliotis and N. Sgouros and G. Papakonstantinou},
  title = {Attribute grammar based modeling of concurrent constraint logic programming},
  journal = {International Journal on Artificial Intelligence Tools},
  year = {1996},
  volume = {4},
  number = {3},
  pages = {383--411},
  url = {http://www.dsclab.ece.ntua.gr/dsclab_recent_publication.htm}
}
van Vugt, N. (1996), "Generalized Context-Free Grammars". School: Leiden University. Leiden, The Netherlands
Abstract: We consider several language generating formalisms from the literature, such as string-valued attribute grammars with only s-attributes, parallel multiple context-free grammars, relational grammars and top-down tree-to-string transducers, of which we have chosen the OnlyS string-valued attribute grammars to be our vantage point. We prove that OnlyS string-valued attribute grammars, parallel multiple context-free grammars and relational grammars generate the same class of languages, and we prove that every language accepted by an OnlyS string-valued attribute grammar is the image of a top-down tree-to-string transducer. The main result of this thesis is the proof of equivalence of the special string-valued attribute grammars, the multiple context-free grammar, the special relational grammar and the finite copying top-down tree-to-string transducer. In order to prove these equivalences, definitions of some of these formalisms have been slightly modified, and normal forms have been (re)defined and proven
BibTeX:
@phdthesis{Vugt96,
  author = {N. van Vugt},
  title = {Generalized Context-Free Grammars},
  school = {Leiden University},
  year = {1996},
  url = {ftp://ftp.wi.leidenuniv.nl/pub/CS/MScTheses/vvugt.96.ps.gz}
}
Adorni, A.P.G. & Ferrari, G. (1997), "Attribute Grammars as a Robust Technical Basis for a Human-Computer Interaction General Purpose Architecture", Int. Journal of Human-Computer Studies. Vol. 47, pp. 531-563.
Abstract: In this paper, we present a Natural Language Interface (NLI), which combines some of the advantages of using general purpose grammars with some of the features found in semantic grammars. This is achieved by an Attribute Grammar so as to create an intermediate representation which is interpreted in terms of domain-specific routines. NLI has been used as a component of a Man-Machine Interaction (MMI) system, working on different domains. After a discussion of the theory underlying the system, two examples of the use of NLI on practical domains are described: the first is in the field of three-dimensional scene generations, the second in the field of road map car planning. Some evaluation issues are also included in this paper.
BibTeX:
@article{Adorni97,
  author = {A. Poggi G. Adorni and G. Ferrari},
  title = {Attribute Grammars as a Robust Technical Basis for a Human-Computer Interaction General Purpose Architecture},
  journal = {Int. Journal of Human-Computer Studies},
  year = {1997},
  volume = {47},
  pages = {531--563}
}
Alexin, Z., Gyimóthy, T. & Boström, H. (1997), "IMPUT: An Interactive Learning Tool Based on Program Specialization", Intelligent Data Analysis IDA., October, 1997. Vol. 1(4)
Abstract: The algorithm SPECTRE specializes logic programs with respect to positive and negative examples by applying the transformation rule unfolding together with clause removal. The method IMPUT presented in this paper gives a modified version of this algorithm by integrating the algorithmic debugging system IDTS with SPECTRE. The main idea of the IMPUT method, is that the identification of a clause to be unfolded has a crucial importance on the effectiveness of the specialization process. The debugging system IDTS is used to identify this buggy clause.
BibTeX:
@article{Alexin,
  author = {Zoltán Alexin and Tibor Gyimóthy and Henrik Boström},
  title = {IMPUT: An Interactive Learning Tool Based on Program Specialization},
  journal = {Intelligent Data Analysis IDA},
  year = {1997},
  volume = {1},
  number = {4},
  note = {published by Elsevier Science Inc},
  url = {http://www-east.elsevier.com/ida/browse/0104/ida00015/ida00015.htm}
}
Bjarnason, E. & Hedin, G. (1997), "Tool Support for Framework-Specific Language Extensions", In Object-Oriented Technology. ECOOP'97 Workshop Reader. Volume 1357, pp. 137-140. Springer Verlag.
BibTeX:
@inproceedings{Bjarnason97,
  author = {E. Bjarnason and Görel Hedin},
  title = {Tool Support for Framework-Specific Language Extensions},
  booktitle = {Object-Oriented Technology. ECOOP'97 Workshop Reader},
  publisher = {Springer Verlag},
  year = {1997},
  volume = {1357},
  pages = {137--140}
}
Chambre, P. (1997), "Contribution à la validation de programmes concurrents avec contraintes". School: Orléans-LIFO.
BibTeX:
@phdthesis{Chambre97,
  author = {Pascal Chambre},
  title = {Contribution à la validation de programmes concurrents avec contraintes},
  school = {Orléans-LIFO},
  year = {1997}
}
Correnson, L., Duris, E., Parigot, D. & Roussel, G. (1997), "Attribute Grammars and Functional Programming Deforestation", In Fourth International Static Analysis Symposium -- Poster Session. Paris, France. September 1997.
Abstract: The functional programming community is paying increasing attention to static structure-based transformations. For example, generic control operators, such as fold, have been introduced in functional programming to increase the power and applicability of a particular kind of static transformation, called deforestation, which prevents the construction of useless intermediate data structures in function composition. This is achieved by making the structure of the data more explicit in program specifications. We argue that one of the original concepts of Attribute Grammars is precisely to make data structures explicit in program specifications. Furthermore, there exists a powerful static deforestation-like transformation in their context. In this paper, we present similarities between deforestation methods, on the one hand with the functional approach, and on the other hand with the Attribute Grammars approach. In order to gain a grasp of these similarities, we first make a simple comparison: purely-synthesized Attribute Grammars and first order folds. In this context, deforestation transformations are equivalent. This allows us to highlight the limitations of the fold formalism and to present how the hylomorphism approach generalizes it; hylomorphisms and attribute grammars are surprisingly alike. Finally, we show how the inherited attribute notion in Attribute Grammars solves some transformation problems in higher order functional programs.
BibTeX:
@inproceedings{Correnson97,
  author = {Loïc Correnson and Etienne Duris and Didier Parigot and Gilles Roussel},
  title = {Attribute Grammars and Functional Programming Deforestation},
  booktitle = {Fourth International Static Analysis Symposium -- Poster Session},
  year = {1997},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/sas97.ps.gz}
}
Correnson, L. (1997), "Programmation Polytypique avec les Grammaires Attribuées". Université de Paris VII, September, 1997.
BibTeX:
@techreport{Correnson97-dea,
  author = {Loïc Correnson},
  title = {Programmation Polytypique avec les Grammaires Attribuées},
  year = {1997},
  note = {scriptsize http://www-sop.inria.fr/members/Didier.Parigot/publications/Rapport/Correnson97-dea.ps.gz},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/Rapport/Correnson97-dea.ps.gz}
}
Correnson, L., Duris, E., Parigot, D. & Roussel, G. (1997), "Composition Symbolique", In journées du GDR de programmation. Rennes. November 1997.
BibTeX:
@inproceedings{Correnson97-gdr,
  author = {Loïc Correnson and Etienne Duris and Didier Parigot and Gilles Roussel},
  title = {Composition Symbolique},
  booktitle = {journées du GDR de programmation},
  year = {1997},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/gdr97.ps.gz}
}
Duris, E. (1997), "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.
BibTeX:
@inproceedings{Duris-icfp97,
  author = {Etienne Duris},
  title = {Functional Programming and Attribute Grammar Deforestation},
  booktitle = {Proc.of the International Conference on Functional Programming (ICFP'97) -- Poster Session},
  publisher = {ACM Press},
  year = {1997},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/icfp97.ps.gz}
}
Duris, E., Parigot, D., Roussel, G. & Jourdan, M. (1997), "Grammaires attribuées et folds : opérateurs de contrôle génériques", In Journées Francophones des Langages Applicatifs. Dolomieu, France. January 1997.
Abstract: Les opérateurs de contrôle génériques tels que fold ont été introduits en programmation fonctionnelle pour augmenter la puissance et le champ d'application des transformations fondées sur la structure des données. Ceci est possible en rendant cette structure plus explicite dans la spécification des programmes. Nous considérons que cette caractéristique fondamentale est l'un des concepts de base des grammaires attribuées. Dans cet article, nous exposons informellement les similitudes qui existent entre le formalisme du fold et la spécification par grammaires attribuées. Nous comparons également leurs méthodes respectives d'élimination des structures intermédiaires introduites lors de la composition de fonctions (notion de déforestation ou de fusion): l'algorithme de normalisation pour les programmes exprimés à l'aide de folds et la composition descriptionnelle pour les grammaires attribuées. Le but principal de cet article est de présenter intuitivement chacun de ces deux paradigmes, ainsi que leurs similitudes qui offrent des possibilités de fertilisation croisée
BibTeX:
@inproceedings{Duris97,
  author = {Etienne Duris and Didier Parigot and Gilles Roussel and Martin Jourdan},
  title = {Grammaires attribuées et folds : opérateurs de contrôle génériques},
  booktitle = {Journées Francophones des Langages Applicatifs},
  year = {1997},
  note = {scriptsize http://www-sop.inria.fr/members/Didier.Parigot/publications/jfla97.ps.gz},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/jfla97.ps.gz}
}
Duris, E., Parigot, D., Roussel, G. & Jourdan, M. (1997), "Structure-directed Genericity in Functional Programming and Attribute Grammars". INRIA, Technical Report 3105, February, 1997.
Abstract: Generic control operators, such as fold, have been introduced in functional programming to increase the power and applicability of data-structure-based transformations. This is achieved by making the structure of the data more explicit in program specifications.\ We argue that this very important property is one of the original concepts of attribute grammars. In this paper, we present the similarities between the fold formalism and attribute grammars. In particular, we show the equivalence of their respective deforestation methods.\ Given these results and the fundamental role of deforestation in the concept of structure-directed genericity, first devised for attribute grammars with descriptional composition, we show how the fold operator with its fusion method allow to transport this concept in the area of functional programming.
BibTeX:
@techreport{Duris97gen,
  author = {Etienne Duris and Didier Parigot and Gilles Roussel and Martin Jourdan},
  title = {Structure-directed Genericity in Functional Programming and Attribute Grammars},
  year = {1997},
  number = {3105},
  url = {ftp://ftp.inria.fr/INRIA/publication/RR/RR-3105.ps.gz}
}
Economakos, G., Papakonstantinou, G. & Tsanakas, P. (1997), "Global Scheduling in an Attribute Grammar Driven Silicon Compilation Environment", In International Workshop on Behavioral Modeling and Simulation., pp. 167-176.
BibTeX:
@inproceedings{Eco97BMAS,
  author = {G. Economakos and G. Papakonstantinou and P. Tsanakas},
  title = {Global Scheduling in an Attribute Grammar Driven Silicon Compilation Environment},
  booktitle = {International Workshop on Behavioral Modeling and Simulation},
  year = {1997},
  pages = {167--176}
}
Economakos, G., Papakonstantinou, G., Pekmestzi, K. & Tsanakas, P. (1997), "Hardware Compilation Using Attribute Grammars", In Advanced Research Working Conference on Correct Hardware Design and Verification Methods., pp. 273-290.
BibTeX:
@inproceedings{Eco97CHARME,
  author = {G. Economakos and G. Papakonstantinou and K. Pekmestzi and P. Tsanakas},
  title = {Hardware Compilation Using Attribute Grammars},
  booktitle = {Advanced Research Working Conference on Correct Hardware Design and Verification Methods},
  year = {1997},
  pages = {273--290}
}
Economakos, G., Economakos, P., Papakonstantinou, G. & Tsanakas, P. (1997), "Integrating Different VHDL Coding Styles in an Attribute Grammar Driven High-Level Synthesis Environment", In International Workshop on Logic and Architecture Synthesis., pp. 175-184.
BibTeX:
@inproceedings{Eco97IWLAS,
  author = {G. Economakos and P. Economakos and G. Papakonstantinou and P. Tsanakas},
  title = {Integrating Different VHDL Coding Styles in an Attribute Grammar Driven High-Level Synthesis Environment},
  booktitle = {International Workshop on Logic and Architecture Synthesis},
  year = {1997},
  pages = {175--184}
}
Economakos, G., Papakonstantinou, G., Pekmestzi, K. & Tsanakas, P. (1997), "Hardware Compilation Using Attribute Grammars", In IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods, CHARME.
BibTeX:
@inproceedings{Economakos97,
  author = {G. Economakos and G. Papakonstantinou and K. Pekmestzi and P. Tsanakas},
  title = {Hardware Compilation Using Attribute Grammars},
  booktitle = {IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods, CHARME},
  year = {1997}
}
Economakos, G.P.G. & Tsanakas, P. (1997), "Global Scheduling in an Attribute Grammar Driven Silicon Compilation Environment", In IEEE/VIUF International Workshop on Behavioral Modeling and Simulation, BMAS.
BibTeX:
@inproceedings{Economakos97a,
  author = {G. Papakonstantinou G. Economakos and P. Tsanakas},
  title = {Global Scheduling in an Attribute Grammar Driven Silicon Compilation Environment},
  booktitle = {IEEE/VIUF International Workshop on Behavioral Modeling and Simulation, BMAS},
  year = {1997}
}
Efremidis, S., Mughal, K.A., Søraas, L. & Reppy, J. (1997), "AML: Attribute Grammars in ML", Nordic Journal of Computing., March, 1997.
Abstract: Attribute grammars are a valuable tool for constructing compilers and building user interfaces. This paper reports on a system we are developing, called AML (for Attribution in ML), which is an attribute grammar toolkit for building such applications as language-based programming environments using SML. This system builds on the proven technology of efficient attribute evaluation, while using a higher-level foundation for the implementation of interactive systems. It supports a general and uniform platform for building applications that can manipulate attributed terms and allow access to attribute values. We describe the design of the AML system, its current implementation status, and our plans for the future.
BibTeX:
@article{Efremidis97,
  author = {Sofoklis Efremidis and Khalid A. Mughal and Lars Søraas and John Reppy},
  title = {AML: Attribute Grammars in ML},
  journal = {Nordic Journal of Computing},
  year = {1997},
  url = {ftp://ftp.ii.uib.no/pub/aml/njc-aml-paper.ps.Z}
}
Forax, R. (1997), "Le langage Chocolat". Université de Marne la Vallée, July, 1997.
BibTeX:
@techreport{Forax97,
  author = {Rémi Forax},
  title = {Le langage Chocolat},
  year = {1997},
  note = {scriptsize http://www-sop.inria.fr/members/Didier.Parigot/publications/Rapport/Forax97.ps.gz},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/Rapport/Forax97.ps.gz}
}
Forgács, I. & Gyimóthy, T. (1997), "An efficient interprocedural slicing method for large programs". Informatics Lab., MTA SZTAKI, Technical Report TR97-7, June, 1997.
Abstract: In this paper a method is introduced for the interprocedural static slicing of large programs. The most time-consuming part of interprocedural slicing methods is the computation of transitive dependencies (i.e., summary edges) due to the procedure calls. From these dependencies and program dependence graphs the system dependence graph of a program can be constructed. It is straightforward to compute interprocedural slices from the system dependence graph. Horwitz et al. introduced an algorithm based on attribute grammars for computing summary edges, while Reps et al. suggested an improved technique for this task. This paper defines a method which improves the space requirement of Reps' method.
BibTeX:
@techreport{Forgács97,
  author = {István Forgács and Tibor Gyimóthy},
  title = {An efficient interprocedural slicing method for large programs},
  year = {1997},
  number = {TR97-7},
  pages = {10},
  url = {http://www.inf.u-szeged.hu/~gyimi/}
}
Hedin, G. (1997), "Attribute Extension - A Technique for Enforcing Programming Language Conventions", Nordic Journal of Computing. Vol. 4, pp. 93-122.
BibTeX:
@article{Hedin97,
  author = {G. Hedin},
  title = {Attribute Extension - A Technique for Enforcing Programming Language Conventions},
  journal = {Nordic Journal of Computing},
  year = {1997},
  volume = {4},
  pages = {93--122}
}
Hedin, G. (1997), "Language Support for Design Patterns using Attribute Extension", In Language Support for Design Patterns and Frameworks. Jyväskylä, Finland.
BibTeX:
@inproceedings{Hedin97a,
  author = {Görel Hedin},
  title = {Language Support for Design Patterns using Attribute Extension},
  booktitle = {Language Support for Design Patterns and Frameworks},
  year = {1997},
  note = {Workshop in conjunction with ECOOP'97},
  url = {http://bilbo.ide.hk-r.se:8080/osch/lsdf/}
}
Kühnemann, A. (1997), "Berechnungsstärken von Teilklassen primitiv-rekursiver Programmschemata". School: Technical University of Dresden.
Abstract: In this thesis the concept of macro attributed tree transducer is introduced in order to integrate various extensions of the scheme of primitive recursion over trees and the concept of attribute grammar. Thus macro attributed tree transducers can handle context information implicitly with parameters of functions and explicitly with inherited attributes. To every noncircular macro attributed tree transducer a total tree-to-tree transformation can be assigned. In this thesis we compare the tree-to-tree transformation classes of different subclasses of macro attributed tree transducers which are known from the literature. To this end we develop and use composition and decomposition results on the one hand and pumping lemmata on the other hand.
BibTeX:
@phdthesis{kue97,
  author = {A. Kühnemann},
  title = {Berechnungsstärken von Teilklassen primitiv-rekursiver Programmschemata},
  school = {Technical University of Dresden},
  year = {1997},
  note = {Shaker Verlag, Aachen}
}
Lämmel, R. & Riedewald, G. (1997), "Operations on attribute grammar specifications towards semantic extensibility". Rostok University, May, 1997.
BibTeX:
@techreport{Lammel97,
  author = {Ralf Lämmel and Günter Riedewald},
  title = {Operations on attribute grammar specifications towards semantic extensibility},
  year = {1997},
  url = {http://www.informatik.uni-rostock.de/laemmel/}
}
Makoto, M. & Nakatsuyama, H. (1997), "A Theoretical Foundation of the DSSSL Location Model", Mathematical and Computer Modelling., February, 1997. Vol. 25(4), pp. 05-107.
Abstract: In the location model of the Document Style Semantics and Specification Language (DSSSL), one can use tree patterns to locate nodes in logical structures of documents. A tree pattern consists of conditions on nodes and those on their hierarchical relationships. As a first step towards efficient implementations, the paper shows a theoretical foundation of the location model. Tree patterns are first expressed by sentences of branching time temporal logic. These sentences are then converted to well formed attribute grammars. Thus, the library of attribute grammar evaluation techniques can be used to implement the location model. It is our belief that this observation is significant for future implementers of DSSSL. Furthermore, the converted attribute grammars can be evaluated by traversing logical structures several times. The number of required traversals can be found by examining the original sentences.
BibTeX:
@article{Makoto97,
  author = {Murata Makoto and H. Nakatsuyama},
  title = {A Theoretical Foundation of the DSSSL Location Model},
  journal = {Mathematical and Computer Modelling},
  year = {1997},
  volume = {25},
  number = {4},
  pages = {05--107}
}
Pfahler, P. & Kastens, U. (1997), "Language Design and Implementation by Selection", In In Proc. 1st ACM-SIGPLAN Workshop on Domain-Specific-Languages, DSL '97. Paris France., pp. 97-108.
BibTeX:
@inproceedings{Pfahler97,
  author = {Peter Pfahler and Uwe Kastens},
  title = {Language Design and Implementation by Selection},
  booktitle = {In Proc. 1st ACM-SIGPLAN Workshop on Domain-Specific-Languages, DSL '97},
  year = {1997},
  pages = {97--108},
  url = {http://www.uni-paderborn.de/fachbereich/AG/agkastens/AGKasUE.ELI.html}
}
Saraiva, J., Kuiper, M. & Swierstra, D. (1997), "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.
BibTeX:
@inproceedings{Saraiva97,
  author = {João Saraiva and Matthis Kuiper and Doaitse Swierstra},
  title = {Specialing Trees for Efficient Functional Tree Decoration},
  booktitle = {Proceedings of the International Workshop on Specialization of Declarative Programs and its Applications},
  year = {1997}
}
Sassa, M. & Ookubo, T. (1997), "Systematic Debugging Method for Attribute Grammar Description", Information Processing Letters. Vol. 62(6), pp. 305-313.
BibTeX:
@article{Sassa97,
  author = {Masataka Sassa and Takuya Ookubo},
  title = {Systematic Debugging Method for Attribute Grammar Description},
  journal = {Information Processing Letters},
  year = {1997},
  volume = {62},
  number = {6},
  pages = {305--313}
}
Sloane, A.M. (1997), "Generating dynamic program analysis tools", In the Australian Software Engineering Conference (ASWEC'97). Sydney., pp. 166-173. IEEE CS Press.
Abstract: Sophisticated instrumentation-based systems exist for building dynamic analysis tools but to use these systems a developer must write the instrumentation and analysis code by hand. This paper describes how analysis tools can be generated automatically by specifying analysis algorithms using attribute grammars based on the static and dynamic structure of the program being analysed. Using methods similar to those used to generate compilers, this approach enables implicit storage allocation for analysis data, automatic sequencing of analysis steps and transparently supports a variety of data sources and independence from the underlying implementation technology. Furthermore, analysis algorithms can be described in a modular way, enabling reuse. To demonstrate the approach the paper describes the Wyong system that generates dynamic analysis tools from specifications. An example analysis module specification is described and its reuse is illustrated. Wyong is based on the Eli compiler generation system and the ATOM program instrumentation system. To avoid having to build extremely large trees describing the dynamic structure of a program, Wyong automatically generates instrumentation code for ATOM. Combined with other modules generated by Eli, the ATOM-instrumented binary evaluates the specified analysis attribute computations as it executes. Thus the benefits of a specification-based method are combined with the efficiency of an instrumentation-based implementation.
BibTeX:
@inproceedings{Sloane97,
  author = {Anthony M. Sloane},
  title = {Generating dynamic program analysis tools},
  booktitle = {the Australian Software Engineering Conference (ASWEC'97)},
  publisher = {IEEE CS Press},
  year = {1997},
  pages = {166--173},
  url = {http://www.comp.mq.edu.au/~asloane/pubs.html}
}
Vivien, B. (1997), "Etude et réalisation d'un compilateur E-LOTOS à l'aide du générateur de compilateurs SYNTAX/FNC-2". Conservatoire National des Arts et Métiers, Décembre, 1997.
BibTeX:
@techreport{Vivien97,
  author = {Bruno Vivien},
  title = {Etude et réalisation d'un compilateur E-LOTOS à l'aide du générateur de compilateurs SYNTAX/FNC-2},
  year = {1997},
  url = {ftp://ftp.inrialpes.fr/pub/vasy/publications/theses/Vivien-97.ps.Z}
}
Bloem, R. & Engelfriet, J. (1998), "A comparison of tree transductions defined by monadic second order logic and by attribute grammars". Leiden University Technical Report, Technical Report 98-02, 1998.
Abstract: Formulas from monadic second order (MSO) logic with one and two free variables can be used to define the nodes and edges (respectively) of a graph, in terms of a given graph. Such MSO definable graph transductions play a role in the theory of graph grammars. Here we investigate the special case of trees. The main result is that the MSO definable tree transductions are exactly those tree transductions that can be computed by attributed tree transducers with look-ahead, which are a specific type of two-stage attribute grammar: in the first (look-ahead) stage all attributes have finitely many values, in the second stage all attributes are trees, and the second stage satisfies the single use restriction (i.e., each attribute is used at most once). Moreover, if we allow the MSO transductions to produce trees with shared subtrees (i.e., term graphs, that have to be unfolded), then the single use restriction can be dropped.
BibTeX:
@techreport{Bloem98,
  author = {R. Bloem and J. Engelfriet},
  title = {A comparison of tree transductions defined by monadic second order logic and by attribute grammars},
  year = {1998},
  number = {98-02},
  url = {http://www.wi.leidenuniv.nl/TechRep/1998/tr98-02.html}
}
Boyland, J.T. (1998), "Analyzing Direct Non-local Dependencies in Attribute Grammars", In Compiler Construction CC'98. portugal. April 1998. Volume 1383, pp. 31-49. Springer-Verlag.
BibTeX:
@inproceedings{Boyland98,
  author = {John Tang Boyland},
  title = {Analyzing Direct Non-local Dependencies in Attribute Grammars},
  booktitle = {Compiler Construction CC'98},
  publisher = {Springer-Verlag},
  year = {1998},
  volume = {1383},
  pages = {31--49}
}
Correnson, L., Duris, E., Parigot, D. & Roussel, G. (1998), "Symbolic Composition". INRIA, Technical Report 3348, January, 1998.
Abstract: The deforestation of a functional program is a transformation which gets rid of intermediate data structures constructions that appear when two functions are composed. The descriptional composition, initially introduced by Ganzinger and Giegerich, is a deforestation method dedicated to the composition of two attribute grammars. This article presents a new functional deforestation technique, called symbolic composition, based on the descriptional composition mechanism, but extending it. An automatic translation from a functional program into an equivalent attribute grammar allows symbolic composition to be applied, and then the result can be translated back into a functional program. This yields a source to source functional program transformation. The resulting deforestation method provides a better deforestation than other existing functional techniques. Symbolic composition, that uses the declarative and descriptional features of attribute grammars is intrinsically more powerful than categorical-flavored transformations, whose recursion schemes are set by functors. These results tend to show that attribute grammars are a simple intermediate representation, particularly well-suited for program transformations.
BibTeX:
@techreport{Correnson98,
  author = {Loïc Correnson and Etienne Duris and Didier Parigot and Gilles Roussel},
  title = {Symbolic Composition},
  year = {1998},
  number = {3348},
  url = {ftp://ftp.inria.fr/INRIA/publication/RR/RR-3348.ps.gz}
}
Correnson, L., Duris, E., Parigot, D. & Roussel, G. (1998), "Composition Symbolique", In Journées Francophones des Langages Applicatifs. Come, Italie. February 1998.
Abstract: La déforestation d'un programme fonctionnel est une transformation qui consiste à éliminer la construction des structures intermédiaires qui sont introduites par les compositions de fonctions. La composition descriptionnelle, initialement introduite par Ganzinger et Giegerich, est une méthode de déforestation spécifique, qui s'applique à la composition de deux grammaires attribuées. Cet article propose une nouvelle technique de déforestation, appelée composition symbolique, qui est une extension et une amélioration de la composition descriptionnelle. En traduisant automatiquement un programme fonctionnel en une grammaire attribuée équivalente, il est possible de lui appliquer la composition symbolique, et de traduire le résultat en un programme fonctionnel (par exemple, en utilisant la transformation de Johnsson). On obtient alors une transformation source à source de programmes fonctionnels. La méthode de déforestation ainsi obtenue donne de meilleurs résultats que les méthodes fonctionnelles existantes. La composition symbolique, complètement dédiée au caractère déclaratif et descriptionnel des grammaires attribuées est intrinsèquement plus puissante que les transformations basées sur les notions catégorielles, dont les schémas de récursions sont figés par des foncteurs. Ces résultats confirment que la notation des grammaires attribuées est une représentation intermédiaire simple et particulièrement adaptée aux transformations de programmes.
BibTeX:
@inproceedings{Correnson98-jfla,
  author = {Loïc Correnson and Etienne Duris and Didier Parigot and Gilles Roussel},
  title = {Composition Symbolique},
  booktitle = {Journées Francophones des Langages Applicatifs},
  year = {1998},
  note = {scriptsize http://www-sop.inria.fr/members/Didier.Parigot/publications/jfla98.ps.gz},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/jfla98.ps.gz}
}
Correnson, L., Duris, E., Parigot, D. & Roussel, G. (1998), "Generic Programming by Program Composition (position paper)", In Workshop on Generic Programming. Marstrand, Sweden. June 1998.
Abstract: Recently, generic programming becomes of a major interest in several programming paradigms. A recurrent idea to achieve genericity is to abstract computations from their representative data structures. This allows these generic specifications to be instantiated onto a large number of neighboring data structures. Moreover the program can be adapted when the data structures have to evolve. Polytypic programming, adaptive programming and generic attribute grammars are generic programming methods related to this approach. Their comparison leads us to propose a common framework for generic programming: automatic generation of programs that compute morphisms between data structures, and program composition. Thanks to this compositional approach, the complete specialization of generic programs could be advantageously delegated to some powerful and general deforestation method.
BibTeX:
@inproceedings{Correnson98a,
  author = {Loïc Correnson and Etienne Duris and Didier Parigot and Gilles Roussel},
  title = {Generic Programming by Program Composition (position paper)},
  booktitle = {Workshop on Generic Programming},
  year = {1998},
  note = {conjunction with MPC'98},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/Correnson98a.ps.gz}
}
Correnson, L., Duris, E., Parigot, D. & Roussel, G. (1998), "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.
Abstract: Depuis peu, la programmation générique suscite un intérêt grandissant dans différents paradigmes de programmation. Un principe souvent utilisé pour obtenir de la généricité est d'abstraire les calculs d'un programme par rapport à leur structure de données. Cette approche permet à ces spécifications génériques d'être instanciées pour un grand nombre de structures de données voisines. De plus, le programme peut ainsi être automatiquement adapté lorsque les structures de données évoluent. La programmation polytypique, la programmation adaptive et les grammaires attribuées génériques sont des méthodes formelles de programmation génériques qui adoptent cette approche. La comparaison de ces méthodes nous a conduit à proposer un schéma commun de développement de programmes génériques. Cette méthode est basée sur deux concepts fondamentaux: la génération automatique de morphismes entre structures de données, et l'instanciation formelle des programmes génériques par composition, assistée par des outils de spécialisation.
BibTeX:
@inproceedings{Correnson98b,
  author = {Loïc Correnson and Etienne Duris and Didier Parigot and Gilles Roussel},
  title = {Schéma générique de développement par composition},
  booktitle = {Approches Formelles dans l'Assistance au Développement de Logiciel AFADL'98},
  year = {1998},
  note = {scriptsize http://www-sop.inria.fr/members/Didier.Parigot/publications/Correnson98b.ps.gz},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/Correnson98b.ps.gz}
}
Correnson, L., Duris, E., Parigot, D. & Roussel, G. (1998), "A Generic Framework for Genericity"
Abstract: Recently, generic programming becomes of a major interest in several programming paradigms. A recurrent idea to achieve genericity is to specify algorithms on their convenient data structure, and to allow these specifications to be instantiated onto a large number of neighboring data structures. Polytypic programming, shapely types and generic attribute grammars are generic programming methods related to this approach. A framework for generic programming is proposed to embed these methods. It consists in tools for automatic generation of morphisms between data structures, and for program composition. Thanks to this compositional approach, the complete specialization of generic programs could be advantageously delegated to a general and powerful mechanism of ``symbolic composition'', which performs deforestation and partial evaluation.
BibTeX:
@unpublished{Correnson98c,
  author = {Loïc Correnson and Etienne Duris and Didier Parigot and Gilles Roussel},
  title = {A Generic Framework for Genericity},
  year = {1998},
  note = {English version of},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/Correnson98c.ps.gz}
}
Correnson, L., Duris, E., Parigot, D. & Roussel, G. (1998), "Equational Semantics". INRIA, October, 1998.
Abstract: Many methods exist to perform program transformations, but most of them are dedicated to few programming languages. We propose a new formalism able to encode an abstract representation of the operational semantics of a program. With this formalism, we define simple transformations that lead to complex ones such as deforestation or partial evaluation in several programming languages. Though highly theoretical and language-independent, this method can be implemented and especially interfaced with real programming languages. For instance, a prototype dealing with a simple higher-order functional programming language has been implemented (with a call-by-value operational semantics). This prototype produces some more powerful transformations than other known functional methods, especially with deforestation on functions with accumulative parameters.
BibTeX:
@techreport{Correnson98e,
  author = {Loic Correnson and Etienne Duris and Didier Parigot and Gilles Roussel},
  title = {Equational Semantics},
  year = {1998},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/Rapport/correnson98e.ps.gz}
}
Duris, E. (1998), "Contribution aux relations entre les grammaires attribuées et la programmation fonctionnelle". School: Université d'Orléans.
Abstract: Software engineering has to reconcile modularity, that is required for development and maintenance phases, with efficiency, obviously essential in the practical implementation of applications. This dilemma implies that methods and techniques must be developed in order to increase the efficiency of modular programs. The aim of deforestation transformations is to discard intermediate data structures that appear when software components are composed. Thus, these transformations are of great interest, especially to attribute grammar and functional programming communities. In spite of the variety of formalisms they used, this thesis compares several existing techniques and develops a new general deforestation method drawn from their advantages. First, a natural attribute grammar extension is introduced, allowing a larger functional programming class to be expressed. Then, dynamic attribute grammars are no more tied to concrete trees, to direct computations and transformations. Nevertheless, they could always be evaluated with classical attribute grammar evaluation methods. Next, the main functional deforestation methods (Wadler's algorithm, elimination of foldr/build rule, normalization of folds, fusion of hylomorphisms) are studied and compared with the descriptional composition of attribute grammars. Limitations of each method are established and allow suitable features for these program transformations to be determined. Finally, a new deforestation method is introduced. The symbolic composition uses the power of attribute grammar formalism and also includes a partial evaluation mechanism. This general technique can be applied to attribute grammars or to functional programs and it deforests programs for which existing methods were insufficient.
BibTeX:
@phdthesis{Duris98,
  author = {Etienne Duris},
  title = {Contribution aux relations entre les grammaires attribuées et la programmation fonctionnelle},
  school = {Université d'Orléans},
  year = {1998},
  note = {scriptsize http://www-sop.inria.fr/members/Didier.Parigot/publications/theses/Duris98.ps.gz},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/theses/Duris98.ps.gz}
}
Economakos, G., Papakonstantinou, G. & Tsanakas, P. (1998), "AGENDA: An Attribute Grammar Driven Environment for the Design Automation of Digital Systems", In Design Automation and Test in Europe Conference and Exhibition., pp. 933-934.
BibTeX:
@inproceedings{Eco98DATE,
  author = {G. Economakos and G. Papakonstantinou and P. Tsanakas},
  title = {AGENDA: An Attribute Grammar Driven Environment for the Design Automation of Digital Systems},
  booktitle = {Design Automation and Test in Europe Conference and Exhibition},
  year = {1998},
  pages = {933--934}
}
Economakos, G. & Papakonstantinou, G. (1998), "An Attribute Grammar Driven High-Level Synthesis Paradigm for Control Applications", In 3rd European Robotics, Intelligent Systems and Control Conference.
BibTeX:
@inproceedings{Eco98EURISCON,
  author = {G. Economakos and G. Papakonstantinou},
  title = {An Attribute Grammar Driven High-Level Synthesis Paradigm for Control Applications},
  booktitle = {3rd European Robotics, Intelligent Systems and Control Conference},
  year = {1998}
}
Economakos, G. & Papakonstantinou, G. (1998), "Exploiting the Use of VHDL Specifications in the AGENDA High-Level Synthesis Environment", In 24th EUROMICRO Conference, Workshop on Digital System Design., pp. 91-98.
BibTeX:
@inproceedings{Eco98EUROMICRO,
  author = {G. Economakos and G. Papakonstantinou},
  title = {Exploiting the Use of VHDL Specifications in the AGENDA High-Level Synthesis Environment},
  booktitle = {24th EUROMICRO Conference, Workshop on Digital System Design},
  year = {1998},
  pages = {91--98}
}
Economakos, G., Papakonstantinou, G. & Tsanakas, P. (1998), "Behavioral Synthesis of Digital Filters Using Attribute Grammars", In IX European Signal Processing Conference., pp. 519-522.
BibTeX:
@inproceedings{Eco98EUSIPCO,
  author = {G. Economakos and G. Papakonstantinou and P. Tsanakas},
  title = {Behavioral Synthesis of Digital Filters Using Attribute Grammars},
  booktitle = {IX European Signal Processing Conference},
  year = {1998},
  pages = {519--522}
}
Economakos, G., Papakonstantinou, G. & Tsanakas, P. (1998), "Incorporating Multi-pass Attribute Grammars for the High-Level Synthesis of ASICs", In Symposium on Applied Computing., pp. 45-49.
BibTeX:
@inproceedings{Eco98SAC,
  author = {G. Economakos and G. Papakonstantinou and P. Tsanakas},
  title = {Incorporating Multi-pass Attribute Grammars for the High-Level Synthesis of ASICs},
  booktitle = {Symposium on Applied Computing},
  year = {1998},
  pages = {45--49}
}
Hedin, G., Ohlsson, L. & McKenna, J. (1998), "Product Configuration using Object Oriented Grammars", In 8th International Symposium on System Configuration Management (SCM-8). Brussels. July 1998.
Abstract: This paper presents a technique for product configuration modelling based on object-orientation and attribute grammars. The technique allows efficient interactive configurator tools to be generated for specified product families. Additional benefits include a high degree of checkability, early validation, readability, and reusability. The mechanical configuration of plate heat exchangers is used to demonstrate these benefit
BibTeX:
@inproceedings{Hedin98,
  author = {Gorel Hedin and Lennart Ohlsson and John McKenna},
  title = {Product Configuration using Object Oriented Grammars},
  booktitle = {8th International Symposium on System Configuration Management (SCM-8)},
  year = {1998},
  note = {(co-located with ECOOP'98)}
}
Hussain, T.S. & Browse, R.A. (1998), "Basic Properties of Attribute Grammar Encoding", In Late Breaking Papers at the Genetic Programming 1998 Conference. University of Wisconsin, Madison, Wisconsin, USA. 22-25 July 1998. Stanford University Bookstore.
BibTeX:
@inproceedings{Hussain98,
  author = {Talib S. Hussain and Roger A. Browse},
  title = {Basic Properties of Attribute Grammar Encoding},
  booktitle = {Late Breaking Papers at the Genetic Programming 1998 Conference},
  publisher = {Stanford University Bookstore},
  year = {1998},
  url = {http://www.ai.mit.edu/people/unamay/phd-ws-abstracts/gp-workshop-hussain.ps}
}
Kastens, U., Pfahler, P. & Jung, M. (1998), "The Eli System", In Compiler Construction CC'98. portugal. April 1998. Volume 1383 Springer-Verlag.
BibTeX:
@inproceedings{Kastens98,
  author = {Uwe Kastens and Peter Pfahler and Matthias Jung},
  title = {The Eli System},
  booktitle = {Compiler Construction CC'98},
  publisher = {Springer-Verlag},
  year = {1998},
  volume = {1383},
  note = {tool demonstration}
}
Kuiper, M. & Saraiva, J. (1998), "Lrc A generator for Incremental Language-Oriented Tools", In Compiler Construction CC'98. portugal. April 1998. Volume 1383, pp. 298-301. Springer-Verlag.
BibTeX:
@inproceedings{Kuiper,
  author = {Matthijs Kuiper and João Saraiva},
  title = {Lrc A generator for Incremental Language-Oriented Tools},
  booktitle = {Compiler Construction CC'98},
  publisher = {Springer-Verlag},
  year = {1998},
  volume = {1383},
  pages = {298--301},
  note = {tool demonstration}
}
Maddox, W. (1998), "Incremental Static Semantic Analysis". University of California, Berkeley, Technical Report ucb/CSD-97-948, 1998.
BibTeX:
@techreport{Maddox98,
  author = {William Maddox},
  title = {Incremental Static Semantic Analysis},
  year = {1998},
  number = {ucb/CSD-97-948},
  url = {http://cs-tr.cs.cornell.edu:80/Dienst/UI/1.0/Display/ncstrl.ucb/CSD-97-948}
}
Mizushima, K. & Katayama, T. (1998), "Storage Allocation Strategies for Recursive Attribute Evaluators", In Compiler Construction CC'98. portugal. April 1998. Volume 1383, pp. 50-64. Springer-Verlag.
BibTeX:
@inproceedings{Mizushima98,
  author = {Kazunori Mizushima and Takuya Katayama},
  title = {Storage Allocation Strategies for Recursive Attribute Evaluators},
  booktitle = {Compiler Construction CC'98},
  publisher = {Springer-Verlag},
  year = {1998},
  volume = {1383},
  pages = {50--64}
}
Neven, F. & den Bussche, J.V. (1998), "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., pp. 11-17. ACM press.
BibTeX:
@inproceedings{Neven98,
  author = {Frank Neven and Jan Van den Bussche},
  title = {Expressiveness of structured document query languages based on attribute grammars},
  booktitle = {PODS '98. Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems},
  publisher = {ACM press},
  year = {1998},
  pages = {11--17},
  url = {http://www.luc.ac.be/neven/expr_ag.ps.gz}
}
Nielson, H.R. & Nielson, F. (1998), "Flow Logics for Contraint Based Analysis", In Compiler Construction CC'98. portugal. April 1998. Volume 1383, pp. 109-127. Springer-Verlag.
Abstract: Flow logic offers a compact and versatile notation for expressing the acceptability of solutions to program analysis problems. In contrast to previous logical formulations of program analysis it aims at integrating existing approaches to data flow analysis and control flow analysis. It is able to deal with a broad variety of language paradigms, program properties, kinds of formal semantics, and methods used for computing the best solution. In this paper we illustrate how a compositional flow logic (in ``succinct'' form) can be systematically transformed into an efficient exhaustive procedure for computing the best solution of a set of constraints generated. This involves transformations to attribute grammars and to specifications of the (``verbose'') form used in control flow analysis.
BibTeX:
@inproceedings{Nielson98,
  author = {Hanne Riis Nielson and Flemming Nielson},
  title = {Flow Logics for Contraint Based Analysis},
  booktitle = {Compiler Construction CC'98},
  publisher = {Springer-Verlag},
  year = {1998},
  volume = {1383},
  pages = {109--127}
}
Yang, W. & Liu, Y.T. (1998), "SSCC: A software tool based on extended ordered attribute grammars", Proc. National Science Council Part A: Physical Science and Engineering.
BibTeX:
@article{Yang,
  author = {W. Yang and Y. T. Liu},
  title = {SSCC: A software tool based on extended ordered attribute grammars},
  journal = {Proc. National Science Council Part A: Physical Science and Engineering},
  year = {1998},
  url = {http://www.cis.nctu.edu.tw/~wuuyang/papers/SSCC.NSC98.ps}
}
an Alexin, Z., Zvada, S. & othy, T.G. (1999), "Application of AGLEARN on Hungarian Part-of-speech Tagging", In Second Workshop on Attribute Grammars and their Applications, WAGA'99. Amsterdam, The Netherlands. March 1999., pp. 133-152. INRIA rocquencourt.
Abstract: In this paper we present an application of the AGLEARN method to the part-of-speech (POS) tagging of Hungarian sentences. The task of AGLEARN is to infer the semantic functions associated with production. In the learning process the grammar, the background semantic functions and the examples can be used. We applied the AGLEARN method to infer context rules to choose the correct tags. A corpus with about 100 000 pre-tagged words has been used for training and testing. By using AGLEARN method learning data are generated to the C 4.5 attribute value learner. These generated data contain information about the phrase structure of the sentences. A background attribute grammar has been used to determine these sructural information. Our experinces showed that using this structural background information C4.5 learner was able to infer more precise context rules.
BibTeX:
@inproceedings{Alexin99,
  author = {Zoltan Alexin and Szilvia Zvada and and Tibor Gyimothy},
  title = {Application of AGLEARN on Hungarian Part-of-speech Tagging},
  booktitle = {Second Workshop on Attribute Grammars and their Applications, WAGA'99},
  publisher = {INRIA rocquencourt},
  year = {1999},
  pages = {133--152},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/www/fnc2/WAGA99/accept.html}
}
Correnson, L., Duris, E., Parigot, D. & Roussel, G. (1999), "How to deforest in accumulative parameters?". INRIA, Technical Report 3608, January, 1999.
Abstract: Software engineering has to reconcile modularity with efficiency. One way to grapple with this dilemma is to automatically transform a modular-specified program into an efficient-implementable one. This is the aim of deforestation transformations which get rid of intermediate data structures constructions that appear when two functions are composed. Nevertheless, existing functional methods cannot deforest non-trivial intermediate constructions that are processed by symbolic composition. This new deforestation technique is based on the descriptional composition dedicated to attribute grammars. In this paper, we present the symbolic composition, we outline its counterpart in terms of classical deforestation methods and we sketch a way to embed it in a functional framework.
BibTeX:
@techreport{Correnson98d,
  author = {Loic Correnson and Etienne Duris and Didier Parigot and Gilles Roussel},
  title = {How to deforest in accumulative parameters?},
  year = {1999},
  number = {3608},
  url = {ftp://ftp.inria.fr/INRIA/publication/RR/RR-3608.ps.gz}
}
Correnson, L. (1999), "Equational Semantics", In Second Workshop on Attribute Grammars and their Applications, WAGA'99. Amsterdam, The Netherlands. March 1999., pp. 205-222. INRIA rocquencourt.
Abstract: Attribute grammars are well-designed to construct complex algorithms by composing several ones together. Actually, there exists a powerful transformation called descriptional composition which highly simplifies the composition of two attribute grammars by removing useless intermediate constructions. However, most of non-linear algorithms can not be expressed with attribute grammars. Thus, many compositions can not be simplified by the decriptional composition. In this paper, we present Equational Semantics, a formalism largely inspired by attribute grammars but where non-linear algorithms can be encoded. More precisely, instead of being restricted to one input static tree as it is the case for attribute grammars, an algorithm encoded with Equational Semantics may use dynamically constructed trees. This formalism consists in an very poor abstract syntax. We present its semantics and some of its transformations such as partial evaluation and decriptionnal composition (also called deforestation).
BibTeX:
@inproceedings{Correnson99,
  author = {Loic Correnson},
  title = {Equational Semantics},
  booktitle = {Second Workshop on Attribute Grammars and their Applications, WAGA'99},
  publisher = {INRIA rocquencourt},
  year = {1999},
  pages = {205--222},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/www/fnc2/WAGA99/accept.html}
}
Correnson, L., Duris, E., Parigot, D. & Roussel, G. (1999), "Equational Semantics", In Symposium Static Analysis SAS'99 . Venice, Italy. #sept# 1999. Volume 1694, pp. 264-283.
Abstract: In the context of functional programming, semantic methods are commonly used to drive program transformations. However, classical semantic domains often rely on recursive objects which embed the control flow of recursive functions. As a consequence, transformations which have to modify the control flow are difficult to define. We propose in this paper a new semantic domain where the control flow is defined implicitly, and thus can be modified. This new theoretical and practical framework allows to homogeneously define and extend powerful transformations related to partial evaluation and deforestation.
BibTeX:
@inproceedings{Correnson99a,
  author = {Loïc Correnson and Etienne Duris and Didier Parigot and Gilles Roussel},
  title = {Equational Semantics},
  booktitle = {Symposium Static Analysis SAS'99 },
  year = {1999},
  volume = {1694},
  pages = {264--283},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/Correnson99a.ps.gz}
}
Correnson, L., Duris, E., Parigot, D. & Roussel, G. (1999), "Declarative program transformation: \a deforestation case-study", In Principles and Practice of Declarative Programming PPDP'99. Paris, France. October 1999. Volume 1702, pp. 353-369.
Abstract: Software engineering has to reconcile modularity with efficiency. One way to grapple with this dilemma is to automatically transform a modular-specified program into an efficient-implementable one. This is the aim of deforestation transformations which get rid of intermediate data structure constructions that occur when two functions are composed. Beyond classical compile time optimization, these transformations are undeniable tools for generic programming and software component specialization. Despite various and numerous research works in this area, general transformation methods cannot deforest some non-trivial intermediate constructions. Actually, these recalcitrant structures are built inside accumulating parameters and then, they follow a construction scheme which is independent from the function scheme itself. Known deforestation methods are too much tied to fixed recursion schemes to be able to deforest these structures. In this article, we show that a fully declarative approach of program transformation allows new deforestation sites to be detected and treated. We present the principle of the symbolic composition, based on the attribute grammar formalism, with an illustrative running example stemming from a typical problem of standard functional deforestations.
BibTeX:
@inproceedings{Correnson99b,
  author = {Loïc Correnson and Etienne Duris and Didier Parigot and Gilles Roussel},
  title = {Declarative program transformation: \a deforestation case-study},
  booktitle = {Principles and Practice of Declarative Programming PPDP'99},
  year = {1999},
  volume = {1702},
  pages = {353--369},
  note = {scriptsize http://www-sop.inria.fr/members/Didier.Parigot/publications/Correnson99b.ps.gz},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/Correnson99b.ps.gz}
}
Correnson, L. (1999), "Equational Semantics", Informatica (Solvenia).
Abstract: Attribute grammars are well-designed to construct complex algorithms by composing several ones together. Actually, there exists a powerful transformation called descriptional composition which highly simplifies the composition of two attribute grammars by removing useless intermediate constructions. However, most of non-linear algorithms can not be expressed with attribute grammars. Thus, many compositions can not be simplified by the decriptional composition. In this paper, we present Equational Semantics, a formalism largely inspired by attribute grammars but where non-linear algorithms can be encoded. More precisely, instead of being restricted to one input static tree as it is the case for attribute grammars, an algorithm encoded with Equational Semantics may use dynamically constructed trees. This formalism consists in an very poor abstract syntax. We present its semantics and some of its transformations such as partial evaluation and decriptionnal composition (also called deforestation).
BibTeX:
@article{Correnson99c,
  author = {Loic Correnson},
  title = {Equational Semantics},
  journal = {Informatica (Solvenia)},
  year = {1999},
  note = {scriptsize http://www-sop.inria.fr/members/Didier.Parigot/publications/Correnson99c.ps.gz},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/Correnson99c.ps.gz}
}
Grosch, J. (1999), "Using Attribute Grammars in Industry", In Second Workshop on Attribute Grammars and their Applications, WAGA'99. Amsterdam, The Netherlands. March 1999., pp. 1-16. INRIA rocquencourt.
Abstract: Are attribute grammars used in industrial applications? Or are attribute grammars just an academic playground? I would like to answer these two ques- tions based on my personal experience. I have been working with attribute grammars for around 17 years now. Around 10 years ago I started creating the Cocktail Toolbox which contains among other tools for compiler construction the attribute grammar tool ag. Five years ago I founded a company named CoCo- Lab which stands for compiler compiler laboratory. The company develops and markets the Cocktail Toolbox as well as parsers generated with Cocktail. We also do project work in the area of compiler construction and programming lan- guages. My first and very spontaneous answers to the above two questions are: Yes, in both cases. Attribute grammars are used in industry and at the same time they can be regarded as academic playground. This does seem contradictory, doesn't it? Therefore let me explain in more detail why I am giving the above answers.
BibTeX:
@inproceedings{Grosch99,
  author = {Josef Grosch},
  title = {Using Attribute Grammars in Industry},
  booktitle = {Second Workshop on Attribute Grammars and their Applications, WAGA'99},
  publisher = {INRIA rocquencourt},
  year = {1999},
  pages = {1--16},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/www/fnc2/WAGA99/accept.html}
}
Hansson, O. (1999), "Bayesian Problem-Solving Applied to Scheduling". University of California, Berkeley, Technical Report CSD-98-1028, January 5,, 1999.
Abstract: This dissertation describes several advances to the theory and practice of artificial intelligence scheduling and constraint-satisfaction techniques. I have developed and implemented these techniques during the construction of DTS, the Decision-Theoretic Scheduler, and its successor, SchedKit, a toolkit of scheduling algorithms and data structures. The dissertation describes and analyzes the three orthogonal approaches to improving a scheduler's performance. These are: (1) reducing the size of the state space to be searched, (2) reducing the per-state cost of state generation and evaluation, and (3) reducing the number of states examined by selective search. To reduce the size of the state space, I have developed several new preprocessing algorithms designed to exploit resource constraints, including resource capacity and resource/task compatibility. Experiments show that it is possible to exploit resource capacity constraints efficiently despite their inherently disjunctive nature. To reduce the cost of state generation, I employ computational geometry data structures that optimize incremental heuristic evaluation, constraint-checking and state-variable maintenance. These data structures can be compiled from a formal attribute grammar specification of the heuristics and constraints. Experience with these techniques in DTS shows significant speedups and other advantages over manually-coded software. Finally, to reduce the number of states examined during search, I have applied the Bayesian Problem-Solving (BPS) approach to the problem of search ordering in backtracking algorithms. The approach estimates, for each subtree, the search cost and probability that a solution exists. These estimates are conditioned on raw heuristic features used by other ordering techniques from the literature. Experiments with the BPS ordering heuristic on a state-of-the-art propositional satisfiability solver show that it overcomes a performance anomaly of an existing strong heuristic on two sets of benchmark problems.
BibTeX:
@techreport{Hansson99,
  author = {Othar Hansson},
  title = {Bayesian Problem-Solving Applied to Scheduling},
  year = {1999},
  number = {CSD-98-1028},
  pages = {89}
}
Hedin, G. (1999), "Reference Attributed Grammars", In Second Workshop on Attribute Grammars and their Applications, WAGA'99. Amsterdam, The Netherlands. March 1999., pp. 153-172. INRIA rocquencourt.
Abstract: An extension to canonical attribute grammars is introduced, permitting attributes to be references to arbitrary nodes in the syntax tree, and attributes to be accessed via the reference attributes. Important practical problems such as name and type analysis for object-oriented languages can be expressed concisely in these grammars, and an optimal evaluation algorithm is available. The proposed formalism and algorithm have been implemented in an interactive language development tool.
BibTeX:
@inproceedings{Hedin99,
  author = {Gorel Hedin},
  title = {Reference Attributed Grammars},
  booktitle = {Second Workshop on Attribute Grammars and their Applications, WAGA'99},
  publisher = {INRIA rocquencourt},
  year = {1999},
  pages = {153--172},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/www/fnc2/WAGA99/accept.html}
}
Lämmel, R. & Riedewald, G. (1999), "Reconstruction of paradigm shifts", In Second Workshop on Attribute Grammars and their Applications, WAGA'99. Amsterdam, The Netherlands. March 1999., pp. 37-56. INRIA rocquencourt.
Abstract: There are many extensions of the basic attribute grammar formalism intended to improve its pragmatics, e.g. certain modularity concepts, remote access, object-orientation, templates, rule models and higher-order features. In the paper, a generic and formal approach to an effective and orthogonal reconstruction of the concepts underlying some extensions is described. The reconstruction is effective in the sense that the reconstructed concepts are presented as executable meta-programs. The approach to reconstruction is formal in the sense that the derived meta-programs modelling certain concepts can be analysed based on properties of the meta-programs, e.g. preservation properties. Furthermore, it is a generic approach because the meta-programming framework can be instantiated not only for attribute grammars but also for several other representatives of the declarative paradigm, e.g. natural semantics and algebraic specification. Thereby, concepts can be imported from and exported to other frameworks. Finally, the reconstructions are derived orthogonally in the sense that potential roles are first unbundled and then particular combinations of the roles can be investigated. The described meta-programming framework has been implemented in the specification framework of LDL and it is used for reusable formal language definition based on attribute grammars and operational semantics.
BibTeX:
@inproceedings{Lammel99,
  author = {Ralf Lämmel and Günter Riedewald},
  title = {Reconstruction of paradigm shifts},
  booktitle = {Second Workshop on Attribute Grammars and their Applications, WAGA'99},
  publisher = {INRIA rocquencourt},
  year = {1999},
  pages = {37--56},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/www/fnc2/WAGA99/accept.html}
}
Mernik, M., c, M.L., cauv sevic, E.A. & Zumer, V. (1999), "Multiple Attribute Grammar Inheritance", In Second Workshop on Attribute Grammars and their Applications, WAGA'99. Amsterdam, The Netherlands. March 1999., pp. 57-76. INRIA rocquencourt.
Abstract: The language design process should be supported by modularity and abstraction in a manner that allows incremental changes as easily as possible. To at least partially fulfill this ambitious goal a new object-oriented attribute grammar specification language which support multiple attribute grammar inheritance is introduced. Multiple attribute grammar inheritance is a structural organization of attribute grammars where the attribute grammar inherits the specifications from ancestor attribute grammars, may add new specifications or may override some specifications from ancestors specifications. With the proposed approach a language designer has the chance to design incrementally a language or reuse some fragments from other programming language specifications. The multiple attribute grammar inheritance is first introduced using an example, and thereafter by a formal model. The proposed approach is successfully implemented in the compiler/interpreter generator tool LISA ver. 2.0.
BibTeX:
@inproceedings{Mernik99,
  author = {Marjan Mernik and Mitja Leniv c and Enis Avdiv cauv sevic and Viljem v Zumer},
  title = {Multiple Attribute Grammar Inheritance},
  booktitle = {Second Workshop on Attribute Grammars and their Applications, WAGA'99},
  publisher = {INRIA rocquencourt},
  year = {1999},
  pages = {57--76},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/www/fnc2/WAGA99/accept.html}
}
Natori, S., Gondow, K., Imaizumi, T., Hagiwara, T. & Katayama, T. (1999), "On Eliminating Type 3 Circularities of Ordered Attribute Grammars", In Second Workshop on Attribute Grammars and their Applications, WAGA'99. Amsterdam, The Netherlands. March 1999., pp. 93-112. INRIA rocquencourt.
Abstract: Ordered attribute grammars (OAGs for short) are a useful class of attribute grammars (AGs). For some attribute grammars, even though they are not circular, OAG circularity test reports that they are not ordered and fails to generate attribute evaluators because of the existence of type 3 circularities. First we discuss that it is sometimes difficult for programmers to eliminate type 3 circularities by hand. Secondly, in order to reduce this difficulty, we propose a new AG class called OAG* that produces less type 3 circularities than OAG while preserving the positive characteristic of OAG. We also show that we obtained good results with our experimental implementation.
BibTeX:
@inproceedings{Natori99,
  author = {Shin Natori and Katsuhiko Gondow and Takashi Imaizumi and Takeshi Hagiwara and Takuya Katayama},
  title = {On Eliminating Type 3 Circularities of Ordered Attribute Grammars},
  booktitle = {Second Workshop on Attribute Grammars and their Applications, WAGA'99},
  publisher = {INRIA rocquencourt},
  year = {1999},
  pages = {93--112},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/www/fnc2/WAGA99/accept.html}
}
(1999), "Second Workshop on Attribute Grammars and their Applications WAGA'99" Amsterdam, The Netherlands, March, 1999. INRIA rocquencourt.
BibTeX:
@proceedings{Parigot99,,
  title = {Second Workshop on Attribute Grammars and their Applications WAGA'99},
  publisher = {INRIA rocquencourt},
  year = {1999},
  note = {Satellite event of ETAPS'99 scriptsize http://www-sop.inria.fr/members/Didier.Parigot/www/fnc2/WAGA99/waga99.html},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/www/fnc2/WAGA99/waga99.html}
}
Persson, P. & Hedin, G. (1999), "Interactive Execution Time Predictions Using Reference Attributed Grammars", In Second Workshop on Attribute Grammars and their Applications, WAGA'99. Amsterdam, The Netherlands. March 1999., pp. 173-184. INRIA rocquencourt.
Abstract: A central problem for real-time scheduling is to acquire tight but conservative bounds on task execution times. We present a prototype for an environment where such bounds are interactively presented, in terms of source code constructs, to the programmer during development. The prototype is based on the language development tool APPLAB and uses an extended attribute grammar formalism, reference attributed grammars (RAGs), which overcomes some drawbacks of conventional attribute grammars in this context (e.g. description of non-local dependencies). In this paper we show how timing schemata can be implemented as RAGs. Our experience is that the RAG approach allows timing schemata to be implemented in a clear, concise, and modular manner.
BibTeX:
@inproceedings{Persson99,
  author = {Patrik Persson and Görel Hedin},
  title = {Interactive Execution Time Predictions Using Reference Attributed Grammars},
  booktitle = {Second Workshop on Attribute Grammars and their Applications, WAGA'99},
  publisher = {INRIA rocquencourt},
  year = {1999},
  pages = {173--184},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/www/fnc2/WAGA99/accept.html}
}
Psaila, G. & Crespi-Reghizzi, S. (1999), "Adding Semantics to XML", In Second Workshop on Attribute Grammars and their Applications, WAGA'99. Amsterdam, The Netherlands. March 1999., pp. 113-132. INRIA rocquencourt.
Abstract: Starting form the analogy between a document tagged by a mark-up language (XML, SGML) and a source string generated by a BNF grammar, we argue that XML parsers should benefit from the addition of semantic attributes and functions. Currently XML only includes initialized lexical attributes. By our approach a XML parser would be extended into a syntax-directed translator. Deep transformations of a document could be specified, sent over the network, and executed within the XML system. For the specification of the semantic attributes and functions we propose a XML Document Type Definition, that is conceptually similar to the metalanguage of a compiler-compiler. By this approach the additions to the XML standard are kept to a minimum.The differences between attribute grammars and attributed XML specifications are discussed, and the system architecture of a semantic evaluator generator is presented.
BibTeX:
@inproceedings{Psaila99,
  author = {G. Psaila and S. Crespi-Reghizzi},
  title = {Adding Semantics to XML},
  booktitle = {Second Workshop on Attribute Grammars and their Applications, WAGA'99},
  publisher = {INRIA rocquencourt},
  year = {1999},
  pages = {113--132},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/www/fnc2/WAGA99/accept.html}
}
Saraiva, J. & Swierstra, D. (1999), "Generic Attribute Grammars", In Second Workshop on Attribute Grammars and their Applications, WAGA'99. Amsterdam, The Netherlands. March 1999., pp. 185-204. INRIA rocquencourt.
Abstract: This paper introduces generic attribute grammars which provide a support for genericity, reusability and modularity in attribute grammars. A generic attribute grammar is a component which is easily reused, composed and understood. An attribute grammar based system is constructed out of a set of such generic components. These components can be analysed and compiled separately. Furthermore, deforestated attribute evaluator are derived for each component. As result, redundant intermediate data structures used to glue different components are eliminated.
BibTeX:
@inproceedings{Saraiva99,
  author = {Joao Saraiva and Doaitse Swierstra},
  title = {Generic Attribute Grammars},
  booktitle = {Second Workshop on Attribute Grammars and their Applications, WAGA'99},
  publisher = {INRIA rocquencourt},
  year = {1999},
  pages = {185--204},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/www/fnc2/WAGA99/accept.html}
}
Thanos, A. & Papakonstantinou, G. (1999), "Facilitating the Development of Parallel Implementations of Declarative Programming Languages Using Attribute Grammars", In Second Workshop on Attribute Grammars and their Applications, WAGA'99. Amsterdam, The Netherlands. March 1999., pp. 17-36. INRIA rocquencourt.
Abstract: This paper presents how we can model different control operations on parallel implementations of declarative programming languages. We use a program analysis method based on Attribute Grammar dependency graphs. We present the PAGE framework, which facilitates the development of parallel implementation of declarative languages. As in compiler technology, we use AG as a specification language for the description of the programming paradigms under consideration. Each of the programming paradigms is outlined from a transformation table or a combination of them. These tables consist of transformation actions that have to be applied, under some conditions. The transformations are described in the form of AG semantic rules. With this analysis we can discern a large part of the control of such languages which we can specify in a programmable way. The remain control part is forming a non-programmable layer which is following the restrictions of the underlying hardware architecture of each implementation. In this way we build a layer between the program executed and the control. Using AG technology to specify this control layer is the semantic basis of PAGE. The method can help towards the automation of the development of modern declarative programming languages, such as Concurrent Constraint Logic Programming Languages. The system has been implemented and tested in a wide range of architectures, exhibiting encouraging results.
BibTeX:
@inproceedings{Thanos99,
  author = {Aggelos Thanos and George Papakonstantinou},
  title = {Facilitating the Development of Parallel Implementations of Declarative Programming Languages Using Attribute Grammars},
  booktitle = {Second Workshop on Attribute Grammars and their Applications, WAGA'99},
  publisher = {INRIA rocquencourt},
  year = {1999},
  pages = {17--36},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/www/fnc2/WAGA99/accept.html}
}
lazybug Yang, W. (1999), "A finest partitioning algorithm for attribute grammars", In Second Workshop on Attribute Grammars and their Applications, WAGA'99. Amsterdam, The Netherlands. March 1999., pp. 77-92. INRIA rocquencourt.
Abstract: The attribute dependence graph of a syntax tree may be partitioned into disjoint regions. Attribute instances in different regions are independent of one other. The advantages of partitioning the attribute dependence graph include simplifying the attribute grammar conceptually and allowing the possibility of parallel evaluation. We present a static partitioning algorithm for attribute grammars. The algorithm builds the set of all feasible partitions for every production by analyzing the grammar. After the attributed syntax tree is constructed, one of the feasible partitions is chosen for each production instance in the syntax tree. Gluing together the selected partitions for individual production instances results in a partition of the attribute dependence graph of the syntax tree. No further merging or partitioning is needed at evaluation time. In addition to static partitioning, the algorithm always produces the finest partition of every attribute dependence graph.
BibTeX:
@inproceedings{Yang99,
  author = {Wuu lazybug Yang},
  title = {A finest partitioning algorithm for attribute grammars},
  booktitle = {Second Workshop on Attribute Grammars and their Applications, WAGA'99},
  publisher = {INRIA rocquencourt},
  year = {1999},
  pages = {77--92},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/www/fnc2/WAGA99/accept.html}
}
Correnson, L. (2000), "Sémantique Equationnelle". School: l'Ecole Polytechnique., April, 2000.
BibTeX:
@phdthesis{Correnson00,
  author = {Loic Correnson},
  title = {Sémantique Equationnelle},
  school = {l'Ecole Polytechnique},
  year = {2000},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/publications/theses/Correnson2000.ps.gz}
}
(2000), "Third Workshop on Attribute Grammars and their Applications WAGA'00" Ponte de Lima, Portugal, July, 2000. INRIA rocquencourt.
BibTeX:
@proceedings{Parigot00,,
  title = {Third Workshop on Attribute Grammars and their Applications WAGA'00},
  publisher = {INRIA rocquencourt},
  year = {2000},
  note = {Satellite event of MPC'2000},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/WAGA00/waga00.html}
}
(2000), "Attribute Grammars and Their Applications" Vol. 24(2) Informatica, Slovenia.
BibTeX:
@book{ParigotBook,,
  title = {Attribute Grammars and Their Applications},
  publisher = {Informatica, Slovenia},
  year = {2000},
  volume = {24},
  number = {2}
}
(2001), "Workshop on Language Descriptions, Tools and Applications" Genova, Italy, April, 2001. Electronic Notes in Theoretical Computer Science (ENTCS).
BibTeX:
@proceedings{Parigot01,,
  title = {Workshop on Language Descriptions, Tools and Applications},
  publisher = {Electronic Notes in Theoretical Computer Science (ENTCS)},
  year = {2001},
  note = {Satellite event of ETAPS'2001},
  url = {http://www-sop.inria.fr/members/Didier.Parigot/LDTA/ldta.html}
}
Benedikt, M., Chan, C.Y., Fan, W., Rastogi, R., Zheng, S. & Zhou, A. (2002), "DTD-directed publishing with attribute translation grammars", In VLDB '02: Proceedings of the 28th international conference on Very Large Data Bases., pp. 838-849. VLDB Endowment.
BibTeX:
@inproceedings{Benedikt2002,
  author = {Benedikt,, Michael and Chan,, Chee Yong and Fan,, Wenfei and Rastogi,, Rajeev and Zheng,, Shihui and Zhou,, Aoying},
  title = {DTD-directed publishing with attribute translation grammars},
  booktitle = {VLDB '02: Proceedings of the 28th international conference on Very Large Data Bases},
  publisher = {VLDB Endowment},
  year = {2002},
  pages = {838--849}
}
Neven, F. & Van Den Bussche, J. (2002), "Expressiveness of structured document query languages based on attribute grammars", J. ACM. New York, NY, USA Vol. 49(1), pp. 56-100. ACM.
BibTeX:
@article{Neven2002,
  author = {Neven,, Frank and Van Den Bussche,, Jan},
  title = {Expressiveness of structured document query languages based on attribute grammars},
  journal = {J. ACM},
  publisher = {ACM},
  year = {2002},
  volume = {49},
  number = {1},
  pages = {56--100},
  doi = {http://doi.acm.org/10.1145/505241.505245}
}
van den Brand, M.G.J., Klint, P. & Vinju, J.J. (2003), "Term rewriting with traversal functions", ACM Trans. Softw. Eng. Methodol.. New York, NY, USA Vol. 12(2), pp. 152-190. ACM.
BibTeX:
@article{Brand2003,
  author = {van den Brand,, Mark G. J. and Klint,, Paul and Vinju,, Jurgen J.},
  title = {Term rewriting with traversal functions},
  journal = {ACM Trans. Softw. Eng. Methodol.},
  publisher = {ACM},
  year = {2003},
  volume = {12},
  number = {2},
  pages = {152--190},
  doi = {http://doi.acm.org/10.1145/941566.941568}
}
Chok, S.S. & Marriott, K. (2003), "Automatic generation of intelligent diagram editors", ACM Trans. Comput.-Hum. Interact.. New York, NY, USA Vol. 10(3), pp. 244-276. ACM.
BibTeX:
@article{Chok2003,
  author = {Chok,, Sitt Sen and Marriott,, Kim},
  title = {Automatic generation of intelligent diagram editors},
  journal = {ACM Trans. Comput.-Hum. Interact.},
  publisher = {ACM},
  year = {2003},
  volume = {10},
  number = {3},
  pages = {244--276},
  doi = {http://doi.acm.org/10.1145/937549.937553}
}
Gançarski, A.L. & Henriques, P.R. (2003), "Interactive information retrieval from XML documents represented by attribute grammars", In DocEng '03: Proceedings of the 2003 ACM symposium on Document engineering. New York, NY, USA., pp. 171-174. ACM.
BibTeX:
@inproceedings{Ganccarski2003,
  author = {Gançarski,, Alda Lopes and Henriques,, Pedro Rangel},
  title = {Interactive information retrieval from XML documents represented by attribute grammars},
  booktitle = {DocEng '03: Proceedings of the 2003 ACM symposium on Document engineering},
  publisher = {ACM},
  year = {2003},
  pages = {171--174},
  doi = {http://doi.acm.org/10.1145/958220.958251}
}
Kuhn, J. (2003), "Compounding and derivational morphology in a finite-state setting", In ACL '03: Proceedings of the 41st Annual Meeting on Association for Computational Linguistics. Morristown, NJ, USA., pp. 192-199. Association for Computational Linguistics.
BibTeX:
@inproceedings{Kuhn2003,
  author = {Kuhn,, Jonas},
  title = {Compounding and derivational morphology in a finite-state setting},
  booktitle = {ACL '03: Proceedings of the 41st Annual Meeting on Association for Computational Linguistics},
  publisher = {Association for Computational Linguistics},
  year = {2003},
  pages = {192--199},
  doi = {http://dx.doi.org/10.3115/1075096.1075121}
}
Mcroy, S.W., Channarukul, S. & Ali, S.S. (2003), "An augmented template-based approach to text realization", Nat. Lang. Eng.. New York, NY, USA Vol. 9(4), pp. 381-420. Cambridge University Press.
BibTeX:
@article{Mcroy2003,
  author = {Mcroy,, Susan W. and Channarukul,, Songsak and Ali,, Syed S.},
  title = {An augmented template-based approach to text realization},
  journal = {Nat. Lang. Eng.},
  publisher = {Cambridge University Press},
  year = {2003},
  volume = {9},
  number = {4},
  pages = {381--420},
  doi = {http://dx.doi.org/10.1017/S1351324903003188}
}
Saraiva, J. a. & Swierstra, D. (2003), "Generating spreadsheet-like tools from strong attribute grammars", In GPCE '03: Proceedings of the 2nd international conference on Generative programming and component engineering. New York, NY, USA., pp. 307-323. Springer-Verlag New York, Inc..
BibTeX:
@inproceedings{Saraiva2003,
  author = {Saraiva,, Jo ao and Swierstra,, Doaitse},
  title = {Generating spreadsheet-like tools from strong attribute grammars},
  booktitle = {GPCE '03: Proceedings of the 2nd international conference on Generative programming and component engineering},
  publisher = {Springer-Verlag New York, Inc.},
  year = {2003},
  pages = {307--323}
}
Verstak, A., Ramakrishnan, N., Watson, L.T., He, J., Shaffer, C.A., Bae, K.K., Jiang, J., Tranter, W.H. & Rappaport, T.S. (2003), "BSML: A binding schema markup language for data interchange in problem solving environments", Sci. Program.. Amsterdam, The Netherlands, The Netherlands Vol. 11(3), pp. 199-224. IOS Press.
BibTeX:
@article{Verstak2003,
  author = {Verstak,, Alex and Ramakrishnan,, Naren and Watson,, Layne T. and He,, Jian and Shaffer,, Clifford A. and Bae,, Kyung Kyoon and Jiang,, Jing and Tranter,, William H. and Rappaport,, Theodore S.},
  title = {BSML: A binding schema markup language for data interchange in problem solving environments},
  journal = {Sci. Program.},
  publisher = {IOS Press},
  year = {2003},
  volume = {11},
  number = {3},
  pages = {199--224}
}
Cahill, A., Burke, M., O'Donovan, R., van Genabith, J. & Way, A. (2004), "Long-distance dependency resolution in automatically acquired wide-coverage PCFG-based LFG approximations", In ACL '04: Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics. Morristown, NJ, USA., pp. 319. Association for Computational Linguistics.
BibTeX:
@inproceedings{Cahill2004,
  author = {Cahill,, Aoife and Burke,, Michael and O'Donovan,, Ruth and van Genabith,, Josef and Way,, Andy},
  title = {Long-distance dependency resolution in automatically acquired wide-coverage PCFG-based LFG approximations},
  booktitle = {ACL '04: Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics},
  publisher = {Association for Computational Linguistics},
  year = {2004},
  pages = {319},
  doi = {http://dx.doi.org/10.3115/1218955.1218996}
}
Chitic, C. & Rosu, D. (2004), "On validation of XML streams using finite state machines", In WebDB '04: Proceedings of the 7th International Workshop on the Web and Databases. New York, NY, USA., pp. 85-90. ACM.
BibTeX:
@inproceedings{Chitic2004,
  author = {Chitic,, Cristiana and Rosu,, Daniela},
  title = {On validation of XML streams using finite state machines},
  booktitle = {WebDB '04: Proceedings of the 7th International Workshop on the Web and Databases},
  publisher = {ACM},
  year = {2004},
  pages = {85--90},
  doi = {http://doi.acm.org/10.1145/1017074.1017096}
}
Gançarski, A.L. & Henriques, P.R. (2004), "Presenting the results of relevance-oriented search over XML documents", In DocEng '04: Proceedings of the 2004 ACM symposium on Document engineering. New York, NY, USA., pp. 31-33. ACM.
BibTeX:
@inproceedings{Ganccarski2004,
  author = {Gançarski,, Alda Lopes and Henriques,, Pedro Rangel},
  title = {Presenting the results of relevance-oriented search over XML documents},
  booktitle = {DocEng '04: Proceedings of the 2004 ACM symposium on Document engineering},
  publisher = {ACM},
  year = {2004},
  pages = {31--33},
  doi = {http://doi.acm.org/10.1145/1030397.1030402}
}
Glesner, S. & Zimmermann, W. (2004), "Natural semantics as a static program analysis framework", ACM Trans. Program. Lang. Syst.. New York, NY, USA Vol. 26(3), pp. 510-577. ACM.
BibTeX:
@article{Glesner2004,
  author = {Glesner,, Sabine and Zimmermann,, Wolf},
  title = {Natural semantics as a static program analysis framework},
  journal = {ACM Trans. Program. Lang. Syst.},
  publisher = {ACM},
  year = {2004},
  volume = {26},
  number = {3},
  pages = {510--577},
  doi = {http://doi.acm.org/10.1145/982158.982161}
}
Neff, N. (2004), "Attribute based compiler implemented using visitor pattern", In SIGCSE '04: Proceedings of the 35th SIGCSE technical symposium on Computer science education. New York, NY, USA., pp. 130-134. ACM.
BibTeX:
@inproceedings{Neff2004,
  author = {Neff,, Norman},
  title = {Attribute based compiler implemented using visitor pattern},
  booktitle = {SIGCSE '04: Proceedings of the 35th SIGCSE technical symposium on Computer science education},
  publisher = {ACM},
  year = {2004},
  pages = {130--134},
  doi = {http://doi.acm.org/10.1145/971300.971347}
}
Panagopoulos, I., Pavlatos, C. & Papakonstantinou, G. (2004), "A hardware extension of the RISC microprocessor for Attribute Grammar evaluation", In SAC '04: Proceedings of the 2004 ACM symposium on Applied computing. New York, NY, USA., pp. 897-904. ACM.
BibTeX:
@inproceedings{Panagopoulos2004,
  author = {Panagopoulos,, Ioannis and Pavlatos,, Christos and Papakonstantinou,, George},
  title = {A hardware extension of the RISC microprocessor for Attribute Grammar evaluation},
  booktitle = {SAC '04: Proceedings of the 2004 ACM symposium on Applied computing},
  publisher = {ACM},
  year = {2004},
  pages = {897--904},
  doi = {http://doi.acm.org/10.1145/967900.968081}
}
Wu, P.-C. (2004), "On exponential-time completeness of the circularity problem for attribute grammars", ACM Trans. Program. Lang. Syst.. New York, NY, USA Vol. 26(1), pp. 186-190. ACM.
BibTeX:
@article{Wu2004,
  author = {Wu,, Pei-Chi},
  title = {On exponential-time completeness of the circularity problem for attribute grammars},
  journal = {ACM Trans. Program. Lang. Syst.},
  publisher = {ACM},
  year = {2004},
  volume = {26},
  number = {1},
  pages = {186--190},
  doi = {http://doi.acm.org/10.1145/963778.963783}
}
Boyland, J.T. (2005), "Remote attribute grammars", J. ACM. New York, NY, USA Vol. 52(4), pp. 627-687. ACM.
BibTeX:
@article{Boyland2005,
  author = {Boyland,, John Tang},
  title = {Remote attribute grammars},
  journal = {J. ACM},
  publisher = {ACM},
  year = {2005},
  volume = {52},
  number = {4},
  pages = {627--687},
  doi = {http://doi.acm.org/10.1145/1082036.1082042}
}
Hennessy, M. & Power, J.F. (2005), "An analysis of rule coverage as a criterion in generating minimal test suites for grammar-based software", In ASE '05: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering. New York, NY, USA., pp. 104-113. ACM.
BibTeX:
@inproceedings{Hennessy2005,
  author = {Hennessy,, Mark and Power,, James F.},
  title = {An analysis of rule coverage as a criterion in generating minimal test suites for grammar-based software},
  booktitle = {ASE '05: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering},
  publisher = {ACM},
  year = {2005},
  pages = {104--113},
  doi = {http://doi.acm.org/10.1145/1101908.1101926}
}
Klint, P., Lämmel, R. & Verhoef, C. (2005), "Toward an engineering discipline for grammarware", ACM Trans. Softw. Eng. Methodol.. New York, NY, USA Vol. 14(3), pp. 331-380. ACM.
BibTeX:
@article{Klint2005,
  author = {Klint,, Paul and Lämmel,, Ralf and Verhoef,, Chris},
  title = {Toward an engineering discipline for grammarware},
  journal = {ACM Trans. Softw. Eng. Methodol.},
  publisher = {ACM},
  year = {2005},
  volume = {14},
  number = {3},
  pages = {331--380},
  doi = {http://doi.acm.org/10.1145/1072997.1073000}
}
Kossatchev, A.S. & Posypkin, M.A. (2005), "Survey of compiler testing methods", Program. Comput. Softw.. New York, NY, USA Vol. 31(1), pp. 10-19. Plenum Press.
BibTeX:
@article{Kossatchev2005,
  author = {Kossatchev,, A. S. and Posypkin,, M. A.},
  title = {Survey of compiler testing methods},
  journal = {Program. Comput. Softw.},
  publisher = {Plenum Press},
  year = {2005},
  volume = {31},
  number = {1},
  pages = {10--19},
  doi = {http://dx.doi.org/10.1007/s11086-005-0008-6}
}
Kotb, Y. & Katayama, T. (2005), "Consistency checking of UML model diagrams using the XML semantics approach", In WWW '05: Special interest tracks and posters of the 14th international conference on World Wide Web. New York, NY, USA., pp. 982-983. ACM.
BibTeX:
@inproceedings{Kotb2005,
  author = {Kotb,, Yasser and Katayama,, Takuya},
  title = {Consistency checking of UML model diagrams using the XML semantics approach},
  booktitle = {WWW '05: Special interest tracks and posters of the 14th international conference on World Wide Web},
  publisher = {ACM},
  year = {2005},
  pages = {982--983},
  doi = {http://doi.acm.org/10.1145/1062745.1062829}
}
Mernik, M., Heering, J. & Sloane, A.M. (2005), "When and how to develop domain-specific languages", ACM Comput. Surv.. New York, NY, USA Vol. 37(4), pp. 316-344. ACM.
BibTeX:
@article{Mernik2005,
  author = {Mernik,, Marjan and Heering,, Jan and Sloane,, Anthony M.},
  title = {When and how to develop domain-specific languages},
  journal = {ACM Comput. Surv.},
  publisher = {ACM},
  year = {2005},
  volume = {37},
  number = {4},
  pages = {316--344},
  doi = {http://doi.acm.org/10.1145/1118890.1118892}
}
Sierra, J.L., Navarro, A., Fernández-Manjón, B. & Fernández-Valmayor, A. (2005), "Incremental definition and operationalization of domain-specific markup languages in ADDS", SIGPLAN Not.. New York, NY, USA Vol. 40(12), pp. 28-37. ACM.
BibTeX:
@article{Sierra2005,
  author = {Sierra,, José L. and Navarro,, Antonio and Fernández-Manjón,, Baltasar and Fernández-Valmayor,, Alfredo},
  title = {Incremental definition and operationalization of domain-specific markup languages in ADDS},
  journal = {SIGPLAN Not.},
  publisher = {ACM},
  year = {2005},
  volume = {40},
  number = {12},
  pages = {28--37},
  doi = {http://doi.acm.org/10.1145/1117303.1117308}
}
Črepinšek, M., Mernik, M., Javed, F., Bryant, B.R. & Sprague, A. (2005), "Extracting grammar from programs: evolutionary approach", SIGPLAN Not.. New York, NY, USA Vol. 40(4), pp. 39-46. ACM.
BibTeX:
@article{vCrepinvsek2005,
  author = {Črepinšek,, Matej and Mernik,, Marjan and Javed,, Faizan and Bryant,, Barrett R. and Sprague,, Alan},
  title = {Extracting grammar from programs: evolutionary approach},
  journal = {SIGPLAN Not.},
  publisher = {ACM},
  year = {2005},
  volume = {40},
  number = {4},
  pages = {39--46},
  doi = {http://doi.acm.org/10.1145/1064165.1064172}
}
Wu, H., Gray, J., Roychoudhury, S. & Mernik, M. (2005), "Weaving a debugging aspect into domain-specific language grammars", In SAC '05: Proceedings of the 2005 ACM symposium on Applied computing. New York, NY, USA., pp. 1370-1374. ACM.
BibTeX:
@inproceedings{Wu2005,
  author = {Wu,, Hui and Gray,, Jeff and Roychoudhury,, Suman and Mernik,, Marjan},
  title = {Weaving a debugging aspect into domain-specific language grammars},
  booktitle = {SAC '05: Proceedings of the 2005 ACM symposium on Applied computing},
  publisher = {ACM},
  year = {2005},
  pages = {1370--1374},
  doi = {http://doi.acm.org/10.1145/1066677.1066986}
}
Frost, R.A. (2006), "Realization of natural language interfaces using lazy functional programming", ACM Comput. Surv.. New York, NY, USA Vol. 38(4), pp. 11. ACM.
BibTeX:
@article{Frost2006,
  author = {Frost,, Richard A.},
  title = {Realization of natural language interfaces using lazy functional programming},
  journal = {ACM Comput. Surv.},
  publisher = {ACM},
  year = {2006},
  volume = {38},
  number = {4},
  pages = {11},
  doi = {http://doi.acm.org/10.1145/1177352.1177353}
}
Martens, W., Neven, F., Schwentick, T. & Bex, G.J. (2006), "Expressiveness and complexity of XML Schema", ACM Trans. Database Syst.. New York, NY, USA Vol. 31(3), pp. 770-813. ACM.
BibTeX:
@article{Martens2006,
  author = {Martens,, Wim and Neven,, Frank and Schwentick,, Thomas and Bex,, Geert Jan},
  title = {Expressiveness and complexity of XML Schema},
  journal = {ACM Trans. Database Syst.},
  publisher = {ACM},
  year = {2006},
  volume = {31},
  number = {3},
  pages = {770--813},
  doi = {http://doi.acm.org/10.1145/1166074.1166076}
}
Montana, D., VanWyk, E., Brinn, M., Montana, J. & Milligan, S. (2006), "Genomic computing networks learn complex POMDPs", In GECCO '06: Proceedings of the 8th annual conference on Genetic and evolutionary computation. New York, NY, USA., pp. 233-234. ACM.
BibTeX:
@inproceedings{Montana2006,
  author = {Montana,, David and VanWyk,, Eric and Brinn,, Marshall and Montana,, Joshua and Milligan,, Stephen},
  title = {Genomic computing networks learn complex POMDPs},
  booktitle = {GECCO '06: Proceedings of the 8th annual conference on Genetic and evolutionary computation},
  publisher = {ACM},
  year = {2006},
  pages = {233--234},
  doi = {http://doi.acm.org/10.1145/1143997.1144037}
}
Zhu, S.-C. & Mumford, D. (2006), "A stochastic grammar of images", Found. Trends. Comput. Graph. Vis.. Hanover, MA, USA Vol. 2(4), pp. 259-362. Now Publishers Inc..
BibTeX:
@article{Zhu2006,
  author = {Zhu,, Song-Chun and Mumford,, David},
  title = {A stochastic grammar of images},
  journal = {Found. Trends. Comput. Graph. Vis.},
  publisher = {Now Publishers Inc.},
  year = {2006},
  volume = {2},
  number = {4},
  pages = {259--362},
  doi = {http://dx.doi.org/10.1561/0600000018}
}
Brabrand, C. & Schwartzbach, M.I. (2007), "The metafront system: Safe and extensible parsing and transformation", Sci. Comput. Program.. Amsterdam, The Netherlands, The Netherlands Vol. 68(1), pp. 2-20. Elsevier North-Holland, Inc..
BibTeX:
@article{Brabrand2007,
  author = {Brabrand,, Claus and Schwartzbach,, Michael I.},
  title = {The metafront system: Safe and extensible parsing and transformation},
  journal = {Sci. Comput. Program.},
  publisher = {Elsevier North-Holland, Inc.},
  year = {2007},
  volume = {68},
  number = {1},
  pages = {2--20},
  doi = {http://dx.doi.org/10.1016/j.scico.2005.06.007}
}
Ekman, T. & Hedin, G. (2007), "The jastadd extensible java compiler", In OOPSLA '07: Proceedings of the 22nd annual ACM SIGPLAN conference on Object-oriented programming systems and applications. New York, NY, USA., pp. 1-18. ACM.
BibTeX:
@inproceedings{Ekman2007,
  author = {Ekman,, Torbjörn and Hedin,, Görel},
  title = {The jastadd extensible java compiler},
  booktitle = {OOPSLA '07: Proceedings of the 22nd annual ACM SIGPLAN conference on Object-oriented programming systems and applications},
  publisher = {ACM},
  year = {2007},
  pages = {1--18},
  doi = {http://doi.acm.org/10.1145/1297027.1297029}
}
Ekman, T. & Hedin, G. (2007), "The JastAdd system --- modular extensible compiler construction", Sci. Comput. Program.. Amsterdam, The Netherlands, The Netherlands Vol. 69(1-3), pp. 14-26. Elsevier North-Holland, Inc..
BibTeX:
@article{Ekman2007a,
  author = {Ekman,, Torbjörn and Hedin,, Görel},
  title = {The JastAdd system --- modular extensible compiler construction},
  journal = {Sci. Comput. Program.},
  publisher = {Elsevi