the reverse of the string w. Which of these languages are deterministic Context-free languages?
Correct Answer: C
For L1 and L2 we can design Deterministic Push down automata, so both are DCFL. But for L3, it is not possible to design deterministic PDA, because DPDA cannot determine where 'w' ends exactly so it could start poping symbols (for wr ) from the stack. Therefore, option (C) is Correct.
report Report Error
Select Issue Type
Selected Issue
forum Community Discussion
speaker_notes_off
No discussions yet. Be the first to start!
syncLoading more...
You must be logged in to participate in the discussion.
Consider the language L = { an ? n?0 }?{ anbn ? n?0 } and the following statements.I. L is deterministic context-free.II. L is context-free but not deterIII. L is not LL(k) for any k.Which of the above statements is/are TRUE ?
Every regular language can be produced by context free grammar and context free language can be produced by context sensitive grammar and so on.
Find the context sensitive language from the given diagram
