Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
