264 views
0 votes
0 votes
Let L(G) be the language generated by a context free grammar G.

Whether L(G) is deterministic context free language or not.

Is the above problem is decidable?

1 Answer

0 votes
0 votes
Yes  , because for the language generated by cfl if we can design dpda (deterministic push down automata) then it is dcfl else it is not dcfl .

No related questions found