Optimization in code generation in compiler

In compiler design the breaking of the whole code into small pieces of lexemes can be done with some built in operation(means simply that without any specific model ). To overcome this issue we will be applying the Krohn-Rhode decomposition theorem on such a scenario. By using the Krohn-Rh

Project Title

Optimization in code generation in compiler

Project Area of Specialization

Computer Science

Project Summary

In compiler design the breaking of the whole code into small pieces of lexemes can be done with some built in operation(means simply that without any specific model ). To overcome this issue we will be applying the Krohn-Rhode decomposition theorem on such a scenario. By using the Krohn-Rhode Decomposition Theorem  we will decompose expression into small units which will provide a new transition from the previous built in operation.

Project Objectives

•Objectives:

•Study of decomposition theorem in detail along with its applications.

•Learning to provide algebraic/mathematical expressions in high-level languages.

•To perform decomposition of the given mathematical expression using Krohn-Rhode theorem.

•To carry out quantitative analysis of the results.

Project Implementation Method

It is implemented on java YACC compiler and the machine code generation is implemented on a assembly language.

Benefits of the Project

For the compiler design such a technique can be adopted to modern compiler for their code generation optimization and the quality of code.

Technical Details of Final Deliverable

The whole mechanism is designed on a java YACC compiler and then test on a suitable benchmark with the other traditional compiler methods.

Final Deliverable of the Project

Software System

Core Industry

Education

Other Industries

IT

Core Technology

Others

Other Technologies

Artificial Intelligence(AI)

Sustainable Development Goals

Quality Education

Required Resources

If you need this project, please contact me on contact@adikhanofficial.com