LEXICAL ANALYSIS
ROLE OF THE LEXICAL ANALYZER
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Which language is accepted by the push-down automata?
|
|
Type 0 language
|
|
|
Type 1 language
|
|
|
Type 2 language
|
|
|
Type 3 language
|
Explanation:
Detailed explanation-1: -Pushdown automata accepts Context-Free Grammar Language (Type 2) in the Language Hierarchy.
Detailed explanation-2: -Usually, PDAs can accept by accepting state, accepting empty stack, or accepting both empty state and empty stack.
Detailed explanation-3: -Non-Deterministic Pushdown Automata Question 4 Detailed Solution. Explanation: The language L = wwR | w (a + b)* is the set of all even-length palindromes. L is a CFL that has no deterministic push-down automata that accepts it, because the PDA has to guess when it has reached the middle of the string.
There is 1 question to complete.