0 votes
1
formule for1.number of binary tree2.number of binary search tree3.number labeled binary tree4.number of unlabeled binary tree
6 votes
5
Suppose we have a rightmost derivation which proceeds as follows:$\begin{array}{ccc}S &\rightarrow & Aabw \\ & \rightarrow &ABw \end{array}$Which of the following is a po...
1 votes
6
If we merge states in LR(1) parser to form a LALR(1) parser, we may introduceshift-reduce conflictreduce-reduce conflictno extra conflictboth shift-reduce as well as redu...
0 votes
7
A fair coin is tossed repeatedly till both head and appear atleast once. The average number of tosses required is?