In this task you need to write a code in C that will implement the functionality of Stack Implementation Table for the LL(1) parser. Here is the grammar that you will use: S Aa A BD B b | D d | Some of the possible valid input strings that we can generate from this grammar are: {a, ba, da, bda} Your task is to follow all the steps which include, Listing down the FIRST and FLLOW sets of all the non-terminal symbols in the grammar. List down the LL(1) parsing table. Note that all the above steps should be completed using paper and pencil. Make sure to incorporate these in your report as well. Now that we have listed down the parse table for the parser, you need to write a program using C language. Your program should accept a string on command line argument and list down the complete stack implementation table on screen for the LL(1) parser showing whether the string is accepted or rejected. Note that you must incorporate appropriate checks in your program. Some of these may be: Check that user must provide $ symbol in her input. The input string must consist of alphabets only. No numeric or special character (except one $ symbol at the end of the string) are allowed. Once you are done with the program test it using different strings and choose at least three valid and three invalid inputs for your program. Include the screen shots of the output in your report. A sample run is provided for your convenience.

For LR(0) parser: $ gcc 1r.c=01r \$./1r codd\$ The output is as shown below: For LL(1) parser: $gcc11.c=011 $./11 bda\$ The output is as shown below