Q. Which of the following are context free language?

View solution

Q. Which of the following are non essential while simplifying a grammar?

View solution

Q. Statement 1: Ambiguity is the property of grammar but not the language.
Statement 2: Same language can have more than one grammar.

Which of the following options are correct with respect to the given statements?

View solution

Q. Let G=(V, T, P, S)
where a production can be written as:

S->aAS|a

A->SbA|ba|SS

Which of the following string is produced by the grammar?

View solution

Q. Which among the following is incorrect with reference to a derivation tree?

View solution

Q. For the given set of code, the grammar representing real numbers in Pascal has error in one of the six lines. Fetch the error.
(1) ->

(2) -> | epsilon

(3) -> | epsilon

(4) -> ‘E’ | epsilon

(5) -> + | – | epsilon

(6) -> 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9

View solution

Q. State true or false:
S-> 0S1|01

Statement: No regular expression exists for the given grammar.

View solution

Q. CFGs are more powerful than:

View solution

Q. A CFG for a program describing strings of letters with the word “main” somewhere in the string:

View solution

Q. A CFG consist of the following elements:

View solution

Q. Which of the following is the correct representation of grammar for the given regular expression?
a(aUb)*b

View solution

Q. Find a regular expression for a grammar which generates a language which states :
L contains a set of strings starting wth an a and ending with a b, with something in the middle.

View solution

Q. If the partial derivation tree contains the root as the starting variable, the form is known as:

View solution

Q. There exists a Context free grammar such that:
X->aX

Which among the following is correct with respect to the given assertion?

View solution

Q. If P is the production, for the given statement, state true or false.
P: V->(V∑T)* represents that the left hand side production rule has no right or left context.

View solution

Q. From the definition of context free grammars,
G=(V, T, P, S)

What is the solution of VÇT?

View solution

Q. a→b
Restriction: Length of b must be atleast as much length of a.

Which of the following is correct for the given assertion?

View solution

Q. Context free grammar is called Type 2 grammar because of ______________ hierarchy.

View solution

Q. The following denotion belongs to which type of language:
G=(V, T, P, S)

View solution

Q. abb*c denotes which of the following?

View solution