Date: $27\mathrm{.}02\mathrm{.}2024$

Aim : To write a C$++$ Program to find first and follow of a Grammar

Refer the lecture material to know about the detailed procedure for finding first and follow of a Grammar.

Input format

Number of non$-$terminals in the grammar

Number of terminal in the grammar

List of non$-$terminals $($separated by one white space$)$

List of terminals $($separated by one white space$)$

Production rules of the grammar

Output format

$\backslash$table$[[$Non Terminal $($NT$),$First$($NT$),$Follow$($NT$)]]$

Test case$1$ Grammar

$S$ABCD

$Ab|E|$

$BC$

$C$

$De$

Sample Input

$5$

$4$

S A B C D

bcde

RHS of S: A B C D

RHS of A: b$,$epsilon $($If two rules, separate them using comma$)$

RHS of B:C

RHS of $C$:$d$