TOOLS AND TECHNIQUES FOR COMPILER DESIGN
MISCELLENOUS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Type 0
|
|
|
Type 1
|
|
|
Type 2
|
|
|
Type 3
|
Detailed explanation-1: -Pushdown automata accept context-free languages. This means that a context-free language can be represented by a pushdown automaton or a context-free grammar.
Detailed explanation-2: -The languages which can be accepted by PDA are called context-free languages (CFL), denoted by LCF. Diagrammatically, a PDA is a finite state automaton (see Fig. 5.1), with memories (push-down stacks).
Detailed explanation-3: -So the language accepted by a PDA in which the stack is limited to 10 items is best described as regular.
Detailed explanation-4: -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.