LEXICAL ANALYSIS
CONSTRUCTION OF A LEXICAL ANALYZER
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
True
|
|
|
False
|
|
|
Either A or B
|
|
|
None of the above
|
Detailed explanation-1: -The turing machine accepts all the language even though they are recursively enumerable. Recursive means repeating the same set of rules for any number of times and enumerable means a list of elements.
Detailed explanation-2: -A Turing machine accepts all languages, even if they are recursively enumerable. Recommended Readings: Basics of TOC. Deterministic Finite Automata.
Detailed explanation-3: -Turing machines are more powerful than both finite automata (FA) and pushdown automata (PDA). They are as powerful as any computer we have ever built.
Detailed explanation-4: -Explanation: The language accepted by Turing machines are called recursively ennumerable (RE), and the subset of RE languages that are accepted by a turing machine that always halts are called recursive. Explanation: We can refer to languages as ‘recursive’ and problems as ‘decidable’.
Detailed explanation-5: -The question is asking for a false statement. Statement 2: Turing recognizable languages are closed under union and complementation. This Statement is false since Turing recognizable languages are not closed under complementation operation.