Given a CFG G = (V, T, S, P), where P is S -> aS | SS | bA, A ->BB, B -> CC | ab | aAbC, C -> lambda V_N = {C, B, A}. Q)
Posted: Sat Nov 27, 2021 2:43 pm
Given a CFG G = (V, T, S, P), where P is
S -> aS | SS | bA,
A ->BB,
B -> CC | ab | aAbC,
C -> lambda
V_N = {C, B, A}.
Q) please find V_N and the equivalent grammar
G' without lambda-productions.(=removing lambda
productions)
S -> aS | SS | bA,
A ->BB,
B -> CC | ab | aAbC,
C -> lambda
V_N = {C, B, A}.
Q) please find V_N and the equivalent grammar
G' without lambda-productions.(=removing lambda
productions)