A. V. Aho & S. C. Johnson (1976):
Optimal Code Generation for Expression Trees.
J. ACM 23(3),
pp. 488501,
doi:10.1145/321958.321970.
Alfred V. Aho, Ravi Sethi & Jeffrey D. Ullman (1986):
Compilers: Principles, Techniques, and Tools.
Addison-Wesley Longman Publishing Co., Inc.,
USA.
Alfred V. Aho & Jeffrey D. Ullman (1972):
The Theory of Parsing, Translation, and Compiling.
Prentice-Hall, Inc.,
USA.
Andrew W. Appel (2004):
Modern Compiler Implementation in ML.
Cambridge University Press,
USA.
Andrew W. Appel (2007):
Modern Compiler Implementation in Java.
Foundation Press, Inc.,
USA.
Andrew W. Appel & Maia Ginsburg (1998):
Modern Compiler Implementation in C.
Press Syndicate of the University of Cambridge.
Gregory J. Chaitin, Marc A. Auslander, Ashok K. Chandra, John Cocke, Martin E. Hopkins & Peter W. Markstein (1981):
Register Allocation via Coloring.
Comput. Lang. 6(1),
pp. 4757,
doi:10.1016/0096-0551(81)90048-5.
Christopher W. Fraser (1991):
A Retargetable Compiler for ANSI C.
SIGPLAN Not. 26(10),
pp. 2943,
doi:10.1145/122616.122621.
Christopher W. Fraser & David R. Hanson (1995):
A Retargetable C Compiler: Design and Implementation.
Addison-Wesley Longman Publishing Co., Inc.,
USA.
Christopher W. Fraser, David R. Hanson & Todd A. Proebsting (1992):
Engineering a Simple, Efficient Code-Generator Generator.
ACM Lett. Program. Lang. Syst. 1(3),
pp. 213226,
doi:10.1145/151640.151642.
Christopher W. Fraser, Robert R. Henry & Todd A. Proebsting (1992):
BURG: Fast Optimal Instruction Selection and Tree Parsing.
SIGPLAN Not. 27(4),
pp. 6876,
doi:10.1145/131080.131089.
A. Ghuloum (2006):
An Incremental Approach to Compiler Construction.
Scheme and Functional Programming.
Anastasia Izmaylova, Ali Afroozeh & Tijs van der Storm (2016):
Practical, General Parser Combinators.
In: Proceedings of the 2016 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation,
PEPM '16.
Association for Computing Machinery,
New York, NY, USA,
pp. 112,
doi:10.1145/2847538.2847539.
Mark Johnson (1995):
Memoization in Top-down Parsing.
Comput. Linguist. 21(3),
pp. 405417.
Chris Lattner & Vikram Adve (2004):
LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation.
In: Proceedings of the International Symposium on Code Generation and Optimization: Feedback-Directed and Runtime Optimization,
CGO '04.
IEEE Computer Society,
USA,
pp. 75.
S.S. Lavrov (1962):
Store economy in closed operator schemes.
USSR Computational Mathematics and Mathematical Physics 1(3),
pp. 810–828,
doi:10.1016/0041-5553(63)90176-9.
Fabrice Le Fessant & Luc Maranget (2001):
Optimizing Pattern Matching.
SIGPLAN Not. 36(10),
pp. 2637,
doi:10.1145/507669.507641.
Luc Maranget (2008):
Compiling Pattern Matching to Good Decision Trees.
In: Proceedings of the 2008 ACM SIGPLAN Workshop on ML,
ML 08.
Association for Computing Machinery,
New York, NY, USA,
pp. 3546,
doi:10.1145/1411304.1411311.
Robert Morgan (1998):
Building an Optimizing Compiler.
Digital Press,
USA.
Steven S. Muchnick (1998):
Advanced Compiler Design and Implementation.
Morgan Kaufmann Publishers Inc.,
San Francisco, CA, USA.
Rohan Padhye, Koushik Sen & Paul N. Hilfinger (2019):
ChocoPy: A Programming Language for Compilers Courses.
In: Proceedings of the 2019 ACM SIGPLAN Symposium on SPLASH-E,
SPLASH-E 2019.
Association for Computing Machinery,
New York, NY, USA,
pp. 4145,
doi:10.1145/3358711.3361627.
E. Pelegrí-Llopart & S. L. Graham (1988):
Optimal Code Generation for Expression Trees: An Application BURS Theory.
In: Proceedings of the 15th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages,
POPL '88.
Association for Computing Machinery,
New York, NY, USA,
pp. 294308,
doi:10.1145/73560.73586.
Ravi Sethi & J. D. Ullman (1970):
The Generation of Optimal Code for Arithmetic Expressions.
J. ACM 17(4),
pp. 715728,
doi:10.1145/321607.321620.
A. van Wijngaarden (1969):
Report on the Algorithmic Language ALGOL 68.
Printing by the Mathematisch Centrum.
eptcs@eptcs.org