Compiler Design

[1]  Niklaus Wirth,et al.  Algorithms + Data Structures = Programs , 1976 .

[2]  Ulrich Möncke,et al.  Generierung von Systemen zur Transformation attributierter Operatorbäume: Komponenten d. Systems u. Mechanismen d. Generierung , 1985 .

[3]  Donald E. Knuth,et al.  Semantics of context-free languages , 1968, Mathematical systems theory.

[4]  David Pager,et al.  The lane-tracing algorithm for constructing LR (k) parsers and ways of enhancing its efficiency , 1977, Inf. Sci..

[5]  Bruno Courcelle,et al.  Equivalences and Transformations of Regular Systems-Applications to Recursive Program Schemes and Grammars , 1986, Theor. Comput. Sci..

[6]  Henk Alblas,et al.  Attribute Evaluation Methods , 1991, Attribute Grammars, Applications and Systems.

[7]  Richard Edwin Stearns,et al.  Syntax-Directed Transduction , 1966, JACM.

[8]  Jean Huens,et al.  A Programming methodology in compiler construction , 1979 .

[9]  David Pager,et al.  Eliminating unit productions from LR parsers , 1977, Acta Informatica.

[10]  Frank Neven,et al.  Expressiveness of structured document query languages based on attribute grammars , 1998, JACM.

[11]  Xavier Leroy,et al.  Validating LR(1) Parsers , 2012, ESOP.

[12]  Masaru Tomita,et al.  An Efficient Context-Free Parsing Algorithm for Natural Languages , 1985, IJCAI.

[13]  Pierre Deransart,et al.  Attribute Grammars: Definitions, Systems and Bibliography , 1988 .

[14]  Robert Giegerich,et al.  Counter-One-Pass Features in One-Pass Compilation: A Formalization Using Attribute Grammars , 1978, Inf. Process. Lett..

[15]  Reinhard Wilhelm,et al.  Grammar Flow Analysis , 1991, Attribute Grammars, Applications and Systems.

[16]  Mark P. Jones.  A system of constructor classes: overloading and implicit higher-order polymorphism , 1993, FPCA '93.

[17]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[18]  João Saraiva,et al.  Generating Spreadsheet-Like Tools from Strong Attribute Grammars , 2003, GPCE.

[19]  S. Doaitse Swierstra,et al.  Attribute grammars fly first-class: how to do aspect oriented programming in Haskell , 2009, ICFP.

[20]  Michael L. Van De Vanter.  A FORMALIZATION AND CORRECTNESS PROOF OF THE CGOL LANGUAGE SYSTEM , 1975 .

[21]  Donald E. Knuth.  Semantics of context-free languages: Correction , 2005, Mathematical systems theory.

[22]  R. Wilhelm,et al.  Iterative Algorithms on Grammar Graphs , 1982, WG.

[23]  Donald E. Knuth,et al.  A Generalization of Dijkstra's Algorithm , 1977, Inf. Process. Lett..

[24]  Eljas Soisalon-Soininen,et al.  LR(k) and LL(k) parsing , 1990 .

[25]  Robin Milner,et al.  A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..

[26]  Franklin L. DeRemer,et al.  Simple LR(k) grammars , 1971, Commun. ACM.

[27]  M. Jazayeri,et al.  The intrinsically exponential complexity of the circularity problem for attribute grammars , 1975, CACM.

[28]  E. Schmidt,et al.  Lex—a lexical analyzer generator , 1990 .

[29]  Douglas T. Ross,et al.  Automatic generation of efficient lexical processors using finite state techniques , 1968, CACM.

[30]  Ken Kennedy,et al.  Automatic generation of efficient evaluators for attribute grammars , 1976, POPL.

[31]  Robin Milner,et al.  Principal type-schemes for functional programs , 1982, POPL '82.

[32]  S. Doaitse Swierstra,et al.  Typed Transformations of Typed Grammars: The Left Corner Transform , 2010, Electron. Notes Theor. Comput. Sci..

[33]  Sönke Kannapinn.  Eine Rekonstruktion der LR-Theorie zur Elimination von Redundanz mit Anwendung auf den Bau von ELR-Parsern , 2001 .

[34]  S. Doaitse Swierstra,et al.  The Kennedy-Warren Algorithm Revisited: Ordering Attribute Grammars , 2012, PADL.

[35]  Frank DeRemer,et al.  A simplified operator identification scheme for Ada , 1980, SIGP.

[36]  Simon Peyton Jones,et al.  Type classes: an exploration of the design space , 1997 .

[37]  Peter Dencker,et al.  Optimization of parser tables for portable compilers , 1984, TOPL.

[38]  Jacques Garrigue.  Relaxing the Value Restriction , 2002, APLAS.

[39]  F. L. Deremer,et al.  Practical translators for LR(k) languages , 1969 .

[40]  Philip Wadler,et al.  How to make ad-hoc polymorphism less ad hoc , 1989, POPL '89.

[41]  Vaughan R. Pratt,et al.  Top down operator precedence , 1973, POPL.

[42]  Bruno Courcelle.  Attribute Grammars: Definitions, Analysis of Dependencies, Proof Methods , 1983, Method and tools for compiler construction.

[43]  Norbert Blum.  On LR(k)-Parsers of Polynomial Size , 2010, ICALP.

[44]  Robert W. Floyd,et al.  Syntactic Analysis and Operator Precedence , 1963, JACM.

[45]  Joost Engelfriet,et al.  Attribute Grammars: Attribute Evaluation Methods , 1984, Method and tools for compiler construction.

[46]  Urs Ammann.  Error recovery in recursive descent parsers , 1978 .

[47]  B Lorho.  Methods and tools for compiler construction , 1984 .

[48]  David A. Watt,et al.  The parsing problem for affix grammars , 1977, Acta Informatica.

[49]  Hanne Riis Nielson,et al.  Computation sequences: A way to characterize classes of attribute grammars , 1983, Acta Informatica.

[50]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[51]  Reinhold Heckmann.  An efficient ELL(1)-parser generator , 2004, Acta Informatica.

[52]  Donald E. Knuth,et al.  On the Translation of Languages from Left to Right , 1965, Inf. Control..

[53]  R. Hindley.  The Principal Type-Scheme of an Object in Combinatory Logic , 1969 .