The name of a transformational grammar theory proposed by Chomsky that includes structural properties that can vary from one language to another. Question 67Answer a. Context-Free Grammar cross out b. Context-Sensitive Grammar cross out c. Recursive Grammar cross out d. Principles and Parameters
Added by Silvia C.
Step 1
The question refers to a transformational grammar theory proposed by Noam Chomsky that accounts for structural properties that can vary between languages. Show more…
Show all steps
Your feedback will help us improve your experience
James Kiss and 71 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Select the correct alternative from the given choices. Two languages $L_{1}, L_{2}$ are defined as: $L_{1}=\left\{a^{i} b^{j} c^{k}: i, j, k \geq 0, i=j\right\}$ $L_{2}=\left\{a^{i} b^{j} c^{k}: i, j, k \geq 0, j=k\right\}$ which of following statements are true? (i) $L_{1} \cap L_{2}$ is context free (ii) $L_{1} \cap L_{2}=\left\{a^{n} b^{n} c^{n} \mid n \geq 0\right\}$ (iii) $L_{1}, L_{2}$ are context free (iv) Only $L_{1}$ is context free (A) All are true (B) (i), (ii) are true (C) (iii), (iv) are true (D) (ii), (iii) are true
Theory of Computation
CONTEXT FREE LANGUAGES AND PUSH DOWN AUTOMATA
Which of the following grammar rules violate the requirements of an operator grammar? (i) $A \rightarrow B c C$ (ii) $A \rightarrow d B C$ (iii) $A \rightarrow C / \in$ (iv) $A \rightarrow c B d C$ (A) (i) only (B) (i) and (C) (ii) and (iii) only (D) (i) and (iv) only
COMPILER DESIGN
LEXICAL ANALYSIS AND PARSING
Select the correct alternative from the given choices. Consider the following languages $L_{1}, L_{2}$ and $L_{3}$ : $L_{1}=\left\{a^{n} b^{m} c^{n+m} \mid n, m \geq 0\right\}$ $L_{2}=\left\{a^{n} b^{n+1} c^{n+2} \mid n \geq 0\right\}$ $L_{3}=\left\{a^{n} b^{n} c^{m} \mid n, m \geq 0\right\}$ Which of following statement is true? (A) $L_{1}, L_{2}, L_{3}$ are context free languages (B) $L_{1}, L_{2}$ are context free but not $L_{3}$ (C) $L_{1}, L_{3}$ are context free but $\operatorname{not} L_{2}$ (D) $L_{1}, L_{2}, L_{3}$ are not context free languages.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD