context free grammar - Result of Chomsky normal form with infinite rules -


let's have following grammar in chomsky normal form:

s -> ac -> ab b ->    b -> b c -> c 

it seems impossible ever "end" grammar. have "a" remaining, no matter do.

so question is, grammars valid, , if so, how should understand them? don't think can, @ given moment, decide ignore remaining , keep word generated of moment (which "(a | b)*c"), mean language allows empty word, or allows no words @ all?


Comments