Hello everyone! Here is a question I am working on:
Consider the context-free grammar G = ( { S, B, E }, { 0, 1, i, e, s }, R, S ), where R is:
S --> iBSE | s
B --> 0 | 1
E --> lambda | eS
Convert this to Chomsky Normal Form, showing all steps.
Alrighty, so I removed the lambda and got:
S0...