Translating Between PEGs and CFGs

Ross Tate, Michael Stepp, Zachary Tatlock and Sorin Lerner
November 2, 2008

In recent research, we have developed a new approach to structuring optimizers, and to make this approach effective, we have designed a new IR called Program Expression Graphs (PEG). The details of the PEG representation can be found elsewhere. In this technical report, we only present the algorithms for translating from CFGs to a PEGs and from PEGs to CFGs.

How to view this document

The authors of these documents have submitted their reports to this technical report series for the purpose of non-commercial dissemination of scientific work. The reports are copyrighted by the authors, and their existence in electronic format does not imply that the authors have relinquished any rights. You may copy a report for scholarly, non-commercial purposes, such as research or instruction, provided that you agree to respect the author's copyright. For information concerning the use of this document for other than research or instructional purposes, contact the authors. Other information concerning this technical report series can be obtained from the Computer Science and Engineering Department at the University of California at San Diego,

[ Search ]

This server operates at UCSD Computer Science and Engineering.
Send email to