info@avatto.com
+91-9920808017
61. If L1 = {x | x is a palindrome in (0 + 1)*} L2 = {letter (letter + digit)* }; L3 = (0n 1n 2n | n > 1} L4 = {ambnam+n | m, n > 1}then which of the following statement is correct ?
L1 is context free language and L3 is context sensitive language
L2 is a regular set and L4 is not a context free language
Both L1 and L2 are regular sets
Both L3 and L4 are context-sensitive languages
Your email address will not be published. Required fields are marked *
Report
Name
Email
Website
Save my name, email, and website in this browser for the next time I comment.
Comment
62. A grammar to generate { (ab)n I n ≥ 1 } ∪ { (ba)n I n ≥ 1 } is constructed as
S ---> S1, S1 ---> abS1, S1 ---> ab, S ---> S2, S2 —> baS2, S2 —> ba
S ---> S1 , Sl ---> aS1, S1 ---> ab, S ---> S2, S2 ---> bS2, S2 —> bc
S —> S1, S1—>S2, S2 —> S1a, S1 —> ab, S2 —> ba
none of these
63. Consider the grammar S ---> PQ | SQ | PS P ---> x Q--> yTo get a string of n terminals, the number of productions to be used is
n2
n + 1
2n
2n - 1
64. What is the highest type number which can be applied to the following grammar? S —> Aa, A —> Ba, B —> abc
Type 0
Type 1
Type 2
Type 3
65. Following syntax-directed translation scheme is used with a shift reduction (bottom up) parser that perform the action in braces immediately after a reduction by the corresponding production A —> aB {print “(1)” A —> c {print “1”), B —> Ab {print *2”}. When parser is aaacbbb, then string printed
0202021
1202020
1020202
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
