ACtE07 · Chapter 7Theory of Computation & Graphics🏛️ Past Licensure QuestionID: 3650b480

Which of the following is NOT a component of a Context-Free Grammar (CFG) 4-tuple $G = (V, \Sigma, R, S)$ ?

Multiple Choice Options

A
Terminals ( $\Sigma$ )
B
Non-terminals / Variables ( $V$ )
C
Production rules ( $R$ )
D
Transition states ( $Q$ )
✓ Correct Option

Detailed Technical Solution & Explanation

A Context-Free Grammar is formally defined as a 4-tuple $G = (V, \Sigma, R, S)$ , where $V$ is a finite set of non-terminals, $\Sigma$ is a finite set of terminals, $R$ is a relation of production rules ( $V \to (V \cup \Sigma)^*$ ), and $S$ is the start symbol. 'States' belong to automata (Finite Automata or Pushdown Automata), not grammars.

Option Analysis:

•

Option A (Terminals (

\Sigma

)): Fundamental alphabet symbols of the language.

•

Option B (Non-terminals / Variables (V)): Syntactic variables used in production rules.

•

Option C (Production rules (R)): Rewrite rules governing string derivations.

•

Option D (Transition states (Q)): Correct (NOT part of CFG). States are part of automata, not grammar tuples.

Reference: Demo · Set 4NEC Licensure Syllabus

Which of the following is NOT a component of a Context-Free Grammar (CFG) 4-tuple $G = (V, \Sigma, R, S)$ ?

Multiple Choice Options

Detailed Technical Solution & Explanation

Option Analysis:

Want to practice this topic interactively?

Which of the following is NOT a component of a Context-Free Grammar (CFG) 4-tuple $G = (V, \Sigma, R, S)$ ?

Multiple Choice Options

Detailed Technical Solution & Explanation

Option Analysis:

Want to practice this topic interactively?