info@avatto.com

+91-9920808017

31. In a context-sensitive grammar, number of grammar symbols on the left hand side of a production can't be greater than the number of

grammar symbols on the right hand side

terminals on the right hand side

non-terminals on the right hand side

all of these

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

32. In a context-free grammar

ε can't be the right hand side of any production

terminal symbols can't be present in the left hand side of any production

number of grammar symbols in the left hand side is not greater than the number of grammar symbols in the right hand side

33. CFG can be recognized by a

push-down automata

2-way linear bounded automata

both (A) and (B)

none of these

34. A given grammar is called ambiguous if

two or more productions have the same non-terminal on the left hand side

a derivation tree has more than one associated sentence

there is a sentence with more than one derivation tree corresponding to it

brackets are not present in the grammar

35. Let L be a language recognizable by a finite automaton. The language REVERSE (L) = {w such that w is the reverse of v where v ∈ L } is a

regular language

context-free language

context-sensitive language

recursively enumerable language

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