Bibliography - Crafting a Compiler - page 658

[Ott84] Karl J. Ottenstein. Intermediate languages in compiler

construction—a supplemental bibliography. In SIGPLAN Notices ,
19(7):25-27, 1984.

[Par97] Terence J. Parr. Language Translation Using PCCTS and C ++ .Au-

tomata Publishing, San Jose, CA, 1997.

[Pax] Vern Paxton. Flex Home Page . SourceForge. http://flex.

sourceforge.net/.

[Piz99] Cesare Pizzi. Memory access error checkers. In Linux Journal ,

page 26, 1999.

[PLG88] E. Pelegrı-Llopart and S. L. Graham. Optimal code generation for

expression trees: an application burs theory. In Proceedings of the
ACM SIGPLAN-SIGACT Symposium on Principles of Programming
Languages , pages 294-308, San Diego, California, 1988. ACM.

[Pos] Adobe Systems. PostScript Language Reference Manual . http://

www.adobe.com/products/postscript/pdfs/PLRM.pdf.

[Pro91] Todd Proebsting. Simple and e cient burs table generation. Tech-

nical Report TR1065, University of Wisconsin, Madison, 1991.

[pur] IBMRational. purify . http://www.ibm.com/software/awdtools/

purify/.

[Ros78] Barry K. Rosen. Monoids for rapid data flow analysis. In Pro-

ceedings of the ACM SIGACT-SIGPLAN Symposium on Principles
of Programming Languages , pages 47-59, Tucson, Arizona, 1978.
ACM.

[Sch86] David A. Schmidt. Denotational Semantics: A Methodology for Lan-

guage Development . Allyn and Bacon, 1986. Out of print but can be
found at http://people.cis.ksu.edu/ ∼ schmidt/text/densem.
html.

[Set83] Ravi Sethi. Control flow aspects of semantics-directed compil-

ing. In ACM Transactions on Programming Languages and Systems ,
5(4):554-595, 1983.

[Spr77] Renzo Sprugnoli. Perfect hashing functions: a single probe re-

trieving method for static sets. In Communications of the ACM ,

20(11):841-850, 1977.

[SS78] J. T. Schwartz and M. Sharir. Tarjan's fast interval finding algo-

rithm. SETL Newsletter 204, Courant Institute of Mathematical
Sciences, New York University, 1978.