Build a mini compiler to implement string processing $($concatenation$,$ substring finder, length of a string, reversing a string, finding palindrome$).$ Then implement and code the associated Lex and Yacc definitions, functions, and any related issues.

A detailed report that summarizes the implementation of the toy compiler

starting from how we can download Lex$/$Yacc and ending with the integration of all

parts and compilation. The report should be like a brief lab manual for teaching

purposes, hence, the report should be easy, readable, and clear with snapshots of examples

as an input and the corresponding outputs as well. Use your creativity to make this report

rich with information, Define the difficulties that are faced through the implementation of the compiler and how it can be solved $.$ Recommend better or simpler generators similar to Lex and Yacc that can be used in its place.