Write a context-free grammar for the following language. Start with an English statement of the language, and give five good strings.
x1#x2# .. #xk, k ≥ 1, for some i and j: xi = xj^R, Σ = {a, b, #}
(notes: xi’s contain a’s and b’s only,
#’s appear only between xi substrings)
1 answer