ACM Home Page
Please provide us with feedback. Feedback
Finite-state code generation
Full text PdfPdf (1.10 MB)
Source ACM SIGPLAN Notices archive
Volume 34 ,  Issue 5  (May 1999) table of contents
Pages: 270 - 280  
Year of Publication: 1999
ISSN:0362-1340
Also published in ...
Authors
Christopher W. Fraser  Microsoft Research, One Microsoft Way, Redmond, WA
Todd A. Proebsting  Microsoft Research, One Microsoft Way, Redmond, WA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 40,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/301631.301680
What is a DOI?

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 I-cache and that emits x86 code at 3.6 MB/set on a 266-MHz P6. Our just-in-time code generator translates and executes small benchmarks at speeds within a factor of two of executables derived from the conventional compile-time code generator on which it is based.


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.

AGT89
ATLLW96
DF80
DF84
Eng96
 
FH95
FHP92a
FHP92b
GG78
 
GG83
HO82
 
KR88
 
LY97
PLG88
Pro95
 
PW96


Collaborative Colleagues:
Christopher W. Fraser: colleagues
Todd A. Proebsting: colleagues