Find your grammar definition in grammars. md file which corresponds to your ID. Make sure that your grammar is LL(1) No left recursion Pairwise disjoint Make appropriate changes to your grammar to convert it to the LL(1) form if necessary Write a recursive-descent parser for your grammar. Your parser should output for every test sentence: A test sentence itself A list the grammar rules required to parse a correct sentence. See a parsing example in grammar1.fsx script. Use provided sentences from grammars. md file to test correctness of your parser. You recursive-descent parser must output list of grammar rules required to parse a valid sentence of produced by your grammar. Several sentences are provided to you. If case of the error in parser input, i. e. invalid sentence, your parser need to output error and terminate execution.