theoremTheorem 6.5Theorem 6.5. The even-length binary palindrome language has a parsing expression grammar: EPAL2={wwR:w∈{0,1}∗}∈PEG.\boxed{\mathsf{EPAL}_2=\{ww^R:w\in\{0,1\}^*\}\in\mathsf{PEG}.}EPAL2={wwR:w∈{0,1}∗}∈PEG.
Theorem 6.5. The even-length binary palindrome language has a parsing expression grammar: EPAL2={wwR:w∈{0,1}∗}∈PEG.\boxed{\mathsf{EPAL}_2=\{ww^R:w\in\{0,1\}^*\}\in\mathsf{PEG}.}EPAL2={wwR:w∈{0,1}∗}∈PEG.