Java Reference
In-Depth Information
[GNU]
[Gos95]
James Gosling. Java intermediate bytecodes. In
ACM SIGPLAN
Workshop on Intermediate Representations
, pages 111-118, San Fran-
cisco, California, 1995. ACM.
[Gra88]
Robert W. Gray.
-gla-a generator for lexical analyzers that pro-
grammers can use. In
USENIX Conference Proceedings
, pages 147-
160, Berkeley, CA, 1988. USENIX.
γ
[Gri81]
David Gries.
The Science of Programming
. Springer Verlag, Berlin,
1981.
[GT04]
Loukas Georgiadis and Robert E. Tarjan. Finding dominators
revisited: extended abstract. In
Proceedings of the ACM SIGACT-
SIAM Symposium on Discrete Algorithms
, pages 869-878, New Or-
leans, Louisiana, 2004. ACM.
[Han85]
Per Brinch Hansen.
Brinch Hansen on Pascal Compilers
.Prentice-
Hall, Englewood Cli
ff
s, NJ, 1985.
[HMN05]
FritzHenglein, HenningMakholm, andHenning Niss. E
ect type
systems and region-based memory management. In
Advanced
Topics In Types And Programming Languages
, chapter 3, pages 87-
133. The MIT Press, Cambridge, MA, 2005.
ff
[HO82]
ChristophM. Ho
mann andMichael J. O'Donnell. Patternmatch-
ing in trees. In
Journal of the ACM
, 29(1):68-95, 1982.
ff
[Hoa89]
C. A. R. Hoare. The varieties of programming language. In
Pro-
ceedings of the International Joint Conference on Theory and Practice of
Software Development
, pages 1-18, Barcelona, Spain, 1989.
[HU72]
Matthew S. Hecht and Je
rey D. Ullman. Flow graph reducibility.
In
Proceedings of the ACMSymposium on Theory of Computing
,pages
238-250, Denver, Colorado, 1972. ACM.
ff
[HU79]
J. E. Hopcroft and J. D. Ullman.
Introduction to Automata The-
ory, Languages and Computation
. Addison-Wesley, Reading, Mas-
sachusetts, 1979.
[Jac87]
Van Jacobson. Tuning UNIX Lex or it's NOT true what they
say about Lex. In
USENIX Conference Proceedings
, pages 163-164,
Washington, DC, 1987. USENIX.
[Jaz]
