Write a program in java, to implement a topdown parser(syntactical analyzer) with a stack for the following LL(1) grammer:

Implementation of a topdown parser usuing a stack Write a program, preferably in Java, to implement a topdown parser (syntactical analyzer) with a stack for the following LL(1) grammar: SXYa X??a Yb Y-c All the upper case letters represent nonterminals, and lower case letters represent terminals. Your program must be a general parser for any LL(1) grammar with any input. That means your program will take two inputs, a grammar with a set of grammar rules and an input string, and it will determine if this input string is syntactically correct according to the input grammar. Follow exactly what have been presented in our class about the topdown parser using a stack. Turn in your program listing and a few test runs on input strings to show that your parser works well. Use javadoc to properly document your program