Register
Filter

Answers by ashutoshaay26

0 votes
1
Couting the number of reduce moves
The maximum number of reduce moves that can be taken by a bottom-up parser with no epsilon and unit productions to parse a string of length 3 tokens is ____ ?
The maximum number of reduce moves that can be taken by a bottom-up parser with no epsilon and unit productions to parse a string of length 3 tokens is ____ ?
0 votes
2
Finite Automata
How to construct NFA with even number of a's and even no of b's??
How to construct NFA with even number of a's and even no of b's??
0 votes
3
decidability
S = { <M> | M is a DFA that accepts some palindrome }. Then what will be S - a) Turing recognizable b) decidable c) undecidable d) none of these
S = { <M | M is a DFA that accepts some palindrome }. Then what will be S -a) Turing recognizableb) decidable c) undecidabled) none of these