adplus-dvertising
frame-decoration

Question

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

a.

Accepting State

b.

Starting Variable

c.

Sensitive Grammar

d.

None of these

Answer: (b).Starting Variable

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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

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

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

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

Q. Which of the following statement is correct?

Q. Are ambiguous grammar context free?

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

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.

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

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

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

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}

Q. The language accepted by Push down Automaton:

Q. Which among the following is the correct option for the given grammar?
G->X111|G1,X->X0|00

Q. Which of the following the given language belongs to?
L={a^mb^mc^m| m>=1}

Q. Choose the correct option:
Statement: There exists two inference approaches:

1. Recursive Inference
2. Derivation

Q. Choose the correct option:
Statement 1: Recursive Inference, using productions from head to body.

Statement 2: Derivations, using productions from body to head.

Q. State true or false:
Statement: Every right-linear grammar generates a regular language.

Q. What the does the given CFG defines?
S->aSbS|bSaS|e and w denotes terminal

Q. If L1 and L2 are context free languages, which of the following is context free?