Context-free grammars in Compiler Design - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is a context-free grammar (CFG)?

A context-free grammar is a set of rules used to describe the structure of languages. It consists of terminals, non-terminals, a start symbol, and production rules that replace non-terminals with groups of terminals and non-terminals.

beginner

What are the four main components of a context-free grammar?

The four main components are: 1) A set of terminals (basic symbols), 2) A set of non-terminals (symbols that can be replaced), 3) A start symbol (a special non-terminal where parsing begins), and 4) Production rules (which define how non-terminals can be replaced).

beginner

Explain the role of production rules in a CFG.

Production rules define how non-terminal symbols can be replaced by combinations of terminals and non-terminals. They guide how strings in the language are generated step-by-step.

intermediate

Why are context-free grammars important in compiler design?

CFGs are used to describe the syntax of programming languages clearly and precisely. They help compilers understand and check the structure of code during parsing.

beginner

Give an example of a simple context-free grammar rule.

An example rule: <expr> → <expr> + <term> | <term>. This means an expression can be another expression plus a term, or just a term.

Which component of a CFG represents the symbols that cannot be broken down further?

A Non-terminals

B Terminals

C Start symbol

D Production rules

Terminals are the basic symbols of the language and cannot be replaced further.

What does a production rule in a CFG do?

A Defines how to replace non-terminals with terminals and/or non-terminals

B Defines how to replace terminals with non-terminals

C Defines the start symbol

D Defines the set of terminals

Production rules specify how non-terminals can be replaced by combinations of terminals and non-terminals.

In compiler design, CFGs are mainly used for:

A Describing syntax of programming languages

B Optimizing code

C Executing programs

D Memory management

CFGs describe the syntax rules that programming languages follow, helping compilers parse code.

Which symbol in a CFG indicates where parsing starts?

A Terminal

B Non-terminal

C Production rule

D Start symbol

The start symbol is a special non-terminal symbol where parsing begins.

Which of the following is NOT a component of a context-free grammar?

A Terminals

B Non-terminals

C Lexical analyzer

D Start symbol

A lexical analyzer is a separate part of a compiler, not a component of CFG.

Describe the components of a context-free grammar and their roles.

Think about what each part represents and how they work together to generate language strings.

Explain why context-free grammars are useful in designing programming languages.

Consider how CFGs help compilers understand code structure.