Theory of Computation and Compilers - Context free languages
22. If Σ = (0, 1), L = Σ* and R = (0n 1nsuch that n > 0) then languages L ∪ R and R respectively are
25. Which of the following statement is correct?
- Option : D
- Explanation : CFG is a higher than regular language. So we can draw a regular equivalent to CFG. And some non regular like context sensitive can't be generated by cfg. So, option 3 and 2 are correct. So answer is 'D'.
*/?>
*/?>
*/?>
*/?>