Please do it step by step.

Note:

Textbook : Introduction to Computer Theory 2nd Edition

Page for example: 417

Q1. S aS | ABB A abA | ab B BB | ba Using top-down parsing, find the leftmost derivation in the grammar given above for the word aababba. Please write your answer in an explanatory way like the step by step parsing solutions in your textbook. You can number branches of the parsing tree and can use your paper in landscape (horizontal) orientation while drawing the parsing tree