Question

Context free grammar is

• A. A complier
• B. A language generator
• C. A regular expression
• D. None of these

Answer 1

Answer: (B)

A language generator

Context free grammar is a language generator.

A context-free grammar (CFG) is a set of recursive rewriting rules (or productions) used to generate patterns of strings. A CFG consists of the following components: a set of terminal symbols, which are the characters of the alphabet that appear in the strings generated by the grammar.

Context-free grammar (CFG) is a certain type of formal grammar: a set of production rules that describe all possible strings in a given formal language. Production rules are simple replacements.