recategorized by
1,186 views

3 Answers

0 votes
0 votes
Is answer B? Because we can push W and X into the stack and for each Y we can pop one element of the stack.That means we can design a PDA for this grammar
0 votes
0 votes
B is correct. Its CFL or Type 2 language.

Push a for each W. Push a for each X. Pop a for each Y. If the stack is empty then it is accepted else not.
0 votes
0 votes
It is context free grammar but not regular because it requires to solve one stack of memory.
Answer:

Related questions

1 votes
1 votes
3 answers
1
Arjun asked Dec 7, 2018
2,011 views
The context free grammar $S \rightarrow aSb \mid bSa \mid \epsilon$ generates:Equal number of a’s and b’sUnequal number of a’s and b’sAny number of a’s followed...
0 votes
0 votes
4 answers
2
Arjun asked Dec 7, 2018
2,617 views
Identify the total number of tokens in the given statementprintf("A%B=",&i);$7$$8$$9$$13$
0 votes
0 votes
2 answers
3
Arjun asked Dec 7, 2018
2,182 views
Among all given option, ____ must reside in the main memory.AssemblerCompilerLinkerLoader
1 votes
1 votes
2 answers
4
Arjun asked Dec 7, 2018
4,349 views
Which of the following code replacements is an example of operator strength reduction?Replace $ \text{P^2} $ by $P^*P$Replace $ P^*16$ by $P<<4$Replace $ \text{pow}(P,3) ...