Extension of Context Free Grammar for Intermediate Code and Peephole Optimization Rule Parsers

For the purpose of writing and constructing compilers, interpreters and optimizers the parsing of code is mandatory. The syntactic analysis of the input intermediate code into its component parts is known as parsing. And for the implementation of such parsers we need a Context Free Grammar (CFG) which helps to analyses the input code. This paper mainly focuses on extension of the CFG in an EBNF form which describes the parser for intermediate code and different peephole optimization rules. The peephole optimizer basically applies some strategies to perform optimization on the intermediate code based on optimization rules but for that it requires parsers which help to determine the intermediate code and optimization rules accordingly.