Path Grammars

 

Craig A. Damon

 

Abstract

Path grammars are a new representation of control flow information for program analysis. In traditional compiler analyses, path grammars support more precise analysis than is possible with control flow graphs with the same computational expense. By providing a mechanism to describe subsets of possible program execution paths, path grammars also open up new opportunities for both compiler and program understanding analyses.