Translating Between PEGs and CFGs
Skip to main content
eScholarship
Open Access Publications from the University of California

Translating Between PEGs and CFGs

Abstract

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.

Pre-2018 CSE ID: CS2008-0931

Main Content
For improved accessibility of PDF content, download the file to your device.
Current View