An improvement to bottom-up tree pattern matching

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An improvement to bottom-up tree pattern matching

Full text

Pdf (954 KB)

Source

Annual Symposium on Principles of Programming Languages archive
Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages table of contents

Munich, West Germany

Pages: 168 - 177

Year of Publication: 1987

ISBN:0-89791-215-2

Author

D. R. Chase

Department of Computer Science, Rice University, Houston, Texas

Sponsor

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 32, Citation Count: 16

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/41625.41640 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	COS82	Feng Cheng, Scott Omdahl, and George Strawn. Idiom matching: An optimization technique for an A PL compiler. Technical Report, Iowa State University, 1982.
	GKM82	Susan L. Graham , Peter B. Kessler , Marshall K. Mckusick, Gprof: A call graph execution profiler, Proceedings of the 1982 SIGPLAN symposium on Compiler construction, p.120-126, June 23-25, 1982, Boston, Massachusetts, United States
	Hat86	Philip Hatcher. correspondence, October 1986.
	HC86	Philip J. Hatcher , Thomas W. Christopher, High-quality code generation via bottom-up tree pattern matching, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.119-130, January 01, 1986, St. Petersburg Beach, Florida [doi>10.1145/512644.512655]
	Hen84	Robert Rettig Henry. Groham.GlanviUe Code Generators. Technical Report UCB/CSD 841184, University of California, Berkeley, 1984.
	HO82	Christoph M. Hoffmann , Michael J. O'Donnell, Pattern Matching in Trees, Journal of the ACM (JACM), v.29 n.1, p.68-95, Jan. 1982 [doi>10.1145/322290.322295]
	JM81	Neil D. Jones and Steven S. Muchnick. Flow analysis and optimization of LISP-like structures. In .Steven S. Muchnick and Neil D. Jones, editors, Program Flow Analysis: Theory and Applioations, pages 102-131, Prentice-Hall, 1981.
	Kro75	Hans Hermann Kron, Tree templates and subtree transformational grammars., 1975
	ODo85	Michael J. O'Donnell, Equational logic as a programming language, Massachusetts Institute of Technology, Cambridge, MA, 1985

CITED BY 16

	C. W. Fraser, A language for writing code generators, ACM SIGPLAN Notices, v.24 n.7, p.238-245, July 1989
	Extending Graham-Glanville techniques for optimal code generation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.22 n.6, p.973-1001, Nov. 2000
	Todd A. Proebsting, BURS automata generation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.17 n.3, p.461-486, May 1995
	R. Ramesh , I. V. Ramakrishnan, Nonlinear pattern matching in trees, Journal of the ACM (JACM), v.39 n.2, p.295-316, April 1992
	Christopher W. Fraser , David R. Hanson , Todd A. Proebsting, Engineering a simple, efficient code-generator generator, ACM Letters on Programming Languages and Systems (LOPLAS), v.1 n.3, p.213-226, Sept. 1992
	E. Pelegrí-Llopart , S. L. Graham, Optimal code generation for expression trees: an application BURS theory, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.294-308, January 10-13, 1988, San Diego, California, United States
	Todd A. Proebsting, Simple and efficient BURS table generation, ACM SIGPLAN Notices, v.27 n.7, p.331-340, July 1992
	Charles Farnum, Pattern-based tree attribution, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.211-222, January 19-22, 1992, Albuquerque, New Mexico, United States
	Amihood Amir , Martin Farach , Ramana M. Idury , Johannes A. La Poutré , Alejandro A. Schäffer, Improved dynamic dictionary matching, Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, p.392-401, January 25-27, 1993, Austin, Texas, United States
	M. Anton Ertl, Optimal code selection in DAGs, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.242-249, January 20-22, 1999, San Antonio, Texas, United States
	Jürgen Börstler , Ulrich Möncke , Reinhard Wilhelm, Table compression for tree automata, ACM Transactions on Programming Languages and Systems (TOPLAS), v.13 n.3, p.295-314, July 1991
	Wim De Pauw , David Lorenz , John Vlissides , Mark Wegman, Execution patterns in object-oriented visualization, Proceedings of the 4th conference on USENIX Conference on Object-Oriented Technologies and Systems (COOTS), p.16-16, April 27-30, 1998, Santa Fe, New Mexico
	M. Anton Ertl , Kevin Casey , David Gregg, Fast and flexible instruction selection with on-demand tree-parsing automata, ACM SIGPLAN Notices, v.41 n.6, June 2006
	Sungwon Yi , Byoung-koo Kim , Jintae Oh , Jongsoo Jang , George Kesidis , Chita R. Das, Memory-efficient content filtering hardware for high-speed intrusion detection systems, Proceedings of the 2007 ACM symposium on Applied computing, March 11-15, 2007, Seoul, Korea
	Christopher W. Fraser , Robert R. Henry , Todd A. Proebsting, BURG: fast optimal instruction selection and tree parsing, ACM SIGPLAN Notices, v.27 n.4, p.68-76, April 1992
	Loek Cleophas, Forest FIRE and FIRE Wood: Tools for Tree Automata and Tree Algorithms, Proceeding of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008, p.191-198, July 11, 2009