Java Reference
In-Depth Information
[Lam95]
Leslie Lamport.
LaTeX: A Document Preparation System
. Addison-
Wesley, Reading, MA, 1995.
[Lar90]
J. R. Larus. Spim s20: A mips r2000 stimulator. Technical Report
TR966, University of Wisconsin, Madison, 1990.
[LH86]
J. R. Larus and P. N. Hilfinger. Register allocation in the spur lisp
compiler. In
ACM SIGPLAN Symposium on Compiler Construction
,
pages 255-263, Palo Alto, CA, 1986.
[LS83]
M.E. Lesk and E. Schmidt.
LEX - A Lexical Analyzer Generator
.Bell
Laboratories, Murray Hill, NJ, 1983.
[LT79]
Thomas Lengauer and Robert Endre Tarjan. A fast algorithm
for finding dominators in a flowgraph. In
ACM Transactions on
Programming Languages and Systems
, 1(1):121-141, July 1979.
[Mar03]
John C. Martin.
Introduction to Languages and the Theory of Compu-
tation
. McGraw-Hill, San Francisco, 2003.
[McC60]
John McCarthy. Recursive functions of symbolic expressions and
their computation by machine, Part I.
In
Communications of the
ACM
, 3(4):184-195, 1960.
[McK65] W. M. McKeeman. Peephole optimization. In
Communications of
the ACM
, 8(7):443-444, 1965.
[Mey]
[Moe90]
Hanspeter Moessenboeck. Coco
r - a generator for fast compiler
front-ends. Technical report, ETH Zurich, 1990.
/
[MR90]
T. J. Marlowe and B. G. Ryder. Properties of data flow frameworks:
aunifiedmodel.In
Acta Informatica
, 28(2):121-163, 1990.
[MTHM97] Robin Milner, Mads Tofte, Robert Harper, and David McQueen.
The Definition of Standard ML (Revised)
. MIT Press, Cambridge,
MA, May 1997.
[Mye81]
EugeneW. Myers. Aprecise inter-procedural data flow algorithm.
In
Proceedings of the ACM SIGACT-SIGPLAN Symposium on Princi-
ples of Programming Languages
, pages 219-230, Williamsburg, VA,
1981.
[NN92]
Hanne Riis Nielson and Flemming Nielson.
Semantics with appli-
cations: a formal introduction
. John Wiley & Sons, Inc., New York,
NY, 1992.
