$=====================$

Given the grammar defined by the following set of production rules which represent a subset of MODULA$-2$ programming language :

module$-$decl $$ module$-$heading declarations procedure$-$decl

block name $.$

module$-$heading $$ module name ;

block $$ begin stmt$-$list end

declarations $$ const$-$decl var$-$decl

const$-$decl $$ const const$-$list $||$

const$-$list $($ name $=$ value ;