Question

For each language give the CFG that describes it.

• L1 = {w | w ∈ {a,+,-,*,/,(,)} *, w is a legal arithmetic expression in infix form}
• L2 = {w | w ∈ {0,1}*, w contains at least three 1s}
• L3 = {w | w ∈ {0,1}*, the length of w is odd}
• L4 = {w | w ∈ {0,1}*, w starts and ends with the same symbol}
• L5 = {w | w ∈ {0,1}*, w is a palindrome}
• L6 = {w | w ∈ {0,1}*, w contains equal numbers of 0s and 1s}

Answer 1

Hi, If you like the Solution Please press the thumb up button.