Question 4
Marks : +2 | -2
Pass Ratio : 100%
A language is regular if and only if it is accepted by finite automata.
Explanation: Regular Language is accepted by Finite Automata. Every regular language is Context free.
Question 8
Marks : +2 | -2
Pass Ratio : 100%
A context free language is called ambiguous if?
Explanation: When two or more Left and right most derivative occur the grammar turn ambiguous .
Question 10
Marks : +2 | -2
Pass Ratio : 100%
Which of the following statement is true?
Explanation: All these statements are true w.r.t regular expression.