The document outlines instructions for creating a BNF grammar using Java and the Parboiled library, specifically for parsing first and last names. It requires the program to accept names formatted as 'First Last' and produce a parse tree without errors. Additionally, it requests the submission of screenshots of the input and output processes, along with the program's source files in a zipped folder.

1. Using Java and the parboiled Java library
Write a BNF grammar for the language consisting of your first name, space, and last name
Examples:
David Beckham
John Anderson
Bruce Wayne
When your program receives an input in the mentioned format above, it should run using the
grammar without any errors and draw the parse tree.
When submitting, include screenshots of the input and output (parse tree) processes and your
program folder along with its source files in a zipped file. You should submit that compressed
(zipped) file on canvas.
My name is Will Smith. Please help me write a BNF grammar for the language. My name is Will
Smith. Please make sure the output of the program has a parse tree in it