Arrange the following Language Classes in ascending order according to their expressive power, as defined by Chomsky hierarchy:
(A) Context-free languages
(B) Context-sensitive languages
(C) Regular languages
(D) Unrestricted Grammars
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. (C), (A), (B), (D)
Explanation
Regular ⊂ context-free ⊂ context-sensitive ⊂ unrestricted (recursively enumerable).
More Theory of Computation and Compilers questions
- Which of the following is a context-free language? (A) {wⁱ xʲ yᵏ zˡ | i + k = j + l, i, j, k, l ≥ 0} (B) {wⁱ xʲ yᵏ zˡ | i = j, k = l} (C) {…
- Match List I with List II. List I: A. A → aB | a (a ∈ T; A, B ∈ V), B. A → BC | a (a ∈ T; A, B, C ∈ V), C. LL(1) grammar, D. Halting proble…
- For the regular languages and context-free languages which is not correct? A. both are closed under union operation B. both are closed unde…
- Match List-I with List-II :
- For the given two machines which of the following is correct?
- Let L= {ab, aa, baa}. Which of the following strings are not in L*?