Christopher W. Fraser, Todd A. Proebsting  Home/Search
Context Related
| microsoft.com/~cwfr...pldi99codegen.pdf mit.edu/readinggrou...pldi99codegen.ps 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: microsoft.com/~toddpro/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper describes gburg, which generates tiny, fast code generators based on finite-state machine pattern matching. The code generators translate postfix intermediate code into machine instructions in one pass (except, of course, for backpatching addresses) . A stack-based virtual machine---known as the Lean Virtual Machine (LVM)---tuned for fast code generation is also described. Gburg translates the two-page LVM-to-x86 specification into a code generator that fits entirely in an 8 KB... (Update)
Cited by: More
Jello: a retargetable Just-In-Time compiler for LLVM bytecode - Lattner, Brukman, Gaeke (2002) (Correct)
Active bibliography (related documents): More All
0.5: Sumatra: A Language for Resource-aware Mobile Programs - Acharya, Ranganathan, Saltz (1997) (Correct)
0.3: Optimal Code Selection in DAGs - Ertl (1999) (Correct)
0.3: Compiling Verilog into Automata - Szu-Tsung Cheng (1994) (Correct)
Similar documents based on text: More All
0.5: The Pool Driver: A Volume Driver for SANs - Teigland (1999) (Correct)
0.4: Omniware: A Universal Substrate for Web Programming - Lucco, Sharp, Wahbe (1995) (Correct)
0.3: Hard-coding Bottom-up Code Generation Tables to Save Time and.. - Fraser, Henry (1991) (Correct)
BibTeX entry: (Update)
C. W. Fraser and T. A. Proebsting. Finite-state code generation. ACM SIGPLAN Notices, 34(5), 1999. http://citeseer.ist.psu.edu/fraser99finitestate.html More
@article{ fraser99finitestate,
author = "Christopher W. Fraser and Todd A. Proebsting",
title = "Finite-State Code Generation",
journal = "ACM SIG{\-}PLAN Notices",
volume = "34",
number = "5",
pages = "270--280",
year = "1999",
url = "citeseer.ist.psu.edu/fraser99finitestate.html" }
Citations (may not include all citations):98 Compiler: Design and Implementation (context) - Fraser, Hanson et al. - 1995
91 Code generation using tree matching and dynamic programming (context) - Aho, Ganapathi et al. - 1989
77 very fast dynamic code generation system (context) - Engler, retargetable - 1996
67 BURG --- fast optimal instruction selection and tree parsing - Fraser, Henry et al. - 1992
47 ACM Letters on Programming Languages and Systems (context) - Fraser, Hanson et al. - 1992
42 Code selection through object code optimization (context) - Davidson, Fraser - 1984
26 A new method for compiler code generation (context) - Glanville, Graham - 1978
24 The Icon Programming Language (context) - Griswold, Griswold - 1983
23 ACM Transactions on Programming Languages and Systems (context) - Proebsting, generation - 1995
22 The design and application of a retargetable peephole optimi.. (context) - Davidson, Fraser - 1980
20 Pattern matching in trees (context) - Ho, Michael et al. - 1982
19 Optimal code generation for expression trees: An application.. (context) - Pelegri-Llopart, Graham - 1988
4 optimal tree parsing --- with or without trees (context) - Proebsting, Whaley - 1996
3 Kernighan and Dennis M Ritchie (context) - Brian - 1988
2 cient and language-independent mobile programs (context) - Adl-Tabatabai, Langdale et al. - 1996
Documents on the same site (http://www.research.microsoft.com/~toddpro/): More
Krakatoa: Decompilation in Java (Does Bytecode Reveal Source?) - Proebsting, Watterson (1997) (Correct)
Simple Translation of Goal-Directed Evaluation - Proebsting (1997) (Correct)
Very Fast YACC-Compatible Parsers (For Very Little Effort) - Bhamidipaty, Proebsting (1995) (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