ACtE07 · Chapter 7Theory of Computation & Graphics🏛️ Past Licensure QuestionID: 3e64e849
A formal meta-syntax notation used to specify context-free grammars for computer programming languages is known as:
A formal meta-syntax notation used to specify context-free grammars for computer programming languages is known as:
Multiple Choice Options
- A✓ Correct Option
Backus-Naur Form (BNF)
- B
Chomsky Disjunctive Form
- C
Markov Decision Process
- D
Post Correspondence Protocol
Detailed Technical Solution & Explanation
Backus-Naur Form (BNF) is a formal meta-syntax notation used to describe the syntax of context-free languages and programming languages, using non-terminal symbols (<symbol>), rewrite operators (::=), and alternatives (|).
Option Analysis:
•
Option A (Backus-Naur Form (BNF)): Correct. Standard formal syntax notation widely used in compiler design and language specification.
•
Option B (Chomsky Disjunctive Form): Not a formal grammar notation (Chomsky Normal Form exists, but not disjunctive form).
•
Option C (Markov Decision Process): A mathematical framework for modeling sequential decision making in probability and AI.
•
Option D (Post Correspondence Protocol): PCP is an undecidable decision problem, not a grammar specification notation.
Reference: Demo2 · Set 2NEC Licensure Syllabus