Given a CFG G1 which generates a language, which is defined as a set of strings in the upper alphabet {0,1}, which conta
Posted: Thu Jun 02, 2022 7:55 am
Given a CFG G1 which generates a language, which is defined as a
set of strings in the upper alphabet {0,1}, which contains several
zeros (“0”) below (“1”). S → T0TT → TT | 0T1 | 1T0 | 0 | εAlphabet
is Σ = {0.1}
a) Make a derivation for the string w1 = "01001" based on G1.
Illustrate with a parsnip.
b) Design a PDA, which is equivalent to G1, and illustrate with a
diagram. Exemplify with the string w1
set of strings in the upper alphabet {0,1}, which contains several
zeros (“0”) below (“1”). S → T0TT → TT | 0T1 | 1T0 | 0 | εAlphabet
is Σ = {0.1}
a) Make a derivation for the string w1 = "01001" based on G1.
Illustrate with a parsnip.
b) Design a PDA, which is equivalent to G1, and illustrate with a
diagram. Exemplify with the string w1