Pushing down Context-Free Grammars

Grammars and parsing algorithms for those grammars are widely used to create and work with programming languages. While most languages use standard form of grammars like Context Free Gram- mars, some can be parsed faster using algorithms for Visibly Push- down Grammars. While there has been effort in creating parser generators for VPGs, the question of conversion from CFGs to VPGs remains. We propose to create a tool that will perform operations that will make CFGs more suitable for conversion by existing tools, as well as potentially find what specific properties of CFGs may be a reason to claim that a grammar cannot be converted.