Consider the following grammar for simple Boolean expression,

$\{OR\}$

$\{$ AND $\}$

$$ NOT $|$ BOOL $|()$

BOOL represents Boolean literals $($e$.$g$.,$ TRUE, FALSE$)$; OR$,$ AND, and NOT are logical operators.

In Recursive$-$Descent Parsing, define the subprograms $($in pseudocode$)$ for $,,$ and