Given the following grammar rules:

$1.->$ start finish

$2.->|$ ;

$3.->$ :$=$

$4.->$ X $|$ Y $|$ Z

$5.->*|/|$

Consider the program:

start

X :$=$ Y $*$;

Z :$=$ X $+5$

Finish

$4.$ How can the given grammar be applied to develop a simple scripting language for configuring

devices in a network? Describe how parsing would be used to validate and execute

configurations written in this language