info@avatto.com
+91-9920808017
46. Which of the following statement is wrong?
Any regular language has an equivalent context-free grammar.
Some non-regular languages can’t be generated by any context-free grammar
Intersection of context free language and a regular language is always context-free
All languages can be generated by context- free grammar
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
47. Consider a grammar : G = ( { x , y ) , { s , x , y } , p , s) where elements of parse : S--> x y S -->y x x--> x z x--> x y--> y z--> z The language L generated by G most accurately is called
Chomsky type 0
Chomsky type 1
Chomsky type 2
Chomsky type 3
48. Consider a grammar : G = { { S } , { 0 , 1 } , p , s } where elements of p are: S --> ss S--> 0S1 S--> 1S0 S--> empty The grammar will generate
regular language
context-free language
context-sensitive language
recursive enumerable language
49. A grammar that produces more than one parse tree for some sentence is called
ambiguos
unambigous
regular
none of these
50. Given a grammar G a production of G with a dot at some position of the right side is called
LR (0) item of G
LR (1) item of G
both (A) and (B)
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
