Ulfar Erlingsson, Mukkai Krishnamoorthy, T.V. Raman  Home/Search
Context Related
| princeton.edu/software/lcc/d...mrst.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: princeton.edu/software/lcc/doc... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper discusses only its application to switch statements. There has been considerable work in the past ([2], [3], [5], [6] and [10]) on the Pascal case statement and code generation. The generation of code for switch statements is discussed in [4] and [11]. A scheme similar to MRST, but restricted to binary radix search trees, appears in [9]. Preprint submitted to Elsevier Preprint 8 August 1997 Applications for fast sparse switch statements are many and varied. Two examples are: -- Let ... (Update)
Context of citations to this paper: More
...to generating good code for a C switch statement. bpo s efficient pattern matching is based on multiway radix search trees (MRSTs) [26], which have been used to implement fast switch statements. 7.2 Design A binary peephole optimizer has somewhat different requirements...
Cited by: More
Language and Compiler Support for Dynamic Code Generation - Poletto (1999) (Correct)
Similar documents (at the sentence level):
9.7%: Lucid and Efficient Case Analysis - Erlingsson, Krishnamoorthy, Raman (Correct)
Active bibliography (related documents): More All
0.2: Effectively Exploiting Indirect Jumps - Uh (1997) (Correct)
0.2: RE2C - A More Versatile Scanner Generator - Bumbulis, Cowan (1994) (Correct)
0.1: Coalescing Conditional Branches into Efficient Indirect Jumps - Uh, Whalley (1997) (Correct)
Similar documents based on text: More All
0.3: Interactive Graph Drawing on the World Wide Web - Erlingsson, Krishnamoorthy (1996) (Correct)
0.2: Top Speed FFTs for FMA Architectures - Karner, Auer, Ueberhuber (1998) (Correct)
0.2: Multiway Cuts in Directed and Node Weighted Graphs - Garg, Vazirani, Yannakakais (1994) (Correct)
BibTeX entry: (Update)
' U. Erlingsson, M. Krishnamoorthy, and T. V. Raman. Efficient multiway radix search trees. Information Processing Letters, 60:115--120, 1996. http://citeseer.ist.psu.edu/erlingsson96efficient.html More
@article{ erlingsson96efficient,
author = "Ulfar Erlingsson and Mukkai S. Krishnamoorthy and T. V. Raman",
title = "Efficient Multiway Radix Search Trees",
journal = "Information Processing Letters",
volume = "60",
number = "3",
pages = "115-120",
year = "1996",
url = "citeseer.ist.psu.edu/erlingsson96efficient.html" }
Citations (may not include all citations):2003 The Art of Computer Programming (context) - Knuth - 1981
866 Techniques and Tools (context) - Aho, Sethi et al. - 1988
296 Free Software Foundation (context) - Stallman, porting et al. - 1992
98 Compiler: Design and Implementation (context) - Fraser, Hanson et al. - 1994
78 PATRICIA---Practical algorithm to retrieve information coded.. (context) - Morrison - 1968
18 Producing good code for the case statement (context) - Bernstein - 1985
10 cient randomized pattern-matching algorithms (context) - Karp, Rabin - 1981
6 The implementation of case statements in Pascal (context) - Sale - 1981
2 Optimizing two-state case statements in Pascal (context) - Atkinson - 1982
2 Correction to Producing good code for the case statement - Kannan, Proebsting - 1994
1 Software---Practice and Experience (context) - Hennessy, Mendelsohn et al. - 1982
Documents on the same site (http://www.cs.princeton.edu/software/lcc/doc/): More
Engineering Simple, Efficient Code Generator Generator - Fraser, Hanson, Proebsting (1992) (Correct)
A Code Generation Interface for ANSI C - Fraser (1991) (Correct)
Early Experience with ASDL in lcc - Hanson (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC