0 votes 0 votes I guess the Language , L = { } ...please verify ... Theory of Computation theory-of-computation grammar + – Vicky rix asked Apr 5, 2017 • retagged Jun 4, 2017 by Arjun Vicky rix 364 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes yes you are right, here no termination condition(only terminal for some production) given. for any grammar to produce any string, there must be at least one path from start state which can generate terminal alphabet. 2018 answered Apr 5, 2017 • selected Apr 5, 2017 by Vicky rix 2018 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes i think this would be an AMBEGIOUS grammer ...and its not containing terminals too so there would be ni chance of deriving such grammers suryaprakash answered Feb 8, 2018 suryaprakash comment Share Follow See all 0 reply Please log in or register to add a comment.
