Q. CSG can be recognized by

View solution

Q. Which of the following is/are the suitable approaches for inferencing?

View solution

Q. If w belongs to L(G), for some CFG, then w has a parse tree, which defines the syntactic structure of w. w could be:

View solution

Q. Which of the following does the given parse tree correspond to?

View solution

Q. The entity which generate Language is termed as:

View solution

Q. Production Rule: aAb->agb belongs to which of the following category?

View solution

Q. The Grammar can be defined as: G=(V, ∑, p, S)
In the given definition, what does S represents?

View solution

Q. Which among the following cannot be accepted by a regular grammar?

View solution

Q. Which of the expression is appropriate?
For production p: a->b where a∈V and b∈_______

View solution

Q. For S->0S1|e for ∑={0,1}*, which of the following is wrong for the language produced?

View solution

Q. The minimum number of productions required to produce a language consisting of palindrome strings over ∑={a,b} is

View solution

Q. Which of the following statement is correct?

View solution

Q. Are ambiguous grammar context free?

View solution

Q. Which of the following is not a notion of Context free grammars?

View solution

Q. State true or false:
Statement: The recursive inference procedure determines that string w is in the language of the variable A, A being the starting variable.

View solution

Q. Which of the following statements are correct for a concept called inherent ambiguity in CFL?

View solution

Q. Is the following statement correct?
Statement: Recursive inference and derivation are equivalent.

View solution

Q. A->aA| a| b
The number of steps to form aab:

View solution

Q. An expression is mentioned as follows. Figure out number of incorrect notations or symbols, such that a change in those could make the expression correct.
L(G)={w in T*|S→*w}

View solution

Q. The language accepted by Push down Automaton:

View solution