Question 1
Question 2
Question 3
Question 4
Question 5
Question 6
Consider the languages L1 = [Tex]\\phi [/Tex]and L2 = {a}. Which one of the following represents L1 L2* U L1*
Question 7
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon- and unit-production (i.e., of type A -> є and A -> a) to parse a string with n tokens?
Question 8
Question 9
GROUP I GROUP II (P) Service oriented computing (1) Interoperability (Q) Heterogeneous communicating systems (2) BPMN (R) Information representation (3) Publish-find-bind (S) Process description (4) XML
Question 10
There are 58 questions to complete.