Techniques for Improving Grammar Flow Analysis (Extended Abstract)

) Martin Jourdan & Didier Parigot INRIA Abstract Grammar Flow Analysis (GFA) is a computation framework that can be applied to a large number of problems expressed on context-free grammars. In this framework, as was done on programs with Data Flow Analysis, those problems are split into a general resolution procedure and a set of specific propagation functions. This paper presents a number of improvement techniques that act on the resolution procedure, and hence apply to every GFA problem: grammar partitioning, non-terminals static ordering, weak stability and semantic stability. Practical experiments using circularity tests for attribute grammars will show the benefit of these improvements. This paper is a shortened version of [JoP]. 1 Introduction In optimizing compilers, we have to statically infer run-time properties of programs, so that we can take advantage of this knowledge to generate better code. For instance, we may want to know whether the value of a given variable in a..