1 answer
3
why is C incorrect?addition of any two nibbles such as10001000 -0000Will generate a final carry as 1 0000, which will require the addition of 0110 as 1 0110 to make it...
1 answer
4
The above circuit produces the output sequence:$1111\quad 1111\quad0000\quad0000$$1111 \quad 0000\quad1111\quad0000$$1111 \quad 0001\quad0011\quad0101$$1010\quad1010\quad...
3 answers
6
Context-free languages are closed under:Union, intersectionUnion, Kleene closureIntersection, complementComplement, Kleene closure
1 answer
11
1 answer
12
Given Problem : S1 can be shown allowed under 2PL.However, the solution that they have provided for S2 : Seems wrong, as So, is S2 allowed under 2PL, or the answer give...
0 answers
16
In paging , giving more bits to the innermost table as compared to the outermost page table results in using less physical memory space. Is this statement true always?
0 answers
22
2 answers
24
if a grammar is CLR(1) with no mergeable states, then it is LALR(1) ? I suppose it is “yes”, am I right?
2 answers
26
1 answer
27
please provide the solution
1 answer
28
How many ‘n’ state FA are possible with ‘m’ symbols with –(i) Designated initial state(ii) With designated initial and final state(iii) With no designated initi...
1 answer
29