Grammar has to be converted into an SLR state table with their first and follow. With the help of that the p1 and p2 need to be converted into output tree. [url removed, login to view] can be refer for the details.
Need to be implemented in JAVA and has to be completed in 2 days.
Hello, I used to teach Compiler design to grad students, and well aware with how to do this. Thanks and regards